pLft == NULL ? 1 : 1 + node->pLft->size;\n\n \n\n NODE* cur = node;\n\n int result = 1;\n\n while (cur->pParent != NULL) {\n\n \n\n if (cur == cur->pParent->pRgt) { // if node is its parent right child\n\n result += 1 + (cur->pParent->pLft == NULL ? 0 : cur->pParent->pLft->size); \n\n }\n\n \n\n cur = cur->pParent;\n\n }\n\n \n\n return result;\n","file_path":"problem/Tree/Statistical binary search tree.cpp","rank":84,"score":17.804320002015817},{"content":" cur = cur->pLft;\n\n }\n\n \n\n while (!stk.empty()) {\n\n \n\n cur = stk.top();\n\n cout<<cur->val<<endl;\n\n stk.pop();\n\n \n\n cur = cur->pRgt;\n\n while (NULL != cur) {\n\n \n\n stk.push(cur);\n\n cur = cur->pLft;\n\n }\n\n }\n\n}\n\n\n\nint main() {\n\n NODE *root = new NODE(5);\n","file_path":"problem/Tree/Find the largest BST sub tree in BT.cpp","rank":85,"score":17.444583897532635},{"content":"/*\n\n\n\nGiven a binary tree with parent link, find a node's immediate right neighbor without the root node.\n\n\n\n\n\n*/\n\n\n\n/*\n\n\n\nsolution: first find the lowest parent that both the node and its immediate neighbor have. Then\n\nrecursively find its immediate neighbor in the parent's left subtree.\n\nO(h) time, O(1) space, h is the height of the node.\n\n*/\n\n\n\n#include<iostream>\n\nusing namespace std;\n\n\n\n\n","file_path":"problem/Tree/Immediate right neighbor.cpp","rank":86,"score":17.243132807932547},{"content":" \n\n const char* p = mem;\n\n return DeSerializeInner(p);\n\n}\n\n\n\nint main() {\n\n\n\n NODE *root = new NODE(3);\n\n root->pLft = new NODE(1);\n\n root->pRgt = new NODE(4);\n\n char str[] = \"\";\n\n Serialize(str, root);\n\n cout<<str<<endl;\n\n const char str1[] = \"3 1 # # 4 # #\";\n\n NODE *r = DeSerialize(str1);\n\n cout<<r->val<<endl;\n\n cout<<r->pLft->val<<endl;\n\n cout<<r->pRgt->val<<endl;\n\n return 0;\n\n}\n","file_path":"problem/Tree/SerializeDeSerialize a binary tree.cpp","rank":87,"score":17.207804933574288},{"content":"/*\n\n\n\n Given an integer array arr, find the maximal a[i] such that a[i]=a[x]+a[y].\n\n \n\n*/\n\n\n\n/*\n\n\n\nsolution: sort&binary search\n\nO(nlogn) time, O(1) space\n\n\n\n*/\n\n\n\n#include<iostream>\n\n#include<cassert>\n\n#include<algorithm>\n\nusing namespace std;\n\n\n\nbool TwoSum(int arr[], int len, int skipindex) {\n\n\n","file_path":"problem/Array/Find the max item A[i], such that A[i]=A[x]+A[y].cpp","rank":88,"score":17.058967243610713},{"content":"*/\n\n#include<iostream>\n\nusing namespace std;\n\n\n\n\n\n\n\nbool IsDuplicate(const string str) {\n\n\n\n int strlen = str.size();\n\n\n\n if(strlen < 4) return false;\n\n\n\n int len = 1; //length of the duplicate substring\n\n int start = 0;\n\n for (int i = 1; i< strlen; ++i) {\n\n\n\n if (str[start] == str[i]) {\n\n\n\n start++;\n\n if(start >= len) start = 0; //reach an end of a duplicate substring, back to beginning\n","file_path":"problem/String/Kduplicates.cpp","rank":89,"score":16.917550227629544},{"content":"\n\nuse two sets, one is to record all visited index in the array, another one is to record the visited index in current possible cycle\n\nO(n) time, O(n) space\n\n\n\n*/\n\n\n\n\n\n#include<iostream>\n\n#include<unordered_set>\n\nusing namespace std;\n\n\n\nbool DetectCycle1(int arr[], int len) {\n\n \n\n int slow = 0;\n\n int fast = 0;\n\n int cur = 0;\n\n \n\n while (cur < len) {\n\n \n\n if (arr[slow] >= 0 && arr[slow] < len) {\n","file_path":"problem/Array/Detect cycle in an array.cpp","rank":90,"score":16.758783001097143},{"content":"\n\n if(local) {\n\n return local;\n\n\t\t} else{\n\n node = parent;\n\n parent = node->parent;\n\n level--;\n\n }\n\n }\n\n return NULL; \n\n}\n\n\n\nint main(){\n\n\n\n Node *root = new Node(0);\n\n root->left = new Node(1);\n\n root->left->parent = root;\n\n root->right = new Node(2);\n\n root->right->parent = root;\n\n root->left->left = new Node(3);\n","file_path":"problem/Tree/Immediate right neighbor.cpp","rank":91,"score":16.717273349583355},{"content":"/*\n\n\n\nsolutuion: calculate horizontal distances from root for all nodes. If two nodes have the same horizontal distance, then they are on same vertical line. \n\nHD for root is 0, a right edge (edge connecting to right subtree) is considered as +1 horizontal distance and a left edge is considered as -1 horizontal distance. \n\n\n\nDo an inorder traversal and calcuate the horizontal distance recursively.\n\n\n\nO(n) time, O(n) space\n\n\n\n*/\n\n\n\n#include<iostream>\n\n#include<unordered_map>\n\nusing namespace std;\n\n\n","file_path":"problem/Tree/Vertical sum in a binary tree.cpp","rank":92,"score":16.683155915992955},{"content":"/*\n\nSieve of Eratosthenes algorithm\n\n*/\n\n\n\n/*\n\n\n\nsolution: start from smallest primer number p, print p and mark 2p, 3p, 4p, ...\n\nprint the first number q greater than p without mark if it exists, then repeat the steps above for q.\n\n\n\n*/\n\n\n\n\n\n#include <iostream>\n\nusing namespace std;\n\n\n\n\n\nvoid FlagMultiples(bool arr[], int a, unsigned int num) {\n\n int i = 2;\n\n int temp = i * a;\n\n while ( temp <= num ) {\n","file_path":"problem/SieveofEratosthenes.cpp","rank":93,"score":16.682443619178972},{"content":"*/\n\n\n\n/*\n\n\n\nsolution: define the vowel checking rule correctly. Then just one scan.\n\nO(n) time, O(1) space\n\n\n\n*/\n\n#include<iostream>\n\n#include<cctype>\n\n#include<string>\n\nusing namespace std;\n\n\n\nbool checkBasicVowel(char c) {\n\n\n\n if (c == 'a' || c =='e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' ||c == 'U') {\n\n return true;\n\n\n\n } else {\n\n\n","file_path":"problem/String/Vowel product.cpp","rank":94,"score":16.664347476311875},{"content":"\n\n#include<iostream>\n\n#include<string>\n\nusing namespace std;\n\n\n\nbool TransformString(string str1, string str2) {\n\n\n\n int len1 = str1.size();\n\n int len2 = str2.size();\n\n\n\n if (abs(len1 - len2) > 1) return false;\n\n\n\n if (len1 > len2) return TransformString(str2, str1);\n\n\n\n\t//replace\t\n\n if (len1 == len2) {\n\n\n\n int countdiff = 0;\n\n\n\n for (int i = 0 ; i < len1; ++i) {\n","file_path":"problem/String/Edit Distance one.cpp","rank":95,"score":16.567559041272233},{"content":"/*\n\nGiven an array of sorted integers where each one is in the range from 0 to m-1 and m > n,\n\nwhere n is the length of this array.\n\nFind the smallest number that is missing from the array.\n\n*/\n\n\n\n/*\n\nsolution: modified binary search. \n\nO(logn) time, O(1) space\n\n*/\n\n\n\n#include<iostream>\n\nusing namespace std;\n\n\n\nint FindFirstMissing(int arr[], int begin, int end) {\n\n \n\n //end+1 is the number larger than the last element of array\n\n if (begin > end)\n\n return end + 1;\n\n \n","file_path":"problem/SortingSearch/Smallestmissingnumber.cpp","rank":96,"score":16.234300952581133},{"content":" stk.pop();\n\n }\n\n }\n\n}\n\n \n\n//preorder\n\nvoid PrevOrderTravel(NODE* root) {\n\n assert(root);\n\n \n\n stack<NODE*> stk;\n\n stk.push(root);\n\n \n\n while (!stk.empty()) {\n\n \n\n NODE* top = stk.top();\n\n stk.pop();\n\n \n\n cout<<top->val<<endl;\n\n \n\n if (top->pRgt != NULL) stk.push(top->pRgt);\n","file_path":"problem/Tree/PreInPostorder travel of bT with stack.cpp","rank":97,"score":15.901693231718374},{"content":"/*\n\nFind the last k digits of m^n, where m, n is positive integer, n may be very large.\n\n*/\n\n\n\n/*\n\n\n\nsolution: big number + recursion\n\nO((log n) * k * k) time, O(k*k) space\n\n*/\n\n\n\n#include<iostream>\n\n#include<cassert>\n\n#include<string>\n\nusing namespace std;\n\n\n\nstring MultiplyArrays(string num1, string num2, int k) {\n\n int N = num1.length(), M = num2.length();\n\n string res(N+M, '0');\n\n for (int i = N - 1; i >= 0; --i) {\n\n int carry = 0;\n","file_path":"problem/Math/Calculate (m^n)%(10^k).cpp","rank":98,"score":15.607745224466276},{"content":"","file_path":"problem/Quadtree.cpp","rank":99,"score":15.453547276372685}],"string":"[\n {\n \"content\": \"struct Node {\\n\\n int val;\\n\\n Node* plft;\\n\\n Node* prgt;\\n\\n\\n\\n\\tNode(int v) : val(v), plft(NULL), prgt(NULL) {}\\n\\n};\\n\\n\\n\\n\\n\\n//need finish this version\\n\\n\\n\\nint main() {\\n\\n\\n\\n\\t/*\\n\\n\\tNode *root = new Node(1);\\n\\n\\troot->plft = new Node(2);\\n\\n\\troot->prgt = new Node(3);\\n\\n\\troot->plft->plft = new Node(4);\\n\\n\\troot->plft->prgt = new Node(5);\\n\\n\\troot->prgt->plft = new Node(6);\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 0,\n \"score\": 115952.27447917088\n },\n {\n \"content\": \"struct Node {\\n\\n int val;\\n\\n Node *plft;\\n\\n Node *prgt;\\n\\n \\n\\n Node(int v) : val(v), plft(NULL), prgt(NULL) {}\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nNode *SecondLargestNode(NODE *root) {\\n\\n\\n\\n\\n\\n if (root == NULL || root->plft == NULL && root->prgt == NULL) return NULL;\\n\\n\\n\\n NODE *iter = root;\\n\\n NODE *parent = NULL;\\n\\n \\n\\n while (iter->prgt != NULL) {\\n\",\n \"file_path\": \"problem/Tree/Second largest node in BST.cpp\",\n \"rank\": 1,\n \"score\": 112531.14414397393\n },\n {\n \"content\": \"struct Node {\\n\\n\\n\\n int val\\n\\n Node *plft;\\n\\n TreeNode *prgt;\\n\\n \\n\\n Node(int v) : val(v), plft(NULL), prgt(NULL) {}\\n\\n\\n\\n};\\n\\n\\n\\nint Height(Node* root) {\\n\\n\\n\\n if (root == NULL) {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n int leftheight = Height(root->plft);\\n\\n int rightheight = Height(root->prgt);\\n\\n\\n\\n if (leftheight > rightheight) {\\n\",\n \"file_path\": \"problem/Tree/Longest distance between two nodes.cpp\",\n \"rank\": 2,\n \"score\": 112531.14414397393\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n \\n\\n NODE(int n) : val(n), pLft(NULL), pRgt(NULL) {}\\n\\n};\\n\\n\\n\\nvoid GetRightMostBTInner(NODE* Node, vector<NODE*> &vec, int Lev) {\\n\\n\\n\\n if (Node == NULL) return;\\n\\n \\n\\n if (Lev >= vec.size()) {\\n\\n \\n\\n vec.push_back(Node);\\n\\n cout<<Node->val;\\n\\n }\\n\\n\\t\\n\\n \\n\\n GetRightMostBTInnerNode->pRgt, vec, Lev+1);\\n\",\n \"file_path\": \"problem/Tree/Find the right most node in each level of a binary tree.cpp\",\n \"rank\": 4,\n \"score\": 109383.88740781978\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n vector<NODE*> vec;\\n\\n \\n\\n NODE(int n) : val(n), vec() {}\\n\\n};\\n\\n \\n\\nvoid SerialInner(NODE* node, char*& p) {\\n\\n\\n\\n\\t\\n\\n itoa(node->val, p, 10);\\n\\n p += strlen(p);\\t\\n\\n int num = node->vec.size();\\n\\n itoa(num, p, 10);\\n\\n p += strlen(p);\\n\\n\\t\\n\\n if (node->vec.size() == 0) return;\\n\\n \\n\\n for (vector<NODE*>::iterator it = node->vec.begin(); it != pNode->vec.end(); it++) {\\n\\n \\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 5,\n \"score\": 109383.88740781978\n },\n {\n \"content\": \"struct node {\\n\\n double _x, _y;\\n\\n node(double x, double y): _x(x), _y(y){}\\n\\n node(): _x(0.0), _y(0.0){}\\n\\n};\\n\\n\\n\\ndouble Distance(node x, node target) {\\n\\n\\treturn pow(x._x - target._x, 2) + pow(x._y - target._y,2);\\n\\n}\\n\\n\\n\\nnode target(0,0);\\n\\n\\n\",\n \"file_path\": \"problem/Heap/TwoDtopk.cpp\",\n \"rank\": 6,\n \"score\": 107116.52377831328\n },\n {\n \"content\": \"struct Node {\\n\\n int val;\\n\\n Node *left;\\n\\n Node *right;\\n\\n Node *parent;\\n\\n \\n\\n Node(int v) : val(v), left(NULL), right(NULL), parent(NULL) {}\\n\\n};\\n\\n\\n\\n\\n\\nNode *FindNeighbor( Node *node, int level ) {\\n\\n\\n\\n if( node == NULL ) return NULL;\\n\\n if( level == 0 ) return node;\\n\\n\\n\\n Node *left = FindNeighbor(node->left,level+1);\\n\\n //always return left child at first such that this node is the immediate right neighbor\\n\\n if( left ) { \\n\\n\\t\\treturn left;\\n\\n\\t} else { \\n\",\n \"file_path\": \"problem/Tree/Immediate right neighbor.cpp\",\n \"rank\": 7,\n \"score\": 105134.336527965\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* plft;\\n\\n NODE* prgt;\\n\\n \\n\\n NODE(int n) : val(n), plft(NULL), prgt(NULL) {}\\n\\n};\\n\\n\\n\\nvoid ShiftUp(NODE *node) {\\n\\n\\n\\n if(!node) return; \\n\\n \\n\\n NODE *largest = node;\\n\\n\\n\\n\\t //find the largest node\\n\\n if (node->plft != NULL && largest->val < node->plft->val) { \\n\\n\\n\\n largest = node->plft; \\n\\n\\n\\n }\\n\",\n \"file_path\": \"problem/Tree/Heapify a binary tree.cpp\",\n \"rank\": 8,\n \"score\": 105134.336527965\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n \\n\\n NODE(int n) : val(n), pLft(NULL), pRgt(NULL) {}\\n\\n};\\n\\n\\n\\n/*\\n\\nHere is the inorder iterator.\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Iterator for binary tree.cpp\",\n \"rank\": 9,\n \"score\": 105134.336527965\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n int size; //the size of the subtree rooted at that node\\n\\n NODE* pParent;\\n\\n \\n\\n NODE(int n, int sz = 1) : val(n), size(sz), pLft(NULL), pRgt(NULL), pParent(NULL) {}\\n\\n \\n\\n void setLeft(NODE* node) {\\n\\n if (node==NULL) return;\\n\\n pLft = node;\\n\\n node->pParent = this;\\n\\n }\\n\\n \\n\\n void setRight(NODE* node) {\\n\\n if (node==NULL) return;\\n\\n pRgt = node;\\n\\n node->pParent = this;\\n\\n }\\n\",\n \"file_path\": \"problem/Tree/Statistical binary search tree.cpp\",\n \"rank\": 10,\n \"score\": 103250.96983060292\n },\n {\n \"content\": \"struct Node {\\n\\n int val;\\n\\n Node *plft;\\n\\n Node *prgt;\\n\\n \\n\\n Node(int v) : val(v), plft(NULL), prgt(NULL) {}\\n\\n};\\n\\n\\n\\n\\n\\nvoid GetHorizontalDistance(Node *root, int hd, unordered_map<int, int> &hdmp) { \\n\\n\\n\\n \\n\\n if (root == NULL) return;\\n\\n \\n\\n \\n\\n GetHorizontalDistance(root->plft, hd - 1, hdmp);\\n\\n \\n\\n \\n\\n int prevsum = (hdmp.find(hd) == hdmp.end()) ? 0 : hdmp.find(hd)->second;\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Vertical sum in a binary tree.cpp\",\n \"rank\": 11,\n \"score\": 103250.96983060292\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n \\n\\n NODE(int n) : val(n), pLft(NULL), pRgt(NULL) {}\\n\\n};\\n\\n\\n\\n//postorder\\n\\nvoid PostOrderTravel(NODE* root) {\\n\\n assert(root);\\n\\n \\n\\n stack<NODE*> stk;\\n\\n NODE* cur = root;\\n\\n while (cur != NULL) {\\n\\n \\n\\n stk.push(cur);\\n\\n cur = cur->pLft;\\n\\n }\\n\\n \\n\",\n \"file_path\": \"problem/Tree/PreInPostorder travel of bT with stack.cpp\",\n \"rank\": 12,\n \"score\": 101459.21347241984\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n \\n\\n NODE(int n) : val(n), pLft(NULL), pRgt(NULL) {}\\n\\n};\\n\\n \\n\\nvoid SerializeInner(char * &p, NODE* node) {\\n\\n if (node == NULL) {\\n\\n *p++ = '#';\\n\\n *p++ = ' ';\\n\\n return;\\n\\n }\\n\\n //char * itoa ( int value, char * str, int base );\\n\\n //Converts an integer value to a null-terminated string using \\n\\n //the specified base and stores the result in the array given\\n\\n //by str parameter.\\n\\n\\t\\n\\n itoa(node->val, p, 10);\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize a binary tree.cpp\",\n \"rank\": 13,\n \"score\": 101459.21347241984\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* next;\\n\\n \\n\\n NODE(int x) : val(x), next(NULL) {}\\n\\n};\\n\\n\\n\\n//insert x after p\\n\\nvoid Insert(NODE* p, int x) {\\n\\n NODE* tmp = p->next;\\n\\n NODE* newnode = new NODE(x);\\n\\n p->next = newnode;\\n\\n newnode->next = tmp;\\n\\n}\\n\\n \\n\\nvoid InsertToCycleLink(NODE* node, int x) {\\n\\n assert(node != NULL);\\n\\n \\n\\n NODE* iter = node;\\n\\n NODE* big = iter; \\n\",\n \"file_path\": \"problem/LinkedList/Insert into a Cyclic Sorted List.cpp\",\n \"rank\": 14,\n \"score\": 101459.21347241984\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* Lft;\\n\\n NODE* Rgt;\\n\\n \\n\\n NODE(int n) : val(n), Lft(NULL), Rgt(NULL) {}\\n\\n};\\n\\n \\n\\nbool BinTreeSwitchEqualInner(NODE* node1, NODE* node2, int& switch) {\\n\\n switch = 0;\\n\\n\\t\\n\\n if (node1 == NULL || node2 == NULL) return node1 == NULL && node2 == NULL;\\n\\n \\n\\n if (node1->val != node2->val) return false;\\n\\n \\n\\n int leftswitch, rightswitch;\\n\\n \\n\\n if (BinTreeSwitchEqualInner(node1->Lft, node2->Lft, leftswitch) && \\n\\n BinTreeSwitchEqualInner(node1->Rgt, node2->Rgt, rightswitch)) {\\n\\n \\n\",\n \"file_path\": \"problem/Tree/Switch binary tree to make equal.cpp\",\n \"rank\": 15,\n \"score\": 101459.21347241984\n },\n {\n \"content\": \"struct NODE {\\n\\n int val;\\n\\n NODE* pLft;\\n\\n NODE* pRgt;\\n\\n \\n\\n NODE(int n) : val(n), pLft(NULL), pRgt(NULL) {}\\n\\n};\\n\\n\\n\\n \\n\\nint GetLargestBSTInner(NODE* Node, int& minbound, int& maxbound, NODE*& maxbstroot, int& maxbstnum) {\\n\\n \\n\\n assert(Node);\\n\\n \\n\\n minbound = Node->val;\\n\\n maxbound = Node->val;\\n\\n \\n\\n int result = 1; //count root\\n\\n bool bivalid = false;\\n\\n if (Node->pLft != NULL) {\\n\\n \\n\",\n \"file_path\": \"problem/Tree/Find the largest BST sub tree in BT.cpp\",\n \"rank\": 16,\n \"score\": 99752.5420206213\n },\n {\n \"content\": \"struct node {\\n\\n int a,b,val; //element index and their value sum\\n\\n node(int _a,int _b,int v): a(_a),b(_b),val(v) {}\\n\\n\\t\\n\\n};\\n\\n\\n\",\n \"file_path\": \"problem/Heap/Kth maximal element of sum of two arrays.cpp\",\n \"rank\": 17,\n \"score\": 99752.5420206213\n },\n {\n \"content\": \"struct TNode {\\n\\n int val;\\n\\n TNode* plft;\\n\\n TNode* prgt;\\n\\n TNode* parent;\\n\\n\\n\\n TNode(int v) : val(v), plft(NULL), prgt(NULL), parent(NULL) {}\\n\\n};\\n\\n\\n\\n//print node below given node \\n\\nvoid PrintDown(TNode * node, int k) {\\n\\n\\n\\n if (node == NULL || k < 0) return;\\n\\n\\n\\n if (k == 0) {\\n\\n cout<<node->val<<endl;\\n\\n } else {\\n\\n PrintDown(node->plft, k -1);\\n\\n PrintDown(node->prgt, k -1);\\t\\n\\n }\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 18,\n \"score\": 97779.65219680007\n },\n {\n \"content\": \"\",\n \"file_path\": \"problem/Quadtree.cpp\",\n \"rank\": 19,\n \"score\": 92779.9945778869\n },\n {\n \"content\": \"struct TreeNode {\\n\\n int val;\\n\\n vector<TreeNode*> children; \\n\\n TreeNode(int n) : val(n), children() {}\\n\\n};\\n\\n\\n\\nint MaxPathSumInner(TreeNode *node, int &maxSoFar) {\\n\\n if (node == NULL) return 0;\\n\\n\\tint maxPath = node->val;\\n\\n\\tint tempPath = INT_MIN;\\n\\n\\tvector<TreeNode*>::iterator it = node->children.begin();\\n\\n\\tfor (; it != node->children.end(); it++) {\\n\\n\\t\\tint maxchild = MaxPathSumInner(*it, maxSoFar);\\n\\n\\t\\t\\n\\n\\t\\tif (maxchild > 0) maxPath += maxchild;\\n\\n\\t\\tif (maxchild > tempPath) tempPath = maxchild;\\n\\n\\t}\\n\\n\\tif (maxPath > maxSoFar) maxSoFar = maxPath;\\n\\n\\tint res = node->val;\\n\\n\\treturn max(res, res + tempPath); //note path definition\\n\",\n \"file_path\": \"problem/Tree/Maximalpathsum.cpp\",\n \"rank\": 20,\n \"score\": 90690.99953321335\n },\n {\n \"content\": \"struct Racer {\\n\\n\\n\\n\\n\\n Racer(int ide, int starte, int ende) {\\n\\n id = ide;\\n\\n start = starte;\\n\\n end = ende;\\n\\n startrank = 0;\\n\\n score = 0;\\n\\n }\\n\\n Racer() {\\n\\n id = -1;\\n\\n start = -1;\\n\\n end = -1;\\n\\n startrank = 0;\\n\\n score = 0;\\n\\n }\\n\\n\\n\\n int id, start, end, score, startrank;\\n\\n};\\n\",\n \"file_path\": \"problem/Racescore.cpp\",\n \"rank\": 21,\n \"score\": 54179.822181620446\n },\n {\n \"content\": \"struct Event {\\n\\n Event(int _h, int _x, int _type) \\n\\n : height(_h), x(_x), type(_type) {}\\n\\n enum Type{START, END};\\n\\n int height;\\n\\n int x;\\n\\n int type;\\n\\n};\\n\\n/*\\n\\nsort the event from begin to end by the following order:\\n\\nthe event with smaller x axis value, with smaller type,\\n\\nif both event are START, with larger height, or if both\\n\\nevent are END, with smaller height. \\n\\n\\n\\n*/\\n\\nbool CmpEvent(const Event* lhs, const Event* rhs) {\\n\\n if (lhs->x == rhs->x) {\\n\\n if (lhs->type == rhs->type) {\\n\\n if (lhs->type == Event::START) {\\n\\n return lhs->height > rhs->height;\\n\",\n \"file_path\": \"problem/Skyline.cpp\",\n \"rank\": 22,\n \"score\": 54179.822181620446\n },\n {\n \"content\": \"\",\n \"file_path\": \"problem/Onlineuser.cpp\",\n \"rank\": 23,\n \"score\": 54179.822181620446\n },\n {\n \"content\": \"\",\n \"file_path\": \"problem/Groupcontact.cpp\",\n \"rank\": 24,\n \"score\": 54179.822181620446\n },\n {\n \"content\": \"\",\n \"file_path\": \"problem/Onlineuser.cpp\",\n \"rank\": 25,\n \"score\": 54179.822181620446\n },\n {\n \"content\": \"struct Compareto {\\n\\n bool operator() (const Cell *a, const Cell *b) {\\n\\n return a->height > b->height;\\n\\n }\\n\\n};\\n\\n\\n\\nconst int m = 3;\\n\\nconst int n = 3;\\n\\npriority_queue<Cell*, vector<Cell*>, Compareto> minheap; \\n\\nvector<vector<bool> > visited(m, vector<bool>(n, false));\\n\\nvector<vector<int> > mat(m, vector<int>(n, 0));\\n\\n\\n\\n\\n\\n\\n\\nvoid Check(int x, int y, int lowest, int &result) {\\n\\n\\n\\n if(x < 0 || x >= m || y < 0 || y >= n || visited[x][y]) return;\\n\\n if(mat[x][y] < lowest) result += lowest - mat[x][y];\\n\\n visited[x][y] = true;\\n\\n minheap.push(new Cell(x,y, max(lowest, mat[x][y])));\\n\",\n \"file_path\": \"problem/Heap/Waterin2dhistogram.cpp\",\n \"rank\": 26,\n \"score\": 53074.507745440525\n },\n {\n \"content\": \"struct Cell {\\n\\n\\n\\n int x;\\n\\n int y;\\n\\n int height;\\n\\n\\tCell(): x(0), y(0), height(0) {}\\n\\n Cell(int _x,int _y,int _height): x(_x), y(_y), height(_height) {}\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"problem/Heap/Waterin2dhistogram.cpp\",\n \"rank\": 27,\n \"score\": 53074.507745440525\n },\n {\n \"content\": \"struct GreaterNote {\\n\\n\\n\\n bool operator() (const node a, const node b) {\\n\\n return Distance(a, target) < Distance(b, target);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\nvector<node> GetKClosestNode(vector<node> nodes, int k) {\\n\\n priority_queue<node, vector<node>, GreaterNote > q; //build the max heap\\n\\n size_t size = nodes.size();\\n\\n if (size <= k) return nodes;\\n\\n for (size_t i = 0; i < k; i++ ){\\n\\n q.push(nodes[i]);\\n\\n }\\n\\n size_t num = k;\\n\\n\\t\\n\\n while (num < size) {\\n\\n node top = q.top();\\n\",\n \"file_path\": \"problem/Heap/TwoDtopk.cpp\",\n \"rank\": 28,\n \"score\": 51033.41905068699\n },\n {\n \"content\": \"/////////////////////////////////////////// \\n\\nstruct TOKEN {\\n\\n bool bnull;\\n\\n int val;\\n\\n TOKEN(bool b, int n) : bnull(b), val(n) {}\\n\\n};\\n\\n \\n\\nTOKEN GetToken(const char* &p) {\\n\\n while(*p == ' ') p++;\\n\\n \\n\\n if (*p < '0' || *p > '9') {\\n\\n \\n\\n p++;\\n\\n return TOKEN(true, 0);\\n\\n }\\n\\n \\n\\n int val = 0;\\n\\n while (*p >= '0' && *p <= '9') {\\n\\n \\n\\n val = 10*val + *p++ - '0';\\n\\n \\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize a binary tree.cpp\",\n \"rank\": 29,\n \"score\": 49190.89479681765\n },\n {\n \"content\": \"struct GreaterNote {\\n\\n\\n\\n bool operator() (const node a, const node b) {\\n\\n return a.val < b.val;\\n\\n }\\n\\n};\\n\\n\\n\\nint FindKthSum1(int A[],int m,int B[],int n,int k) {\\n\\n\\n\\n\\tpriority_queue<node, vector<node>, GreaterNote > q; //build the max heap\\n\\n\\tq.push(node(0,0,A[0]+B[0]));\\n\\n\\tset<pair<int,int> > visited;\\n\\n\\tvisited.insert(pair<int,int>(0,0));\\n\\n\\twhile(!q.empty()) {\\n\\n\\t\\n\\n\\t\\tnode t = q.top();\\n\\n\\t\\tq.pop();\\n\\n\\t\\tk--;\\n\\n\\t\\tif(k == 0) return t.val;\\n\\n\\t\\t\\n\",\n \"file_path\": \"problem/Heap/Kth maximal element of sum of two arrays.cpp\",\n \"rank\": 30,\n \"score\": 47519.303438591596\n },\n {\n \"content\": \"using namespace std;\\n\\n\\n\\nbool Prob() {\\n\\n\\n\\n int i = rand();\\n\\n if (i % 2 == 0) {\\n\\n\\n\\n return true;\\n\\n\\n\\n } else {\\n\\n\\n\\n return false;\\n\\n\\n\\n }\\n\\n}\\n\\n\\n\\nbool ProbAny(double probability, bool value ) {\\n\\n\\n\\n if (probability < 0.5) {\\n\\n\\t\\n\",\n \"file_path\": \"problem/Tree/Output true.cpp\",\n \"rank\": 31,\n \"score\": 40305.559503098884\n },\n {\n \"content\": \"/*\\n\\n\\n\\nCalculate the last digit of a^b, where a,b are positive. Use map to store the last digit.\\n\\nO(logb) time, O(10) space\\n\\n\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<map>\\n\\n#include<math.h>\\n\\nusing namespace std;\\n\\n\\n\\nunsigned int LastDigit(unsigned int a, unsigned int b, map<unsigned int, unsigned int> &mp){\\n\\n\\n\\n if (a == 1) return 1;\\n\\n unsigned int digit = a %10;\\n\\n digit = mp[a]; //a^2;\\n\\n\\n\\n unsigned int time = 2;\\n\\n for (; time * 2 <= b; time = time * 2){\\n\",\n \"file_path\": \"problem/Math/Last digit of a^b.cpp\",\n \"rank\": 32,\n \"score\": 40300.40422053819\n },\n {\n \"content\": \" return ProbAny(1.0 - probability,!value);\\n\\n\\n\\n } else if (Prob() == value) {\\n\\n\\n\\n return value;\\n\\n\\n\\n } else {\\n\\n\\n\\n return ProbAny((probability - 0.5) * 2, value);\\n\\n\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\nint main() {\\n\\n\\n\\n srand (time(NULL));\\n\\n\\t\\n\\n for (int i = 0; i< 20; ++i) {\\n\\n\\n\\n cout<<ProbAny(0.3, true)<<endl;\\n\\n }\\n\\n return 0;\\n\\n\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/Output true.cpp\",\n \"rank\": 33,\n \"score\": 40293.48422962657\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGiven a function which can return true with probability 0.5, write a function which can return ture with any probability.\\n\\n\\n\\nsolution: from peking2 at mitbbs\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: suppose you want to the function return true with probability 0.4, which means it returns false with 0.6\\n\\nIf you get false from prob(), you can return false because 0.5 is smaller than 0.6. If get true from prob(), you have\\n\\nto subtract 0.5 from to 0.6, you need to a function return false with probability 0.2 next time.\\n\\nIt is similar when we want to return true with probability larger than 0.5\\n\\n\\n\\n\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<time.h>\\n\",\n \"file_path\": \"problem/Tree/Output true.cpp\",\n \"rank\": 34,\n \"score\": 40286.71174120319\n },\n {\n \"content\": \"\\n\\n digit = mp[digit];\\n\\n }\\n\\n \\n\\n time = time / 2;\\n\\n\\n\\n unsigned int extratime = b - time * 2;\\n\\n\\n\\n digit = (digit * (int)pow((double)a, (int)extratime)) % 10;\\n\\n \\n\\n\\n\\n return digit;\\n\\n}\\n\\n\\n\\n\\n\\nint main(){\\n\\n\\t\\n\\n map<unsigned int, unsigned int> mp;\\n\\n mp[1]=1;\\n\\n mp[2]=4;\\n\",\n \"file_path\": \"problem/Math/Last digit of a^b.cpp\",\n \"rank\": 35,\n \"score\": 40286.448019464995\n },\n {\n \"content\": \" mp[3]=9;\\n\\n mp[4]=6;\\n\\n mp[5]=5;\\n\\n mp[6]=6;\\n\\n mp[7]=9;\\n\\n mp[8]=4;\\n\\n mp[9]=1;\\n\\n\\n\\n cout<<LastDigit(2, 35, mp)<<endl;\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"problem/Math/Last digit of a^b.cpp\",\n \"rank\": 36,\n \"score\": 40286.011816461876\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGiven an array with numbers, find the number with most duplicates, and return all the corresponding index with equal probability.\\n\\n\\n\\nFor example, int input[]={3,7,4,3,6,1,3,6}, the function should return index 0, 3, 6 each with probability 1/3.\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: scan first time to get the number with most duplicates, scan second time to output the num equally.\\n\\nO(n) time, O(n) space\\n\\n\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<unordered_map>\\n\\nusing namespace std;\\n\\n\\n\\nint MaxDupEqual(int arr[], int len) {\\n\",\n \"file_path\": \"problem/Math/Return the duplicate.cpp\",\n \"rank\": 37,\n \"score\": 40281.56494835272\n },\n {\n \"content\": \"\\n\\n int maxoccur = 0;\\n\\n int num = 0 ;\\n\\n int maxnum = 0;\\n\\n int result=0;\\n\\n unordered_map<int , int> occurmap;\\n\\n unordered_map<int , int> randompickmap;\\n\\n for (int i = 0 ; i < len ; ++i) {\\n\\n\\n\\n num = arr[i];\\n\\n if (occurmap.count(num)) {\\n\\n\\n\\n occurmap[num] += 1;\\n\\n\\n\\n } else {\\n\\n\\n\\n occurmap[num] = 1;\\n\\n\\n\\n }\\n\\n\\n\",\n \"file_path\": \"problem/Math/Return the duplicate.cpp\",\n \"rank\": 38,\n \"score\": 40273.69723677676\n },\n {\n \"content\": \" return result;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nint main() {\\n\\n\\n\\n int arr[] = {3,7,4,3,6,1,3,6};\\n\\n int len = sizeof(arr)/sizeof(arr[0]);\\n\\n cout<<MaxDupEqual(arr, len)<<endl;\\n\\n return 0;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"problem/Math/Return the duplicate.cpp\",\n \"rank\": 39,\n \"score\": 40273.28351017274\n },\n {\n \"content\": \" if (occurmap[num] > maxoccur) {\\n\\n\\n\\n maxoccur = occurmap[num];\\n\\n maxnum = randompickmap[num]; \\n\\n }\\n\\n\\n\\n }\\n\\n \\n\\n int occur = 0;\\n\\n\\n\\n for (int i = 0 ; i < len ; ++i) {\\n\\n \\n\\n if (arr[i] == maxnum) {\\n\\n\\n\\n occur++;\\n\\n\\n\\n if(rand() % occur == 0) result = i;\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"problem/Math/Return the duplicate.cpp\",\n \"rank\": 40,\n \"score\": 40272.922031020746\n },\n {\n \"content\": \"}\\n\\n//print above node from given node \\n\\nvoid PrintAbove(TNode* node, int k) {\\n\\n\\n\\n if(node == NULL || k < 0) return;\\n\\n\\n\\n TNode *parent = NULL;\\n\\n parent = node->parent;\\n\\n while (parent != NULL) {\\n\\n k--;\\n\\n\\t\\tif(k == 0) {\\n\\n cout<<parent->val<<endl;\\n\\n } else if(node == parent->plft) {\\n\\n\\t\\t\\tPrintDown(parent->prgt, k-1);\\n\\n } else {\\n\\n PrintDown(parent->plft,k-1);\\n\\n }\\n\\n\\t\\t\\n\\n node = parent;\\n\\n parent = parent->parent;\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 41,\n \"score\": 39728.87541440872\n },\n {\n \"content\": \"\\troot->prgt->prgt = new Node(7);\\n\\n\\tNode *start = root->prgt->prgt;\\n\\n\\t*/\\n\\n\\t\\n\\n\\n\\n\\tTNode *root1 = new TNode(1);\\n\\n\\troot1->plft = new TNode(2);\\n\\n\\troot1->prgt = new TNode(3);\\n\\n\\troot1->plft->parent = root1;\\n\\n\\troot1->prgt->parent = root1;\\n\\n\\t\\n\\n\\troot1->plft->plft = new TNode(4);\\n\\n\\troot1->plft->plft->parent = root1->plft;\\n\\n\\troot1->plft->prgt = new TNode(5);\\n\\n\\troot1->plft->prgt->parent = root1->plft;\\n\\n\\troot1->prgt->plft = new TNode(6);\\n\\n\\troot1->prgt->prgt = new TNode(7);\\n\\n\\troot1->prgt->plft->parent = root1->prgt;\\n\\n\\troot1->prgt->prgt->parent = root1->prgt;\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 42,\n \"score\": 39724.91757040925\n },\n {\n \"content\": \"/*\\n\\n\\n\\nPrint all Nodes at a given distance from a starting Node in a binary tree\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\\n#include<iostream>\\n\\n#include<vector>\\n\\n#include<unordered_set>\\n\\n#include<queue>\\n\\nusing namespace std;\\n\\n\\n\\n\\n\\n//The binary tree has parent link.\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: print nodes in the subtree of the start node is easy. For those nodes as the start node's ancestor, \\n\\nuse parent link to move up to print nodes, for those nodes as the start node's neighbor and those nodes in another\\n\\nsubtree of the full tree, call the print down function with proper node and update distance.\\n\\n\\n\\nO(n) time, O(1) space\\n\\n\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 43,\n \"score\": 39719.58574534992\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n\\n\\nvoid PrintDistancekNodeP(TNode *start, int k) {\\n\\n\\n\\n\\tif (start == NULL || k < 0) return;\\n\\n\\n\\n\\tif (start->parent != NULL) {\\n\\n PrintAbove(start, k);\\n\\n\\t}\\n\\n PrintDown(start, k);\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\n//The binary tree does not have parent link.\\n\\n\\n\\n/*\\n\\n\\n\\nsolution:\\n\\n\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 44,\n \"score\": 39717.48167714881\n },\n {\n \"content\": \"\\tTNode *start1 = root1->prgt->prgt;\\n\\n\\tTNode *start2 = root1->prgt;\\n\\n\\n\\n\\tPrintDistancekNodeP(root1, 1);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(root1, 2);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start1, 1);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start1, 2);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start1, 3);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start2, 1);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start2, 2);\\n\\n\\tcout<<endl;\\n\\n\\tPrintDistancekNodeP(start2, 3);\\n\\n\\tcout<<endl;\\n\\n\\treturn 0;\\n\\n\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/Printing all nodes.cpp\",\n \"rank\": 45,\n \"score\": 39715.106137233386\n },\n {\n \"content\": \"\\n\\n return leftheight + 1;\\n\\n\\n\\n } else {\\n\\n\\n\\n return rightheight + 1;\\n\\n }\\n\\n}\\n\\n\\n\\nint LongestDistanceTwoNodes(Node *root) {\\n\\n\\n\\n if (root == NULL) {\\n\\n\\n\\n return 0;\\n\\n }\\n\\n\\n\\n int lheight = Height(root->plft);\\n\\n int rheight = Height(root->prgt);\\n\\n\\n\\n int llength = LongestDistanceTwoNodes(root->plft);\\n\\n int rlength = LongestDistanceTwoNodes(root->prgt);\\n\\n\\n\\n return max(lheight + rheight+ 1, max(llength, rlength));\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/Longest distance between two nodes.cpp\",\n \"rank\": 52,\n \"score\": 37709.14415014129\n },\n {\n \"content\": \" \\n\\n parent = iter;\\n\\n\\n\\n iter = iter->prgt;\\n\\n\\n\\n }\\n\\n\\n\\n if (iter->left == NULL) return parent;\\n\\n\\n\\n NODE *leftsub = iter->plft;\\n\\n\\n\\n while (leftsub=>prgt != NULL) {\\n\\n \\n\\n\\n\\n leftsub = leftsub=>prgt;\\n\\n\\n\\n }\\n\\n \\n\\n return leftsub;\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Second largest node in BST.cpp\",\n \"rank\": 53,\n \"score\": 37692.53074604532\n },\n {\n \"content\": \"*/\\n\\n\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: for a node, if it has child, return first child, otherwise, if it has sibling, return next sibling, \\n\\notherwise, return its partent sibling\\n\\n\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\\nNode* GetNextNode(Node *node) {\\n\\n assert(node != NULL);\\n\\n\\n\\n Node* next = node->GetFirstChild();\\n\\n if(next) return next;\\n\\n\\n\\n next = node->GetSlibing();\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Implement getNextNode().cpp\",\n \"rank\": 55,\n \"score\": 37684.15825512361\n },\n {\n \"content\": \" if(next) return next;\\n\\n\\n\\n next = node->GetParent();\\n\\n\\n\\n while (next) {\\n\\n\\n\\n next = next->GetSlibing();\\n\\n if(next) return next;\\n\\n next = next->GetParent();\\n\\n }\\n\\n\\n\\n return NULL;\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/Implement getNextNode().cpp\",\n \"rank\": 56,\n \"score\": 37682.963978951724\n },\n {\n \"content\": \"/*\\n\\n\\n\\nLongest distance between any two nodes in binary tree\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: the longest distance should be in left subtree or in right subtree or it should pass through root. \\n\\nWe can do it recursively.\\n\\nO(nlogn) time, O(1) space\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Longest distance between two nodes.cpp\",\n \"rank\": 57,\n \"score\": 37682.6856789507\n },\n {\n \"content\": \"/*\\n\\n\\n\\nSecond largest node in the binary search tree\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n \\n\\nsolutions: iterate right subtree to find the lastest node. If the node does not have left child, the node's parent is the second largest node, \\n\\notherwise, find the largest node in its left subtree.\\n\\nO(n) time, O(1) space \\n\\n \\n\\n*/\\n\\n\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Second largest node in BST.cpp\",\n \"rank\": 58,\n \"score\": 37680.62895952905\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGive a chapter tree as below:\\n\\n\\n\\n 1\\n\\n / | \\\\\\n\\n 1.1 1.2 1.3\\n\\n / /\\n\\n 1.1.1 1.2.1 \\n\\n\\n\\nand operations getParent(), getNextSibling(), getFirstChild()\\n\\n\\n\\nImplement getNextNode(node)\\n\\n\\n\\nExample:\\n\\n\\n\\n1.1.1's next is 1.2\\n\\n\\n\\n1.2.1's next is 1.3\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Implement getNextNode().cpp\",\n \"rank\": 59,\n \"score\": 37679.937898928685\n },\n {\n \"content\": \" SerialInner(*it, p);\\n\\n } \\n\\n}\\n\\n \\n\\nchar* Serialize(NODE* root, char mem[]) {\\n\\n if (NULL == mem || NULL == root) return NULL;\\n\\n \\n\\n char* p = mem;\\n\\n SerialInner(root, p);\\n\\n p++;\\n\\n *p='\\\\0';\\n\\n return mem;\\n\\n}\\n\\n\\n\\n\\n\\nint Proc(const char*& p) {\\n\\n \\n\\n int val = 0;\\n\\n while (*p >= '0' && *p <= '9' && *p!=' ') {\\n\\n \\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 60,\n \"score\": 35863.630879884964\n },\n {\n \"content\": \"/*\\n\\n\\n\\nSerializeDeSerialize an arbitrary nodes tree\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: preorder traversal\\n\\nO(n) time\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\\n\\n\\n#include<iostream>\\n\\n#include<vector>\\n\\nusing namespace std;\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 61,\n \"score\": 35857.688820902156\n },\n {\n \"content\": \" val = 10 * val + *p++ - '0';\\n\\n \\n\\n }\\n\\n p++;\\n\\n return val;\\n\\n}\\n\\n \\n\\nNODE *DeserialInner(const char*& p) {\\n\\n\\t\\n\\n \\n\\n int val = Proc(p);\\n\\n \\n\\n NODE *sresult = new NODE(val);\\n\\n \\n\\n val = Proc(p);\\n\\n\\n\\n int childnum = val;\\n\\n \\n\\n\\n\\n for (int i = 0; i < childnum; ++i) {\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 62,\n \"score\": 35857.429845374856\n },\n {\n \"content\": \"/*\\n\\nFind the right most node in each level of a binary tree\\n\\n*/\\n\\n\\n\\n/*\\n\\nsolution: preorder traversal but with right child at first\\n\\nO(n) time\\n\\n*/\\n\\n\\n\\n\\n\\n\\n\\n#include<iostream>\\n\\n#include<vector>\\n\\nusing namespace std;\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Find the right most node in each level of a binary tree.cpp\",\n \"rank\": 63,\n \"score\": 35857.26331592011\n },\n {\n \"content\": \" NODE *p3 = new NODE(4);\\n\\n root1->vec.push_back(p1);\\n\\n root1->vec.push_back(p2);\\n\\n root1->vec.push_back(p3);\\n\\n char str[] = \\\"\\\";\\n\\n Serialize(root1, str);\\n\\n cout<<str<<endl;\\n\\n \\n\\n const char mem1[] = \\\"3 3 1 0 2 0 4 0\\\";\\n\\n NODE *root = DeSerialize(mem1);\\n\\n cout<<root->val<<endl;\\n\\n for (vector<NODE*>::iterator it = root->vec.begin(); it != root->vec.end(); it++) {\\n\\n\\t\\n\\n cout<<(*it)->val<<endl;\\n\\n\\t\\t\\n\\n }\\t\\n\\n return 0;\\t\\n\\n\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 64,\n \"score\": 35856.36569533443\n },\n {\n \"content\": \" \\n\\n result->vec.push_back(DeserialInner(p));\\n\\n \\n\\n } \\n\\n \\n\\n return result;\\n\\n}\\n\\n \\n\\nNODE *DeSerialize(const char mem[]) {\\n\\n if (NULL == mem) return NULL;\\n\\n \\n\\n const char* p = mem;\\n\\n return DeserialInner(p);\\n\\n}\\n\\n\\n\\nint main() {\\n\\n \\n\\n NODE *root1 = new NODE(3);\\n\\n NODE *p1 = new NODE(1);\\n\\n NODE *p2 = new NODE(2);\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize an arbitrary nodes tree.cpp\",\n \"rank\": 65,\n \"score\": 35855.20633027471\n },\n {\n \"content\": \" GetRightMostBTInner(Node->pLft, vec, Lev+1);\\n\\n}\\n\\n \\n\\nvector<NODE*> GetRightMostBT(NODE* root) {\\n\\n\\n\\n vector<NODE*> vec;\\n\\n GetRightMostBThelp(root, vec, 0);\\n\\n\\n\\n return vec;\\n\\n}\\n\\n\\n\\nint main() {\\n\\n\\n\\n NODE *head=new NODE(2);\\n\\n head->pLft=new NODE(3);\\n\\n head->pRgt=new NODE(5);\\n\\n head->pRgt->pRgt=new NODE(7);\\n\\n GetRightMostBT(head);\\n\\n return 0;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Find the right most node in each level of a binary tree.cpp\",\n \"rank\": 66,\n \"score\": 35854.5675104419\n },\n {\n \"content\": \" if (node->prgt != NULL && largest->val < node->prgt->val) {\\n\\n\\n\\n largest = node->prgt;\\n\\n\\n\\n }\\n\\n\\n\\n\\t // if root has the largest value, return\\n\\n if (largest == node) return;\\n\\n \\n\\n\\t //if not, swap the node's value with largest value\\n\\n int tmp = node->val;\\n\\n node->val = largest->val;\\n\\n largest->val = tmp; \\n\\n\\n\\n ShiftUp(largest);\\n\\n}\\n\\n\\n\\nvoid HeapifyBinaryTree(NODE *root) {\\n\\n\\n\\n if (!root) return;\\n\",\n \"file_path\": \"problem/Tree/Heapify a binary tree.cpp\",\n \"rank\": 67,\n \"score\": 25.535898596085858\n },\n {\n \"content\": \" root->plft = new NODE(2);\\n\\n root->prgt = new NODE(3);\\n\\n root->prgt->plft = new NODE(5);\\n\\n HeapifyBinaryTree(root);\\n\\n cout<<root->val<<endl;\\n\\n cout<<root->plft->val<<endl;\\n\\n cout<<root->prgt->val<<endl;\\n\\n cout<<root->prgt->plft->val<<endl;\\n\\n return 0;\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Heapify a binary tree.cpp\",\n \"rank\": 68,\n \"score\": 25.304815329134925\n },\n {\n \"content\": \"\\n\\n for (unordered_map<int, int>::iterator it = hdmp.begin(); it != hdmp.end(); ++it ) {\\n\\n\\n\\n cout<< it->second <<\\\" \\\"<<endl;\\n\\n\\n\\n }\\n\\n\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\nint main() {\\n\\n\\n\\n Node *root = new Node(1);\\n\\n root->plft = new Node(2);\\n\\n root->prgt = new Node(3);\\n\\n root->plft->plft = new Node(4);\\n\\n root->plft->prgt = new Node(5);\\n\\n root->prgt->plft = new Node(6);\\n\\n root->prgt->prgt = new Node(7);\\n\\n\\n\\n VerticalSum(root);\\n\\n\\n\\n return 0;\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Vertical sum in a binary tree.cpp\",\n \"rank\": 69,\n \"score\": 24.49283136239298\n },\n {\n \"content\": \"}\\n\\n\\n\\n\\n\\nint MaxPathSum(TreeNode *root) {\\n\\n\\n\\n if (root == NULL) return 0;\\n\\n int maxSoFar = root->val;\\n\\n MaxPathSumInner(root, maxSoFar);\\n\\n return maxSoFar;\\n\\n}\\n\\n\\n\\nint main() {\\n\\n\\n\\n TreeNode *root = new TreeNode(-10);\\n\\n TreeNode *p1 = new TreeNode(2);\\n\\n TreeNode *p2 = new TreeNode(3);\\n\\n TreeNode *p3 = new TreeNode(4);\\n\\n root->children.push_back(p1);\\n\\n root->children.push_back(p2);\\n\\n root->children.push_back(p3);\\n\",\n \"file_path\": \"problem/Tree/Maximalpathsum.cpp\",\n \"rank\": 70,\n \"score\": 22.91734383565346\n },\n {\n \"content\": \" if (hdmp.find(hd) == hdmp.end()) {\\n\\n\\n\\n hdmp.insert(make_pair<int,int>(hd, prevsum + root->val));\\n\\n \\n\\n } else {\\n\\n\\n\\n hdmp[hd] = prevsum + root->val;\\n\\n }\\n\\n\\n\\n GetHorizontalDistance(root->prgt, hd + 1, hdmp);\\n\\n }\\n\\n\\n\\nvoid VerticalSum(Node *root) {\\n\\n\\n\\n if (root == NULL) return;\\n\\n\\n\\n unordered_map<int, int> hdmp;\\n\\n GetHorizontalDistance(root, 0, hdmp);\\n\\n\\n\\n if (!hdmp.empty()) {\\n\",\n \"file_path\": \"problem/Tree/Vertical sum in a binary tree.cpp\",\n \"rank\": 71,\n \"score\": 22.4451248951093\n },\n {\n \"content\": \"\\n\\n if (root->plft) {\\n\\n HeapifyBinaryTree(root->plft); \\n\\n } \\n\\n\\n\\n if (root->prgt) {\\n\\n\\n\\n HeapifyBinaryTree(root->prgt);\\n\\n \\n\\n }\\n\\n\\n\\n ShiftUp(root);\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nint main() {\\n\\n\\n\\n NODE *root = new NODE(1);\\n\",\n \"file_path\": \"problem/Tree/Heapify a binary tree.cpp\",\n \"rank\": 72,\n \"score\": 22.26711575735685\n },\n {\n \"content\": \" switch = leftswitch + rightswitch;\\n\\n return true;\\n\\n }\\n\\n \\n\\n if (BinTreeSwitchEqualInner(node1->Lft, node2->Rgt, leftswitch) && \\n\\n BinTreeSwitchEqualInner(node1->Rgt, node2->Lft, rightswitch)) {\\n\\n \\n\\n switch = leftswitch +rightswitch + 1; //add 1 to count switch left and right part\\n\\n return true;\\n\\n }\\n\\n \\n\\n return false;\\n\\n}\\n\\n \\n\\nint BinTreeSwitchEqual(NODE* root1, NODE* root2) {\\n\\n assert(root2 && root1);\\n\\n \\n\\n int switch = 0;\\n\\n bool result = BinTreeSwitchEqualInner(root1, root2, switch);\\n\\n \\n\",\n \"file_path\": \"problem/Tree/Switch binary tree to make equal.cpp\",\n \"rank\": 73,\n \"score\": 20.94375644820505\n },\n {\n \"content\": \"#include<vector>\\n\\n#include<algorithm>\\n\\n#include<unordered_map>\\n\\n#include<string>\\n\\nusing namespace std;\\n\\n\\n\\nunordered_map<string, int> mp;\\n\\n\\n\\nbool LessThan(string str1, string str2) {\\n\\n\\n\\n int order1 = mp[str1];\\n\\n int order2 = mp[str2];\\n\\n \\n\\n if (order1 < order2) {\\n\\n return true;\\n\\n } else {\\n\\n\\n\\n return false;\\n\\n \\n\\n }\\n\",\n \"file_path\": \"problem/String/Sortfirstaccordingsecond.cpp\",\n \"rank\": 74,\n \"score\": 20.08211324555336\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGiven an array and a number k, if there exists an element arr[i] such that its duplicates\\n\\nlies in arr[i-k] and arr[i+k],return true, else return false\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\nsolution: use a set to store and check the duplicates\\n\\nO(nlogk) time, O(k) space\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<cassert>\\n\\n#include<set>\\n\\nusing namespace std;\\n\\n\\n\\nbool HasDupk(int arr[], int len, int k) {\\n\\n\\n\\n\\tassert(arr && k >= 0 && k < len && len > 0);\\n\",\n \"file_path\": \"problem/Given an array and a number k.cpp\",\n \"rank\": 75,\n \"score\": 19.909109844455546\n },\n {\n \"content\": \"#include<cassert>\\n\\nusing namespace std;\\n\\n\\n\\nvoid detectLongestCycleInner(int start, int idx, int arr[], vector<bool>& visited, int &len) {\\n\\n visited[idx] = true;\\n\\n len++;\\n\\n \\n\\n if (!visited[arr[idx]]) {\\n\\n \\n\\n detectLongestCycleInner(start, arr[idx], arr, visited, len);\\n\\n \\n\\n } else {\\n\\n \\n\\n assert(start != idx); //a cycle\\n\\n }\\n\\n \\n\\n}\\n\\n\\n\\n\\n\\n/*\\n\",\n \"file_path\": \"problem/Array/Detect the longest cycle in an array.cpp\",\n \"rank\": 76,\n \"score\": 19.32591138332665\n },\n {\n \"content\": \"*/\\n\\n\\n\\n#include<iostream>\\n\\nusing namespace std;\\n\\n\\n\\n\\n\\nint FindPartiion(int arr[], int len) {\\n\\n int sum = 0;\\n\\n int i, j;\\n\\n \\n\\n for (i = 0; i < len; ++i) {\\n\\n \\n\\n sum += arr[i];\\n\\n \\n\\n } \\n\\n \\n\\n bool part[50][8];\\n\\n \\n\\n \\n\\n for (i = 0; i <= len; ++i) {\\n\",\n \"file_path\": \"problem/DynamicProgramming/Minimal subset sum.cpp\",\n \"rank\": 77,\n \"score\": 19.067751758837574\n },\n {\n \"content\": \" int lftmax, lftmin;\\n\\n int numnodes = GetLargestBSTInner(Node->pLft, lftmin, lftmax, maxbstroot, maxbstnum);\\n\\n if (numnodes <= 0 || lftmax > pNode->val) { //check invalid\\n\\n \\n\\n bivalid = true; \\n\\n \\n\\n } else { //pNode->pLft is a valid BST\\n\\n \\n\\n result += numnodes; //count size of left subtree\\n\\n minbound = lftmin; //update bound\\n\\n }\\n\\n }\\n\\n \\n\\n if (Node->pRgt != NULL) {\\n\\n \\n\\n int rgtmax, rgtmin;\\n\\n int numnodes = GetLargestBSTInner(Node->pRgt, rgtmin, rgtmax, maxbstroot, maxbstnum);\\n\\n if (numnodes <= 0 || rgtmin < pNode->val) { //check invalid\\n\\n \\n\\n bivalid = true;\\n\",\n \"file_path\": \"problem/Tree/Find the largest BST sub tree in BT.cpp\",\n \"rank\": 78,\n \"score\": 18.78339924530132\n },\n {\n \"content\": \"NODE *GetLargestBST(NODE *root) {\\n\\n \\n\\n if (root == NULL) return NULL;\\n\\n \\n\\n NODE *result = NULL;\\n\\n int maxbstnum = 0;\\n\\n int minbound, maxbound;\\n\\n GetLargestBSTInner(root, minbound, maxbound, result, maxbstnum);\\n\\n \\n\\n return result;\\n\\n}\\n\\n\\n\\nvoid InOrderTravel(NODE* root) {\\n\\n assert(root);\\n\\n \\n\\n stack<NODE*> stk;\\n\\n NODE* cur = root;\\n\\n while (NULL != cur) {\\n\\n \\n\\n stk.push(cur);\\n\",\n \"file_path\": \"problem/Tree/Find the largest BST sub tree in BT.cpp\",\n \"rank\": 79,\n \"score\": 18.47953280106867\n },\n {\n \"content\": \" \\n\\n if (node->pLft == NULL) {\\n\\n \\n\\n node->setLeft(tmp);\\n\\n \\n\\n } else {\\n\\n \\n\\n Insert(node->pLft, tmp);\\n\\n } \\n\\n }\\n\\n}\\n\\n\\n\\n//find the n'th smallest element stored in the tree in O(logn) time\\n\\n\\n\\nNODE *Select(NODE *root, int n) {\\n\\n if (root==NULL || n <= 0) return NULL;\\n\\n \\n\\n NODE *cur = root;\\n\\n \\n\\n int cursum = 0;\\n\",\n \"file_path\": \"problem/Tree/Statistical binary search tree.cpp\",\n \"rank\": 80,\n \"score\": 18.338338178911506\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGiven a N-way tree, find the maximum path sum. The path may start and end at any node in the tree.\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: calculate each path sum for each child, add it to maximal path if it is positve \\n\\nO(n) time, O(1) space\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<vector>\\n\\nusing namespace std;\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Maximalpathsum.cpp\",\n \"rank\": 81,\n \"score\": 18.046225509752027\n },\n {\n \"content\": \"}\\n\\n\\n\\nint main() {\\n\\n NODE *root = new NODE(3);\\n\\n Insert(root, new NODE(1));\\n\\n Insert(root, new NODE(5));\\n\\n NODE *p1 = new NODE(4);\\n\\n Insert(root,p1);\\n\\n cout<<root->size<<endl;//4\\n\\n\\t\\n\\n cout<<Select(root,1)->val<<endl;\\n\\n cout<<Select(root,2)->val<<endl;\\n\\n cout<<Select(root,3)->val<<endl;\\n\\n cout<<Select(root,4)->val<<endl;\\n\\n cout<<GetNum(root, p1)<<endl;\\n\\n return 0; \\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Statistical binary search tree.cpp\",\n \"rank\": 82,\n \"score\": 17.974139495989604\n },\n {\n \"content\": \"*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<vector>\\n\\n#include<queue>\\n\\nusing namespace std;\\n\\n\\n\\nvoid PrintSubTreeSum(vector<vector<int> > &relation, int node) { \\n\\n int size = relation.size();\\n\\n if (node == 0 || size == 0) return;\\n\\n vector<int> outdegree(node, 0);\\n\\n vector<int> totalweight(node,0);\\n\\n vector<int> orgweight(node,0);\\n\\n vector<int> parentindex(node,-1);\\n\\n\\t\\n\\n for (int i = 0;i < size;i++) {\\n\\n\\n\\n outdegree[relation[i][1]]++;\\n\\n totalweight[relation[i][0]] = relation[i][2];\\n\\n parentindex[relation[i][0]] = relation[i][1];\\n\",\n \"file_path\": \"problem/Tree/Totalweight.cpp\",\n \"rank\": 83,\n \"score\": 17.837139758276738\n },\n {\n \"content\": \"\\n\\n//find the rank of element node in the tree in O(logn) time\\n\\n\\n\\nint GetNum(NODE* root, NODE* node) {\\n\\n if (root == NULL|| node == NULL) return 0;\\n\\n \\n\\n if (node == root) return node->pLft == NULL ? 1 : 1 + node->pLft->size;\\n\\n \\n\\n NODE* cur = node;\\n\\n int result = 1;\\n\\n while (cur->pParent != NULL) {\\n\\n \\n\\n if (cur == cur->pParent->pRgt) { // if node is its parent right child\\n\\n result += 1 + (cur->pParent->pLft == NULL ? 0 : cur->pParent->pLft->size); \\n\\n }\\n\\n \\n\\n cur = cur->pParent;\\n\\n }\\n\\n \\n\\n return result;\\n\",\n \"file_path\": \"problem/Tree/Statistical binary search tree.cpp\",\n \"rank\": 84,\n \"score\": 17.804320002015817\n },\n {\n \"content\": \" cur = cur->pLft;\\n\\n }\\n\\n \\n\\n while (!stk.empty()) {\\n\\n \\n\\n cur = stk.top();\\n\\n cout<<cur->val<<endl;\\n\\n stk.pop();\\n\\n \\n\\n cur = cur->pRgt;\\n\\n while (NULL != cur) {\\n\\n \\n\\n stk.push(cur);\\n\\n cur = cur->pLft;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nint main() {\\n\\n NODE *root = new NODE(5);\\n\",\n \"file_path\": \"problem/Tree/Find the largest BST sub tree in BT.cpp\",\n \"rank\": 85,\n \"score\": 17.444583897532635\n },\n {\n \"content\": \"/*\\n\\n\\n\\nGiven a binary tree with parent link, find a node's immediate right neighbor without the root node.\\n\\n\\n\\n\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: first find the lowest parent that both the node and its immediate neighbor have. Then\\n\\nrecursively find its immediate neighbor in the parent's left subtree.\\n\\nO(h) time, O(1) space, h is the height of the node.\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\nusing namespace std;\\n\\n\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Immediate right neighbor.cpp\",\n \"rank\": 86,\n \"score\": 17.243132807932547\n },\n {\n \"content\": \" \\n\\n const char* p = mem;\\n\\n return DeSerializeInner(p);\\n\\n}\\n\\n\\n\\nint main() {\\n\\n\\n\\n NODE *root = new NODE(3);\\n\\n root->pLft = new NODE(1);\\n\\n root->pRgt = new NODE(4);\\n\\n char str[] = \\\"\\\";\\n\\n Serialize(str, root);\\n\\n cout<<str<<endl;\\n\\n const char str1[] = \\\"3 1 # # 4 # #\\\";\\n\\n NODE *r = DeSerialize(str1);\\n\\n cout<<r->val<<endl;\\n\\n cout<<r->pLft->val<<endl;\\n\\n cout<<r->pRgt->val<<endl;\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"problem/Tree/SerializeDeSerialize a binary tree.cpp\",\n \"rank\": 87,\n \"score\": 17.207804933574288\n },\n {\n \"content\": \"/*\\n\\n\\n\\n Given an integer array arr, find the maximal a[i] such that a[i]=a[x]+a[y].\\n\\n \\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: sort&binary search\\n\\nO(nlogn) time, O(1) space\\n\\n\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<cassert>\\n\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n\\n\\nbool TwoSum(int arr[], int len, int skipindex) {\\n\\n\\n\",\n \"file_path\": \"problem/Array/Find the max item A[i], such that A[i]=A[x]+A[y].cpp\",\n \"rank\": 88,\n \"score\": 17.058967243610713\n },\n {\n \"content\": \"*/\\n\\n#include<iostream>\\n\\nusing namespace std;\\n\\n\\n\\n\\n\\n\\n\\nbool IsDuplicate(const string str) {\\n\\n\\n\\n int strlen = str.size();\\n\\n\\n\\n if(strlen < 4) return false;\\n\\n\\n\\n int len = 1; //length of the duplicate substring\\n\\n int start = 0;\\n\\n for (int i = 1; i< strlen; ++i) {\\n\\n\\n\\n if (str[start] == str[i]) {\\n\\n\\n\\n start++;\\n\\n if(start >= len) start = 0; //reach an end of a duplicate substring, back to beginning\\n\",\n \"file_path\": \"problem/String/Kduplicates.cpp\",\n \"rank\": 89,\n \"score\": 16.917550227629544\n },\n {\n \"content\": \"\\n\\nuse two sets, one is to record all visited index in the array, another one is to record the visited index in current possible cycle\\n\\nO(n) time, O(n) space\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\\n#include<iostream>\\n\\n#include<unordered_set>\\n\\nusing namespace std;\\n\\n\\n\\nbool DetectCycle1(int arr[], int len) {\\n\\n \\n\\n int slow = 0;\\n\\n int fast = 0;\\n\\n int cur = 0;\\n\\n \\n\\n while (cur < len) {\\n\\n \\n\\n if (arr[slow] >= 0 && arr[slow] < len) {\\n\",\n \"file_path\": \"problem/Array/Detect cycle in an array.cpp\",\n \"rank\": 90,\n \"score\": 16.758783001097143\n },\n {\n \"content\": \"\\n\\n if(local) {\\n\\n return local;\\n\\n\\t\\t} else{\\n\\n node = parent;\\n\\n parent = node->parent;\\n\\n level--;\\n\\n }\\n\\n }\\n\\n return NULL; \\n\\n}\\n\\n\\n\\nint main(){\\n\\n\\n\\n Node *root = new Node(0);\\n\\n root->left = new Node(1);\\n\\n root->left->parent = root;\\n\\n root->right = new Node(2);\\n\\n root->right->parent = root;\\n\\n root->left->left = new Node(3);\\n\",\n \"file_path\": \"problem/Tree/Immediate right neighbor.cpp\",\n \"rank\": 91,\n \"score\": 16.717273349583355\n },\n {\n \"content\": \"/*\\n\\n\\n\\nsolutuion: calculate horizontal distances from root for all nodes. If two nodes have the same horizontal distance, then they are on same vertical line. \\n\\nHD for root is 0, a right edge (edge connecting to right subtree) is considered as +1 horizontal distance and a left edge is considered as -1 horizontal distance. \\n\\n\\n\\nDo an inorder traversal and calcuate the horizontal distance recursively.\\n\\n\\n\\nO(n) time, O(n) space\\n\\n\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<unordered_map>\\n\\nusing namespace std;\\n\\n\\n\",\n \"file_path\": \"problem/Tree/Vertical sum in a binary tree.cpp\",\n \"rank\": 92,\n \"score\": 16.683155915992955\n },\n {\n \"content\": \"/*\\n\\nSieve of Eratosthenes algorithm\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: start from smallest primer number p, print p and mark 2p, 3p, 4p, ...\\n\\nprint the first number q greater than p without mark if it exists, then repeat the steps above for q.\\n\\n\\n\\n*/\\n\\n\\n\\n\\n\\n#include <iostream>\\n\\nusing namespace std;\\n\\n\\n\\n\\n\\nvoid FlagMultiples(bool arr[], int a, unsigned int num) {\\n\\n int i = 2;\\n\\n int temp = i * a;\\n\\n while ( temp <= num ) {\\n\",\n \"file_path\": \"problem/SieveofEratosthenes.cpp\",\n \"rank\": 93,\n \"score\": 16.682443619178972\n },\n {\n \"content\": \"*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: define the vowel checking rule correctly. Then just one scan.\\n\\nO(n) time, O(1) space\\n\\n\\n\\n*/\\n\\n#include<iostream>\\n\\n#include<cctype>\\n\\n#include<string>\\n\\nusing namespace std;\\n\\n\\n\\nbool checkBasicVowel(char c) {\\n\\n\\n\\n if (c == 'a' || c =='e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' ||c == 'U') {\\n\\n return true;\\n\\n\\n\\n } else {\\n\\n\\n\",\n \"file_path\": \"problem/String/Vowel product.cpp\",\n \"rank\": 94,\n \"score\": 16.664347476311875\n },\n {\n \"content\": \"\\n\\n#include<iostream>\\n\\n#include<string>\\n\\nusing namespace std;\\n\\n\\n\\nbool TransformString(string str1, string str2) {\\n\\n\\n\\n int len1 = str1.size();\\n\\n int len2 = str2.size();\\n\\n\\n\\n if (abs(len1 - len2) > 1) return false;\\n\\n\\n\\n if (len1 > len2) return TransformString(str2, str1);\\n\\n\\n\\n\\t//replace\\t\\n\\n if (len1 == len2) {\\n\\n\\n\\n int countdiff = 0;\\n\\n\\n\\n for (int i = 0 ; i < len1; ++i) {\\n\",\n \"file_path\": \"problem/String/Edit Distance one.cpp\",\n \"rank\": 95,\n \"score\": 16.567559041272233\n },\n {\n \"content\": \"/*\\n\\nGiven an array of sorted integers where each one is in the range from 0 to m-1 and m > n,\\n\\nwhere n is the length of this array.\\n\\nFind the smallest number that is missing from the array.\\n\\n*/\\n\\n\\n\\n/*\\n\\nsolution: modified binary search. \\n\\nO(logn) time, O(1) space\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\nusing namespace std;\\n\\n\\n\\nint FindFirstMissing(int arr[], int begin, int end) {\\n\\n \\n\\n //end+1 is the number larger than the last element of array\\n\\n if (begin > end)\\n\\n return end + 1;\\n\\n \\n\",\n \"file_path\": \"problem/SortingSearch/Smallestmissingnumber.cpp\",\n \"rank\": 96,\n \"score\": 16.234300952581133\n },\n {\n \"content\": \" stk.pop();\\n\\n }\\n\\n }\\n\\n}\\n\\n \\n\\n//preorder\\n\\nvoid PrevOrderTravel(NODE* root) {\\n\\n assert(root);\\n\\n \\n\\n stack<NODE*> stk;\\n\\n stk.push(root);\\n\\n \\n\\n while (!stk.empty()) {\\n\\n \\n\\n NODE* top = stk.top();\\n\\n stk.pop();\\n\\n \\n\\n cout<<top->val<<endl;\\n\\n \\n\\n if (top->pRgt != NULL) stk.push(top->pRgt);\\n\",\n \"file_path\": \"problem/Tree/PreInPostorder travel of bT with stack.cpp\",\n \"rank\": 97,\n \"score\": 15.901693231718374\n },\n {\n \"content\": \"/*\\n\\nFind the last k digits of m^n, where m, n is positive integer, n may be very large.\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\nsolution: big number + recursion\\n\\nO((log n) * k * k) time, O(k*k) space\\n\\n*/\\n\\n\\n\\n#include<iostream>\\n\\n#include<cassert>\\n\\n#include<string>\\n\\nusing namespace std;\\n\\n\\n\\nstring MultiplyArrays(string num1, string num2, int k) {\\n\\n int N = num1.length(), M = num2.length();\\n\\n string res(N+M, '0');\\n\\n for (int i = N - 1; i >= 0; --i) {\\n\\n int carry = 0;\\n\",\n \"file_path\": \"problem/Math/Calculate (m^n)%(10^k).cpp\",\n \"rank\": 98,\n \"score\": 15.607745224466276\n },\n {\n \"content\": \"\",\n \"file_path\": \"problem/Quadtree.cpp\",\n \"rank\": 99,\n \"score\": 15.453547276372685\n }\n]","isConversational":false}}},{"rowIdx":377,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"mindspore/ccsrc/runtime/device/memory_offload_strategy.cc"},"repo_name":{"kind":"string","value":"zhz44/mindspore"},"commit":{"kind":"string","value":"6044d34074c8505dd4b02c0a05419cbc32a43f86"},"file_code":{"kind":"string","value":"\n#include \"runtime/device/memory_offload_strategy.h\"\n#include <vector>\n#include <map>\n#include <memory>\n#include <utility>\n#include \"utils/log_adapter.h\"\n\nnamespace mindspore {\nnamespace device {\nconstexpr size_t kFirstGetMemEventIndex = 1;\nconstexpr size_t kInitOrMallocMemEventIndex = 0;\n\nstd::vector<std::shared_ptr<MemEvent>> &MemOffloadStrategy::GetPreComputeEvents(size_t step) {\n if (pre_compute_events_.size() <= step) {\n MS_LOG_EXCEPTION << \"Index out of pre event range, index:\" << step << \", event size:\" << pre_compute_events_.size();\n }\n return pre_compute_events_[step];\n}\n\nstd::vector<std::shared_ptr<MemEvent>> &MemOffloadStrategy::GetPostComputeEvents(size_t step) {\n if (post_compute_events_.size() <= step) {\n MS_LOG_EXCEPTION << \"Index out of post event range, index:\" << step\n << \", event size:\" << post_compute_events_.size();\n }\n return post_compute_events_[step];\n}\n\nvoid MemOffloadStrategy::Execute() {\n CountMemUsage();\n CheckMemSize();\n if (need_swap_) {\n GenEventSpan();\n GenSwapEventSet();\n }\n GenComputeMemEvents();\n}\n\nvoid MemOffloadStrategy::CountMemUsage() {\n if (!min_mem_used_.empty()) {\n return;\n }\n if (mem_events_.empty() || total_step_ == 0) {\n return;\n }\n min_mem_used_.resize(total_step_, 0);\n std::vector<size_t> total_mem_used(total_step_, 0);\n size_t high_priority_mem_size = 0;\n for (auto &item : mem_events_) {\n auto &mem_events = item.second;\n if (mem_events.empty()) {\n continue;\n }\n auto first_event = mem_events[kInitOrMallocMemEventIndex];\n const bool is_high_priority = IsHighPriorityMem(first_event->key);\n if (is_high_priority) {\n high_priority_mem_size += first_event->mem_size;\n } else {\n auto last_event = mem_events[mem_events.size() - 1];\n for (size_t start_index = first_event->index; start_index <= last_event->index; ++start_index) {\n total_mem_used[start_index] += first_event->mem_size;\n }\n }\n \n for (const auto &event : mem_events) {\n MS_EXCEPTION_IF_NULL(event);\n if (event->type != kGet) {\n continue;\n }\n min_mem_used_[event->index] += first_event->mem_size;\n }\n }\n min_mem_needed_ = *(std::max_element(min_mem_used_.begin(), min_mem_used_.end()));\n mem_used_without_swap_ = *(std::max_element(total_mem_used.begin(), total_mem_used.end())) + high_priority_mem_size;\n if (mem_size_ < min_mem_needed_) {\n MS_LOG(EXCEPTION) << \"Out of memory, as available mem size is \" << mem_size_ << \" while graph needs at least \"\n << min_mem_needed_;\n }\n}\n\nbool MemOffloadStrategy::IsHighPriorityMem(const void *key) const {\n auto iter = mem_priority_.find(key);\n if (iter != mem_priority_.end()) {\n return iter->second == kMemPriorityHigh;\n }\n return false;\n}\n\nvoid MemOffloadStrategy::CheckMemSize() {\n if (mem_size_ < mem_used_without_swap_ || !manual_offload_keys_.empty()) {\n need_swap_ = true;\n }\n\n MS_LOG(INFO) << \"Available mem size: \" << mem_size_ << \", graph needs mem size: \" << mem_used_without_swap_\n << \" without swap, and needs at least \" << min_mem_needed_ << \" with swap.\";\n}\n\nvoid MemOffloadStrategy::GenEventSpan() {\n if (!event_span_.empty()) {\n return;\n }\n for (auto &item : mem_events_) {\n auto &tensor_events = item.second;\n if (tensor_events.size() <= 1) {\n continue;\n }\n const bool is_high_priority = IsHighPriorityMem(tensor_events[kInitOrMallocMemEventIndex]->key);\n for (size_t i = kFirstGetMemEventIndex; i < tensor_events.size(); ++i) {\n auto &event = tensor_events[i];\n MS_EXCEPTION_IF_NULL(event);\n if (event->type != kGet) {\n MS_LOG(EXCEPTION) << \"Event should be Get except fist event.\";\n }\n auto latest_event = tensor_events[i - 1];\n if (i == kFirstGetMemEventIndex && is_high_priority) {\n latest_event = tensor_events[tensor_events.size() - 1];\n }\n auto span = GetSpanBetweenMemEvents(latest_event->index, event->index);\n if (is_high_priority && span == 0 && latest_event == event) {\n span = total_step_;\n }\n if (span > 1) {\n const size_t span_mul_size = (span - 1) * event->mem_size;\n (void)event_span_.emplace(std::make_pair(span_mul_size, std::make_pair(event, span)));\n }\n }\n }\n}\n\nvoid MemOffloadStrategy::GenSwapEventSet() {\n swap_events_.clear();\n \n if (!manual_offload_keys_.empty()) {\n for (const auto &iter : event_span_) {\n auto &event = iter.second.first;\n if (manual_offload_keys_.find(event->key) != manual_offload_keys_.end()) {\n (void)swap_events_.emplace(event);\n }\n }\n return;\n }\n\n \n std::vector<size_t> cur_mem_used(min_mem_used_.begin(), min_mem_used_.end());\n for (const auto &iter : event_span_) {\n auto span = iter.second.second;\n auto &event = iter.second.first;\n auto start_index = ((event->index + total_step_ - span + 1) % total_step_);\n bool revert = false;\n size_t cur_index = start_index;\n while (cur_index != event->index) {\n cur_mem_used[cur_index] += event->mem_size;\n if (cur_mem_used[cur_index] > mem_size_) {\n revert = true;\n }\n cur_index += 1;\n if (cur_index >= total_step_) {\n cur_index = 0;\n }\n }\n if (revert) {\n cur_index = start_index;\n while (cur_index != event->index) {\n cur_mem_used[cur_index] -= event->mem_size;\n cur_index += 1;\n if (cur_index >= total_step_) {\n cur_index = 0;\n }\n }\n (void)swap_events_.emplace(event);\n }\n }\n}\n\nvoid MemOffloadStrategy::GenComputeMemEvents() {\n pre_compute_events_.clear();\n post_compute_events_.clear();\n pre_compute_events_.resize(total_step_);\n post_compute_events_.resize(total_step_);\n for (auto &item : mem_events_) {\n auto &mem_events = item.second;\n \n if (mem_events.size() <= 1) {\n continue;\n }\n\n const bool is_high_priority = IsHighPriorityMem(item.first);\n auto first_event = mem_events[kInitOrMallocMemEventIndex];\n MS_EXCEPTION_IF_NULL(first_event);\n const auto &first_get_event = mem_events[kFirstGetMemEventIndex];\n MS_EXCEPTION_IF_NULL(first_get_event);\n if (is_high_priority && swap_events_.find(first_get_event) != swap_events_.end()) {\n first_event->index = first_get_event->index;\n }\n if ((first_event->type == kInit || first_event->type == kMalloc) && first_event->index < total_step_) {\n pre_compute_events_[first_event->index].emplace_back(first_event);\n } else {\n MS_LOG_EXCEPTION << \"First event should be init or malloc!\";\n }\n\n const auto &last_event = mem_events[mem_events.size() - 1];\n size_t pre_index = is_high_priority ? last_event->index : first_event->index;\n const auto &swap_out_event_index = GetSwapOutEventIndex(item.first, mem_events);\n for (size_t i = kFirstGetMemEventIndex; i < mem_events.size(); ++i) {\n auto &event = mem_events[i];\n MS_EXCEPTION_IF_NULL(event);\n if (need_swap_ && swap_events_.find(event) != swap_events_.end()) {\n MemEventType event_type = kSwapOut;\n if (is_high_priority && swap_out_event_index.count(i) == 0) {\n event_type = kFree;\n }\n auto free_or_swap_out_event = std::make_shared<MemEvent>(event_type, pre_index);\n free_or_swap_out_event->key = item.first;\n free_or_swap_out_event->mem_size = first_event->mem_size;\n post_compute_events_[pre_index].emplace_back(free_or_swap_out_event);\n \n if (i != kFirstGetMemEventIndex || first_event->type != kInit) {\n auto swap_in_event = std::make_shared<MemEvent>(kSwapIn, event->index);\n swap_in_event->key = item.first;\n swap_in_event->mem_size = first_event->mem_size;\n (void)pre_compute_events_[event->index].emplace_back(swap_in_event);\n }\n }\n if (event->index < pre_compute_events_.size()) {\n (void)pre_compute_events_[event->index].emplace_back(event);\n }\n pre_index = event->index;\n }\n if (!is_high_priority) {\n GenFreeEvent(last_event);\n }\n }\n}\n\nvoid MemOffloadStrategy::GenFreeEvent(const std::shared_ptr<MemEvent> &last_event) {\n MS_EXCEPTION_IF_NULL(last_event);\n auto free_event = std::make_shared<MemEvent>(kFree, last_event->index);\n free_event->key = last_event->key;\n if (last_event->index < post_compute_events_.size()) {\n (void)post_compute_events_[last_event->index].emplace_back(free_event);\n }\n}\n\nstd::set<size_t> MemOffloadStrategy::GetSwapOutEventIndex(const void *key,\n const std::vector<std::shared_ptr<MemEvent>> &mem_events) {\n const auto &update_step_iter = high_priority_updated_step_.find(key);\n if (update_step_iter == high_priority_updated_step_.end() || update_step_iter->second.empty()) {\n return std::set<size_t>();\n }\n const auto &update_steps = update_step_iter->second;\n size_t update_steps_index = 0;\n std::set<size_t> swap_out_event_index;\n size_t min_swap_index_before_update = SIZE_MAX;\n size_t max_swap_out_step = 0;\n for (size_t i = 0; i < mem_events.size(); ++i) {\n const auto &mem_event = mem_events[i];\n if (swap_events_.count(mem_event) == 0) {\n continue;\n }\n if (mem_event->index <= update_steps[update_steps_index]) {\n if (i <= min_swap_index_before_update) {\n min_swap_index_before_update = i;\n }\n } else {\n swap_out_event_index.insert(i);\n max_swap_out_step = mem_event->index;\n while (update_steps_index < update_steps.size() && update_steps[update_steps_index] < mem_event->index) {\n ++update_steps_index;\n }\n }\n }\n if (max_swap_out_step <= update_steps[update_steps.size() - 1]) {\n swap_out_event_index.insert(min_swap_index_before_update);\n }\n return swap_out_event_index;\n}\n} \n} \n"},"prefix":{"kind":"string","value":"\n#include \"runtime/device/memory_offload_strategy.h\"\n#include <vector>\n#include <map>\n#include <memory>\n#include <utility>\n#include \"utils/log_adapter.h\"\n\nnamespace mindspore {\nnamespace device {\nconstexpr size_t kFirstGetMemEventIndex = 1;\nconstexpr size_t kInitOrMallocMemEventIndex = 0;\n\nstd::vector<std::shared_ptr<MemEvent>> &MemOffloadStrategy::GetPreComputeEvents(size_t step) {\n if (pre_compute_events_.size() <= step) {\n MS_LOG_EXCEPTION << \"Index out of pre event range, index:\" << step << \", event size:\" << pre_compute_events_.size();\n }\n return pre_compute_events_[step];\n}\n\nstd::vector<std::shared_ptr<MemEvent>> &MemOffloadStrategy::GetPostComputeEvents(size_t step) {\n if (post_compute_events_.size() <= step) {\n MS_LOG_EXCEPTION << \"Index out of post event range, index:\" << step\n << \", event size:\" << post_compute_events_.size();\n }\n return post_compute_events_[step];\n}\n\nvoid MemOffloadStrategy::Execute() {\n CountMemUsage();\n CheckMemSize();\n if (need_swap_) {\n GenEventSpan();\n GenSwapEventSet();\n }\n GenComputeMemEvents();\n}\n\nvoid MemOffloadStrategy::CountMemUsage() {\n if (!min_mem_used_.empty()) {\n return;\n }\n if (mem_events_.empty() || total_step_ == 0) {\n return;\n }\n min_mem_used_.resize(total_step_, 0);\n std::vector<size_t> total_mem_used(total_step_, 0);\n size_t high_priority_mem_size = 0;\n for (auto &item : mem_events_) {\n auto &mem_events = item.second;\n if (mem_events.empty()) {\n continue;\n }\n auto first_event = mem_events[kInitOrMallocMemEventIndex];\n const bool is_high_priority = IsHighPriorityMem(first_event->key);\n if (is_high_priority) {\n high_priority_mem_size += first_event->mem_size;\n } else {\n auto last_event = mem_events[mem_events.size() - 1];\n for (size_t start_index = first_event->index; start_index <= last_event->index; ++start_index) {\n total_mem_used[start_index] += first_event->mem_size;\n }\n }\n \n for (const auto &event : mem_events) {\n MS_EXCEPTION_IF_NULL(event);\n if (event->type != kGet) {\n continue;\n }\n min_mem_used_[event->index] += first_event->mem_size;\n }\n }\n min_mem_needed_ = *(std::max_element(min_mem_used_.begin(), min_mem_used_.end()));\n mem_used_without_swap_ = *(std::max_element(total_mem_used.begin(), total_mem_used.end())) + high_priority_mem_size;\n if (mem_size_ < min_mem_needed_) {\n MS_LOG(EXCEPTION) << \"Out of memory, as available mem size is \" << mem_size_ << \" while graph needs at least \"\n << min_mem_needed_;\n }\n}\n\nbool MemOffloadStrategy::IsHighPriorityMem(const void *key) const {\n auto iter = mem_priority_.find(key);\n if (iter != mem_priority_.end()) {\n return iter->second == kMemPriorityHigh;\n }\n return false;\n}\n\nvoid MemOffloadStrategy::CheckMemSize() {\n if (mem_size_ < mem_used_without_swap_ || !manual_offload_keys_.empty()) {\n need_swap_ = true;\n }\n\n MS_LOG(INFO) << \"Available mem size: \" << mem_size_ << \", graph needs mem size: \" << mem_used_without_swap_\n << \" without swap, and needs at least \" << min_mem_needed_ << \" with swap.\";\n}\n\nvoid MemOffloadStrategy::GenEventSpan() {\n if (!event_span_.empty()) {\n return;\n }\n for (auto &item : mem_events_) {\n auto &tensor_events = item.second;\n if (tensor_events.size() <= 1) {\n continue;\n }\n const bool is_high_priority = IsHighPriorityMem(tensor_events[kInitOrMallocMemEventIndex]->key);\n for (size_t i = kFirstGetMemEventIndex; i < tensor_events.size(); ++i) {\n auto &event = tensor_events[i];\n MS_EXCEPTION_IF_NULL(event);\n if (event->type != kGet) {\n MS_LOG(EXCEPTION) << \"Event should be Get except fist event.\";\n }\n auto latest_event = tensor_events[i - 1];\n if (i == kFirstGetMemEventIndex && is_high_priority) {\n latest_event = tensor_events[tensor_events.size() - 1];\n }\n auto span = GetSpanBetweenMemEvents(latest_event->index, event->index);\n if (is_high_priority && span == 0 && latest_event == event) {\n span = total_step_;\n }\n if (span > 1) {\n const size_t span_mul_size = (span - 1) * event->mem_size;\n (void)event_span_.emplace(std::make_pair(span_mul_size, std::make_pair(event, span)));\n }\n }\n }\n}\n\nvoid MemOffloadStrategy::GenSwapEventSet() {\n swap_events_.clear();\n \n if (!manual_offload_keys_.empty()) {\n for (const auto &iter : event_span_) {\n auto &event = iter.second.first;\n if (manual_offload_keys_.find(event->key) != manual_offload_keys_.end()"},"suffix":{"kind":"string","value":"rt(min_swap_index_before_update);\n }\n return swap_out_event_index;\n}\n} \n} \n"},"middle":{"kind":"string","value":") {\n (void)swap_events_.emplace(event);\n }\n }\n return;\n }\n\n \n std::vector<size_t> cur_mem_used(min_mem_used_.begin(), min_mem_used_.end());\n for (const auto &iter : event_span_) {\n auto span = iter.second.second;\n auto &event = iter.second.first;\n auto start_index = ((event->index + total_step_ - span + 1) % total_step_);\n bool revert = false;\n size_t cur_index = start_index;\n while (cur_index != event->index) {\n cur_mem_used[cur_index] += event->mem_size;\n if (cur_mem_used[cur_index] > mem_size_) {\n revert = true;\n }\n cur_index += 1;\n if (cur_index >= total_step_) {\n cur_index = 0;\n }\n }\n if (revert) {\n cur_index = start_index;\n while (cur_index != event->index) {\n cur_mem_used[cur_index] -= event->mem_size;\n cur_index += 1;\n if (cur_index >= total_step_) {\n cur_index = 0;\n }\n }\n (void)swap_events_.emplace(event);\n }\n }\n}\n\nvoid MemOffloadStrategy::GenComputeMemEvents() {\n pre_compute_events_.clear();\n post_compute_events_.clear();\n pre_compute_events_.resize(total_step_);\n post_compute_events_.resize(total_step_);\n for (auto &item : mem_events_) {\n auto &mem_events = item.second;\n \n if (mem_events.size() <= 1) {\n continue;\n }\n\n const bool is_high_priority = IsHighPriorityMem(item.first);\n auto first_event = mem_events[kInitOrMallocMemEventIndex];\n MS_EXCEPTION_IF_NULL(first_event);\n const auto &first_get_event = mem_events[kFirstGetMemEventIndex];\n MS_EXCEPTION_IF_NULL(first_get_event);\n if (is_high_priority && swap_events_.find(first_get_event) != swap_events_.end()) {\n first_event->index = first_get_event->index;\n }\n if ((first_event->type == kInit || first_event->type == kMalloc) && first_event->index < total_step_) {\n pre_compute_events_[first_event->index].emplace_back(first_event);\n } else {\n MS_LOG_EXCEPTION << \"First event should be init or malloc!\";\n }\n\n const auto &last_event = mem_events[mem_events.size() - 1];\n size_t pre_index = is_high_priority ? last_event->index : first_event->index;\n const auto &swap_out_event_index = GetSwapOutEventIndex(item.first, mem_events);\n for (size_t i = kFirstGetMemEventIndex; i < mem_events.size(); ++i) {\n auto &event = mem_events[i];\n MS_EXCEPTION_IF_NULL(event);\n if (need_swap_ && swap_events_.find(event) != swap_events_.end()) {\n MemEventType event_type = kSwapOut;\n if (is_high_priority && swap_out_event_index.count(i) == 0) {\n event_type = kFree;\n }\n auto free_or_swap_out_event = std::make_shared<MemEvent>(event_type, pre_index);\n free_or_swap_out_event->key = item.first;\n free_or_swap_out_event->mem_size = first_event->mem_size;\n post_compute_events_[pre_index].emplace_back(free_or_swap_out_event);\n \n if (i != kFirstGetMemEventIndex || first_event->type != kInit) {\n auto swap_in_event = std::make_shared<MemEvent>(kSwapIn, event->index);\n swap_in_event->key = item.first;\n swap_in_event->mem_size = first_event->mem_size;\n (void)pre_compute_events_[event->index].emplace_back(swap_in_event);\n }\n }\n if (event->index < pre_compute_events_.size()) {\n (void)pre_compute_events_[event->index].emplace_back(event);\n }\n pre_index = event->index;\n }\n if (!is_high_priority) {\n GenFreeEvent(last_event);\n }\n }\n}\n\nvoid MemOffloadStrategy::GenFreeEvent(const std::shared_ptr<MemEvent> &last_event) {\n MS_EXCEPTION_IF_NULL(last_event);\n auto free_event = std::make_shared<MemEvent>(kFree, last_event->index);\n free_event->key = last_event->key;\n if (last_event->index < post_compute_events_.size()) {\n (void)post_compute_events_[last_event->index].emplace_back(free_event);\n }\n}\n\nstd::set<size_t> MemOffloadStrategy::GetSwapOutEventIndex(const void *key,\n const std::vector<std::shared_ptr<MemEvent>> &mem_events) {\n const auto &update_step_iter = high_priority_updated_step_.find(key);\n if (update_step_iter == high_priority_updated_step_.end() || update_step_iter->second.empty()) {\n return std::set<size_t>();\n }\n const auto &update_steps = update_step_iter->second;\n size_t update_steps_index = 0;\n std::set<size_t> swap_out_event_index;\n size_t min_swap_index_before_update = SIZE_MAX;\n size_t max_swap_out_step = 0;\n for (size_t i = 0; i < mem_events.size(); ++i) {\n const auto &mem_event = mem_events[i];\n if (swap_events_.count(mem_event) == 0) {\n continue;\n }\n if (mem_event->index <= update_steps[update_steps_index]) {\n if (i <= min_swap_index_before_update) {\n min_swap_index_before_update = i;\n }\n } else {\n swap_out_event_index.insert(i);\n max_swap_out_step = mem_event->index;\n while (update_steps_index < update_steps.size() && update_steps[update_steps_index] < mem_event->index) {\n ++update_steps_index;\n }\n }\n }\n if (max_swap_out_step <= update_steps[update_steps.size() - 1]) {\n swap_out_event_index.inse"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":378,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"example-ofxDownloadCentral/src/ofApp.cpp"},"repo_name":{"kind":"string","value":"hushstudios/ofxSimpleHttp"},"commit":{"kind":"string","value":"5dd8f761381a5abb05913d0a7c50f5611a7aebcf"},"file_code":{"kind":"string","value":"#include \"ofApp.h\"\n\nvoid ofApp::setup(){\n\n\tofSetFrameRate(60);\n\tofBackground(22);\n\tofSetWindowPosition(20, 20);\n\n\tdownloader.setNeedsChecksumMatchToSkipDownload(true); \n\tdownloader.setIdleTimeAfterEachDownload(0.2); \n\tdownloader.setVerbose(false);\n\tdownloader.setMaxConcurrentDownloads(3);\n\t\n}\n\nvoid ofApp::downloadFinished(ofxBatchDownloaderReport &report){\n\n\tcout << \"#################################################\" << endl;\n\tcout << \"#### download finished!!\" << endl;\n\tcout << \"#### [ \" << report.attemptedDownloads.size() << \" attempted | \" ;\n\n\tif(report.wasCanceled){\n\t\tcout << \"#### Download Was CANCELED BY USER!\" << endl;\n\t}\n\n\tcout << report.failedDownloads.size() << \" failed | \";\n\tcout << report.successfulDownloads.size() << \" ok ]\" << endl;\n\tfor(int i = 0; i < report.responses.size(); i++){\n\t\tofxSimpleHttpResponse r = report.responses[i];\n\t\tr.print();\n\t}\n\n\t\n\tbool ok = false;\n\tint i = 0;\n\twhile (!ok && i < report.responses.size()){\n\n\t\tif (report.responses[i].ok){\n\t\t\t\n\t\t}\n\t\ti++;\n\t}\n}\n\nvoid ofApp::update(){\n\n\tdownloader.update();\n}\n\nvoid ofApp::draw(){\n\n\tofSetColor(255);\n\tdrawClock();\n\tdownloader.draw(30,30, true, false);\n\n\tstring msg = \"press 1 to download a file and supply a correct SHA1\\n\";\n\tmsg += \"press 2 to download a file and supply an incorrect SHA1\\n\";\n\tmsg += \"press 3 to download a few files without supplying a SHA1\\n\";\n\tmsg += \"press c to cancel current download\\n\";\n\tmsg += \"press C to cancel all downloads\\n\";\n\tofDrawBitmapString(msg, 20, ofGetHeight() - 70);\n}\n\nvoid ofApp::drawClock(){\n\n\tofPushMatrix();\n\tofTranslate(ofGetWidth() - 60,60, 0);\n\tofRotate( ofGetFrameNum() * 3, 0,0,1);\n\tofSetColor(255,255,255);\n\tfloat h = 5;\n\tofRect(-h/2,h/2, h,50);\n\tofPopMatrix();\n}\n\nvoid ofApp::keyPressed(int key){\n\n\tvector<string> allURLS;\n\tvector<string> allSha1s;\n\n\t\n\tif(key == '1'){\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2875/9481775605_ea43f5d4f3_o_d.jpg\");\n\t\tallSha1s.push_back(\"852a7952aabcbf3479974d5350f973b005b23c4a\");\n\t}\n\n\t\n\tif(key == '2'){\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7454/9481666291_40f7c00b80_o_d.jpg\");\n\t\tallSha1s.push_back(\"my_Sha1_Is_Garbage_And_It_Should_Trigger_An_Error\");\n\t}\n\n\t\n\tif(key == '3'){\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7420/10032530563_86ff701d19_o.jpg\");\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2877/9481432451_c74c649515_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm4.staticflickr.com/3702/9484220536_8f5a866b4d_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm4.staticflickr.com/3667/9484488930_2c6527ee35_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2857/9481682413_5f251ba22d_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7438/9481688475_e83f92e8b5_o_d.jpg\");\n\t}\n\n\t\n\tif (key >= '1' && key <= '2'){\n\t\tdownloader.downloadResources(allURLS,\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t allSha1s,\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t this,\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t &ofApp::downloadFinished,\t\n\t\t\t\t\t\t\t\t\t \"downloads_\"\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t );\n\t\tdownloader.startDownloading();\n\t}else\n\tif(key == '3'){ \n\t\tfor(int i = 0; i < allURLS.size(); i++){\n\t\t\tdownloader.downloadResources(allURLS[i],\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t this,\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t &ofApp::downloadFinished,\t\n\t\t\t\t\t\t\t\t\t\t \"downloads_\"\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t );\n\t\t}\n\t\tdownloader.startDownloading();\n\t}\n\n\tif(key == 'c'){\n\t\tdownloader.cancelCurrentDownload();\n\t}\n\n\tif(key == 'C'){\n\t\tdownloader.cancelAllDownloads();\n\t}\n}\n\n"},"prefix":{"kind":"string","value":"#include \"ofApp.h\"\n\nvoid ofApp::setup(){\n\n\tofSetFrameRate(60);\n\tofBackground(22);\n\tofSetWindowPosition(20, 20);\n\n\tdownloader.setNeedsChecksumMatchToSkipDownload(true); \n\tdownloader.setIdleTimeAfterEachDownload(0.2); \n\tdownloader.setVerbose(false);\n\tdownloader.setMaxConcurrentDownloads(3);\n\t\n}\n\nvoid ofApp::downloadFinished(ofxBatchDownloaderReport &report){\n\n\tcout << \"#################################################\" << endl;\n\tcout << \"#### download finished!!\" << endl;\n\tcout << \"#### [ \" << report.attemptedDownloads.size() << \" attempted | \" ;\n\n\tif(report.wasCanceled){\n\t\tcout << \"#### Download Was CANCELED BY USER!\" << endl;\n\t}\n\n\tcout << report.failedDownloads.size() << \" failed | \";\n\tcout << report.successfulDownloads.size() << \" ok ]\" << endl;\n\tfor(int i = 0; i < report.responses.size(); i++){\n\t\tofxSimpleHttpResponse r = report.responses[i];\n\t\tr.print();\n\t}\n\n\t\n\tbool ok = false;\n\tint i = 0;\n\twhile (!ok && i < rep"},"suffix":{"kind":"string","value":"allURLS,\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t allSha1s,\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t this,\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t &ofApp::downloadFinished,\t\n\t\t\t\t\t\t\t\t\t \"downloads_\"\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t );\n\t\tdownloader.startDownloading();\n\t}else\n\tif(key == '3'){ \n\t\tfor(int i = 0; i < allURLS.size(); i++){\n\t\t\tdownloader.downloadResources(allURLS[i],\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t this,\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t &ofApp::downloadFinished,\t\n\t\t\t\t\t\t\t\t\t\t \"downloads_\"\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t );\n\t\t}\n\t\tdownloader.startDownloading();\n\t}\n\n\tif(key == 'c'){\n\t\tdownloader.cancelCurrentDownload();\n\t}\n\n\tif(key == 'C'){\n\t\tdownloader.cancelAllDownloads();\n\t}\n}\n\n"},"middle":{"kind":"string","value":"ort.responses.size()){\n\n\t\tif (report.responses[i].ok){\n\t\t\t\n\t\t}\n\t\ti++;\n\t}\n}\n\nvoid ofApp::update(){\n\n\tdownloader.update();\n}\n\nvoid ofApp::draw(){\n\n\tofSetColor(255);\n\tdrawClock();\n\tdownloader.draw(30,30, true, false);\n\n\tstring msg = \"press 1 to download a file and supply a correct SHA1\\n\";\n\tmsg += \"press 2 to download a file and supply an incorrect SHA1\\n\";\n\tmsg += \"press 3 to download a few files without supplying a SHA1\\n\";\n\tmsg += \"press c to cancel current download\\n\";\n\tmsg += \"press C to cancel all downloads\\n\";\n\tofDrawBitmapString(msg, 20, ofGetHeight() - 70);\n}\n\nvoid ofApp::drawClock(){\n\n\tofPushMatrix();\n\tofTranslate(ofGetWidth() - 60,60, 0);\n\tofRotate( ofGetFrameNum() * 3, 0,0,1);\n\tofSetColor(255,255,255);\n\tfloat h = 5;\n\tofRect(-h/2,h/2, h,50);\n\tofPopMatrix();\n}\n\nvoid ofApp::keyPressed(int key){\n\n\tvector<string> allURLS;\n\tvector<string> allSha1s;\n\n\t\n\tif(key == '1'){\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2875/9481775605_ea43f5d4f3_o_d.jpg\");\n\t\tallSha1s.push_back(\"852a7952aabcbf3479974d5350f973b005b23c4a\");\n\t}\n\n\t\n\tif(key == '2'){\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7454/9481666291_40f7c00b80_o_d.jpg\");\n\t\tallSha1s.push_back(\"my_Sha1_Is_Garbage_And_It_Should_Trigger_An_Error\");\n\t}\n\n\t\n\tif(key == '3'){\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7420/10032530563_86ff701d19_o.jpg\");\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2877/9481432451_c74c649515_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm4.staticflickr.com/3702/9484220536_8f5a866b4d_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm4.staticflickr.com/3667/9484488930_2c6527ee35_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm3.staticflickr.com/2857/9481682413_5f251ba22d_o_d.jpg\");\n\t\tallURLS.push_back(\"http://farm8.staticflickr.com/7438/9481688475_e83f92e8b5_o_d.jpg\");\n\t}\n\n\t\n\tif (key >= '1' && key <= '2'){\n\t\tdownloader.downloadResources("},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct ofxBatchDownloaderReport{\n\n\tstd::string downloadPath;\t\t\t\t\t\t//full path to the directory that holds the downloads\n\n\tofxBatchDownloader* owner;\t\t\t\t\t//pointer to the object in charge of the downloads\n\n\tstd::vector<std::string> attemptedDownloads;\t\t\t//this vector contains all the user supplied urls\n\n\tstd::vector<std::string> successfulDownloads;\t\t\t//this vector contains all the urls that got downloaded correctly\n\n\tstd::vector<std::string> failedDownloads;\t\t\t\t//this vector contains all the urls that failed to download\n\n\tstd::vector<ofxSimpleHttpResponse> responses;\t//this vector contains a list of all url responses, with statuses, filenames, etc\n\n\tbool wasCanceled;\n\n\tofxBatchDownloaderReport(){\n\n\t\twasCanceled = false;\n\n\t}\n\n};\n\n\n\n\n","file_path":"src/ofxBatchDownloader.h","rank":0,"score":69108.76067937785},{"content":"class ofxBatchDownloader;\n\n\n","file_path":"src/ofxDownloadCentral.h","rank":1,"score":39056.492389340325},{"content":"class ofxBatchDownloader;\n\n\n","file_path":"src/ofxBatchDownloader.h","rank":2,"score":39056.492389340325},{"content":"class ofxDownloadCentral{\n\n\n\n\tpublic:\n\n\n\n\t\tofxDownloadCentral();\n\n\t\t~ofxDownloadCentral();\n\n\n\n\t\tvoid update();\n\n\t\tvoid draw(float x, float y, bool drawAllPending = false, bool detailedDownloadInfo = true);\n\n\t\tstd::string getDrawableInfo(bool drawAllPending = false, bool detailedDownloadInfo = true); //draw with a monospaced font!\n\n\n\n\t\tvoid cancelCurrentDownload();\n\n\t\tvoid cancelAllDownloads();\n\n\n\n\t\tbool isBusy();\n\n\t\tint getNumPendingDownloads();\n\n\t\tint getNumActiveDownloads();\n\n\n\n\t\tvoid setVerbose(bool b);\n\n\t\tvoid setNeedsChecksumMatchToSkipDownload(bool needs);\t//if downloaded file is on disk, should I assume its good?\n","file_path":"src/ofxDownloadCentral.h","rank":3,"score":39056.492389340325},{"content":"class ofxBatchDownloader{\n\n\n\npublic:\n\n\n\n\tofxBatchDownloader();\n\n\t~ofxBatchDownloader();\n\n\n\n\tvoid update();\n\n\tvoid draw(float x, float y);\n\n\tstd::string getDrawableString();\n\n\tstd::string getMinimalDrawableString();\n\n\n\n\tvoid setDownloadFolder(std::string f);\n\n\tvoid setSpeedLimit(float KB_per_sec);\n\n\tvoid setTimeOut(float timeOut);\n\n\tvoid setCopyBufferSize(float bufferSizeKb);\n\n\n\n\tvoid setChecksumType(ofxChecksum::Type); //when you supply a checksum to compare a downloaded file against, what type will it be?\n\n\n\n\tvoid addResourcesToDownloadList( std::vector<std::string>urlList );\n","file_path":"src/ofxBatchDownloader.h","rank":4,"score":39056.492389340325},{"content":"\tvoid addResourcesToDownloadList( std::vector<std::string>urlList, std::vector<std::string>checksumList );\n\n\tvoid startDownloading();\n\n\tvoid cancelBatch(bool notify = false);\n\n\n\n\tvoid setVerbose(bool b); //nop\n\n\tvoid setNeedsChecksumMatchToSkipDownload(bool needsChecksum);\n\n\tvoid setIdleTimeAfterEachDownload(float seconds); //wait a bit before notifying once the dowload is over\n\n\n\n\tvoid setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c);\n\n\tvoid setCredentials(const std::string& user, const std::string& password);\n\n\n\n\tuint64_t getDownloadedBytesSoFar(){ return downloadedSoFar;}\n\n\tint getNumSuppliedUrls();\n\n\tint getNumFailedUrls();\n\n\tint pendingDownloads();\n\n\tbool isBusy();\n\n\tfloat getAverageSpeed(); //bytes/sec\n\n\tstd::vector<std::string> pendingURLs();\n\n\n\n\tofEvent<ofxBatchDownloaderReport>\tresourcesDownloadFinished;\n","file_path":"src/ofxBatchDownloader.h","rank":5,"score":33956.3409131723},{"content":"//\n\n// ofxBatchDownloader.h\n\n// emptyExample\n\n//\n\n// Created by Oriol Ferrer Mesià on 14/03/14.\n\n//\n\n//\n\n\n\n#ifndef emptyExample_ofxBatchDownloader_h\n\n#define emptyExample_ofxBatchDownloader_h\n\n\n\n#include \"ofxSimpleHttp.h\"\n\n\n\n/*\n\n\n\n ####### how to get notifications ############################################\n\n\n\n //create a batch downloader\n\n ofxBatchDownloader dl;\n\n\n\n //sign up for the notification\n\n ofAddListener(dl.resourcesDownloadFinished, this, &myApp::downloadFinished);\n\n\n\n //define the callback in your app\n\n void myApp::downloadFinished(ofxBatchDownloaderReport &report){}\n\n\n\n */\n\n\n","file_path":"src/ofxBatchDownloader.h","rank":6,"score":33950.96866940381},{"content":"\t\tstd::vector<ofxBatchDownloader*>\t\tactiveDownloaders;\n\n\n\n\t\tbool\t\t\t\t\t\t\t\t\tbusy;\n\n\t\tbool\t\t\t\t\t\t\t\t\tverbose;\n\n\t\tbool\t\t\t\t\t\t\t\t\tonlySkipDownloadIfChecksumMatches;\n\n\t\tfloat\t\t\t\t\t\t\t\tidleTimeAfterDownload; //float sec\n\n\t\tfloat\t\t\t\t\t\t\t\tdownloadStartTime;\n\n\t\tstd::streamsize\t\t\t\t\t\tdownloadedSoFar; //bytes\n\n\t\tint\t\t\t\t\t\t\t\t\tdownloadStartJobsNumber;\n\n\n\n\t\tint\t\t\t\t\t\t\t\t\tfailedJobsStartNumber;\n\n\t\tint\t\t\t\t\t\t\t\t\tfailedJobsSoFar;\n\n\n\n\t\tstd::map<int, float>\t\t\t\t\tavgSpeed;\t //bytes/sec\n\n\t\tint\t\t\t\t\t\t\t\t\tmaxURLsToList;\n\n\n\n\t\tint\t\t\t\t\t\t\t\t\tmaxConcurrentDownloads;\n\n\t\tfloat\t\t\t\t\t\t\t\tspeedLimit;\n\n\t\tfloat\t\t\t\t\t\t\t\ttimeOut;\n\n\t\tfloat\t\t\t\t\t\t\t\tcopyBufferSize = 1024.0f; //Kb\n","file_path":"src/ofxDownloadCentral.h","rank":7,"score":33949.970986501176},{"content":"\n\nprivate:\n\n\n\n\tofxSimpleHttp http;\n\n\tbool busy;\n\n\tbool needToStop; //user wants to cancel!\n\n\n\n\tstd::string downloadFolder;\n\n\n\n\tstd::vector<std::string>\toriginalUrlList;\n\n\tstd::vector<std::string>\toriginalChecksumList;\n\n\tstd::vector<std::string>\tfailedList;\n\n\tstd::vector<std::string> okList;\n\n\tstd::vector<ofxSimpleHttpResponse> responses;\n\n\n\n\tvoid httpResult(ofxSimpleHttpResponse &response);\n\n\tvoid reset();\n\n\n\n\tuint64_t downloadedSoFar; //bytes\n\n\n\n\tofxChecksum::Type checksumType = ofxChecksum::Type::SHA1;\n\n\n\n};\n\n\n\n#endif\n\n\n","file_path":"src/ofxBatchDownloader.h","rank":8,"score":33949.206852253286},{"content":"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//or only if you provided sha1 checksum and it matches\n\n\n\n\t\tvoid setSpeedLimit(float KB_per_sec);\n\n\t\tvoid setTimeOut(float timeoutSecs);\n\n\t\tvoid setMaxConcurrentDownloads(int numConcurrentDownloads);\n\n\n\n\t\tvoid setChecksumType(ofxChecksum::Type type); //when you supply a checksum to compare a downloaded file against, what type will it be?\n\n\t\tvoid setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c);\n\n\t\tvoid setCredentials(const std::string& user, const std::string& password);\n\n\n\n\t\tvoid setCopyBufferSize(float bufferInKb);\n\n\n\n\t\tvoid setIdleTimeAfterEachDownload(float seconds);\t\t//wait a bit before notifying once the dowload is over\n\n\t\tvoid setMaxURLsToList(int max);\n\n\n\n\t\tvoid startDownloading();\n\n\n\n\t\t///////////////////////////////////////////////////////////////////////////////\n\n\t\ttemplate <typename ArgumentsType, class ListenerClass>\n\n\t\tvoid downloadResources(\tconst std::string & url,\n","file_path":"src/ofxDownloadCentral.h","rank":9,"score":33947.55270843547},{"content":" will be notified when its downloads are ready.\n\n this is meant mainly to download assets on demand, telling its owner \n\n when the asset is ready to load.\n\n\n\n // HOW IS THIS MEANT TO BE USED ?\n\n\n\n 1 - define a central downloads object\n\n\tofxDownloadCentral dlc;\n\n\n\n 2 - implement a notification callback\n\n\tvoid downloadsFinished(ofxBatchDownloaderReport &report){}\n\n\n\n 3 - fill in a list of url with assets you need downloaded\n\n\tstd::vector<std::string> urlList;\n\n \n\n 4 - supply a list the download\n\n \n\n\tdlc.downloadResources( urlList, this, &myClass::downloadsFinished, destinationFolder );\n\n\n\n\tit will all be downloaded in a bg thread\n","file_path":"src/ofxDownloadCentral.h","rank":10,"score":33947.01195177293},{"content":"//\n\n// ofxDownloadCentral.h\n\n// emptyExample\n\n//\n\n// Created by Oriol Ferrer Mesià on 14/03/14.\n\n//\n\n//\n\n\n\n#pragma once\n\n#include \"ofMain.h\"\n\n#include \"ofxBatchDownloader.h\"\n\n#include \"ofxSimpleHttp.h\"\n\n#include \"ofEvents.h\"\n\n#include \"ofEventUtils.h\"\n\n\n\n/*\n\n// WHAT IS THIS?\n\n\n\n Centralised downloads from any number of objects.\n\n creates a download queue, each object that requests a download list \n","file_path":"src/ofxDownloadCentral.h","rank":11,"score":33944.43366055997},{"content":"\t\t\t}\n\n\t\t}\n\n\n\n\t\t///////////////////////////////////////////////////////////////////////////////\n\n\t\ttemplate <typename ArgumentsType, class ListenerClass>\n\n\t\tvoid downloadResources(const std::vector<std::string> & urlList,\n\n\t\t\t\t\t\t\t ListenerClass * listener,\n\n\t\t\t\t\t\t\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\n\n\t\t\t\t\t\t\t const std::string & destinationFolder = \"ofxDownloadCentral_downloads\"\n\n\t\t\t\t\t\t\t ){\n\n\n\n\t\t\tstd::vector<std::string> shas;\n\n\t\t\tdownloadResources(urlList, shas, listener, listenerMethod, destinationFolder);\n\n\t\t}\n\n\n\n\tprivate:\n\n\n\n\t\tvoid startQueue();\n\n\n\n\t\tstd::vector<ofxBatchDownloader*>\t\tdownloaders;\n","file_path":"src/ofxDownloadCentral.h","rank":12,"score":33943.38243457822},{"content":"\t\t\t\t\t\t\t ListenerClass * listener,\n\n\t\t\t\t\t\t\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\n\n\t\t\t\t\t\t\t const std::string & destinationFolder = \"ofxDownloadCentral_downloads\"\n\n\t\t\t\t\t\t\t ){\n\n\n\n\t\t\tstd::vector<std::string> list;\n\n\t\t\tlist.push_back(url);\n\n\t\t\tdownloadResources(list, listener, listenerMethod, destinationFolder);\n\n\t\t}\n\n\n\n\t\t///////////////////////////////////////////////////////////////////////////////\n\n\t\ttemplate <typename ArgumentsType, class ListenerClass>\n\n\t\tvoid downloadResources( const std::string & url,\n\n\t\t\t\t\t\t\t\tconst std::string & sha1String,\n\n\t\t\t\t\t\t\t ListenerClass * listener,\n\n\t\t\t\t\t\t\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\n\n\t\t\t\t\t\t\t const std::string & destinationFolder = \"ofxDownloadCentral_downloads\"\n\n\t\t\t\t\t\t\t ){\n\n\n\n\t\t\tstd::vector<std::string> list;\n","file_path":"src/ofxDownloadCentral.h","rank":13,"score":33943.2175345058},{"content":"\tyou will be notified from the main thread when they are done\n\n\tyou will get a report\n\n \n\n 6 - start the download\n\n\t\n\n\tstartDownloading();\n\n \n\n 7 - update the dlc object\n\n\t\n\n\tdlc.update();\n\n\t\n\n\tand wait for the notification to arrive\n\n\n\n */\n\n\n","file_path":"src/ofxDownloadCentral.h","rank":14,"score":33942.849446336804},{"content":"\t\t\tstd::vector<std::string> shas;\n\n\t\t\tlist.push_back(url);\n\n\t\t\tshas.push_back(sha1String);\n\n\t\t\tdownloadResources(list, shas, listener, listenerMethod, destinationFolder);\n\n\t\t}\n\n\n\n\n\n\t\t///////////////////////////////////////////////////////////////////////////////\n\n\t\ttemplate <typename ArgumentsType, class ListenerClass>\n\n\t\tvoid downloadResources(\tconst std::vector<std::string> & urlList,\n\n\t\t\t\t\t\t\t\tconst std::vector<std::string> & sha1List,\n\n\t\t\t\t\t\t\t\tListenerClass * listener,\n\n\t\t\t\t\t\t\t\tvoid (ListenerClass::*listenerMethod)(ArgumentsType&),\n\n\t\t\t\t\t\t\t\tconst std::string & destinationFolder = \"ofxDownloadCentral_downloads\"\n\n\t\t\t\t\t\t\t ){\n\n\n\n\t\t\tif (urlList.size() > 0 ){\n\n\t\t\t\tofxBatchDownloader * d = new ofxBatchDownloader();\n\n\t\t\t\td->setProxyConfiguration(proxyConfig);\n\n\t\t\t\tif(credentials.first.size() || credentials.second.size()){\n","file_path":"src/ofxDownloadCentral.h","rank":15,"score":33942.52243560439},{"content":"\t\t\t\t\td->setCredentials(credentials.first, credentials.second);\n\n\t\t\t\t}\n\n\t\t\t\tif(timeOut > 0.0f) d->setTimeOut(timeOut);\n\n\t\t\t\tif(speedLimit > 0.0f) d->setSpeedLimit(speedLimit);\n\n\n\n\t\t\t\td->setDownloadFolder(destinationFolder);\n\n\t\t\t\td->setVerbose(verbose);\n\n\t\t\t\td->setNeedsChecksumMatchToSkipDownload(onlySkipDownloadIfChecksumMatches);\n\n\t\t\t\td->setChecksumType(checksumType);\n\n\t\t\t\td->setCopyBufferSize(copyBufferSize);\n\n\t\t\t\td->setIdleTimeAfterEachDownload(idleTimeAfterDownload);\n\n\t\t\t\td->addResourcesToDownloadList(urlList, sha1List);\n\n\t\t\t\tofAddListener(d->resourcesDownloadFinished, listener, listenerMethod); //set the notification to hit our original caller\n\n\t\t\t\tif(downloaders.size() == 0){\n\n\t\t\t\t\tdownloadStartTime = ofGetElapsedTimef();\n\n\t\t\t\t\tdownloadedSoFar = 0;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tdownloadStartJobsNumber++;\n\n\t\t\t\t}\n\n\t\t\t\tdownloaders.push_back(d);\n","file_path":"src/ofxDownloadCentral.h","rank":16,"score":33942.22431468315},{"content":"\t\tofxChecksum::Type \t\t\t\t\tchecksumType = ofxChecksum::Type::SHA1;\n\n\n\n\t\tofxSimpleHttp::ProxyConfig\t\t\tproxyConfig;\n\n\t\tstd::pair<std::string,std::string> \tcredentials;\n\n\n\n\n\n};\n\n\n\n\n","file_path":"src/ofxDownloadCentral.h","rank":17,"score":33937.17532460588},{"content":"\t\treport.attemptedDownloads = originalUrlList;\n\n\t\treport.successfulDownloads = okList;\n\n\t\treport.failedDownloads = failedList;\n\n\t\treport.responses = responses;\n\n\t\treport.wasCanceled = true;\n\n\t\tofNotifyEvent( resourcesDownloadFinished, report, this );\n\n\t}\n\n\tbusy = false;\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::setDownloadFolder(std::string f){\n\n\tdownloadFolder = f;\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::draw(float x, float y){\n\n\thttp.draw(x, y);\n\n}\n\n\n","file_path":"src/ofxBatchDownloader.cpp","rank":18,"score":32745.904722093117},{"content":"\t\treport.attemptedDownloads = originalUrlList;\n\n\t\treport.successfulDownloads = okList;\n\n\t\treport.failedDownloads = failedList;\n\n\t\treport.responses = responses;\n\n\t\tofNotifyEvent( resourcesDownloadFinished, report, this );\n\n\t\tbusy = false;\n\n\t}\n\n}\n\n\n\n\n\nfloat ofxBatchDownloader::getAverageSpeed(){\n\n\treturn http.getAvgDownloadSpeed();\n\n}\n\n\n\n\n\nstd::vector<std::string> ofxBatchDownloader::pendingURLs(){\n\n\n\n\tstd::vector<std::string> res;\n\n\tfor (int i = 0; i < originalUrlList.size(); i++){\n\n\t\tbool found = false;\n","file_path":"src/ofxBatchDownloader.cpp","rank":19,"score":32743.425745430774},{"content":"\tbool checkedOK = r.checksumOK || (!r.checksumOK && r.expectedChecksum.size() == 0);\n\n\tif(r.ok && checkedOK){\n\n\t\tokList.push_back( r.url );\n\n\t\tofLogNotice(\"ofxBatchDownloader\") << \"downloaded OK [\" << r.url << \"]\";\n\n\t}else{\n\n\t\tfailedList.push_back( r.url );\n\n\t\tif (!r.checksumOK){\n\n\t\t\tofLogError(\"ofxBatchDownloader\") << \"checksum mismatch! [\" << r.url << \"] expectedChecksum: \" << r.expectedChecksum << \")\";\n\n\t\t}else{\n\n\t\t\tofLogError(\"ofxBatchDownloader\") << \"FAILED TO download [\" << r.url << \"]\";\n\n\t\t}\n\n\t}\n\n\n\n\tdownloadedSoFar += r.downloadedBytes;\n\n\n\n\tif (originalUrlList.size() == failedList.size() + okList.size()){\n\n\t\t//we are done!\n\n\t\tofxBatchDownloaderReport report;\n\n\t\treport.owner = this;\n\n\t\treport.downloadPath = downloadFolder;\n","file_path":"src/ofxBatchDownloader.cpp","rank":20,"score":32738.781812012057},{"content":"\thttp.setProxyConfiguration(c);\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::setCredentials(const std::string& user, const std::string& password){\n\n\thttp.setCredentials(user, password);\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::setVerbose(bool b){}\n\n\n\n\n\nofxBatchDownloader::~ofxBatchDownloader(){\n\n\tif (busy) {\n\n\t\tcancelBatch(false /*notify*/);\n\n\t}\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::update(){\n","file_path":"src/ofxBatchDownloader.cpp","rank":21,"score":32738.23247255028},{"content":"\t\tfor (int j = 0; j < okList.size(); j++){\n\n\t\t\tif ( okList[j] == originalUrlList[i] ){\n\n\t\t\t\tfound = true;\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor (int j = 0; j < failedList.size(); j++){\n\n\t\t\tif ( failedList[j] == originalUrlList[i] ){\n\n\t\t\t\tfound = true;\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (!found) res.push_back(originalUrlList[i]);\n\n\t}\n\n\treturn res;\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::reset(){\n\n\tfailedList.clear();\n\n\tokList.clear();\n\n\tresponses.clear();\n\n}\n","file_path":"src/ofxBatchDownloader.cpp","rank":22,"score":32737.767047752634},{"content":"\n\nbool ofxBatchDownloader::isBusy(){\n\n\treturn busy;\n\n};\n\n\n\nint ofxBatchDownloader::getNumSuppliedUrls(){\n\n\treturn originalUrlList.size();\n\n}\n\n\n\nint ofxBatchDownloader::getNumFailedUrls(){\n\n\treturn failedList.size();\n\n}\n\n\n\nvoid ofxBatchDownloader::startDownloading(){\n\n\n\n\tif (!busy){\n\n\t\tbusy = true;\n\n\t\treset();\n\n\n\n\t\tofLogVerbose(\"ofxBatchDownloader\") << \"starting downloads! \";\n","file_path":"src/ofxBatchDownloader.cpp","rank":23,"score":32737.66613541973},{"content":"\thttp.update();\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::setTimeOut(float timeOut){\n\n\thttp.setTimeOut(timeOut);\n\n}\n\n\n\nvoid ofxBatchDownloader::setSpeedLimit(float KB_per_sec){\n\n\thttp.setSpeedLimit(KB_per_sec);\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::cancelBatch(bool notify){\n\n\thttp.stopCurrentDownload(true);\n\n\thttp.waitForThread(true);\n\n\tif(notify){\n\n\t\tofxBatchDownloaderReport report;\n\n\t\treport.owner = this;\n\n\t\treport.downloadPath = downloadFolder;\n","file_path":"src/ofxBatchDownloader.cpp","rank":24,"score":32737.50965333005},{"content":"\tonlySkipDownloadIfChecksumMatches = true;\n\n\tmaxURLsToList = 4;\n\n\tidleTimeAfterDownload = 0.0f;\n\n\tmaxConcurrentDownloads = 1;\n\n\ttimeOut = -1.0f;\n\n\tfailedJobsSoFar = failedJobsStartNumber = 0;\n\n}\n\n\n\nofxDownloadCentral::~ofxDownloadCentral(){\n\n\tcancelAllDownloads();\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::setMaxConcurrentDownloads(int numConcurrentDownloads){\n\n\tmaxConcurrentDownloads = ofClamp(numConcurrentDownloads, 1, INT_MAX);\n\n}\n\n\n\nvoid ofxDownloadCentral::setCopyBufferSize(float bufferInKb){\n\n\tcopyBufferSize = bufferInKb;\n\n}\n","file_path":"src/ofxDownloadCentral.cpp","rank":25,"score":32737.21700744624},{"content":"void ofxDownloadCentral::cancelCurrentDownload(){\n\n\tif (busy){\n\n\t\tfor(int i = activeDownloaders.size() - 1; i >= 0; i--){\n\n\t\t\tofxBatchDownloader * bd = activeDownloaders[i];\n\n\t\t\tbd->cancelBatch(true);\n\n\t\t}\n\n\t}\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::cancelAllDownloads(){\n\n\tif (busy){\n\n\t\tcancelCurrentDownload(); //active downloads get stopped\n\n\t\twhile(downloaders.size() > 0){\n\n\t\t\tdelete downloaders[0];\n\n\t\t\tdownloaders.erase(downloaders.begin());\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"src/ofxDownloadCentral.cpp","rank":26,"score":32736.53507541873},{"content":"void ofxDownloadCentral::setVerbose(bool b){\n\n\tverbose = b;\n\n}\n\n\n\nvoid ofxDownloadCentral::setIdleTimeAfterEachDownload(float seconds){\n\n\tidleTimeAfterDownload = seconds;\n\n}\n\n\n\n\n\n\n\nvoid ofxDownloadCentral::setNeedsChecksumMatchToSkipDownload(bool needs){\n\n\tonlySkipDownloadIfChecksumMatches = needs;\n\n}\n\n\n\nvoid ofxDownloadCentral::startQueue(){\n\n\n\n\tfor(int i = activeDownloaders.size(); i < maxConcurrentDownloads; i++){\n\n\t\tif(downloaders.size() > 0){\n\n\t\t\tbusy = true;\n\n\t\t\tofxBatchDownloader * bd = downloaders[0];\n","file_path":"src/ofxDownloadCentral.cpp","rank":27,"score":32735.628274617044},{"content":"\n\nvoid ofxDownloadCentral::setChecksumType(ofxChecksum::Type type){\n\n\tchecksumType = type;\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::startDownloading(){\n\n\tif (!busy){\n\n\t\tdownloadStartJobsNumber = downloaders.size();\n\n\t\tfailedJobsStartNumber = failedJobsSoFar;\n\n\t\tstartQueue();\n\n\t}\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::setMaxURLsToList(int max){\n\n\tmaxURLsToList = max;\n\n}\n\n\n\n\n","file_path":"src/ofxDownloadCentral.cpp","rank":28,"score":32735.325825094184},{"content":"\t}\n\n\n\n\tstd::string spa = \" \";\n\n\tstd::string header = \"//// ofxDownloadCentral queued Jobs: \" + ofToString(numQueuedJobs) + \" ///////////////////////////\\n\"\n\n\t\"//// Jobs executed: \" + spa + ofToString(numProcessed) + \"\\n\" +\n\n\t\"//// Jobs failed: \" + spa + ofToString(numFailed) + \"\\n\" +\n\n//\t\"//// Total Downloads Left: \" + spa + ofToString(total) + \"\\n\" +\n\n\t\"//// Elapsed Time: \" + spa + ofxSimpleHttp::secondsToHumanReadable(elapsedTime, 1) + \"\\n\" +\n\n\t\"//// Estimated Time Left: \" + spa + ofxSimpleHttp::secondsToHumanReadable(timeLeft, 1) + \"\\n\"\n\n\t\"//// Estimated Completion: \" + spa + estFinish + \"\\n\" +\n\n\t\"//// Avg Download Speed: \" + spa + ofxSimpleHttp::bytesToHumanReadable(avg, 1) + \"/sec\\n\" +\n\n\t\"//// Downloaded So Far: \" + spa + ofxSimpleHttp::bytesToHumanReadable(downloadedSoFar, 1) +\n\n\t\"\\n\";\n\n\n\n\treturn header + httpDownloadersStatus + pendingDownloadsList;\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::draw(float x, float y, bool drawAllPending, bool detailedDownloadInfo){\n\n\tif (busy){\n\n\t\tstd::string aux = getDrawableInfo(drawAllPending, detailedDownloadInfo);\n\n\t\tofDrawBitmapString(aux, x, y);\n\n\t}\n\n}\n","file_path":"src/ofxDownloadCentral.cpp","rank":29,"score":32733.652417067562},{"content":"\n\n\n\nstd::string ofxDownloadCentral::getDrawableInfo(bool drawAllPending, bool detailed){\n\n\n\n\tint total = 0;\n\n\tfor(int i = 0; i < activeDownloaders.size(); i++){\n\n\t\ttotal += activeDownloaders[i]->getNumSuppliedUrls();\n\n\t}\n\n\n\n\tfor(int i = 0; i < downloaders.size(); i++){\n\n\t\ttotal += downloaders[i]->getNumSuppliedUrls();\n\n\t}\n\n\n\n\tstd::string httpDownloadersStatus;\n\n\tstd::string pendingDownloadsList;\n\n\tint numQueuedJobs = downloaders.size() + activeDownloaders.size();\n\n\n\n\tstd::vector<std::string> allURLs;\n\n\tstd::vector<std::string> allPending;\n\n\tbool reachedListMaxLen = false;\n","file_path":"src/ofxDownloadCentral.cpp","rank":30,"score":32733.58286920666},{"content":"\n\nbool ofxDownloadCentral::isBusy(){\n\n\treturn busy;\n\n}\n\n\n\n\n\nint ofxDownloadCentral::getNumPendingDownloads(){\n\n\n\n\tint c = 0;\n\n\tfor(int i = 0; i < downloaders.size(); i++){\n\n\t\tstd::vector<std::string> pending = downloaders[i]->pendingURLs();\n\n\t\tc+= pending.size();\n\n\t}\n\n\treturn c;\n\n}\n\n\n\n\n\nint ofxDownloadCentral::getNumActiveDownloads(){\n\n\treturn activeDownloaders.size();\n\n}\n","file_path":"src/ofxDownloadCentral.cpp","rank":31,"score":32733.57609124429},{"content":"\t}\n\n\tif(printingList) pendingDownloadsList += \"//////////////////////////////////////////////////////////////////\";\n\n\n\n\tfloat elapsedTime = ofGetElapsedTimef() - downloadStartTime;\n\n\tfloat timeLeft = 0.0f;\n\n\tint numProcessed = downloadStartJobsNumber - numQueuedJobs;\n\n\tint numFailed = failedJobsSoFar - failedJobsStartNumber;\n\n\tstd::string estFinish;\n\n\tif (numProcessed > 0){\n\n\t\ttimeLeft = numQueuedJobs * elapsedTime / float(numProcessed);\n\n\t\tPoco::Timespan timeToAdd;\n\n\t\ttimeToAdd.assign(timeLeft, 0);\n\n\t\tstd::string timeFormat = \"%H:%M on %w %e, %b %Y\";\n\n\t\tPoco::LocalDateTime now;\n\n\t\tnow += timeToAdd;\n\n\t\testFinish = Poco::DateTimeFormatter::format(now, timeFormat);\n\n\t}\n\n\tfloat avg = 0;\n\n\tfor(int i = 0; i < activeDownloaders.size(); i++){\n\n\t\tavg += avgSpeed[i];\n","file_path":"src/ofxDownloadCentral.cpp","rank":32,"score":32733.56070081176},{"content":"\n\n\n\nvoid ofxDownloadCentral::setSpeedLimit(float KB_per_sec){\n\n\tspeedLimit = KB_per_sec;\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::setTimeOut(float timeoutSecs){\n\n\ttimeOut = timeoutSecs;\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c){\n\n\tproxyConfig = c;\n\n}\n\n\n\nvoid ofxDownloadCentral::setCredentials(const std::string& user, const std::string& password){\n\n\tcredentials.first = user;\n\n\tcredentials.second = password;\n\n}\n","file_path":"src/ofxDownloadCentral.cpp","rank":33,"score":32733.14243680849},{"content":"\n\n\t\thttp.setMaxQueueLength(originalUrlList.size() * 2); //just in case\n\n\n\n\t\tfor(int i = 0; i < originalUrlList.size(); i++){\n\n\t\t\tstd::string sha = \"\";\n\n\t\t\tif (originalChecksumList.size()){\n\n\t\t\t\tsha = originalChecksumList[i];\n\n\t\t\t}\n\n\t\t\thttp.fetchURLToDisk(originalUrlList[i], sha, true, downloadFolder);\n\n\t\t}\n\n\t}\n\n}\n\n\n\n\n\n//this might or might not be called from the main thread! depending on the ofxSimpleHttp config\n\nvoid ofxBatchDownloader::httpResult(ofxSimpleHttpResponse &r){\n\n\n\n\t//int index = okList.size() + failedList.size();\n\n\n\n\tresponses.push_back(r);\n","file_path":"src/ofxBatchDownloader.cpp","rank":34,"score":32733.075649170092},{"content":"\n\nvoid ofxBatchDownloader::setChecksumType(ofxChecksum::Type t){\n\n\tchecksumType = t;\n\n\thttp.setChecksumType(t);\n\n}\n\n\n\nvoid ofxBatchDownloader::setNeedsChecksumMatchToSkipDownload(bool needsChecksum){\n\n\thttp.setNeedsChecksumMatchToSkipDownload(needsChecksum); \n\n}\n\n\n\nvoid ofxBatchDownloader::setCopyBufferSize(float bufferSizeKb){\n\n\thttp.setCopyBufferSize(bufferSizeKb);\n\n}\n\n\n\nvoid ofxBatchDownloader::setIdleTimeAfterEachDownload(float seconds){\n\n\thttp.setIdleTimeAfterEachDownload( seconds );\n\n}\n\n\n\n\n\nvoid ofxBatchDownloader::setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c){\n","file_path":"src/ofxBatchDownloader.cpp","rank":35,"score":32732.224105431316},{"content":"\t\t\tbd->startDownloading();\n\n\t\t\tactiveDownloaders.push_back(bd);\n\n\t\t\tdownloaders.erase(downloaders.begin());\n\n\t\t}\n\n\t}\n\n}\n\n\n\n\n\nvoid ofxDownloadCentral::update(){\n\n\n\n\tif (busy){\n\n\n\n\t\tfor(int i = activeDownloaders.size() - 1; i >= 0; i--){\n\n\n\n\t\t\tofxBatchDownloader * bd = activeDownloaders[i];\n\n\t\t\tbd->update();\n\n\n\n\t\t\tif (!bd->isBusy()){ //this one is over! start the next one!\n\n\t\t\t\tif(avgSpeed[i] <= 0.001f){\n\n\t\t\t\t\tavgSpeed[i] = bd->getAverageSpeed();\n","file_path":"src/ofxDownloadCentral.cpp","rank":36,"score":32731.705352226665},{"content":"\tint c = 0; //count how many pending urls have we printed\n\n\tbool printingList = false; //are we printing a pending list?\n\n\n\n\tif(activeDownloaders.size() > 0){\n\n\n\n\t\tif(!detailed) httpDownloadersStatus += \"\\n//// Active Downloaders (\" + ofToString(activeDownloaders.size()) + \") Status ///////////////////////////////\";\n\n\n\n\t\tfor(int i = 0; i < activeDownloaders.size(); i++){\n\n\t\t\tofxBatchDownloader * bd = activeDownloaders[i];\n\n\n\n\t\t\tif(!detailed){\n\n\t\t\t\tchar aux[5];\n\n\t\t\t\tsprintf(aux, \"%02d\", i);\n\n\t\t\t\thttpDownloadersStatus += \"\\n// (\" + std::string(aux) + \") \" + bd->getMinimalDrawableString();\n\n\t\t\t\tif(i == activeDownloaders.size() - 1) httpDownloadersStatus += \"\\n\\n\"; //last line more spce\n\n\t\t\t}else{\n\n\t\t\t\thttpDownloadersStatus += bd->getDrawableString();\n\n\t\t\t}\n\n\t\t\ttotal -= bd->getNumSuppliedUrls() - bd->pendingDownloads();\n\n\t\t}\n","file_path":"src/ofxDownloadCentral.cpp","rank":37,"score":32731.685014754097},{"content":"//\n\n// ofxDownloadCentral.cpp\n\n// emptyExample\n\n//\n\n// Created by Oriol Ferrer Mesià on 14/03/14.\n\n//\n\n//\n\n\n\n\n\n#include \"ofxDownloadCentral.h\"\n\n#include \"ofEvents.h\"\n\n#include \"ofEventUtils.h\"\n\n#include \"Poco/LocalDateTime.h\"\n\n#include \"Poco/DateTimeFormatter.h\"\n\n\n\nofxDownloadCentral::ofxDownloadCentral(){\n\n\n\n\tverbose = true;\n\n\tbusy = false;\n\n\tspeedLimit = 0.0f;\n","file_path":"src/ofxDownloadCentral.cpp","rank":38,"score":32731.283698665182},{"content":"//\n\n// ofxBatchDownloader.cpp\n\n// emptyExample\n\n//\n\n// Created by Oriol Ferrer Mesià on 14/03/14.\n\n//\n\n//\n\n\n\n\n\n#include \"ofxBatchDownloader.h\"\n\n#include \"ofLog.h\"\n\n\n\nofxBatchDownloader::ofxBatchDownloader(){\n\n\tbusy = false;\n\n\tdownloadFolder = \"_downloads_\";\n\n\tdownloadedSoFar = 0;\n\n\t//add download listener\n\n\tofAddListener(http.httpResponse, this, &ofxBatchDownloader::httpResult);\n\n}\n\n\n","file_path":"src/ofxBatchDownloader.cpp","rank":39,"score":32730.6257801484},{"content":"\t\t\t\t}else{\n\n\t\t\t\t\tavgSpeed[i] = avgSpeed[i] * 0.75 + 0.25 * bd->getAverageSpeed();\n\n\t\t\t\t}\n\n\n\n\t\t\t\tdownloadedSoFar += bd->getDownloadedBytesSoFar();\n\n\t\t\t\tif(bd->getNumFailedUrls() > 0) failedJobsSoFar ++;\n\n\t\t\t\tactiveDownloaders.erase(activeDownloaders.begin() + i);\n\n\t\t\t\tdelete bd;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif(activeDownloaders.size() < maxConcurrentDownloads){\n\n\t\t\tstartQueue();\n\n\t\t}\n\n\t\tif(activeDownloaders.size() == 0){\n\n\t\t\tbusy = false;\n\n\t\t}\n\n\t}\n\n}\n\n\n\n\n","file_path":"src/ofxDownloadCentral.cpp","rank":40,"score":32730.570650790967},{"content":"\tif(!busy){\n\n\n\n\t\tfor(int i = 0; i < _urlList.size(); i++){\n\n\t\t\toriginalUrlList.push_back(_urlList[i]);\n\n\t\t\tif (_checksumList.size()){\n\n\t\t\t\toriginalChecksumList.push_back(_checksumList[i]);\n\n\t\t\t}\n\n\t\t\tofLogVerbose(\"ofxBatchDownloader\") << \"queueing \" << _urlList[i] << \" for download\";\n\n\t\t}\n\n\n\n\t}else{\n\n\t\tofLogWarning(\"ofxBatchDownloader\") << \"already working, wait for it to finish!\";\n\n\t}\n\n}\n\n\n\n\n\nint ofxBatchDownloader::pendingDownloads(){\n\n\treturn http.getPendingDownloads();\n\n}\n\n\n","file_path":"src/ofxBatchDownloader.cpp","rank":41,"score":32730.12618184844},{"content":"\n\n\t\tif(drawAllPending){\n\n\t\t\tprintingList = true;\n\n\t\t\tpendingDownloadsList += \"//// Remaining Downloads (\" + ofToString(total) + \") /////////////////////////////////////\\n\";\n\n\t\t\tfor(int i = 0; i < activeDownloaders.size(); i++){\n\n\t\t\t\tstd::vector<std::string> pending = activeDownloaders[i]->pendingURLs();\n\n\t\t\t\tfor(int j = 0; j < pending.size(); j++){\n\n\t\t\t\t\tallPending.push_back(pending[j]);\n\n\t\t\t\t\tif (c < maxURLsToList){\n\n\t\t\t\t\t\tpendingDownloadsList += \"// \" + pending[j] + \"\\n\";\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif (c == maxURLsToList ){\n\n\t\t\t\t\t\tpendingDownloadsList += \"// ...\\n\";\n\n\t\t\t\t\t\treachedListMaxLen = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tc++;\n\n\t\t\t\t}\n\n\t\t\t\tif (reachedListMaxLen) break;\n\n\t\t\t}\n\n\t\t}\n","file_path":"src/ofxDownloadCentral.cpp","rank":42,"score":32730.033901927134},{"content":"std::string ofxBatchDownloader::getDrawableString(){\n\n\treturn http.drawableString();\n\n}\n\n\n\nstd::string ofxBatchDownloader::getMinimalDrawableString(){\n\n\treturn http.minimalDrawableString();\n\n}\n\n\n\nvoid ofxBatchDownloader::addResourcesToDownloadList( std::vector<std::string> _urlList ){\n\n\tstd::vector<std::string>_checksumList;\n\n\taddResourcesToDownloadList(_urlList, _checksumList);\n\n}\n\n\n\nvoid ofxBatchDownloader::addResourcesToDownloadList( std::vector<std::string> _urlList, std::vector<std::string>_checksumList ){\n\n\n\n\tif ( _checksumList.size() > 0 && (_urlList.size() != _checksumList.size()) ){\n\n\t\tofLogWarning(\"ofxBatchDownloader\") << \"addResourcesToDownloadList >> urlList & shaList element num mismatch!\";\n\n\t\treturn;\n\n\t}\n\n\n","file_path":"src/ofxBatchDownloader.cpp","rank":43,"score":32729.4182222191},{"content":"\t}\n\n\n\n\tif(drawAllPending){\n\n\t\tif(downloaders.size() > 0 && !reachedListMaxLen){\n\n\t\t\tfor(int i = 0; i < downloaders.size(); i++){\n\n\t\t\t\tstd::vector<std::string> pending = downloaders[i]->pendingURLs();\n\n\t\t\t\tfor(int j = 0; j < pending.size(); j++){\n\n\t\t\t\t\tallPending.push_back(pending[j]);\n\n\t\t\t\t\tif (c < maxURLsToList){\n\n\t\t\t\t\t\tpendingDownloadsList += \"// \" + pending[j] + \"\\n\";\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif (c == maxURLsToList ){\n\n\t\t\t\t\t\tpendingDownloadsList += \"// ...\\n\";\n\n\t\t\t\t\t\treachedListMaxLen = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tc++;\n\n\t\t\t\t}\n\n\t\t\t\tif (reachedListMaxLen ) break;\n\n\t\t\t}\n\n\t\t}\n","file_path":"src/ofxDownloadCentral.cpp","rank":44,"score":32729.14704623144},{"content":"#pragma once\n\n\n\n#include \"ofMain.h\"\n\n#include \"ofxBatchDownloader.h\"\n\n\n","file_path":"example-ofxBatchDownloader/src/ofApp.h","rank":45,"score":31601.178285767488},{"content":"#pragma once\n\n\n\n#include \"ofMain.h\"\n\n#include \"ofxDownloadCentral.h\"\n\n\n","file_path":"example-ofxDownloadCentral/src/ofApp.h","rank":46,"score":31601.178285767488},{"content":"\t\tdownloader.addResourcesToDownloadList(downloadList);\n\n\t}\n\n\n\n\tif(key==' '){\n\n\t\tdownloader.startDownloading();\n\n\t}\n\n\n\n\tif(key=='c'){\n\n\t\tdownloader.cancelBatch();\n\n\t}\n\n}\n\n\n\n\n\nvoid ofApp::downloadFinished(ofxBatchDownloaderReport &report){\n\n\n\n\tcout << \"download Finished!\" << endl;\n\n\tcout << report.successfulDownloads.size() << \" successful downloads, \" << report.failedDownloads.size() << \" failed downloads.\" << endl;\n\n\n\n\tif( report.failedDownloads.size() ){\n\n\t\tcout << \"these downloads failed: \" ;\n\n\t\tfor(int i = 0; i < report.failedDownloads.size(); i++ ){\n\n\t\t\tcout << \" - \" << report.failedDownloads[i] << endl;\n\n\t\t}\n\n\t}\n\n\n\n}","file_path":"example-ofxBatchDownloader/src/ofApp.cpp","rank":48,"score":30564.050264242167},{"content":"\tdownloadList.push_back(\"http://farm4.staticflickr.com/3740/9481659071_3159d318dc_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm4.staticflickr.com/3802/9484323300_6d3a6a78b5_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm6.staticflickr.com/5346/9484309488_11ee39298e_o.jpg\");\n\n\n\n\t//add download listener\n\n\tofAddListener(downloader.resourcesDownloadFinished, this, &ofApp::downloadFinished);\n\n\tdownloader.setDownloadFolder(\"tempDownloads\");\n\n\tdownloader.setNeedsChecksumMatchToSkipDownload(true);\n\n\tdownloader.setIdleTimeAfterEachDownload(0.2);\n\n\tdownloader.setVerbose(false);\n\n\n\n}\n\n\n\n\n\nvoid ofApp::update(){\n\n\n\n\tdownloader.update();\n\n}\n\n\n\nvoid ofApp::draw(){\n","file_path":"example-ofxBatchDownloader/src/ofApp.cpp","rank":51,"score":30547.897353960307},{"content":"#include \"ofMain.h\"\n\n#include \"ofApp.h\"\n\n#include \"ofAppGLFWWindow.h\"\n\n\n\n//========================================================================\n\nint main( ){\n\n\tofAppGLFWWindow win;\n\n\t//win.setNumSamples(8);\n\n\t//win.setOrientation(OF_ORIENTATION_90_LEFT);\n\n\t//win.setMultiDisplayFullscreen(true);\n\n\t//win.set\n\n\n\n\tofSetupOpenGL(&win, 800,500, OF_WINDOW);\t// <-------- setup the GL context\n\n\n\n\t// this kicks off the running of my app\n\n\t// can be OF_WINDOW or OF_FULLSCREEN\n\n\t// pass in width and height too:\n\n\tofRunApp(new ofApp());\n\n\n\n}\n","file_path":"example-ofxBatchDownloader/src/main.cpp","rank":53,"score":30544.869845725585},{"content":"#include \"ofMain.h\"\n\n#include \"ofApp.h\"\n\n#include \"ofAppGLFWWindow.h\"\n\n\n\n//========================================================================\n\nint main( ){\n\n\tofAppGLFWWindow win;\n\n\t//win.setNumSamples(8);\n\n\t//win.setOrientation(OF_ORIENTATION_90_LEFT);\n\n\t//win.setMultiDisplayFullscreen(true);\n\n\t//win.set\n\n\n\n\tofSetupOpenGL(&win, 800,600, OF_WINDOW);\t// <-------- setup the GL context\n\n\n\n\t// this kicks off the running of my app\n\n\t// can be OF_WINDOW or OF_FULLSCREEN\n\n\t// pass in width and height too:\n\n\tofRunApp(new ofApp());\n\n\n\n}\n","file_path":"example-ofxDownloadCentral/src/main.cpp","rank":54,"score":30544.869845725585},{"content":"\n\n\tdownloader.draw(30,30);\n\n\tofSetColor(255);\n\n\n\n\t//clock hand to see threading in action\n\n\tofPushMatrix();\n\n\n\n\tofTranslate(ofGetWidth() - 60,60, 0);\n\n\tofRotate( ofGetFrameNum() * 3, 0,0,1);\n\n ofSetColor(255,255,255);\n\n\tfloat h = 5;\n\n\tofRect(-h/2,h/2, h,50);\n\n\n\n\tofPopMatrix();\n\n}\n\n\n\n\n\nvoid ofApp::keyPressed(int key){\n\n\n\n\tif(key=='a'){\n","file_path":"example-ofxBatchDownloader/src/ofApp.cpp","rank":56,"score":30544.31603142723},{"content":"#include \"ofApp.h\"\n\n\n\n\n\n\n\nvoid ofApp::setup(){\n\n\n\n\tofSetFrameRate(63);\n\n\tofSetVerticalSync(true);\n\n\tofEnableAlphaBlending();\n\n\tofBackground(22);\n\n\tofSetWindowPosition(20, 20);\n\n\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7420/10032530563_86ff701d19_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm4.staticflickr.com/3686/9225463176_d0bf83a992_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7255/6888724266_158ce261a2_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7047/7034809565_5f80871bff_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7438/9481688475_e83f92e8b5_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7321/9481647489_e73bed28e1_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm8.staticflickr.com/7367/9484432454_9701453c66_o.jpg\");\n\n\tdownloadList.push_back(\"http://farm6.staticflickr.com/5537/9481654243_7b73b87ceb_o.jpg\");\n","file_path":"example-ofxBatchDownloader/src/ofApp.cpp","rank":59,"score":30542.265752999632},{"content":"class ofApp : public ofBaseApp{\n\n\n\npublic:\n\n\n\n\tvoid setup();\n\n\tvoid update();\n\n\tvoid draw();\n\n\tvoid keyPressed(int key);\n\n\tvoid drawClock();\n\n\n\n\t//download ready callback\n\n\tvoid downloadFinished(ofxBatchDownloaderReport &report);\n\n\n\n\tofxDownloadCentral downloader;\n\n\n\n};\n","file_path":"example-ofxDownloadCentral/src/ofApp.h","rank":60,"score":27760.162258016055},{"content":"class ofApp : public ofBaseApp{\n\n\n\n\tpublic:\n\n\t\tvoid setup();\n\n\t\tvoid update();\n\n\t\tvoid draw();\n\n\n\n\t\tvoid keyPressed(int key);\n\n\n\n\t\tfloat p1;\n\n\t\tbool timeSample;\n\n\n\n\t\tvoid downloadFinished(ofxBatchDownloaderReport &report);\n\n\n\n\t\tofxBatchDownloader downloader;\n\n\t\tvector<string> downloadList;\n\n\n\n};\n","file_path":"example-ofxBatchDownloader/src/ofApp.h","rank":61,"score":27760.162258016055},{"content":"\t\tvoid \t\t\t\t\tsetProxyConfiguration(const ProxyConfig & c);\n\n\n\n\t\tvoid\t\t\t\t\t\tsetTimeOut(int seconds);\n\n\t\tvoid\t\t\t\t\t\tsetUserAgent(std::string newUserAgent );\n\n\t\tvoid\t\t\t\t\t\tsetCredentials(std::string username, std::string password);\n\n\t\tvoid\t\t\t\t\t\tsetMaxQueueLength(int len);\n\n\t\tvoid \t\t\t\t\tsetCopyBufferSize(float KB); /*in KiloBytes (1 -> 1024 bytes)*/\n\n\t\tvoid\t\t\t\t\t\tsetIdleTimeAfterEachDownload(float seconds); //wait a bit before notifying once the dowload is over\n\n\t\tvoid\t\t\t\t\t\tsetChecksumType(ofxChecksum::Type); //when you supply a checksum to compare a downloaded file against, what type will it be?\n\n\n\n\t\tvoid\t\t\t\t\t\tsetCancelCurrentDownloadOnDestruction(bool doIt);\n\n\t\tvoid\t\t\t\t\t\tsetCancelPendingDownloadsOnDestruction(bool cancelAll);\n\n\n\n\t\tvoid\t\t\t\t\t\taddCustomHttpHeader(std::string headerName, std::string headerContent);\n\n\t\tvoid\t\t\t\t\t\tsetNotifyFromMainThread(bool mainThread);\n\n\n\n\t\t\t\t\t\t\t\t//if a download is requested and file already exists on disk,\n\n\t\t\t\t\t\t\t\t//do we require a checksum match to assume the file is good?\n\n\t\t\t\t\t\t\t\t//ie, if the user doesnt provide a checksum, what do we do?\n\n\t\tvoid\t\t\t\t\t\tsetNeedsChecksumMatchToSkipDownload(bool needs);\n","file_path":"src/ofxSimpleHttp.h","rank":62,"score":15.959096642740676},{"content":"\n\n}\n\n\n\n\n\nvoid ofApp::newResponse(ofxSimpleHttpResponse &r){\n\n\n\n\tcout << \"#########################################################\" << endl;\n\n\tcout << \"download of \" << r.url << \" returned : \"<< string(r.ok ? \"OK\" : \"KO\") << endl;\n\n\tcout << \"server reported size is \" << r.serverReportedSize << endl;\n\n\tcout << \"server status is \" << r.status << endl;\n\n\tcout << \"file content type is \" << r.contentType << endl;\n\n\tcout << \"file name is \" << r.fileName << endl;\n\n\n\n\tif(r.downloadToDisk){\n\n\t\tcout << \"file was saved to \" << r.absolutePath << endl;\n\n\n\n\t\t//move the file to wherever you need..\n\n\t\tofDirectory dir;\n\n\t\tdir.createDirectory(\"mySortedDownloads\");\n\n\n","file_path":"example-ofxSimpleHttp/src/ofApp.cpp","rank":63,"score":13.69333162671093},{"content":"\n\nvoid ofxSimpleHttp::setCopyBufferSize(float KB){\n\n\tCOPY_BUFFER_SIZE = KB * 1024;\n\n}\n\n\n\nvoid ofxSimpleHttp::setCancelCurrentDownloadOnDestruction(bool doIt){\n\n\tcancelCurrentDownloadOnDestruction = doIt;\n\n}\n\n\n\nvoid ofxSimpleHttp::setCancelPendingDownloadsOnDestruction(bool cancelAll){\n\n\tflushPendingRequestsOnDestruction = cancelAll;\n\n}\n\n\n\nvoid ofxSimpleHttp::setIdleTimeAfterEachDownload(float seconds){\n\n\tidleTimeAfterEachDownload = seconds;\n\n}\n\n\n\nvoid ofxSimpleHttp::setNotifyFromMainThread(bool mainThread){\n\n\tnotifyFromMainThread = mainThread;\n\n}\n","file_path":"src/ofxSimpleHttp.cpp","rank":64,"score":13.485707905891402},{"content":"\n\nvoid ofxSimpleHttp::setNeedsChecksumMatchToSkipDownload(bool needs){\n\n\tonlySkipDownloadIfChecksumMatches = needs;\n\n}\n\n\n\nvoid ofxSimpleHttp::setTimeOut(int seconds){\n\n\ttimeOut = seconds;\n\n}\n\n\n\nvoid ofxSimpleHttp::setChecksumType(ofxChecksum::Type type){\n\n\tchecksumType = type;\n\n}\n\n\n\nvoid ofxSimpleHttp::setUserAgent( std::string newUserAgent ){\n\n\tuserAgent = newUserAgent;\n\n}\n\n\n\nvoid ofxSimpleHttp::setCredentials(std::string username, std::string password){\n\n\tif(username.size() || password.size()){\n\n\t\tcredentials.setUsername(username);\n","file_path":"src/ofxSimpleHttp.cpp","rank":65,"score":12.508794549124636},{"content":"\t\t\t\tss << \" Avg Download Speed: \" << (serverReportedSize / 1024.f) / timeTakenToDownload << \"Kb/sec\" << endl;\n\n\t\t\t}\n\n\t\t\tif(downloadToDisk){\n\n\t\t\t\tss << \" File Saved at: \" << absolutePath << endl;\n\n\t\t\t}\n\n\t\t}\n\n\t}else{\n\n\t\tss << \" Download FAILED! \" << endl;\n\n\t\tss << \" Status: \" << status << \" - \" << reasonForStatus << endl;\n\n\t}\n\n\treturn ss.str();\n\n}\n\n\n\nvoid ofxSimpleHttpResponse::print(){\n\n\tif (ok){\n\n\t\tofLogNotice(\"ofxSimpleHttpResponse\") << toString();\n\n\t}else{\n\n\t\tofLogError(\"ofxSimpleHttpResponse\") << toString();\n\n\t}\n\n}\n","file_path":"src/ofxSimpleHttp.cpp","rank":66,"score":11.482966736445887},{"content":"\t\tvoid\t\t\t\t\t\tupdate(); //this is mainly used to get notifications in the main thread\n\n\n\n\t\tvoid\t\t\t\t\t\tdraw(float x, float y , float w , float h);\t//draws a box\n\n\t\tvoid\t\t\t\t\t\tdraw(float x, float y);\t//draws a box\n\n\t\tstd::string\t\t\t\tdrawableString(int urlLen = 0);\n\n\t\tvoid\t\t\t\t\t\tdrawMinimal(float x, float y,\n\n\t\t\t\t\t\t\t\t\t\t\tbool withBg = false,\n\n\t\t\t\t\t\t\t\t\t\t\tofColor fontColor = ofColor::white,\n\n\t\t\t\t\t\t\t\t\t\t\tofColor bgColor = ofColor::black);\t//draws a one-line status\n\n\t\tstd::string\t\t\t\tminimalDrawableString();\n\n\n\n\t\tvoid\t\t\t\t\t\tstopCurrentDownload(bool emptyQueue); //if there's more downloads on queue, next will start immediatelly\n\n\n\n\t\tint\t\t\t\t\t\tgetPendingDownloads();\n\n\t\tfloat\t\t\t\t\tgetCurrentDownloadProgress();\t//retuns [0..1] how complete is the download\n\n\t\tstd::string\t\t\t\tgetCurrentDownloadFileName();\t//only while downloading\n\n\t\tfloat\t\t\t\t\tgetAvgDownloadSpeed();\t\t\t// bytes/sec - also when not download\n\n\n\n\t\t// properties //////////////////////////////////////////////////////////\n\n\n","file_path":"src/ofxSimpleHttp.h","rank":67,"score":10.70248225640561},{"content":"\t\tstatic std::string\t\textractFileFromUrl(const std::string & url);\n\n\t\tstatic std::string\t\textractExtensionFromFileName(const std::string& fileName);\n\n\t\tstatic std::string\t\tgetFileSystemSafeString(const std::string & input);\n\n\n\n\tprotected:\n\n\n\n\t\tbool downloadURL( ofxSimpleHttpResponse * resp, bool sendResultThroughEvents, bool beingCalledFromMainThread, bool saveToDisk );\n\n\t\tvoid threadedFunction();\t//the queue runs here\n\n\n\n\t\tofxChecksum::Type \t\tchecksumType = ofxChecksum::Type::SHA1;\n\n\t\tbool\t\t\t\t\t\tnotifyFromMainThread;\n\n\t\tbool\t\t\t\t\t\tonlySkipDownloadIfChecksumMatches;\n\n\n\n\t\tbool \t\t\t\t\tsilent = false; //if true, no ofLog calls\n\n\t\tint\t\t\t\t\t\ttimeOut;\n\n\t\tstd::string\t\t\t\tuserAgent;\n\n\t\tstd::string\t\t\t\tacceptString;\n\n\t\tstd::queue<ofxSimpleHttpResponse*>\tq;\t\t//the pending requests\n\n\t\tbool\t\t\t\t\t\ttimeToStop;\n\n\t\tint\t\t\t\t\t\tqueueLenEstimation;\n","file_path":"src/ofxSimpleHttp.h","rank":68,"score":9.941185579171977},{"content":"\t\tint\t\t\t\t\t\tmaxQueueLen;\n\n\t\tfloat\t\t\t\t\tidleTimeAfterEachDownload;\t//seconds\n\n\t\tfloat\t\t\t\t\tavgDownloadSpeed;\n\n\t\tbool\t\t\t\t\t\tcancelCurrentDownloadOnDestruction;\n\n\t\tbool\t\t\t\t\t\tflushPendingRequestsOnDestruction;\n\n\n\n\t\tfloat\t\t\t\t\tspeedLimit; //in KiloBytes / sec\n\n\t\tofxSimpleHttpResponse\t\tresponse; //used by blocking fetch() methods\n\n\n\n\t\tProxyConfig\t\t\t\tproxyConfig;\n\n\t\tbool\t\t\t\t\t\tuseCredentials;\n\n\t\tPoco::Net::HTTPBasicCredentials\t\tcredentials;\n\n\n\n\t\tstd::queue<ofxSimpleHttpResponse>\t\tresponsesPendingNotification; //we store here downloads that arrived so that we can notify from main thread\n\n\t\tstd::map<std::string, std::string> \tcustomHttpHeaders;\n\n\n\n\t\tstatic \t\t\t\t\tPoco::Net::Context::Ptr pContext;\n\n\t\tint \t\t\t\t\t\tCOPY_BUFFER_SIZE;\n\n\t\tfloat \t\t\t\t\tavgSpeedNow;\n\n\n\n\t\tstd::streamsize streamCopyWithProgress(std::istream & in, std::ostream & out, std::streamsize totalBytes,\n\n\t\t\t\t\t\t\t\t\t\t\t std::streamsize ¤tBytes, bool & speedSampled,\n\n\t\t\t\t\t\t\t\t\t\t\t float & progress, float &speed, const bool &shouldCancel);\n\n\n\n\n\n};\n","file_path":"src/ofxSimpleHttp.h","rank":69,"score":9.650169814469969},{"content":"\tlock();\n\n\tint n = q.size();\n\n\tif ( isThreadRunning() && n > 0){\n\n\t\tofxSimpleHttpResponse * r = q.front();\n\n\t\tif (!r->downloadCanceled){ //dont cancel it twice!\n\n\t\t\tif(!silent) ofLogNotice(\"ofxSimpleHttp\") << \"stopCurrentDownload() >> about to stop download of \" + r->fileName + \" ...\";\n\n\t\t\ttry{\n\n\t\t\t\tr->emptyWholeQueue = emptyQueue;\n\n\t\t\t\tr->downloadCanceled = true;\n\n\t\t\t}catch(Exception& exc){\n\n\t\t\t\tofLogError(\"ofxSimpleHttp\") << \"stopCurrentDownload(\" << r->fileName << \") >> Exception: \" << exc.displayText() ;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tunlock();\n\n}\n\n\n\n\n\n\n\n\n","file_path":"src/ofxSimpleHttp.cpp","rank":70,"score":8.059714792501683},{"content":"\t\tofFile f;\n\n\t\tf.open( r.absolutePath );\n\n\t\tif( f.exists() ){\n\n\t\t\tf.moveTo(\"mySortedDownloads/\" + r.fileName);\n\n\t\t}else{\n\n\t\t\tcout << \"file was not downloaded???!\" << r.absolutePath << endl;\n\n\t\t}\n\n\t}\n\n}\n\n\n\nvoid ofApp::exit(){\n\n\tofxSimpleHttp::destroySslContext();\n\n}\n","file_path":"example-ofxSimpleHttp/src/ofApp.cpp","rank":71,"score":7.985005384174773},{"content":"\tif(customField.size()) ss << \"CustomField: \" << customField << endl;\n\n\tif (ok){\n\n\t\tif (fileWasHere){\n\n\t\t\tss << \" File was already on disk, no download needed!\" << endl;\n\n\t\t\tif (expectedChecksum.size()){\n\n\t\t\t\tss << \" File checksum \" << expectedChecksum << \" matched!\" << endl;\n\n\t\t\t}else{\n\n\t\t\t\tss << \" File checksum not supplied, assuming file is the same blindly\" << endl;\n\n\t\t\t}\n\n\t\t\tss << \" File saved at: \" << absolutePath << endl;\n\n\t\t}else{\n\n\t\t\tss << \" Server Status: \" << status << endl;\n\n\t\t\tss << \" Server Reported size: \" << serverReportedSize << endl;\n\n\t\t\tss << \" Content Type: \" << contentType << endl;\n\n\t\t\tif(expectedChecksum.length()){\n\n\t\t\t\tss << \" Expected Checksum: \" << expectedChecksum << endl;\n\n\t\t\t\tss << \" Checksum Match: \" << std::string(checksumOK ? \"YES\" : \"NO\") << endl;\n\n\t\t\t}\n\n\t\t\tss << \" Download Time taken: \" << timeTakenToDownload << \" seconds\" << endl;\n\n\t\t\tif (serverReportedSize != -1){\n","file_path":"src/ofxSimpleHttp.cpp","rank":72,"score":7.783833323103924},{"content":"\t}\n\n\n\n\tif(key=='6'){\n\n\t\thttp.setUserAgent(\"My Fake Browser\"); //github api requires User Agent string\n\n\t\tofxSimpleHttpResponse res = http.fetchURLBlocking(\"https://api.github.com/users/armadillu/events\");\n\n\t\tcout << res.responseBody << endl;\n\n\t}\n\n\n\n\n\n\tif(key=='7'){ //also supports file:// urls for local filesystem\n\n\t\thttp.fetchURLToDisk(\"file:///System/Library/Fonts/Optima.ttc\", true, OUTPUT_DIRECTORY );\n\n\t}\n\n\n\n\tif(key=='c'){\n\n\t\thttp.stopCurrentDownload(false);\n\n\t}\n\n\n\n\tif(key=='C'){\n\n\t\thttp.stopCurrentDownload(true);\n\n\t}\n","file_path":"example-ofxSimpleHttp/src/ofApp.cpp","rank":73,"score":7.598110873722316},{"content":"# ofxSimpleHttp\n\n\n\n[](https://travis-ci.org/armadillu/ofxSimpleHttp)\n\n[](https://ci.appveyor.com/project/armadillu/ofxsimplehttp/branch/master)\n\n\n\nOpenFrameworks addon to make http downloads easy; \n\n\n\n\n\n\n\n\n\n* supports http://, https:// and file://\n\n* threaded downloads\n\n* user agent customization\n\n* proxy support\n\n* custom timeouts\n\n* parallel downloads\n\n* download queues\n\n* cancel downloads\n\n* checksum checked downloads (sha1)\n\n* skip download if file is already there and sha1 matches\n\n* download reports (http status codes, download speed, total time, etc)\n\n* ofEvents from main thread, or bg thread if required\n\n\n\n\n\n\n\n\n","file_path":"ReadMe.md","rank":74,"score":7.577868069375683},{"content":"\tuserAgent = \"ofxSimpleHttp (Poco Powered)\";\n\n\tacceptString = \"\";\n\n\tnotifyFromMainThread = true;\n\n\tonlySkipDownloadIfChecksumMatches = false;\n\n\tidleTimeAfterEachDownload = 0.0;\n\n\tavgDownloadSpeed = 0.0f;\n\n\tspeedLimit = 0.0f;\n\n\tuseCredentials = false;\n\n\tavgSpeedNow = 0.0f;\n\n}\n\n\n\n\n\nofxSimpleHttp::~ofxSimpleHttp(){\n\n\n\n\tif(flushPendingRequestsOnDestruction){\n\n\t\tif(queueLenEstimation > 0 && !silent) ofLogWarning(\"ofxSimpleHttp\") << \"Destructor canceling pending downloads (\" << queueLenEstimation << \")\";\n\n\t\ttimeToStop = true;\t//lets flag the thread so that it doesnt try access stuff while we delete things around\n\n\t}\n\n\n\n\tif(cancelCurrentDownloadOnDestruction && isThreadRunning()){\n","file_path":"src/ofxSimpleHttp.cpp","rank":75,"score":7.421857752849167},{"content":"\n\n#include \"ofxChecksum.h\"\n\n\n\n#include <Poco/SHA1Engine.h>\n\n#include <Poco/DigestStream.h>\n\n\n\n#include \"../libs/xxHash/xxhash.h\"\n\n#include \"../libs/sha1/sha1.h\"\n\n\n\n//#include \"ofxTimeMeasurements.h\"\n\n//extern \"C\" {\n\n//#include \"sha1.h\"\n\n//}\n\n\n\n\n\nbool ofxChecksum::sha1(const std::string& filePath,\n\n\t\t\t\t\t const std::string& sha1String,\n\n\t\t\t\t\t bool verbose){\n\n\tfloat t;\n\n\tif(verbose){\n","file_path":"src/ofxChecksum.cpp","rank":76,"score":7.352165590270129},{"content":"\t\t\t\t\t\t\t\tstd::string msg = \"downloadURL(\" + resp->fileName + \") >> Exception at file.open: \" + exc.displayText();\n\n\t\t\t\t\t\t\t\tofLogError(\"ofxSimpleHttp\") << msg ;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tresp->downloadedBytes = resp->responseBody.size();\n\n\t\t\t\t\t\t}\n\n\n\n\t\t\t\t\t\tif(resp->timeTakenToDownload > 0.01f){\n\n\t\t\t\t\t\t\tresp->avgDownloadSpeed = (resp->downloadedBytes ) / resp->timeTakenToDownload; //bytes/sec\n\n\t\t\t\t\t\t\tif(!silent) ofLogNotice(\"ofxSimpleHttp\") << \"downloadURL() >> download completed - \\\"\" << resp->url << \"\\\" - avg Dl speed: \" <<\n\n\t\t\t\t\t\t\t\tbytesToHumanReadable(resp->avgDownloadSpeed,1) << \" - Dl Size: \" << bytesToHumanReadable(resp->downloadedBytes, 1) <<\n\n\t\t\t\t\t\t\t\t\" - dur: \" << secondsToHumanReadable(resp->timeTakenToDownload, 1);\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tavgDownloadSpeed = resp->avgDownloadSpeed;\n\n\n\n\t\t\t\t\t\tbool isAPI = (resp->contentType == \"text/json\" || resp->contentType == \"application/json;charset=UTF-8\");\n\n\t\t\t\t\t\tbool sizeMissmatch = resp->serverReportedSize > 0 && resp->serverReportedSize != resp->downloadedBytes;\n\n\n\n\t\t\t\t\t\t//check download file size mismatch\n\n\t\t\t\t\t\tif ( sizeMissmatch && !isAPI ) {\n","file_path":"src/ofxSimpleHttp.cpp","rank":77,"score":7.2270864467157505},{"content":"\n\n\tavgDownloadSpeed = 0.95f * avgDownloadSpeed + 0.05f * avgSpeedNow;\n\n\tbool done = false;\n\n\n\n\twhile(!done){\n\n\t\tlock();\n\n\t\tint numPending = responsesPendingNotification.size();\n\n\t\tif(numPending > 0){\n\n\t\t\tofxSimpleHttpResponse r;\n\n\t\t\tr = responsesPendingNotification.front();\n\n\t\t\tresponsesPendingNotification.pop();\n\n\t\t\tunlock();\n\n\t\t\tofNotifyEvent( httpResponse, r, this ); //we want to be able to notify from outside the lock\n\n\t\t}else{\n\n\t\t\tunlock();\n\n\t\t\tdone = true;\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"src/ofxSimpleHttp.cpp","rank":78,"score":6.966809466267102},{"content":"#pragma once\n\n\n\n#include \"ofMain.h\"\n\n#include \"ofxSimpleHttp.h\"\n\n\n\n#define OUTPUT_DIRECTORY \"tempDownloads\"\n\n\n","file_path":"example-ofxSimpleHttp/src/ofApp.h","rank":79,"score":6.946734207385544},{"content":"\t\t\t\t\t\tdefault: break;\n\n\t\t\t\t\t}\n\n\n\n\t\t\t\t\tresp->checksumOK = resp->expectedChecksum == resp->calculatedChecksum;\n\n\n\n\t\t\t\t\tif(!resp->checksumOK){\n\n\t\t\t\t\t\tif(!silent) ofLogNotice(\"ofxSimpleHttp\") << \"file:// copy OK but Checksum FAILED\";\n\n\t\t\t\t\t\tif(!silent) ofLogNotice(\"ofxSimpleHttp\") << \"Checksum (\" + ofxChecksum::toString(resp->checksumType) + \") was meant to be: \\\"\" << resp->expectedChecksum << \"\\\" but is: \\\"\" << resp->calculatedChecksum<< \"\\\"\";\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\n\n\t\t\t\trs.close();\n\n\t\t\t\tok = true;\n\n\t\t\t}else{\n\n\t\t\t\tofLogError(\"ofxSimpleHttp\") << \"Source File does not exist! \" << resp->url;\n\n\t\t\t\tresp->ok = false;\n\n\t\t\t\tresp->status = 404; //assume not found? todo!\n\n\t\t\t\tresp->reasonForStatus = \"Source File does not exist!\";\n\n\t\t\t\tresp->timeTakenToDownload = 0;\n\n\t\t\t\tresp->checksumOK = false;\n","file_path":"src/ofxSimpleHttp.cpp","rank":80,"score":6.836213375828944},{"content":"\tresponse.who = this;\n\n\tresponse.downloadCanceled = false;\n\n\tresponse.fileName = extractFileFromUrl(url);\n\n\tresponse.extension = extractExtensionFromFileName(response.fileName);\n\n\tresponse.notifyOnSuccess = true;\n\n\tresponse.checksumType = checksumType;\n\n\tbool ok = downloadURL(&response,\n\n\t\t\t\t\t\t false/*send res through events*/,\n\n\t\t\t\t\t\t true/*beingCalledFromMainThread*/,\n\n\t\t\t\t\t\t false/*to disk*/\n\n\t\t\t\t\t\t );\n\n\treturn response;\n\n}\n\n\n\nvoid ofxSimpleHttp::fetchURLToDisk(std::string url, std::string expectedChecksum, bool notifyOnSuccess,\n\n\t\t\t\t\t\t\t\t std::string dirWhereToSave, std::string customField){\n\n\n\n\tif (queueLenEstimation >= maxQueueLen){\n\n\t\tofLogError(\"ofxSimpleHttp\") << \"fetchURL can't do that, queue is too long already (\" << queueLenEstimation << \")!\";\n\n\t\treturn;\n","file_path":"src/ofxSimpleHttp.cpp","rank":81,"score":6.796075060572505},{"content":"\t\tcredentials.setPassword(password);\n\n\t\tuseCredentials = true;\n\n\t}\n\n}\n\n\n\nvoid ofxSimpleHttp::setMaxQueueLength(int len){\n\n\tmaxQueueLen = len;\n\n}\n\n\n\nvoid ofxSimpleHttp::addCustomHttpHeader(std::string headerName, std::string headerContent){\n\n\tcustomHttpHeaders[headerName] = headerContent;\n\n}\n\n\n\nstd::string ofxSimpleHttp::getCurrentDownloadFileName(){\n\n\n\n\tstd::string download = \"\";\n\n\tlock();\n\n\tint n = q.size();\n\n\tif ( isThreadRunning() && n > 0 ){\n\n\t\tofxSimpleHttpResponse * r = q.front();\n","file_path":"src/ofxSimpleHttp.cpp","rank":82,"score":6.781688795830549},{"content":"\n\n\t\t\t\tif (notifyFromMainThread){ //user wants to get notified form main thread, we need to enqueue the notification\n\n\t\t\t\t\tif (timeToStop == false){\t//see if we have been destructed! dont forward events if so\n\n\t\t\t\t\t\tlock();\n\n\t\t\t\t\t\tofxSimpleHttpResponse tempCopy = *resp;\n\n\t\t\t\t\t\tresponsesPendingNotification.push(tempCopy);\n\n\t\t\t\t\t\tunlock();\n\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //user doesnt care about main thread, the notificaiton can come from bg thread so we do it from here\n\n\t\t\t\t\tofNotifyEvent( httpResponse, *resp, this );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\treturn ok;\n\n}\n\n\n\n\n\nvoid ofxSimpleHttp::update(){\n","file_path":"src/ofxSimpleHttp.cpp","rank":83,"score":6.764506565490649},{"content":"\t\t\t\t\t\t\t\t\"press '6' call an https based API, print result on console\\n\"\n\n\t\t\t\t\t\t\t\t\"press '7' to download (copy) a local file (file:// url)\\n\"\n\n\t\t\t\t\t\t\t\t\"press 'c' to cancel current download\\n\"\n\n\t\t\t\t\t\t\t\t\"press 'C' to cancel current download and empty queue\",\n\n\t\t\t\t\t\t\t\t20,\n\n\t\t\t\t\t\t\t\tofGetHeight() - 133\n\n\t\t\t\t\t\t\t\t);\n\n\n\n\n\n}\n\n\n\n\n\nvoid ofApp::keyPressed(int key){\n\n\n\n\n\n\tif(key=='1'){\n\n\t\tstring url = downloadList[floor(ofRandom(downloadList.size()))];\n\n\t\thttp.fetchURLToDisk(url , true/*notify when done*/, OUTPUT_DIRECTORY);\n\n\t}\n\n\n","file_path":"example-ofxSimpleHttp/src/ofApp.cpp","rank":84,"score":6.7586984327252955},{"content":"\t\tvoid\t\t\t\t\t\tsetSpeedLimit(float KB_per_sec);\n\n\n\n\t\tvoid\t\t\t\t\t\tsetSilent(bool noLogging);\n\n\n\n\n\n\t\tofEvent<ofxSimpleHttpResponse> httpResponse;\n\n\n\n\t\t// https support //////////////////////////////////////////////////////////////\n\n\n\n\t\t//call once, before any https connection is made\n\n\t\tstatic void \t\t\t\tcreateSslContext(Poco::Net::Context::Usage = Poco::Net::Context::CLIENT_USE,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t Poco::Net::Context::VerificationMode verMode = Poco::Net::Context::VERIFY_NONE);\n\n\n\n\t\tstatic void \t\t\t\tdestroySslContext(); //call once when no longer need https, once all trasnfers are finished\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t//or just b4 app exit\n\n\n\n\t\t// STATIC Utility Methods ////////////////////////////////////////////////////////\n\n\n\n\t\tstatic std::string\t\tbytesToHumanReadable(long long bytes, int decimalPrecision);\n\n\t\tstatic std::string\t\tsecondsToHumanReadable(float sec, int decimalPrecision);\n","file_path":"src/ofxSimpleHttp.h","rank":85,"score":6.727509105310984},{"content":"\n\n\t\t\t\t\tstd::ostringstream output;\n\n\t\t\t\t\tstreamCopyWithProgress(rs, output, resp->serverReportedSize, resp->downloadedSoFar, resp->chunkTested,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t resp->downloadProgress, resp->downloadSpeed, resp->downloadCanceled);\n\n\t\t\t\t\tresp->responseBody = output.str();\n\n\n\n\t\t\t\t}\n\n\t\t\t\tresp->ok = true;\n\n\t\t\t\tresp->status = 200;\n\n\t\t\t\tresp->timeTakenToDownload = ofGetElapsedTimef() - resp->timeDowloadStarted;\n\n\t\t\t\tresp->downloadedBytes = resp->serverReportedSize;\n\n\n\n\t\t\t\tif (resp->expectedChecksum.length() > 0){\n\n\t\t\t\t\tswitch(resp->checksumType){\n\n\t\t\t\t\t\tcase ofxChecksum::Type::SHA1:\n\n\t\t\t\t\t\t\tresp->calculatedChecksum = ofxChecksum::calcSha1(resp->absolutePath);\n\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ofxChecksum::Type::XX_HASH:\n\n\t\t\t\t\t\t\tresp->calculatedChecksum = ofxChecksum::xxHash(resp->absolutePath);\n\n\t\t\t\t\t\t\tbreak;\n","file_path":"src/ofxSimpleHttp.cpp","rank":86,"score":6.604623383427125},{"content":"\t\t\tofStringReplace(srcFilePath, \"\\\\\", \"/\"); //for windows, replace escaped backslashes\n\n#endif\n\n\t\t\t//ofFile::copyFromTo(srcFile, resp->absolutePath);\n\n\n\n\t\t\tofFile srcOfFile;\n\n\t\t\tbool openOK = srcOfFile.open(ofToDataPath(srcFilePath, true), ofFile::ReadOnly);\n\n\t\t\tresp->downloadSpeed = 0;\n\n\t\t\tresp->downloadedBytes = 0;\n\n\n\n\t\t\tif(srcOfFile.exists()){\n\n\t\t\t\tuint64_t size = srcOfFile.getSize();\n\n\t\t\t\tresp->serverReportedSize = size;\n\n\t\t\t\tresp->timeDowloadStarted = ofGetElapsedTimef();\n\n\t\t\t\tstd::ifstream rs (ofToDataPath(srcFilePath, true).c_str(), std::ifstream::binary);\n\n\n\n\t\t\t\tif(saveToDisk){\n\n\t\t\t\t\tstreamCopyWithProgress(rs, myfile, resp->serverReportedSize, resp->downloadedSoFar, resp->chunkTested,\n\n\t\t\t\t\t\t\t\t\t resp->downloadProgress, resp->downloadSpeed, resp->downloadCanceled);\n\n\n\n\t\t\t\t}else{\n","file_path":"src/ofxSimpleHttp.cpp","rank":87,"score":6.582230335791583},{"content":"\tresponse.fileName = extractFileFromUrl(url);\n\n\tresponse.extension = extractExtensionFromFileName(response.fileName);\n\n\tresponse.notifyOnSuccess = true;\n\n\tresponse.downloadToDisk = true;\n\n\tbool ok = downloadURL(&response,\n\n\t\t\t\t\t\t false,/*send result through events*/\n\n\t\t\t\t\t\t true, /*beingCalledFromMainThread*/\n\n\t\t\t\t\t\t true/*to disk*/\n\n\t\t\t\t\t\t );\n\n\treturn response;\n\n}\n\n\n\n\n\nbool ofxSimpleHttp::downloadURL(ofxSimpleHttpResponse* resp, bool sendResultThroughEvents, bool beingCalledFromMainThread, bool saveToDisk){\n\n\n\n\tbool ok = false;\n\n\tofstream myfile;\n\n\tbool fileIsAlreadyHere = false;\n\n\tresp->responseBody = \"\";\n\n\n","file_path":"src/ofxSimpleHttp.cpp","rank":88,"score":6.485477128583245},{"content":"\t\t\t\t\t\t\tcase ofxChecksum::Type::XX_HASH:\n\n\t\t\t\t\t\t\t\tresp->calculatedChecksum = ofxChecksum::xxHash(resp->absolutePath);\n\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tdefault: break;\n\n\t\t\t\t\t\t}\n\n\n\n\t\t\t\t\t\tresp->checksumOK = resp->expectedChecksum == resp->calculatedChecksum;\n\n\n\n\t\t\t\t\t\tif(!resp->checksumOK){\n\n\t\t\t\t\t\t\tofLogNotice(\"ofxSimpleHttp\") << \"downloaded OK but Checksum FAILED\";\n\n\t\t\t\t\t\t\tofLogNotice(\"ofxSimpleHttp\") << \"Checksum (\" + ofxChecksum::toString(resp->checksumType) + \") was meant to be: \\\"\" << resp->expectedChecksum << \"\\\" but is: \\\"\" << resp->calculatedChecksum<< \"\\\"\";\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\n\t\t\t\t\tresp->downloadSpeed = 0;\n\n\t\t\t\t\tresp->downloadedBytes = 0;\n\n\n\n\t\t\t\t\tif (resp->downloadCanceled){\n\n\t\t\t\t\t\t//delete half-baked download file\n\n\t\t\t\t\t\tif (resp->downloadToDisk){\n","file_path":"src/ofxSimpleHttp.cpp","rank":89,"score":6.439664741979257},{"content":"\n\n\n\nofxSimpleHttpResponse::ofxSimpleHttpResponse(){\n\n\twho = NULL;\n\n\tdownloadToDisk = emptyWholeQueue = false;\n\n\tchecksumOK = true;\n\n\tdownloadProgress = downloadSpeed = avgDownloadSpeed = downloadedBytes = 0.0f;\n\n\ttimeTakenToDownload = 0.0;\n\n\tserverReportedSize = -1;\n\n\tdownloadedSoFar = 0;\n\n\tstatus = -1;\n\n\tfileWasHere = false;\n\n\ttimeDowloadStarted = ofGetElapsedTimef();\n\n\tchunkTested = false;\n\n}\n\n\n\nstd::string ofxSimpleHttpResponse::toString(){\n\n\n\n\tstd::stringstream ss;\n\n\tss << \"URL: \" << url << endl;\n","file_path":"src/ofxSimpleHttp.cpp","rank":90,"score":6.429488111303279},{"content":"\t\t\t\t\t\t\tstd::string msg;\n\n\n\n\t\t\t\t\t\t\tif (resp->downloadedBytes == 0){\n\n\t\t\t\t\t\t\t\tif (resp->timeTakenToDownload > timeOut){\n\n\t\t\t\t\t\t\t\t\tmsg = \"downloadURLtoDiskBlocking() >> TimeOut! (\" + resp->fileName + \")\";\n\n\t\t\t\t\t\t\t\t\tresp->reasonForStatus = \"Request TimeOut\";\n\n\t\t\t\t\t\t\t\t\tresp->status = HTTPResponse::HTTP_REQUEST_TIMEOUT;\n\n\t\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t\tmsg = \"downloadURLtoDiskBlocking() >> Download file is 0 bytes (\" + resp->fileName + \")\";\n\n\t\t\t\t\t\t\t\t\tresp->reasonForStatus = \"Download size is 0 bytes!\";\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\tmsg = \"downloadURLtoDiskBlocking() >> Download size mismatch (\" + resp->fileName + \") >> Server: \" +\n\n\t\t\t\t\t\t\t\tofToString(resp->serverReportedSize) + \" Downloaded: \" + ofToString(resp->downloadedBytes);\n\n\t\t\t\t\t\t\t\tresp->reasonForStatus = \"Download size mismatch\";\n\n\t\t\t\t\t\t\t}\n\n\n\n\t\t\t\t\t\t\tif(!silent) ofLogWarning(\"ofxSimpleHttp\", msg);\n\n\t\t\t\t\t\t\tresp->status = -1;\n\n\t\t\t\t\t\t\tresp->ok = false;\n","file_path":"src/ofxSimpleHttp.cpp","rank":91,"score":6.399105844522036},{"content":"\t\tdownload = r->fileName;\n\n\t}\n\n\tunlock();\n\n\treturn download;\n\n}\n\n\n\n\n\nint ofxSimpleHttp::getPendingDownloads(){\n\n\tlock();\n\n\tqueueLenEstimation = q.size();\n\n\tunlock();\n\n\treturn queueLenEstimation;\n\n}\n\n\n\n\n\nfloat ofxSimpleHttp::getCurrentDownloadProgress(){\n\n\n\n\tfloat downloadPercent = -1;\n\n\tlock();\n\n\tint n = q.size();\n","file_path":"src/ofxSimpleHttp.cpp","rank":92,"score":6.227563919734032},{"content":"#include \"Poco/Net/HTTPRequest.h\"\n\n#include \"Poco/Net/HTTPResponse.h\"\n\n\n\n\n\nPoco::Net::Context::Ptr ofxSimpleHttp::pContext = NULL;\n\n\n\nusing namespace Poco::Net;\n\nusing namespace Poco;\n\nusing Poco::Exception;\n\nusing Poco::Net::HTTPClientSession;\n\n\n\nofxSimpleHttp::ofxSimpleHttp(){\n\n\n\n\tCOPY_BUFFER_SIZE = 1024 * 512; // kb buffer size\n\n\tcancelCurrentDownloadOnDestruction = true;\n\n\tflushPendingRequestsOnDestruction = true;\n\n\ttimeOut = 10;\n\n\tqueueLenEstimation = 0;\n\n\tmaxQueueLen = 1000;\n\n\ttimeToStop = false;\n","file_path":"src/ofxSimpleHttp.cpp","rank":93,"score":6.171685937679604},{"content":"\t\t\t\t\tresp->ok = false;\n\n\t\t\t\t\tresp->reasonForStatus = \"Unknown exception at streamCopy\";\n\n\t\t\t\t\tresp->status = -1;\n\n\t\t\t\t\tok = false;\n\n\t\t\t\t}\n\n\n\n\t\t\t\t//last check for OK flag\n\n\t\t\t\tif(!resp->checksumOK){\n\n\t\t\t\t\tresp->ok = false;\n\n\t\t\t\t\tresp->reasonForStatus += \" / Checksum mismatch! (\" + ofxChecksum::toString(resp->checksumType) + \")\";\n\n\t\t\t\t}\n\n\n\n\t\t\t}catch(Exception& exc){\n\n\n\n\t\t\t\tif (session) session->reset();\n\n\t\t\t\tmyfile.close();\n\n\t\t\t\tstd::string msg = \"downloadURL(\" + resp->fileName + \") >> Exception: \" + exc.displayText();\n\n\t\t\t\tresp->timeTakenToDownload = ofGetElapsedTimef() - resp->timeDowloadStarted;\n\n\t\t\t\tif (resp->timeTakenToDownload > timeOut){\n\n\t\t\t\t\tmsg = \"downloadURLtoDiskBlocking() >> TimeOut! (\" + resp->fileName + \")\";\n","file_path":"src/ofxSimpleHttp.cpp","rank":94,"score":5.86977766135613},{"content":"\t\tmsg += \"] \";\n\n\t\tmsg += std::string( r->downloadToDisk ? ofFilePath::getFileName(r->absolutePath) : \"\");\n\n\t\tmsg += \" (\" + bytesToHumanReadable((long long)r->downloadSpeed, 1) + \"/s\";\n\n\t\tif(r->serverReportedSize > 0){\n\n\t\t\tmsg += \" | \" + bytesToHumanReadable(r->serverReportedSize, 1) + \" file)\";\n\n\t\t}else{\n\n\t\t\tmsg += \")\";\n\n\t\t}\n\n\t}\n\n\tunlock();\n\n\treturn msg;\n\n}\n\n\n\n\n\nstd::string ofxSimpleHttp::drawableString(int urlLen){\n\n\n\n\tstd::string aux;\n\n\tlock();\n\n\tint n = q.size();\n\n\tif( isThreadRunning() && n > 0 ){\n","file_path":"src/ofxSimpleHttp.cpp","rank":95,"score":5.747129308651704},{"content":"float ofxSimpleHttp::getAvgDownloadSpeed(){\n\n\treturn avgDownloadSpeed;\n\n}\n\n\n\n\n\nstd::string ofxSimpleHttp::minimalDrawableString(){\n\n\n\n\tstd::string msg;\n\n\tlock();\n\n\tint n = q.size();\n\n\tif( isThreadRunning() && n > 0 ){\n\n\t\tofxSimpleHttpResponse * r = q.front();\n\n\t\tchar aux[16];\n\n\t\tsprintf(aux, \"% 4d%%\", (int)(r->downloadProgress * 100.0f));\n\n\t\tmsg += std::string(aux) + \" [\";\n\n\t\tfloat barLen = 12;\n\n\t\tfloat numFill = r->downloadProgress * barLen;\n\n\t\tfor(int i = 0; i < barLen; i++){\n\n\t\t\tmsg += std::string(i < numFill ? \"*\" : \" \");\n\n\t\t}\n","file_path":"src/ofxSimpleHttp.cpp","rank":96,"score":5.719555012050627},{"content":" SHA1_Update(context, finalcount, 8); /* Should cause a SHA1_Transform() */\n\n for (i = 0; i < SHA1_DIGEST_SIZE; i++) {\n\n digest[i] = (uint8_t)\n\n ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);\n\n }\n\n\n\n /* Wipe variables */\n\n i = 0;\n\n memset(context->buffer, 0, 64);\n\n memset(context->state, 0, 20);\n\n memset(context->count, 0, 8);\n\n memset(finalcount, 0, 8);\t/* SWR */\n\n}\n\n\n\n//-----------------------------------------------------------------------------\n\n\n\nvoid sha1_32a ( const void * key, int len, uint32_t seed, void * out )\n\n{\n\n SHA1_CTX context;\n\n\n","file_path":"libs/sha1/sha1.cpp","rank":97,"score":5.655032096750761},{"content":"\t\t}\n\n\t}else{\n\n\t\tresp->timeTakenToDownload = 0;\n\n\t\tok = true;\n\n\t}\n\n\n\n\t//enqueue the operation result!\n\n\tif (sendResultThroughEvents ){\n\n\n\n\t\tif ( resp->notifyOnSuccess ){\n\n\n\n\t\t\tif(idleTimeAfterEachDownload > 0.0f){\n\n\t\t\t\tofSleepMillis(idleTimeAfterEachDownload * 1000);\n\n\t\t\t}\n\n\n\n\t\t\tif (beingCalledFromMainThread){ //we running on main thread, we can just snd the notif from here\n\n\n\n\t\t\t\tofNotifyEvent( httpResponse, *resp, this );\n\n\n\n\t\t\t}else{ //we are running from a bg thread\n","file_path":"src/ofxSimpleHttp.cpp","rank":98,"score":5.6225075677152905},{"content":"}\n\n\n\n\n\nint main(int argc, char** argv)\n\n{\n\n int k;\n\n SHA1_CTX context;\n\n uint8_t digest[20];\n\n char output[80];\n\n\n\n fprintf(stdout, \"verifying SHA-1 implementation... \");\n\n\n\n for (k = 0; k < 2; k++){\n\n SHA1_Init(&context);\n\n SHA1_Update(&context, (uint8_t*)test_data[k], strlen(test_data[k]));\n\n SHA1_Final(&context, digest);\n\n digest_to_hex(digest, output);\n\n\n\n if (strcmp(output, test_results[k])) {\n\n fprintf(stdout, \"FAIL\\n\");\n","file_path":"libs/sha1/sha1.cpp","rank":99,"score":5.597978025450921}],"string":"[\n {\n \"content\": \"struct ofxBatchDownloaderReport{\\n\\n\\tstd::string downloadPath;\\t\\t\\t\\t\\t\\t//full path to the directory that holds the downloads\\n\\n\\tofxBatchDownloader* owner;\\t\\t\\t\\t\\t//pointer to the object in charge of the downloads\\n\\n\\tstd::vector<std::string> attemptedDownloads;\\t\\t\\t//this vector contains all the user supplied urls\\n\\n\\tstd::vector<std::string> successfulDownloads;\\t\\t\\t//this vector contains all the urls that got downloaded correctly\\n\\n\\tstd::vector<std::string> failedDownloads;\\t\\t\\t\\t//this vector contains all the urls that failed to download\\n\\n\\tstd::vector<ofxSimpleHttpResponse> responses;\\t//this vector contains a list of all url responses, with statuses, filenames, etc\\n\\n\\tbool wasCanceled;\\n\\n\\tofxBatchDownloaderReport(){\\n\\n\\t\\twasCanceled = false;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 0,\n \"score\": 69108.76067937785\n },\n {\n \"content\": \"class ofxBatchDownloader;\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 1,\n \"score\": 39056.492389340325\n },\n {\n \"content\": \"class ofxBatchDownloader;\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 2,\n \"score\": 39056.492389340325\n },\n {\n \"content\": \"class ofxDownloadCentral{\\n\\n\\n\\n\\tpublic:\\n\\n\\n\\n\\t\\tofxDownloadCentral();\\n\\n\\t\\t~ofxDownloadCentral();\\n\\n\\n\\n\\t\\tvoid update();\\n\\n\\t\\tvoid draw(float x, float y, bool drawAllPending = false, bool detailedDownloadInfo = true);\\n\\n\\t\\tstd::string getDrawableInfo(bool drawAllPending = false, bool detailedDownloadInfo = true); //draw with a monospaced font!\\n\\n\\n\\n\\t\\tvoid cancelCurrentDownload();\\n\\n\\t\\tvoid cancelAllDownloads();\\n\\n\\n\\n\\t\\tbool isBusy();\\n\\n\\t\\tint getNumPendingDownloads();\\n\\n\\t\\tint getNumActiveDownloads();\\n\\n\\n\\n\\t\\tvoid setVerbose(bool b);\\n\\n\\t\\tvoid setNeedsChecksumMatchToSkipDownload(bool needs);\\t//if downloaded file is on disk, should I assume its good?\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 3,\n \"score\": 39056.492389340325\n },\n {\n \"content\": \"class ofxBatchDownloader{\\n\\n\\n\\npublic:\\n\\n\\n\\n\\tofxBatchDownloader();\\n\\n\\t~ofxBatchDownloader();\\n\\n\\n\\n\\tvoid update();\\n\\n\\tvoid draw(float x, float y);\\n\\n\\tstd::string getDrawableString();\\n\\n\\tstd::string getMinimalDrawableString();\\n\\n\\n\\n\\tvoid setDownloadFolder(std::string f);\\n\\n\\tvoid setSpeedLimit(float KB_per_sec);\\n\\n\\tvoid setTimeOut(float timeOut);\\n\\n\\tvoid setCopyBufferSize(float bufferSizeKb);\\n\\n\\n\\n\\tvoid setChecksumType(ofxChecksum::Type); //when you supply a checksum to compare a downloaded file against, what type will it be?\\n\\n\\n\\n\\tvoid addResourcesToDownloadList( std::vector<std::string>urlList );\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 4,\n \"score\": 39056.492389340325\n },\n {\n \"content\": \"\\tvoid addResourcesToDownloadList( std::vector<std::string>urlList, std::vector<std::string>checksumList );\\n\\n\\tvoid startDownloading();\\n\\n\\tvoid cancelBatch(bool notify = false);\\n\\n\\n\\n\\tvoid setVerbose(bool b); //nop\\n\\n\\tvoid setNeedsChecksumMatchToSkipDownload(bool needsChecksum);\\n\\n\\tvoid setIdleTimeAfterEachDownload(float seconds); //wait a bit before notifying once the dowload is over\\n\\n\\n\\n\\tvoid setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c);\\n\\n\\tvoid setCredentials(const std::string& user, const std::string& password);\\n\\n\\n\\n\\tuint64_t getDownloadedBytesSoFar(){ return downloadedSoFar;}\\n\\n\\tint getNumSuppliedUrls();\\n\\n\\tint getNumFailedUrls();\\n\\n\\tint pendingDownloads();\\n\\n\\tbool isBusy();\\n\\n\\tfloat getAverageSpeed(); //bytes/sec\\n\\n\\tstd::vector<std::string> pendingURLs();\\n\\n\\n\\n\\tofEvent<ofxBatchDownloaderReport>\\tresourcesDownloadFinished;\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 5,\n \"score\": 33956.3409131723\n },\n {\n \"content\": \"//\\n\\n// ofxBatchDownloader.h\\n\\n// emptyExample\\n\\n//\\n\\n// Created by Oriol Ferrer Mesià on 14/03/14.\\n\\n//\\n\\n//\\n\\n\\n\\n#ifndef emptyExample_ofxBatchDownloader_h\\n\\n#define emptyExample_ofxBatchDownloader_h\\n\\n\\n\\n#include \\\"ofxSimpleHttp.h\\\"\\n\\n\\n\\n/*\\n\\n\\n\\n ####### how to get notifications ############################################\\n\\n\\n\\n //create a batch downloader\\n\\n ofxBatchDownloader dl;\\n\\n\\n\\n //sign up for the notification\\n\\n ofAddListener(dl.resourcesDownloadFinished, this, &myApp::downloadFinished);\\n\\n\\n\\n //define the callback in your app\\n\\n void myApp::downloadFinished(ofxBatchDownloaderReport &report){}\\n\\n\\n\\n */\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 6,\n \"score\": 33950.96866940381\n },\n {\n \"content\": \"\\t\\tstd::vector<ofxBatchDownloader*>\\t\\tactiveDownloaders;\\n\\n\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\t\\t\\t\\tbusy;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\t\\t\\t\\tverbose;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\t\\t\\t\\tonlySkipDownloadIfChecksumMatches;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\t\\t\\tidleTimeAfterDownload; //float sec\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\t\\t\\tdownloadStartTime;\\n\\n\\t\\tstd::streamsize\\t\\t\\t\\t\\t\\tdownloadedSoFar; //bytes\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\t\\t\\tdownloadStartJobsNumber;\\n\\n\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\t\\t\\tfailedJobsStartNumber;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\t\\t\\tfailedJobsSoFar;\\n\\n\\n\\n\\t\\tstd::map<int, float>\\t\\t\\t\\t\\tavgSpeed;\\t //bytes/sec\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\t\\t\\tmaxURLsToList;\\n\\n\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\t\\t\\t\\tmaxConcurrentDownloads;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\t\\t\\tspeedLimit;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\t\\t\\ttimeOut;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\t\\t\\tcopyBufferSize = 1024.0f; //Kb\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 7,\n \"score\": 33949.970986501176\n },\n {\n \"content\": \"\\n\\nprivate:\\n\\n\\n\\n\\tofxSimpleHttp http;\\n\\n\\tbool busy;\\n\\n\\tbool needToStop; //user wants to cancel!\\n\\n\\n\\n\\tstd::string downloadFolder;\\n\\n\\n\\n\\tstd::vector<std::string>\\toriginalUrlList;\\n\\n\\tstd::vector<std::string>\\toriginalChecksumList;\\n\\n\\tstd::vector<std::string>\\tfailedList;\\n\\n\\tstd::vector<std::string> okList;\\n\\n\\tstd::vector<ofxSimpleHttpResponse> responses;\\n\\n\\n\\n\\tvoid httpResult(ofxSimpleHttpResponse &response);\\n\\n\\tvoid reset();\\n\\n\\n\\n\\tuint64_t downloadedSoFar; //bytes\\n\\n\\n\\n\\tofxChecksum::Type checksumType = ofxChecksum::Type::SHA1;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.h\",\n \"rank\": 8,\n \"score\": 33949.206852253286\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//or only if you provided sha1 checksum and it matches\\n\\n\\n\\n\\t\\tvoid setSpeedLimit(float KB_per_sec);\\n\\n\\t\\tvoid setTimeOut(float timeoutSecs);\\n\\n\\t\\tvoid setMaxConcurrentDownloads(int numConcurrentDownloads);\\n\\n\\n\\n\\t\\tvoid setChecksumType(ofxChecksum::Type type); //when you supply a checksum to compare a downloaded file against, what type will it be?\\n\\n\\t\\tvoid setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c);\\n\\n\\t\\tvoid setCredentials(const std::string& user, const std::string& password);\\n\\n\\n\\n\\t\\tvoid setCopyBufferSize(float bufferInKb);\\n\\n\\n\\n\\t\\tvoid setIdleTimeAfterEachDownload(float seconds);\\t\\t//wait a bit before notifying once the dowload is over\\n\\n\\t\\tvoid setMaxURLsToList(int max);\\n\\n\\n\\n\\t\\tvoid startDownloading();\\n\\n\\n\\n\\t\\t///////////////////////////////////////////////////////////////////////////////\\n\\n\\t\\ttemplate <typename ArgumentsType, class ListenerClass>\\n\\n\\t\\tvoid downloadResources(\\tconst std::string & url,\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 9,\n \"score\": 33947.55270843547\n },\n {\n \"content\": \" will be notified when its downloads are ready.\\n\\n this is meant mainly to download assets on demand, telling its owner \\n\\n when the asset is ready to load.\\n\\n\\n\\n // HOW IS THIS MEANT TO BE USED ?\\n\\n\\n\\n 1 - define a central downloads object\\n\\n\\tofxDownloadCentral dlc;\\n\\n\\n\\n 2 - implement a notification callback\\n\\n\\tvoid downloadsFinished(ofxBatchDownloaderReport &report){}\\n\\n\\n\\n 3 - fill in a list of url with assets you need downloaded\\n\\n\\tstd::vector<std::string> urlList;\\n\\n \\n\\n 4 - supply a list the download\\n\\n \\n\\n\\tdlc.downloadResources( urlList, this, &myClass::downloadsFinished, destinationFolder );\\n\\n\\n\\n\\tit will all be downloaded in a bg thread\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 10,\n \"score\": 33947.01195177293\n },\n {\n \"content\": \"//\\n\\n// ofxDownloadCentral.h\\n\\n// emptyExample\\n\\n//\\n\\n// Created by Oriol Ferrer Mesià on 14/03/14.\\n\\n//\\n\\n//\\n\\n\\n\\n#pragma once\\n\\n#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofxBatchDownloader.h\\\"\\n\\n#include \\\"ofxSimpleHttp.h\\\"\\n\\n#include \\\"ofEvents.h\\\"\\n\\n#include \\\"ofEventUtils.h\\\"\\n\\n\\n\\n/*\\n\\n// WHAT IS THIS?\\n\\n\\n\\n Centralised downloads from any number of objects.\\n\\n creates a download queue, each object that requests a download list \\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 11,\n \"score\": 33944.43366055997\n },\n {\n \"content\": \"\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t///////////////////////////////////////////////////////////////////////////////\\n\\n\\t\\ttemplate <typename ArgumentsType, class ListenerClass>\\n\\n\\t\\tvoid downloadResources(const std::vector<std::string> & urlList,\\n\\n\\t\\t\\t\\t\\t\\t\\t ListenerClass * listener,\\n\\n\\t\\t\\t\\t\\t\\t\\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\\n\\n\\t\\t\\t\\t\\t\\t\\t const std::string & destinationFolder = \\\"ofxDownloadCentral_downloads\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t ){\\n\\n\\n\\n\\t\\t\\tstd::vector<std::string> shas;\\n\\n\\t\\t\\tdownloadResources(urlList, shas, listener, listenerMethod, destinationFolder);\\n\\n\\t\\t}\\n\\n\\n\\n\\tprivate:\\n\\n\\n\\n\\t\\tvoid startQueue();\\n\\n\\n\\n\\t\\tstd::vector<ofxBatchDownloader*>\\t\\tdownloaders;\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 12,\n \"score\": 33943.38243457822\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t ListenerClass * listener,\\n\\n\\t\\t\\t\\t\\t\\t\\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\\n\\n\\t\\t\\t\\t\\t\\t\\t const std::string & destinationFolder = \\\"ofxDownloadCentral_downloads\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t ){\\n\\n\\n\\n\\t\\t\\tstd::vector<std::string> list;\\n\\n\\t\\t\\tlist.push_back(url);\\n\\n\\t\\t\\tdownloadResources(list, listener, listenerMethod, destinationFolder);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t///////////////////////////////////////////////////////////////////////////////\\n\\n\\t\\ttemplate <typename ArgumentsType, class ListenerClass>\\n\\n\\t\\tvoid downloadResources( const std::string & url,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tconst std::string & sha1String,\\n\\n\\t\\t\\t\\t\\t\\t\\t ListenerClass * listener,\\n\\n\\t\\t\\t\\t\\t\\t\\t void (ListenerClass::*listenerMethod)(ArgumentsType&),\\n\\n\\t\\t\\t\\t\\t\\t\\t const std::string & destinationFolder = \\\"ofxDownloadCentral_downloads\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t ){\\n\\n\\n\\n\\t\\t\\tstd::vector<std::string> list;\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 13,\n \"score\": 33943.2175345058\n },\n {\n \"content\": \"\\tyou will be notified from the main thread when they are done\\n\\n\\tyou will get a report\\n\\n \\n\\n 6 - start the download\\n\\n\\t\\n\\n\\tstartDownloading();\\n\\n \\n\\n 7 - update the dlc object\\n\\n\\t\\n\\n\\tdlc.update();\\n\\n\\t\\n\\n\\tand wait for the notification to arrive\\n\\n\\n\\n */\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 14,\n \"score\": 33942.849446336804\n },\n {\n \"content\": \"\\t\\t\\tstd::vector<std::string> shas;\\n\\n\\t\\t\\tlist.push_back(url);\\n\\n\\t\\t\\tshas.push_back(sha1String);\\n\\n\\t\\t\\tdownloadResources(list, shas, listener, listenerMethod, destinationFolder);\\n\\n\\t\\t}\\n\\n\\n\\n\\n\\n\\t\\t///////////////////////////////////////////////////////////////////////////////\\n\\n\\t\\ttemplate <typename ArgumentsType, class ListenerClass>\\n\\n\\t\\tvoid downloadResources(\\tconst std::vector<std::string> & urlList,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tconst std::vector<std::string> & sha1List,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tListenerClass * listener,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tvoid (ListenerClass::*listenerMethod)(ArgumentsType&),\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tconst std::string & destinationFolder = \\\"ofxDownloadCentral_downloads\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t ){\\n\\n\\n\\n\\t\\t\\tif (urlList.size() > 0 ){\\n\\n\\t\\t\\t\\tofxBatchDownloader * d = new ofxBatchDownloader();\\n\\n\\t\\t\\t\\td->setProxyConfiguration(proxyConfig);\\n\\n\\t\\t\\t\\tif(credentials.first.size() || credentials.second.size()){\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 15,\n \"score\": 33942.52243560439\n },\n {\n \"content\": \"\\t\\t\\t\\t\\td->setCredentials(credentials.first, credentials.second);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(timeOut > 0.0f) d->setTimeOut(timeOut);\\n\\n\\t\\t\\t\\tif(speedLimit > 0.0f) d->setSpeedLimit(speedLimit);\\n\\n\\n\\n\\t\\t\\t\\td->setDownloadFolder(destinationFolder);\\n\\n\\t\\t\\t\\td->setVerbose(verbose);\\n\\n\\t\\t\\t\\td->setNeedsChecksumMatchToSkipDownload(onlySkipDownloadIfChecksumMatches);\\n\\n\\t\\t\\t\\td->setChecksumType(checksumType);\\n\\n\\t\\t\\t\\td->setCopyBufferSize(copyBufferSize);\\n\\n\\t\\t\\t\\td->setIdleTimeAfterEachDownload(idleTimeAfterDownload);\\n\\n\\t\\t\\t\\td->addResourcesToDownloadList(urlList, sha1List);\\n\\n\\t\\t\\t\\tofAddListener(d->resourcesDownloadFinished, listener, listenerMethod); //set the notification to hit our original caller\\n\\n\\t\\t\\t\\tif(downloaders.size() == 0){\\n\\n\\t\\t\\t\\t\\tdownloadStartTime = ofGetElapsedTimef();\\n\\n\\t\\t\\t\\t\\tdownloadedSoFar = 0;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tdownloadStartJobsNumber++;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdownloaders.push_back(d);\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 16,\n \"score\": 33942.22431468315\n },\n {\n \"content\": \"\\t\\tofxChecksum::Type \\t\\t\\t\\t\\tchecksumType = ofxChecksum::Type::SHA1;\\n\\n\\n\\n\\t\\tofxSimpleHttp::ProxyConfig\\t\\t\\tproxyConfig;\\n\\n\\t\\tstd::pair<std::string,std::string> \\tcredentials;\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.h\",\n \"rank\": 17,\n \"score\": 33937.17532460588\n },\n {\n \"content\": \"\\t\\treport.attemptedDownloads = originalUrlList;\\n\\n\\t\\treport.successfulDownloads = okList;\\n\\n\\t\\treport.failedDownloads = failedList;\\n\\n\\t\\treport.responses = responses;\\n\\n\\t\\treport.wasCanceled = true;\\n\\n\\t\\tofNotifyEvent( resourcesDownloadFinished, report, this );\\n\\n\\t}\\n\\n\\tbusy = false;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::setDownloadFolder(std::string f){\\n\\n\\tdownloadFolder = f;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::draw(float x, float y){\\n\\n\\thttp.draw(x, y);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 18,\n \"score\": 32745.904722093117\n },\n {\n \"content\": \"\\t\\treport.attemptedDownloads = originalUrlList;\\n\\n\\t\\treport.successfulDownloads = okList;\\n\\n\\t\\treport.failedDownloads = failedList;\\n\\n\\t\\treport.responses = responses;\\n\\n\\t\\tofNotifyEvent( resourcesDownloadFinished, report, this );\\n\\n\\t\\tbusy = false;\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nfloat ofxBatchDownloader::getAverageSpeed(){\\n\\n\\treturn http.getAvgDownloadSpeed();\\n\\n}\\n\\n\\n\\n\\n\\nstd::vector<std::string> ofxBatchDownloader::pendingURLs(){\\n\\n\\n\\n\\tstd::vector<std::string> res;\\n\\n\\tfor (int i = 0; i < originalUrlList.size(); i++){\\n\\n\\t\\tbool found = false;\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 19,\n \"score\": 32743.425745430774\n },\n {\n \"content\": \"\\tbool checkedOK = r.checksumOK || (!r.checksumOK && r.expectedChecksum.size() == 0);\\n\\n\\tif(r.ok && checkedOK){\\n\\n\\t\\tokList.push_back( r.url );\\n\\n\\t\\tofLogNotice(\\\"ofxBatchDownloader\\\") << \\\"downloaded OK [\\\" << r.url << \\\"]\\\";\\n\\n\\t}else{\\n\\n\\t\\tfailedList.push_back( r.url );\\n\\n\\t\\tif (!r.checksumOK){\\n\\n\\t\\t\\tofLogError(\\\"ofxBatchDownloader\\\") << \\\"checksum mismatch! [\\\" << r.url << \\\"] expectedChecksum: \\\" << r.expectedChecksum << \\\")\\\";\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tofLogError(\\\"ofxBatchDownloader\\\") << \\\"FAILED TO download [\\\" << r.url << \\\"]\\\";\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tdownloadedSoFar += r.downloadedBytes;\\n\\n\\n\\n\\tif (originalUrlList.size() == failedList.size() + okList.size()){\\n\\n\\t\\t//we are done!\\n\\n\\t\\tofxBatchDownloaderReport report;\\n\\n\\t\\treport.owner = this;\\n\\n\\t\\treport.downloadPath = downloadFolder;\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 20,\n \"score\": 32738.781812012057\n },\n {\n \"content\": \"\\thttp.setProxyConfiguration(c);\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::setCredentials(const std::string& user, const std::string& password){\\n\\n\\thttp.setCredentials(user, password);\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::setVerbose(bool b){}\\n\\n\\n\\n\\n\\nofxBatchDownloader::~ofxBatchDownloader(){\\n\\n\\tif (busy) {\\n\\n\\t\\tcancelBatch(false /*notify*/);\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::update(){\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 21,\n \"score\": 32738.23247255028\n },\n {\n \"content\": \"\\t\\tfor (int j = 0; j < okList.size(); j++){\\n\\n\\t\\t\\tif ( okList[j] == originalUrlList[i] ){\\n\\n\\t\\t\\t\\tfound = true;\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tfor (int j = 0; j < failedList.size(); j++){\\n\\n\\t\\t\\tif ( failedList[j] == originalUrlList[i] ){\\n\\n\\t\\t\\t\\tfound = true;\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif (!found) res.push_back(originalUrlList[i]);\\n\\n\\t}\\n\\n\\treturn res;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::reset(){\\n\\n\\tfailedList.clear();\\n\\n\\tokList.clear();\\n\\n\\tresponses.clear();\\n\\n}\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 22,\n \"score\": 32737.767047752634\n },\n {\n \"content\": \"\\n\\nbool ofxBatchDownloader::isBusy(){\\n\\n\\treturn busy;\\n\\n};\\n\\n\\n\\nint ofxBatchDownloader::getNumSuppliedUrls(){\\n\\n\\treturn originalUrlList.size();\\n\\n}\\n\\n\\n\\nint ofxBatchDownloader::getNumFailedUrls(){\\n\\n\\treturn failedList.size();\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::startDownloading(){\\n\\n\\n\\n\\tif (!busy){\\n\\n\\t\\tbusy = true;\\n\\n\\t\\treset();\\n\\n\\n\\n\\t\\tofLogVerbose(\\\"ofxBatchDownloader\\\") << \\\"starting downloads! \\\";\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 23,\n \"score\": 32737.66613541973\n },\n {\n \"content\": \"\\thttp.update();\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::setTimeOut(float timeOut){\\n\\n\\thttp.setTimeOut(timeOut);\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::setSpeedLimit(float KB_per_sec){\\n\\n\\thttp.setSpeedLimit(KB_per_sec);\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::cancelBatch(bool notify){\\n\\n\\thttp.stopCurrentDownload(true);\\n\\n\\thttp.waitForThread(true);\\n\\n\\tif(notify){\\n\\n\\t\\tofxBatchDownloaderReport report;\\n\\n\\t\\treport.owner = this;\\n\\n\\t\\treport.downloadPath = downloadFolder;\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 24,\n \"score\": 32737.50965333005\n },\n {\n \"content\": \"\\tonlySkipDownloadIfChecksumMatches = true;\\n\\n\\tmaxURLsToList = 4;\\n\\n\\tidleTimeAfterDownload = 0.0f;\\n\\n\\tmaxConcurrentDownloads = 1;\\n\\n\\ttimeOut = -1.0f;\\n\\n\\tfailedJobsSoFar = failedJobsStartNumber = 0;\\n\\n}\\n\\n\\n\\nofxDownloadCentral::~ofxDownloadCentral(){\\n\\n\\tcancelAllDownloads();\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::setMaxConcurrentDownloads(int numConcurrentDownloads){\\n\\n\\tmaxConcurrentDownloads = ofClamp(numConcurrentDownloads, 1, INT_MAX);\\n\\n}\\n\\n\\n\\nvoid ofxDownloadCentral::setCopyBufferSize(float bufferInKb){\\n\\n\\tcopyBufferSize = bufferInKb;\\n\\n}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 25,\n \"score\": 32737.21700744624\n },\n {\n \"content\": \"void ofxDownloadCentral::cancelCurrentDownload(){\\n\\n\\tif (busy){\\n\\n\\t\\tfor(int i = activeDownloaders.size() - 1; i >= 0; i--){\\n\\n\\t\\t\\tofxBatchDownloader * bd = activeDownloaders[i];\\n\\n\\t\\t\\tbd->cancelBatch(true);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::cancelAllDownloads(){\\n\\n\\tif (busy){\\n\\n\\t\\tcancelCurrentDownload(); //active downloads get stopped\\n\\n\\t\\twhile(downloaders.size() > 0){\\n\\n\\t\\t\\tdelete downloaders[0];\\n\\n\\t\\t\\tdownloaders.erase(downloaders.begin());\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 26,\n \"score\": 32736.53507541873\n },\n {\n \"content\": \"void ofxDownloadCentral::setVerbose(bool b){\\n\\n\\tverbose = b;\\n\\n}\\n\\n\\n\\nvoid ofxDownloadCentral::setIdleTimeAfterEachDownload(float seconds){\\n\\n\\tidleTimeAfterDownload = seconds;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::setNeedsChecksumMatchToSkipDownload(bool needs){\\n\\n\\tonlySkipDownloadIfChecksumMatches = needs;\\n\\n}\\n\\n\\n\\nvoid ofxDownloadCentral::startQueue(){\\n\\n\\n\\n\\tfor(int i = activeDownloaders.size(); i < maxConcurrentDownloads; i++){\\n\\n\\t\\tif(downloaders.size() > 0){\\n\\n\\t\\t\\tbusy = true;\\n\\n\\t\\t\\tofxBatchDownloader * bd = downloaders[0];\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 27,\n \"score\": 32735.628274617044\n },\n {\n \"content\": \"\\n\\nvoid ofxDownloadCentral::setChecksumType(ofxChecksum::Type type){\\n\\n\\tchecksumType = type;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::startDownloading(){\\n\\n\\tif (!busy){\\n\\n\\t\\tdownloadStartJobsNumber = downloaders.size();\\n\\n\\t\\tfailedJobsStartNumber = failedJobsSoFar;\\n\\n\\t\\tstartQueue();\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::setMaxURLsToList(int max){\\n\\n\\tmaxURLsToList = max;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 28,\n \"score\": 32735.325825094184\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tstd::string spa = \\\" \\\";\\n\\n\\tstd::string header = \\\"//// ofxDownloadCentral queued Jobs: \\\" + ofToString(numQueuedJobs) + \\\" ///////////////////////////\\\\n\\\"\\n\\n\\t\\\"//// Jobs executed: \\\" + spa + ofToString(numProcessed) + \\\"\\\\n\\\" +\\n\\n\\t\\\"//// Jobs failed: \\\" + spa + ofToString(numFailed) + \\\"\\\\n\\\" +\\n\\n//\\t\\\"//// Total Downloads Left: \\\" + spa + ofToString(total) + \\\"\\\\n\\\" +\\n\\n\\t\\\"//// Elapsed Time: \\\" + spa + ofxSimpleHttp::secondsToHumanReadable(elapsedTime, 1) + \\\"\\\\n\\\" +\\n\\n\\t\\\"//// Estimated Time Left: \\\" + spa + ofxSimpleHttp::secondsToHumanReadable(timeLeft, 1) + \\\"\\\\n\\\"\\n\\n\\t\\\"//// Estimated Completion: \\\" + spa + estFinish + \\\"\\\\n\\\" +\\n\\n\\t\\\"//// Avg Download Speed: \\\" + spa + ofxSimpleHttp::bytesToHumanReadable(avg, 1) + \\\"/sec\\\\n\\\" +\\n\\n\\t\\\"//// Downloaded So Far: \\\" + spa + ofxSimpleHttp::bytesToHumanReadable(downloadedSoFar, 1) +\\n\\n\\t\\\"\\\\n\\\";\\n\\n\\n\\n\\treturn header + httpDownloadersStatus + pendingDownloadsList;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::draw(float x, float y, bool drawAllPending, bool detailedDownloadInfo){\\n\\n\\tif (busy){\\n\\n\\t\\tstd::string aux = getDrawableInfo(drawAllPending, detailedDownloadInfo);\\n\\n\\t\\tofDrawBitmapString(aux, x, y);\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 29,\n \"score\": 32733.652417067562\n },\n {\n \"content\": \"\\n\\n\\n\\nstd::string ofxDownloadCentral::getDrawableInfo(bool drawAllPending, bool detailed){\\n\\n\\n\\n\\tint total = 0;\\n\\n\\tfor(int i = 0; i < activeDownloaders.size(); i++){\\n\\n\\t\\ttotal += activeDownloaders[i]->getNumSuppliedUrls();\\n\\n\\t}\\n\\n\\n\\n\\tfor(int i = 0; i < downloaders.size(); i++){\\n\\n\\t\\ttotal += downloaders[i]->getNumSuppliedUrls();\\n\\n\\t}\\n\\n\\n\\n\\tstd::string httpDownloadersStatus;\\n\\n\\tstd::string pendingDownloadsList;\\n\\n\\tint numQueuedJobs = downloaders.size() + activeDownloaders.size();\\n\\n\\n\\n\\tstd::vector<std::string> allURLs;\\n\\n\\tstd::vector<std::string> allPending;\\n\\n\\tbool reachedListMaxLen = false;\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 30,\n \"score\": 32733.58286920666\n },\n {\n \"content\": \"\\n\\nbool ofxDownloadCentral::isBusy(){\\n\\n\\treturn busy;\\n\\n}\\n\\n\\n\\n\\n\\nint ofxDownloadCentral::getNumPendingDownloads(){\\n\\n\\n\\n\\tint c = 0;\\n\\n\\tfor(int i = 0; i < downloaders.size(); i++){\\n\\n\\t\\tstd::vector<std::string> pending = downloaders[i]->pendingURLs();\\n\\n\\t\\tc+= pending.size();\\n\\n\\t}\\n\\n\\treturn c;\\n\\n}\\n\\n\\n\\n\\n\\nint ofxDownloadCentral::getNumActiveDownloads(){\\n\\n\\treturn activeDownloaders.size();\\n\\n}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 31,\n \"score\": 32733.57609124429\n },\n {\n \"content\": \"\\t}\\n\\n\\tif(printingList) pendingDownloadsList += \\\"//////////////////////////////////////////////////////////////////\\\";\\n\\n\\n\\n\\tfloat elapsedTime = ofGetElapsedTimef() - downloadStartTime;\\n\\n\\tfloat timeLeft = 0.0f;\\n\\n\\tint numProcessed = downloadStartJobsNumber - numQueuedJobs;\\n\\n\\tint numFailed = failedJobsSoFar - failedJobsStartNumber;\\n\\n\\tstd::string estFinish;\\n\\n\\tif (numProcessed > 0){\\n\\n\\t\\ttimeLeft = numQueuedJobs * elapsedTime / float(numProcessed);\\n\\n\\t\\tPoco::Timespan timeToAdd;\\n\\n\\t\\ttimeToAdd.assign(timeLeft, 0);\\n\\n\\t\\tstd::string timeFormat = \\\"%H:%M on %w %e, %b %Y\\\";\\n\\n\\t\\tPoco::LocalDateTime now;\\n\\n\\t\\tnow += timeToAdd;\\n\\n\\t\\testFinish = Poco::DateTimeFormatter::format(now, timeFormat);\\n\\n\\t}\\n\\n\\tfloat avg = 0;\\n\\n\\tfor(int i = 0; i < activeDownloaders.size(); i++){\\n\\n\\t\\tavg += avgSpeed[i];\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 32,\n \"score\": 32733.56070081176\n },\n {\n \"content\": \"\\n\\n\\n\\nvoid ofxDownloadCentral::setSpeedLimit(float KB_per_sec){\\n\\n\\tspeedLimit = KB_per_sec;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::setTimeOut(float timeoutSecs){\\n\\n\\ttimeOut = timeoutSecs;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c){\\n\\n\\tproxyConfig = c;\\n\\n}\\n\\n\\n\\nvoid ofxDownloadCentral::setCredentials(const std::string& user, const std::string& password){\\n\\n\\tcredentials.first = user;\\n\\n\\tcredentials.second = password;\\n\\n}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 33,\n \"score\": 32733.14243680849\n },\n {\n \"content\": \"\\n\\n\\t\\thttp.setMaxQueueLength(originalUrlList.size() * 2); //just in case\\n\\n\\n\\n\\t\\tfor(int i = 0; i < originalUrlList.size(); i++){\\n\\n\\t\\t\\tstd::string sha = \\\"\\\";\\n\\n\\t\\t\\tif (originalChecksumList.size()){\\n\\n\\t\\t\\t\\tsha = originalChecksumList[i];\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\thttp.fetchURLToDisk(originalUrlList[i], sha, true, downloadFolder);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\n//this might or might not be called from the main thread! depending on the ofxSimpleHttp config\\n\\nvoid ofxBatchDownloader::httpResult(ofxSimpleHttpResponse &r){\\n\\n\\n\\n\\t//int index = okList.size() + failedList.size();\\n\\n\\n\\n\\tresponses.push_back(r);\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 34,\n \"score\": 32733.075649170092\n },\n {\n \"content\": \"\\n\\nvoid ofxBatchDownloader::setChecksumType(ofxChecksum::Type t){\\n\\n\\tchecksumType = t;\\n\\n\\thttp.setChecksumType(t);\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::setNeedsChecksumMatchToSkipDownload(bool needsChecksum){\\n\\n\\thttp.setNeedsChecksumMatchToSkipDownload(needsChecksum); \\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::setCopyBufferSize(float bufferSizeKb){\\n\\n\\thttp.setCopyBufferSize(bufferSizeKb);\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::setIdleTimeAfterEachDownload(float seconds){\\n\\n\\thttp.setIdleTimeAfterEachDownload( seconds );\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxBatchDownloader::setProxyConfiguration(const ofxSimpleHttp::ProxyConfig & c){\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 35,\n \"score\": 32732.224105431316\n },\n {\n \"content\": \"\\t\\t\\tbd->startDownloading();\\n\\n\\t\\t\\tactiveDownloaders.push_back(bd);\\n\\n\\t\\t\\tdownloaders.erase(downloaders.begin());\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxDownloadCentral::update(){\\n\\n\\n\\n\\tif (busy){\\n\\n\\n\\n\\t\\tfor(int i = activeDownloaders.size() - 1; i >= 0; i--){\\n\\n\\n\\n\\t\\t\\tofxBatchDownloader * bd = activeDownloaders[i];\\n\\n\\t\\t\\tbd->update();\\n\\n\\n\\n\\t\\t\\tif (!bd->isBusy()){ //this one is over! start the next one!\\n\\n\\t\\t\\t\\tif(avgSpeed[i] <= 0.001f){\\n\\n\\t\\t\\t\\t\\tavgSpeed[i] = bd->getAverageSpeed();\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 36,\n \"score\": 32731.705352226665\n },\n {\n \"content\": \"\\tint c = 0; //count how many pending urls have we printed\\n\\n\\tbool printingList = false; //are we printing a pending list?\\n\\n\\n\\n\\tif(activeDownloaders.size() > 0){\\n\\n\\n\\n\\t\\tif(!detailed) httpDownloadersStatus += \\\"\\\\n//// Active Downloaders (\\\" + ofToString(activeDownloaders.size()) + \\\") Status ///////////////////////////////\\\";\\n\\n\\n\\n\\t\\tfor(int i = 0; i < activeDownloaders.size(); i++){\\n\\n\\t\\t\\tofxBatchDownloader * bd = activeDownloaders[i];\\n\\n\\n\\n\\t\\t\\tif(!detailed){\\n\\n\\t\\t\\t\\tchar aux[5];\\n\\n\\t\\t\\t\\tsprintf(aux, \\\"%02d\\\", i);\\n\\n\\t\\t\\t\\thttpDownloadersStatus += \\\"\\\\n// (\\\" + std::string(aux) + \\\") \\\" + bd->getMinimalDrawableString();\\n\\n\\t\\t\\t\\tif(i == activeDownloaders.size() - 1) httpDownloadersStatus += \\\"\\\\n\\\\n\\\"; //last line more spce\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\thttpDownloadersStatus += bd->getDrawableString();\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\ttotal -= bd->getNumSuppliedUrls() - bd->pendingDownloads();\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 37,\n \"score\": 32731.685014754097\n },\n {\n \"content\": \"//\\n\\n// ofxDownloadCentral.cpp\\n\\n// emptyExample\\n\\n//\\n\\n// Created by Oriol Ferrer Mesià on 14/03/14.\\n\\n//\\n\\n//\\n\\n\\n\\n\\n\\n#include \\\"ofxDownloadCentral.h\\\"\\n\\n#include \\\"ofEvents.h\\\"\\n\\n#include \\\"ofEventUtils.h\\\"\\n\\n#include \\\"Poco/LocalDateTime.h\\\"\\n\\n#include \\\"Poco/DateTimeFormatter.h\\\"\\n\\n\\n\\nofxDownloadCentral::ofxDownloadCentral(){\\n\\n\\n\\n\\tverbose = true;\\n\\n\\tbusy = false;\\n\\n\\tspeedLimit = 0.0f;\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 38,\n \"score\": 32731.283698665182\n },\n {\n \"content\": \"//\\n\\n// ofxBatchDownloader.cpp\\n\\n// emptyExample\\n\\n//\\n\\n// Created by Oriol Ferrer Mesià on 14/03/14.\\n\\n//\\n\\n//\\n\\n\\n\\n\\n\\n#include \\\"ofxBatchDownloader.h\\\"\\n\\n#include \\\"ofLog.h\\\"\\n\\n\\n\\nofxBatchDownloader::ofxBatchDownloader(){\\n\\n\\tbusy = false;\\n\\n\\tdownloadFolder = \\\"_downloads_\\\";\\n\\n\\tdownloadedSoFar = 0;\\n\\n\\t//add download listener\\n\\n\\tofAddListener(http.httpResponse, this, &ofxBatchDownloader::httpResult);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 39,\n \"score\": 32730.6257801484\n },\n {\n \"content\": \"\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tavgSpeed[i] = avgSpeed[i] * 0.75 + 0.25 * bd->getAverageSpeed();\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\tdownloadedSoFar += bd->getDownloadedBytesSoFar();\\n\\n\\t\\t\\t\\tif(bd->getNumFailedUrls() > 0) failedJobsSoFar ++;\\n\\n\\t\\t\\t\\tactiveDownloaders.erase(activeDownloaders.begin() + i);\\n\\n\\t\\t\\t\\tdelete bd;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif(activeDownloaders.size() < maxConcurrentDownloads){\\n\\n\\t\\t\\tstartQueue();\\n\\n\\t\\t}\\n\\n\\t\\tif(activeDownloaders.size() == 0){\\n\\n\\t\\t\\tbusy = false;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 40,\n \"score\": 32730.570650790967\n },\n {\n \"content\": \"\\tif(!busy){\\n\\n\\n\\n\\t\\tfor(int i = 0; i < _urlList.size(); i++){\\n\\n\\t\\t\\toriginalUrlList.push_back(_urlList[i]);\\n\\n\\t\\t\\tif (_checksumList.size()){\\n\\n\\t\\t\\t\\toriginalChecksumList.push_back(_checksumList[i]);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tofLogVerbose(\\\"ofxBatchDownloader\\\") << \\\"queueing \\\" << _urlList[i] << \\\" for download\\\";\\n\\n\\t\\t}\\n\\n\\n\\n\\t}else{\\n\\n\\t\\tofLogWarning(\\\"ofxBatchDownloader\\\") << \\\"already working, wait for it to finish!\\\";\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nint ofxBatchDownloader::pendingDownloads(){\\n\\n\\treturn http.getPendingDownloads();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 41,\n \"score\": 32730.12618184844\n },\n {\n \"content\": \"\\n\\n\\t\\tif(drawAllPending){\\n\\n\\t\\t\\tprintingList = true;\\n\\n\\t\\t\\tpendingDownloadsList += \\\"//// Remaining Downloads (\\\" + ofToString(total) + \\\") /////////////////////////////////////\\\\n\\\";\\n\\n\\t\\t\\tfor(int i = 0; i < activeDownloaders.size(); i++){\\n\\n\\t\\t\\t\\tstd::vector<std::string> pending = activeDownloaders[i]->pendingURLs();\\n\\n\\t\\t\\t\\tfor(int j = 0; j < pending.size(); j++){\\n\\n\\t\\t\\t\\t\\tallPending.push_back(pending[j]);\\n\\n\\t\\t\\t\\t\\tif (c < maxURLsToList){\\n\\n\\t\\t\\t\\t\\t\\tpendingDownloadsList += \\\"// \\\" + pending[j] + \\\"\\\\n\\\";\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (c == maxURLsToList ){\\n\\n\\t\\t\\t\\t\\t\\tpendingDownloadsList += \\\"// ...\\\\n\\\";\\n\\n\\t\\t\\t\\t\\t\\treachedListMaxLen = true;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tc++;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (reachedListMaxLen) break;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 42,\n \"score\": 32730.033901927134\n },\n {\n \"content\": \"std::string ofxBatchDownloader::getDrawableString(){\\n\\n\\treturn http.drawableString();\\n\\n}\\n\\n\\n\\nstd::string ofxBatchDownloader::getMinimalDrawableString(){\\n\\n\\treturn http.minimalDrawableString();\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::addResourcesToDownloadList( std::vector<std::string> _urlList ){\\n\\n\\tstd::vector<std::string>_checksumList;\\n\\n\\taddResourcesToDownloadList(_urlList, _checksumList);\\n\\n}\\n\\n\\n\\nvoid ofxBatchDownloader::addResourcesToDownloadList( std::vector<std::string> _urlList, std::vector<std::string>_checksumList ){\\n\\n\\n\\n\\tif ( _checksumList.size() > 0 && (_urlList.size() != _checksumList.size()) ){\\n\\n\\t\\tofLogWarning(\\\"ofxBatchDownloader\\\") << \\\"addResourcesToDownloadList >> urlList & shaList element num mismatch!\\\";\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"src/ofxBatchDownloader.cpp\",\n \"rank\": 43,\n \"score\": 32729.4182222191\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tif(drawAllPending){\\n\\n\\t\\tif(downloaders.size() > 0 && !reachedListMaxLen){\\n\\n\\t\\t\\tfor(int i = 0; i < downloaders.size(); i++){\\n\\n\\t\\t\\t\\tstd::vector<std::string> pending = downloaders[i]->pendingURLs();\\n\\n\\t\\t\\t\\tfor(int j = 0; j < pending.size(); j++){\\n\\n\\t\\t\\t\\t\\tallPending.push_back(pending[j]);\\n\\n\\t\\t\\t\\t\\tif (c < maxURLsToList){\\n\\n\\t\\t\\t\\t\\t\\tpendingDownloadsList += \\\"// \\\" + pending[j] + \\\"\\\\n\\\";\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (c == maxURLsToList ){\\n\\n\\t\\t\\t\\t\\t\\tpendingDownloadsList += \\\"// ...\\\\n\\\";\\n\\n\\t\\t\\t\\t\\t\\treachedListMaxLen = true;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tc++;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (reachedListMaxLen ) break;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/ofxDownloadCentral.cpp\",\n \"rank\": 44,\n \"score\": 32729.14704623144\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofxBatchDownloader.h\\\"\\n\\n\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.h\",\n \"rank\": 45,\n \"score\": 31601.178285767488\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofxDownloadCentral.h\\\"\\n\\n\\n\",\n \"file_path\": \"example-ofxDownloadCentral/src/ofApp.h\",\n \"rank\": 46,\n \"score\": 31601.178285767488\n },\n {\n \"content\": \"\\t\\tdownloader.addResourcesToDownloadList(downloadList);\\n\\n\\t}\\n\\n\\n\\n\\tif(key==' '){\\n\\n\\t\\tdownloader.startDownloading();\\n\\n\\t}\\n\\n\\n\\n\\tif(key=='c'){\\n\\n\\t\\tdownloader.cancelBatch();\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofApp::downloadFinished(ofxBatchDownloaderReport &report){\\n\\n\\n\\n\\tcout << \\\"download Finished!\\\" << endl;\\n\\n\\tcout << report.successfulDownloads.size() << \\\" successful downloads, \\\" << report.failedDownloads.size() << \\\" failed downloads.\\\" << endl;\\n\\n\\n\\n\\tif( report.failedDownloads.size() ){\\n\\n\\t\\tcout << \\\"these downloads failed: \\\" ;\\n\\n\\t\\tfor(int i = 0; i < report.failedDownloads.size(); i++ ){\\n\\n\\t\\t\\tcout << \\\" - \\\" << report.failedDownloads[i] << endl;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n}\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.cpp\",\n \"rank\": 48,\n \"score\": 30564.050264242167\n },\n {\n \"content\": \"\\tdownloadList.push_back(\\\"http://farm4.staticflickr.com/3740/9481659071_3159d318dc_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm4.staticflickr.com/3802/9484323300_6d3a6a78b5_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm6.staticflickr.com/5346/9484309488_11ee39298e_o.jpg\\\");\\n\\n\\n\\n\\t//add download listener\\n\\n\\tofAddListener(downloader.resourcesDownloadFinished, this, &ofApp::downloadFinished);\\n\\n\\tdownloader.setDownloadFolder(\\\"tempDownloads\\\");\\n\\n\\tdownloader.setNeedsChecksumMatchToSkipDownload(true);\\n\\n\\tdownloader.setIdleTimeAfterEachDownload(0.2);\\n\\n\\tdownloader.setVerbose(false);\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofApp::update(){\\n\\n\\n\\n\\tdownloader.update();\\n\\n}\\n\\n\\n\\nvoid ofApp::draw(){\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.cpp\",\n \"rank\": 51,\n \"score\": 30547.897353960307\n },\n {\n \"content\": \"#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofApp.h\\\"\\n\\n#include \\\"ofAppGLFWWindow.h\\\"\\n\\n\\n\\n//========================================================================\\n\\nint main( ){\\n\\n\\tofAppGLFWWindow win;\\n\\n\\t//win.setNumSamples(8);\\n\\n\\t//win.setOrientation(OF_ORIENTATION_90_LEFT);\\n\\n\\t//win.setMultiDisplayFullscreen(true);\\n\\n\\t//win.set\\n\\n\\n\\n\\tofSetupOpenGL(&win, 800,500, OF_WINDOW);\\t// <-------- setup the GL context\\n\\n\\n\\n\\t// this kicks off the running of my app\\n\\n\\t// can be OF_WINDOW or OF_FULLSCREEN\\n\\n\\t// pass in width and height too:\\n\\n\\tofRunApp(new ofApp());\\n\\n\\n\\n}\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/main.cpp\",\n \"rank\": 53,\n \"score\": 30544.869845725585\n },\n {\n \"content\": \"#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofApp.h\\\"\\n\\n#include \\\"ofAppGLFWWindow.h\\\"\\n\\n\\n\\n//========================================================================\\n\\nint main( ){\\n\\n\\tofAppGLFWWindow win;\\n\\n\\t//win.setNumSamples(8);\\n\\n\\t//win.setOrientation(OF_ORIENTATION_90_LEFT);\\n\\n\\t//win.setMultiDisplayFullscreen(true);\\n\\n\\t//win.set\\n\\n\\n\\n\\tofSetupOpenGL(&win, 800,600, OF_WINDOW);\\t// <-------- setup the GL context\\n\\n\\n\\n\\t// this kicks off the running of my app\\n\\n\\t// can be OF_WINDOW or OF_FULLSCREEN\\n\\n\\t// pass in width and height too:\\n\\n\\tofRunApp(new ofApp());\\n\\n\\n\\n}\\n\",\n \"file_path\": \"example-ofxDownloadCentral/src/main.cpp\",\n \"rank\": 54,\n \"score\": 30544.869845725585\n },\n {\n \"content\": \"\\n\\n\\tdownloader.draw(30,30);\\n\\n\\tofSetColor(255);\\n\\n\\n\\n\\t//clock hand to see threading in action\\n\\n\\tofPushMatrix();\\n\\n\\n\\n\\tofTranslate(ofGetWidth() - 60,60, 0);\\n\\n\\tofRotate( ofGetFrameNum() * 3, 0,0,1);\\n\\n ofSetColor(255,255,255);\\n\\n\\tfloat h = 5;\\n\\n\\tofRect(-h/2,h/2, h,50);\\n\\n\\n\\n\\tofPopMatrix();\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofApp::keyPressed(int key){\\n\\n\\n\\n\\tif(key=='a'){\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.cpp\",\n \"rank\": 56,\n \"score\": 30544.31603142723\n },\n {\n \"content\": \"#include \\\"ofApp.h\\\"\\n\\n\\n\\n\\n\\n\\n\\nvoid ofApp::setup(){\\n\\n\\n\\n\\tofSetFrameRate(63);\\n\\n\\tofSetVerticalSync(true);\\n\\n\\tofEnableAlphaBlending();\\n\\n\\tofBackground(22);\\n\\n\\tofSetWindowPosition(20, 20);\\n\\n\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7420/10032530563_86ff701d19_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm4.staticflickr.com/3686/9225463176_d0bf83a992_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7255/6888724266_158ce261a2_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7047/7034809565_5f80871bff_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7438/9481688475_e83f92e8b5_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7321/9481647489_e73bed28e1_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm8.staticflickr.com/7367/9484432454_9701453c66_o.jpg\\\");\\n\\n\\tdownloadList.push_back(\\\"http://farm6.staticflickr.com/5537/9481654243_7b73b87ceb_o.jpg\\\");\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.cpp\",\n \"rank\": 59,\n \"score\": 30542.265752999632\n },\n {\n \"content\": \"class ofApp : public ofBaseApp{\\n\\n\\n\\npublic:\\n\\n\\n\\n\\tvoid setup();\\n\\n\\tvoid update();\\n\\n\\tvoid draw();\\n\\n\\tvoid keyPressed(int key);\\n\\n\\tvoid drawClock();\\n\\n\\n\\n\\t//download ready callback\\n\\n\\tvoid downloadFinished(ofxBatchDownloaderReport &report);\\n\\n\\n\\n\\tofxDownloadCentral downloader;\\n\\n\\n\\n};\\n\",\n \"file_path\": \"example-ofxDownloadCentral/src/ofApp.h\",\n \"rank\": 60,\n \"score\": 27760.162258016055\n },\n {\n \"content\": \"class ofApp : public ofBaseApp{\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid setup();\\n\\n\\t\\tvoid update();\\n\\n\\t\\tvoid draw();\\n\\n\\n\\n\\t\\tvoid keyPressed(int key);\\n\\n\\n\\n\\t\\tfloat p1;\\n\\n\\t\\tbool timeSample;\\n\\n\\n\\n\\t\\tvoid downloadFinished(ofxBatchDownloaderReport &report);\\n\\n\\n\\n\\t\\tofxBatchDownloader downloader;\\n\\n\\t\\tvector<string> downloadList;\\n\\n\\n\\n};\\n\",\n \"file_path\": \"example-ofxBatchDownloader/src/ofApp.h\",\n \"rank\": 61,\n \"score\": 27760.162258016055\n },\n {\n \"content\": \"\\t\\tvoid \\t\\t\\t\\t\\tsetProxyConfiguration(const ProxyConfig & c);\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetTimeOut(int seconds);\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetUserAgent(std::string newUserAgent );\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetCredentials(std::string username, std::string password);\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetMaxQueueLength(int len);\\n\\n\\t\\tvoid \\t\\t\\t\\t\\tsetCopyBufferSize(float KB); /*in KiloBytes (1 -> 1024 bytes)*/\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetIdleTimeAfterEachDownload(float seconds); //wait a bit before notifying once the dowload is over\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetChecksumType(ofxChecksum::Type); //when you supply a checksum to compare a downloaded file against, what type will it be?\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetCancelCurrentDownloadOnDestruction(bool doIt);\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetCancelPendingDownloadsOnDestruction(bool cancelAll);\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\taddCustomHttpHeader(std::string headerName, std::string headerContent);\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetNotifyFromMainThread(bool mainThread);\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//if a download is requested and file already exists on disk,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//do we require a checksum match to assume the file is good?\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//ie, if the user doesnt provide a checksum, what do we do?\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetNeedsChecksumMatchToSkipDownload(bool needs);\\n\",\n \"file_path\": \"src/ofxSimpleHttp.h\",\n \"rank\": 62,\n \"score\": 15.959096642740676\n },\n {\n \"content\": \"\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofApp::newResponse(ofxSimpleHttpResponse &r){\\n\\n\\n\\n\\tcout << \\\"#########################################################\\\" << endl;\\n\\n\\tcout << \\\"download of \\\" << r.url << \\\" returned : \\\"<< string(r.ok ? \\\"OK\\\" : \\\"KO\\\") << endl;\\n\\n\\tcout << \\\"server reported size is \\\" << r.serverReportedSize << endl;\\n\\n\\tcout << \\\"server status is \\\" << r.status << endl;\\n\\n\\tcout << \\\"file content type is \\\" << r.contentType << endl;\\n\\n\\tcout << \\\"file name is \\\" << r.fileName << endl;\\n\\n\\n\\n\\tif(r.downloadToDisk){\\n\\n\\t\\tcout << \\\"file was saved to \\\" << r.absolutePath << endl;\\n\\n\\n\\n\\t\\t//move the file to wherever you need..\\n\\n\\t\\tofDirectory dir;\\n\\n\\t\\tdir.createDirectory(\\\"mySortedDownloads\\\");\\n\\n\\n\",\n \"file_path\": \"example-ofxSimpleHttp/src/ofApp.cpp\",\n \"rank\": 63,\n \"score\": 13.69333162671093\n },\n {\n \"content\": \"\\n\\nvoid ofxSimpleHttp::setCopyBufferSize(float KB){\\n\\n\\tCOPY_BUFFER_SIZE = KB * 1024;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setCancelCurrentDownloadOnDestruction(bool doIt){\\n\\n\\tcancelCurrentDownloadOnDestruction = doIt;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setCancelPendingDownloadsOnDestruction(bool cancelAll){\\n\\n\\tflushPendingRequestsOnDestruction = cancelAll;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setIdleTimeAfterEachDownload(float seconds){\\n\\n\\tidleTimeAfterEachDownload = seconds;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setNotifyFromMainThread(bool mainThread){\\n\\n\\tnotifyFromMainThread = mainThread;\\n\\n}\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 64,\n \"score\": 13.485707905891402\n },\n {\n \"content\": \"\\n\\nvoid ofxSimpleHttp::setNeedsChecksumMatchToSkipDownload(bool needs){\\n\\n\\tonlySkipDownloadIfChecksumMatches = needs;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setTimeOut(int seconds){\\n\\n\\ttimeOut = seconds;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setChecksumType(ofxChecksum::Type type){\\n\\n\\tchecksumType = type;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setUserAgent( std::string newUserAgent ){\\n\\n\\tuserAgent = newUserAgent;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setCredentials(std::string username, std::string password){\\n\\n\\tif(username.size() || password.size()){\\n\\n\\t\\tcredentials.setUsername(username);\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 65,\n \"score\": 12.508794549124636\n },\n {\n \"content\": \"\\t\\t\\t\\tss << \\\" Avg Download Speed: \\\" << (serverReportedSize / 1024.f) / timeTakenToDownload << \\\"Kb/sec\\\" << endl;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(downloadToDisk){\\n\\n\\t\\t\\t\\tss << \\\" File Saved at: \\\" << absolutePath << endl;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tss << \\\" Download FAILED! \\\" << endl;\\n\\n\\t\\tss << \\\" Status: \\\" << status << \\\" - \\\" << reasonForStatus << endl;\\n\\n\\t}\\n\\n\\treturn ss.str();\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttpResponse::print(){\\n\\n\\tif (ok){\\n\\n\\t\\tofLogNotice(\\\"ofxSimpleHttpResponse\\\") << toString();\\n\\n\\t}else{\\n\\n\\t\\tofLogError(\\\"ofxSimpleHttpResponse\\\") << toString();\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 66,\n \"score\": 11.482966736445887\n },\n {\n \"content\": \"\\t\\tvoid\\t\\t\\t\\t\\t\\tupdate(); //this is mainly used to get notifications in the main thread\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tdraw(float x, float y , float w , float h);\\t//draws a box\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tdraw(float x, float y);\\t//draws a box\\n\\n\\t\\tstd::string\\t\\t\\t\\tdrawableString(int urlLen = 0);\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tdrawMinimal(float x, float y,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbool withBg = false,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tofColor fontColor = ofColor::white,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tofColor bgColor = ofColor::black);\\t//draws a one-line status\\n\\n\\t\\tstd::string\\t\\t\\t\\tminimalDrawableString();\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tstopCurrentDownload(bool emptyQueue); //if there's more downloads on queue, next will start immediatelly\\n\\n\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\tgetPendingDownloads();\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tgetCurrentDownloadProgress();\\t//retuns [0..1] how complete is the download\\n\\n\\t\\tstd::string\\t\\t\\t\\tgetCurrentDownloadFileName();\\t//only while downloading\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tgetAvgDownloadSpeed();\\t\\t\\t// bytes/sec - also when not download\\n\\n\\n\\n\\t\\t// properties //////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"src/ofxSimpleHttp.h\",\n \"rank\": 67,\n \"score\": 10.70248225640561\n },\n {\n \"content\": \"\\t\\tstatic std::string\\t\\textractFileFromUrl(const std::string & url);\\n\\n\\t\\tstatic std::string\\t\\textractExtensionFromFileName(const std::string& fileName);\\n\\n\\t\\tstatic std::string\\t\\tgetFileSystemSafeString(const std::string & input);\\n\\n\\n\\n\\tprotected:\\n\\n\\n\\n\\t\\tbool downloadURL( ofxSimpleHttpResponse * resp, bool sendResultThroughEvents, bool beingCalledFromMainThread, bool saveToDisk );\\n\\n\\t\\tvoid threadedFunction();\\t//the queue runs here\\n\\n\\n\\n\\t\\tofxChecksum::Type \\t\\tchecksumType = ofxChecksum::Type::SHA1;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\tnotifyFromMainThread;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\tonlySkipDownloadIfChecksumMatches;\\n\\n\\n\\n\\t\\tbool \\t\\t\\t\\t\\tsilent = false; //if true, no ofLog calls\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\ttimeOut;\\n\\n\\t\\tstd::string\\t\\t\\t\\tuserAgent;\\n\\n\\t\\tstd::string\\t\\t\\t\\tacceptString;\\n\\n\\t\\tstd::queue<ofxSimpleHttpResponse*>\\tq;\\t\\t//the pending requests\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\ttimeToStop;\\n\\n\\t\\tint\\t\\t\\t\\t\\t\\tqueueLenEstimation;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.h\",\n \"rank\": 68,\n \"score\": 9.941185579171977\n },\n {\n \"content\": \"\\t\\tint\\t\\t\\t\\t\\t\\tmaxQueueLen;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tidleTimeAfterEachDownload;\\t//seconds\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tavgDownloadSpeed;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\tcancelCurrentDownloadOnDestruction;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\tflushPendingRequestsOnDestruction;\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tspeedLimit; //in KiloBytes / sec\\n\\n\\t\\tofxSimpleHttpResponse\\t\\tresponse; //used by blocking fetch() methods\\n\\n\\n\\n\\t\\tProxyConfig\\t\\t\\t\\tproxyConfig;\\n\\n\\t\\tbool\\t\\t\\t\\t\\t\\tuseCredentials;\\n\\n\\t\\tPoco::Net::HTTPBasicCredentials\\t\\tcredentials;\\n\\n\\n\\n\\t\\tstd::queue<ofxSimpleHttpResponse>\\t\\tresponsesPendingNotification; //we store here downloads that arrived so that we can notify from main thread\\n\\n\\t\\tstd::map<std::string, std::string> \\tcustomHttpHeaders;\\n\\n\\n\\n\\t\\tstatic \\t\\t\\t\\t\\tPoco::Net::Context::Ptr pContext;\\n\\n\\t\\tint \\t\\t\\t\\t\\t\\tCOPY_BUFFER_SIZE;\\n\\n\\t\\tfloat \\t\\t\\t\\t\\tavgSpeedNow;\\n\\n\\n\\n\\t\\tstd::streamsize streamCopyWithProgress(std::istream & in, std::ostream & out, std::streamsize totalBytes,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t std::streamsize ¤tBytes, bool & speedSampled,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t float & progress, float &speed, const bool &shouldCancel);\\n\\n\\n\\n\\n\\n};\\n\",\n \"file_path\": \"src/ofxSimpleHttp.h\",\n \"rank\": 69,\n \"score\": 9.650169814469969\n },\n {\n \"content\": \"\\tlock();\\n\\n\\tint n = q.size();\\n\\n\\tif ( isThreadRunning() && n > 0){\\n\\n\\t\\tofxSimpleHttpResponse * r = q.front();\\n\\n\\t\\tif (!r->downloadCanceled){ //dont cancel it twice!\\n\\n\\t\\t\\tif(!silent) ofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"stopCurrentDownload() >> about to stop download of \\\" + r->fileName + \\\" ...\\\";\\n\\n\\t\\t\\ttry{\\n\\n\\t\\t\\t\\tr->emptyWholeQueue = emptyQueue;\\n\\n\\t\\t\\t\\tr->downloadCanceled = true;\\n\\n\\t\\t\\t}catch(Exception& exc){\\n\\n\\t\\t\\t\\tofLogError(\\\"ofxSimpleHttp\\\") << \\\"stopCurrentDownload(\\\" << r->fileName << \\\") >> Exception: \\\" << exc.displayText() ;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tunlock();\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 70,\n \"score\": 8.059714792501683\n },\n {\n \"content\": \"\\t\\tofFile f;\\n\\n\\t\\tf.open( r.absolutePath );\\n\\n\\t\\tif( f.exists() ){\\n\\n\\t\\t\\tf.moveTo(\\\"mySortedDownloads/\\\" + r.fileName);\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tcout << \\\"file was not downloaded???!\\\" << r.absolutePath << endl;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid ofApp::exit(){\\n\\n\\tofxSimpleHttp::destroySslContext();\\n\\n}\\n\",\n \"file_path\": \"example-ofxSimpleHttp/src/ofApp.cpp\",\n \"rank\": 71,\n \"score\": 7.985005384174773\n },\n {\n \"content\": \"\\tif(customField.size()) ss << \\\"CustomField: \\\" << customField << endl;\\n\\n\\tif (ok){\\n\\n\\t\\tif (fileWasHere){\\n\\n\\t\\t\\tss << \\\" File was already on disk, no download needed!\\\" << endl;\\n\\n\\t\\t\\tif (expectedChecksum.size()){\\n\\n\\t\\t\\t\\tss << \\\" File checksum \\\" << expectedChecksum << \\\" matched!\\\" << endl;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tss << \\\" File checksum not supplied, assuming file is the same blindly\\\" << endl;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tss << \\\" File saved at: \\\" << absolutePath << endl;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tss << \\\" Server Status: \\\" << status << endl;\\n\\n\\t\\t\\tss << \\\" Server Reported size: \\\" << serverReportedSize << endl;\\n\\n\\t\\t\\tss << \\\" Content Type: \\\" << contentType << endl;\\n\\n\\t\\t\\tif(expectedChecksum.length()){\\n\\n\\t\\t\\t\\tss << \\\" Expected Checksum: \\\" << expectedChecksum << endl;\\n\\n\\t\\t\\t\\tss << \\\" Checksum Match: \\\" << std::string(checksumOK ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tss << \\\" Download Time taken: \\\" << timeTakenToDownload << \\\" seconds\\\" << endl;\\n\\n\\t\\t\\tif (serverReportedSize != -1){\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 72,\n \"score\": 7.783833323103924\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tif(key=='6'){\\n\\n\\t\\thttp.setUserAgent(\\\"My Fake Browser\\\"); //github api requires User Agent string\\n\\n\\t\\tofxSimpleHttpResponse res = http.fetchURLBlocking(\\\"https://api.github.com/users/armadillu/events\\\");\\n\\n\\t\\tcout << res.responseBody << endl;\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\tif(key=='7'){ //also supports file:// urls for local filesystem\\n\\n\\t\\thttp.fetchURLToDisk(\\\"file:///System/Library/Fonts/Optima.ttc\\\", true, OUTPUT_DIRECTORY );\\n\\n\\t}\\n\\n\\n\\n\\tif(key=='c'){\\n\\n\\t\\thttp.stopCurrentDownload(false);\\n\\n\\t}\\n\\n\\n\\n\\tif(key=='C'){\\n\\n\\t\\thttp.stopCurrentDownload(true);\\n\\n\\t}\\n\",\n \"file_path\": \"example-ofxSimpleHttp/src/ofApp.cpp\",\n \"rank\": 73,\n \"score\": 7.598110873722316\n },\n {\n \"content\": \"# ofxSimpleHttp\\n\\n\\n\\n[](https://travis-ci.org/armadillu/ofxSimpleHttp)\\n\\n[](https://ci.appveyor.com/project/armadillu/ofxsimplehttp/branch/master)\\n\\n\\n\\nOpenFrameworks addon to make http downloads easy; \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n* supports http://, https:// and file://\\n\\n* threaded downloads\\n\\n* user agent customization\\n\\n* proxy support\\n\\n* custom timeouts\\n\\n* parallel downloads\\n\\n* download queues\\n\\n* cancel downloads\\n\\n* checksum checked downloads (sha1)\\n\\n* skip download if file is already there and sha1 matches\\n\\n* download reports (http status codes, download speed, total time, etc)\\n\\n* ofEvents from main thread, or bg thread if required\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"ReadMe.md\",\n \"rank\": 74,\n \"score\": 7.577868069375683\n },\n {\n \"content\": \"\\tuserAgent = \\\"ofxSimpleHttp (Poco Powered)\\\";\\n\\n\\tacceptString = \\\"\\\";\\n\\n\\tnotifyFromMainThread = true;\\n\\n\\tonlySkipDownloadIfChecksumMatches = false;\\n\\n\\tidleTimeAfterEachDownload = 0.0;\\n\\n\\tavgDownloadSpeed = 0.0f;\\n\\n\\tspeedLimit = 0.0f;\\n\\n\\tuseCredentials = false;\\n\\n\\tavgSpeedNow = 0.0f;\\n\\n}\\n\\n\\n\\n\\n\\nofxSimpleHttp::~ofxSimpleHttp(){\\n\\n\\n\\n\\tif(flushPendingRequestsOnDestruction){\\n\\n\\t\\tif(queueLenEstimation > 0 && !silent) ofLogWarning(\\\"ofxSimpleHttp\\\") << \\\"Destructor canceling pending downloads (\\\" << queueLenEstimation << \\\")\\\";\\n\\n\\t\\ttimeToStop = true;\\t//lets flag the thread so that it doesnt try access stuff while we delete things around\\n\\n\\t}\\n\\n\\n\\n\\tif(cancelCurrentDownloadOnDestruction && isThreadRunning()){\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 75,\n \"score\": 7.421857752849167\n },\n {\n \"content\": \"\\n\\n#include \\\"ofxChecksum.h\\\"\\n\\n\\n\\n#include <Poco/SHA1Engine.h>\\n\\n#include <Poco/DigestStream.h>\\n\\n\\n\\n#include \\\"../libs/xxHash/xxhash.h\\\"\\n\\n#include \\\"../libs/sha1/sha1.h\\\"\\n\\n\\n\\n//#include \\\"ofxTimeMeasurements.h\\\"\\n\\n//extern \\\"C\\\" {\\n\\n//#include \\\"sha1.h\\\"\\n\\n//}\\n\\n\\n\\n\\n\\nbool ofxChecksum::sha1(const std::string& filePath,\\n\\n\\t\\t\\t\\t\\t const std::string& sha1String,\\n\\n\\t\\t\\t\\t\\t bool verbose){\\n\\n\\tfloat t;\\n\\n\\tif(verbose){\\n\",\n \"file_path\": \"src/ofxChecksum.cpp\",\n \"rank\": 76,\n \"score\": 7.352165590270129\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\tstd::string msg = \\\"downloadURL(\\\" + resp->fileName + \\\") >> Exception at file.open: \\\" + exc.displayText();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tofLogError(\\\"ofxSimpleHttp\\\") << msg ;\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->downloadedBytes = resp->responseBody.size();\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tif(resp->timeTakenToDownload > 0.01f){\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->avgDownloadSpeed = (resp->downloadedBytes ) / resp->timeTakenToDownload; //bytes/sec\\n\\n\\t\\t\\t\\t\\t\\t\\tif(!silent) ofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"downloadURL() >> download completed - \\\\\\\"\\\" << resp->url << \\\"\\\\\\\" - avg Dl speed: \\\" <<\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tbytesToHumanReadable(resp->avgDownloadSpeed,1) << \\\" - Dl Size: \\\" << bytesToHumanReadable(resp->downloadedBytes, 1) <<\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\" - dur: \\\" << secondsToHumanReadable(resp->timeTakenToDownload, 1);\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tavgDownloadSpeed = resp->avgDownloadSpeed;\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tbool isAPI = (resp->contentType == \\\"text/json\\\" || resp->contentType == \\\"application/json;charset=UTF-8\\\");\\n\\n\\t\\t\\t\\t\\t\\tbool sizeMissmatch = resp->serverReportedSize > 0 && resp->serverReportedSize != resp->downloadedBytes;\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t//check download file size mismatch\\n\\n\\t\\t\\t\\t\\t\\tif ( sizeMissmatch && !isAPI ) {\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 77,\n \"score\": 7.2270864467157505\n },\n {\n \"content\": \"\\n\\n\\tavgDownloadSpeed = 0.95f * avgDownloadSpeed + 0.05f * avgSpeedNow;\\n\\n\\tbool done = false;\\n\\n\\n\\n\\twhile(!done){\\n\\n\\t\\tlock();\\n\\n\\t\\tint numPending = responsesPendingNotification.size();\\n\\n\\t\\tif(numPending > 0){\\n\\n\\t\\t\\tofxSimpleHttpResponse r;\\n\\n\\t\\t\\tr = responsesPendingNotification.front();\\n\\n\\t\\t\\tresponsesPendingNotification.pop();\\n\\n\\t\\t\\tunlock();\\n\\n\\t\\t\\tofNotifyEvent( httpResponse, r, this ); //we want to be able to notify from outside the lock\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tunlock();\\n\\n\\t\\t\\tdone = true;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 78,\n \"score\": 6.966809466267102\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"ofMain.h\\\"\\n\\n#include \\\"ofxSimpleHttp.h\\\"\\n\\n\\n\\n#define OUTPUT_DIRECTORY \\\"tempDownloads\\\"\\n\\n\\n\",\n \"file_path\": \"example-ofxSimpleHttp/src/ofApp.h\",\n \"rank\": 79,\n \"score\": 6.946734207385544\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\tdefault: break;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tresp->checksumOK = resp->expectedChecksum == resp->calculatedChecksum;\\n\\n\\n\\n\\t\\t\\t\\t\\tif(!resp->checksumOK){\\n\\n\\t\\t\\t\\t\\t\\tif(!silent) ofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"file:// copy OK but Checksum FAILED\\\";\\n\\n\\t\\t\\t\\t\\t\\tif(!silent) ofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"Checksum (\\\" + ofxChecksum::toString(resp->checksumType) + \\\") was meant to be: \\\\\\\"\\\" << resp->expectedChecksum << \\\"\\\\\\\" but is: \\\\\\\"\\\" << resp->calculatedChecksum<< \\\"\\\\\\\"\\\";\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\trs.close();\\n\\n\\t\\t\\t\\tok = true;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tofLogError(\\\"ofxSimpleHttp\\\") << \\\"Source File does not exist! \\\" << resp->url;\\n\\n\\t\\t\\t\\tresp->ok = false;\\n\\n\\t\\t\\t\\tresp->status = 404; //assume not found? todo!\\n\\n\\t\\t\\t\\tresp->reasonForStatus = \\\"Source File does not exist!\\\";\\n\\n\\t\\t\\t\\tresp->timeTakenToDownload = 0;\\n\\n\\t\\t\\t\\tresp->checksumOK = false;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 80,\n \"score\": 6.836213375828944\n },\n {\n \"content\": \"\\tresponse.who = this;\\n\\n\\tresponse.downloadCanceled = false;\\n\\n\\tresponse.fileName = extractFileFromUrl(url);\\n\\n\\tresponse.extension = extractExtensionFromFileName(response.fileName);\\n\\n\\tresponse.notifyOnSuccess = true;\\n\\n\\tresponse.checksumType = checksumType;\\n\\n\\tbool ok = downloadURL(&response,\\n\\n\\t\\t\\t\\t\\t\\t false/*send res through events*/,\\n\\n\\t\\t\\t\\t\\t\\t true/*beingCalledFromMainThread*/,\\n\\n\\t\\t\\t\\t\\t\\t false/*to disk*/\\n\\n\\t\\t\\t\\t\\t\\t );\\n\\n\\treturn response;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::fetchURLToDisk(std::string url, std::string expectedChecksum, bool notifyOnSuccess,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t std::string dirWhereToSave, std::string customField){\\n\\n\\n\\n\\tif (queueLenEstimation >= maxQueueLen){\\n\\n\\t\\tofLogError(\\\"ofxSimpleHttp\\\") << \\\"fetchURL can't do that, queue is too long already (\\\" << queueLenEstimation << \\\")!\\\";\\n\\n\\t\\treturn;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 81,\n \"score\": 6.796075060572505\n },\n {\n \"content\": \"\\t\\tcredentials.setPassword(password);\\n\\n\\t\\tuseCredentials = true;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::setMaxQueueLength(int len){\\n\\n\\tmaxQueueLen = len;\\n\\n}\\n\\n\\n\\nvoid ofxSimpleHttp::addCustomHttpHeader(std::string headerName, std::string headerContent){\\n\\n\\tcustomHttpHeaders[headerName] = headerContent;\\n\\n}\\n\\n\\n\\nstd::string ofxSimpleHttp::getCurrentDownloadFileName(){\\n\\n\\n\\n\\tstd::string download = \\\"\\\";\\n\\n\\tlock();\\n\\n\\tint n = q.size();\\n\\n\\tif ( isThreadRunning() && n > 0 ){\\n\\n\\t\\tofxSimpleHttpResponse * r = q.front();\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 82,\n \"score\": 6.781688795830549\n },\n {\n \"content\": \"\\n\\n\\t\\t\\t\\tif (notifyFromMainThread){ //user wants to get notified form main thread, we need to enqueue the notification\\n\\n\\t\\t\\t\\t\\tif (timeToStop == false){\\t//see if we have been destructed! dont forward events if so\\n\\n\\t\\t\\t\\t\\t\\tlock();\\n\\n\\t\\t\\t\\t\\t\\tofxSimpleHttpResponse tempCopy = *resp;\\n\\n\\t\\t\\t\\t\\t\\tresponsesPendingNotification.push(tempCopy);\\n\\n\\t\\t\\t\\t\\t\\tunlock();\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{ //user doesnt care about main thread, the notificaiton can come from bg thread so we do it from here\\n\\n\\t\\t\\t\\t\\tofNotifyEvent( httpResponse, *resp, this );\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\treturn ok;\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofxSimpleHttp::update(){\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 83,\n \"score\": 6.764506565490649\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\t\\\"press '6' call an https based API, print result on console\\\\n\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"press '7' to download (copy) a local file (file:// url)\\\\n\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"press 'c' to cancel current download\\\\n\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"press 'C' to cancel current download and empty queue\\\",\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t20,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tofGetHeight() - 133\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t);\\n\\n\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\nvoid ofApp::keyPressed(int key){\\n\\n\\n\\n\\n\\n\\tif(key=='1'){\\n\\n\\t\\tstring url = downloadList[floor(ofRandom(downloadList.size()))];\\n\\n\\t\\thttp.fetchURLToDisk(url , true/*notify when done*/, OUTPUT_DIRECTORY);\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"example-ofxSimpleHttp/src/ofApp.cpp\",\n \"rank\": 84,\n \"score\": 6.7586984327252955\n },\n {\n \"content\": \"\\t\\tvoid\\t\\t\\t\\t\\t\\tsetSpeedLimit(float KB_per_sec);\\n\\n\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tsetSilent(bool noLogging);\\n\\n\\n\\n\\n\\n\\t\\tofEvent<ofxSimpleHttpResponse> httpResponse;\\n\\n\\n\\n\\t\\t// https support //////////////////////////////////////////////////////////////\\n\\n\\n\\n\\t\\t//call once, before any https connection is made\\n\\n\\t\\tstatic void \\t\\t\\t\\tcreateSslContext(Poco::Net::Context::Usage = Poco::Net::Context::CLIENT_USE,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t Poco::Net::Context::VerificationMode verMode = Poco::Net::Context::VERIFY_NONE);\\n\\n\\n\\n\\t\\tstatic void \\t\\t\\t\\tdestroySslContext(); //call once when no longer need https, once all trasnfers are finished\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//or just b4 app exit\\n\\n\\n\\n\\t\\t// STATIC Utility Methods ////////////////////////////////////////////////////////\\n\\n\\n\\n\\t\\tstatic std::string\\t\\tbytesToHumanReadable(long long bytes, int decimalPrecision);\\n\\n\\t\\tstatic std::string\\t\\tsecondsToHumanReadable(float sec, int decimalPrecision);\\n\",\n \"file_path\": \"src/ofxSimpleHttp.h\",\n \"rank\": 85,\n \"score\": 6.727509105310984\n },\n {\n \"content\": \"\\n\\n\\t\\t\\t\\t\\tstd::ostringstream output;\\n\\n\\t\\t\\t\\t\\tstreamCopyWithProgress(rs, output, resp->serverReportedSize, resp->downloadedSoFar, resp->chunkTested,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t resp->downloadProgress, resp->downloadSpeed, resp->downloadCanceled);\\n\\n\\t\\t\\t\\t\\tresp->responseBody = output.str();\\n\\n\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tresp->ok = true;\\n\\n\\t\\t\\t\\tresp->status = 200;\\n\\n\\t\\t\\t\\tresp->timeTakenToDownload = ofGetElapsedTimef() - resp->timeDowloadStarted;\\n\\n\\t\\t\\t\\tresp->downloadedBytes = resp->serverReportedSize;\\n\\n\\n\\n\\t\\t\\t\\tif (resp->expectedChecksum.length() > 0){\\n\\n\\t\\t\\t\\t\\tswitch(resp->checksumType){\\n\\n\\t\\t\\t\\t\\t\\tcase ofxChecksum::Type::SHA1:\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->calculatedChecksum = ofxChecksum::calcSha1(resp->absolutePath);\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t\\t\\tcase ofxChecksum::Type::XX_HASH:\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->calculatedChecksum = ofxChecksum::xxHash(resp->absolutePath);\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 86,\n \"score\": 6.604623383427125\n },\n {\n \"content\": \"\\t\\t\\tofStringReplace(srcFilePath, \\\"\\\\\\\\\\\", \\\"/\\\"); //for windows, replace escaped backslashes\\n\\n#endif\\n\\n\\t\\t\\t//ofFile::copyFromTo(srcFile, resp->absolutePath);\\n\\n\\n\\n\\t\\t\\tofFile srcOfFile;\\n\\n\\t\\t\\tbool openOK = srcOfFile.open(ofToDataPath(srcFilePath, true), ofFile::ReadOnly);\\n\\n\\t\\t\\tresp->downloadSpeed = 0;\\n\\n\\t\\t\\tresp->downloadedBytes = 0;\\n\\n\\n\\n\\t\\t\\tif(srcOfFile.exists()){\\n\\n\\t\\t\\t\\tuint64_t size = srcOfFile.getSize();\\n\\n\\t\\t\\t\\tresp->serverReportedSize = size;\\n\\n\\t\\t\\t\\tresp->timeDowloadStarted = ofGetElapsedTimef();\\n\\n\\t\\t\\t\\tstd::ifstream rs (ofToDataPath(srcFilePath, true).c_str(), std::ifstream::binary);\\n\\n\\n\\n\\t\\t\\t\\tif(saveToDisk){\\n\\n\\t\\t\\t\\t\\tstreamCopyWithProgress(rs, myfile, resp->serverReportedSize, resp->downloadedSoFar, resp->chunkTested,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t resp->downloadProgress, resp->downloadSpeed, resp->downloadCanceled);\\n\\n\\n\\n\\t\\t\\t\\t}else{\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 87,\n \"score\": 6.582230335791583\n },\n {\n \"content\": \"\\tresponse.fileName = extractFileFromUrl(url);\\n\\n\\tresponse.extension = extractExtensionFromFileName(response.fileName);\\n\\n\\tresponse.notifyOnSuccess = true;\\n\\n\\tresponse.downloadToDisk = true;\\n\\n\\tbool ok = downloadURL(&response,\\n\\n\\t\\t\\t\\t\\t\\t false,/*send result through events*/\\n\\n\\t\\t\\t\\t\\t\\t true, /*beingCalledFromMainThread*/\\n\\n\\t\\t\\t\\t\\t\\t true/*to disk*/\\n\\n\\t\\t\\t\\t\\t\\t );\\n\\n\\treturn response;\\n\\n}\\n\\n\\n\\n\\n\\nbool ofxSimpleHttp::downloadURL(ofxSimpleHttpResponse* resp, bool sendResultThroughEvents, bool beingCalledFromMainThread, bool saveToDisk){\\n\\n\\n\\n\\tbool ok = false;\\n\\n\\tofstream myfile;\\n\\n\\tbool fileIsAlreadyHere = false;\\n\\n\\tresp->responseBody = \\\"\\\";\\n\\n\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 88,\n \"score\": 6.485477128583245\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\tcase ofxChecksum::Type::XX_HASH:\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tresp->calculatedChecksum = ofxChecksum::xxHash(resp->absolutePath);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t\\t\\t\\tdefault: break;\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tresp->checksumOK = resp->expectedChecksum == resp->calculatedChecksum;\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tif(!resp->checksumOK){\\n\\n\\t\\t\\t\\t\\t\\t\\tofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"downloaded OK but Checksum FAILED\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\tofLogNotice(\\\"ofxSimpleHttp\\\") << \\\"Checksum (\\\" + ofxChecksum::toString(resp->checksumType) + \\\") was meant to be: \\\\\\\"\\\" << resp->expectedChecksum << \\\"\\\\\\\" but is: \\\\\\\"\\\" << resp->calculatedChecksum<< \\\"\\\\\\\"\\\";\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tresp->downloadSpeed = 0;\\n\\n\\t\\t\\t\\t\\tresp->downloadedBytes = 0;\\n\\n\\n\\n\\t\\t\\t\\t\\tif (resp->downloadCanceled){\\n\\n\\t\\t\\t\\t\\t\\t//delete half-baked download file\\n\\n\\t\\t\\t\\t\\t\\tif (resp->downloadToDisk){\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 89,\n \"score\": 6.439664741979257\n },\n {\n \"content\": \"\\n\\n\\n\\nofxSimpleHttpResponse::ofxSimpleHttpResponse(){\\n\\n\\twho = NULL;\\n\\n\\tdownloadToDisk = emptyWholeQueue = false;\\n\\n\\tchecksumOK = true;\\n\\n\\tdownloadProgress = downloadSpeed = avgDownloadSpeed = downloadedBytes = 0.0f;\\n\\n\\ttimeTakenToDownload = 0.0;\\n\\n\\tserverReportedSize = -1;\\n\\n\\tdownloadedSoFar = 0;\\n\\n\\tstatus = -1;\\n\\n\\tfileWasHere = false;\\n\\n\\ttimeDowloadStarted = ofGetElapsedTimef();\\n\\n\\tchunkTested = false;\\n\\n}\\n\\n\\n\\nstd::string ofxSimpleHttpResponse::toString(){\\n\\n\\n\\n\\tstd::stringstream ss;\\n\\n\\tss << \\\"URL: \\\" << url << endl;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 90,\n \"score\": 6.429488111303279\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\tstd::string msg;\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t\\tif (resp->downloadedBytes == 0){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif (resp->timeTakenToDownload > timeOut){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmsg = \\\"downloadURLtoDiskBlocking() >> TimeOut! (\\\" + resp->fileName + \\\")\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tresp->reasonForStatus = \\\"Request TimeOut\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tresp->status = HTTPResponse::HTTP_REQUEST_TIMEOUT;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmsg = \\\"downloadURLtoDiskBlocking() >> Download file is 0 bytes (\\\" + resp->fileName + \\\")\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tresp->reasonForStatus = \\\"Download size is 0 bytes!\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tmsg = \\\"downloadURLtoDiskBlocking() >> Download size mismatch (\\\" + resp->fileName + \\\") >> Server: \\\" +\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tofToString(resp->serverReportedSize) + \\\" Downloaded: \\\" + ofToString(resp->downloadedBytes);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tresp->reasonForStatus = \\\"Download size mismatch\\\";\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t\\tif(!silent) ofLogWarning(\\\"ofxSimpleHttp\\\", msg);\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->status = -1;\\n\\n\\t\\t\\t\\t\\t\\t\\tresp->ok = false;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 91,\n \"score\": 6.399105844522036\n },\n {\n \"content\": \"\\t\\tdownload = r->fileName;\\n\\n\\t}\\n\\n\\tunlock();\\n\\n\\treturn download;\\n\\n}\\n\\n\\n\\n\\n\\nint ofxSimpleHttp::getPendingDownloads(){\\n\\n\\tlock();\\n\\n\\tqueueLenEstimation = q.size();\\n\\n\\tunlock();\\n\\n\\treturn queueLenEstimation;\\n\\n}\\n\\n\\n\\n\\n\\nfloat ofxSimpleHttp::getCurrentDownloadProgress(){\\n\\n\\n\\n\\tfloat downloadPercent = -1;\\n\\n\\tlock();\\n\\n\\tint n = q.size();\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 92,\n \"score\": 6.227563919734032\n },\n {\n \"content\": \"#include \\\"Poco/Net/HTTPRequest.h\\\"\\n\\n#include \\\"Poco/Net/HTTPResponse.h\\\"\\n\\n\\n\\n\\n\\nPoco::Net::Context::Ptr ofxSimpleHttp::pContext = NULL;\\n\\n\\n\\nusing namespace Poco::Net;\\n\\nusing namespace Poco;\\n\\nusing Poco::Exception;\\n\\nusing Poco::Net::HTTPClientSession;\\n\\n\\n\\nofxSimpleHttp::ofxSimpleHttp(){\\n\\n\\n\\n\\tCOPY_BUFFER_SIZE = 1024 * 512; // kb buffer size\\n\\n\\tcancelCurrentDownloadOnDestruction = true;\\n\\n\\tflushPendingRequestsOnDestruction = true;\\n\\n\\ttimeOut = 10;\\n\\n\\tqueueLenEstimation = 0;\\n\\n\\tmaxQueueLen = 1000;\\n\\n\\ttimeToStop = false;\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 93,\n \"score\": 6.171685937679604\n },\n {\n \"content\": \"\\t\\t\\t\\t\\tresp->ok = false;\\n\\n\\t\\t\\t\\t\\tresp->reasonForStatus = \\\"Unknown exception at streamCopy\\\";\\n\\n\\t\\t\\t\\t\\tresp->status = -1;\\n\\n\\t\\t\\t\\t\\tok = false;\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t//last check for OK flag\\n\\n\\t\\t\\t\\tif(!resp->checksumOK){\\n\\n\\t\\t\\t\\t\\tresp->ok = false;\\n\\n\\t\\t\\t\\t\\tresp->reasonForStatus += \\\" / Checksum mismatch! (\\\" + ofxChecksum::toString(resp->checksumType) + \\\")\\\";\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t}catch(Exception& exc){\\n\\n\\n\\n\\t\\t\\t\\tif (session) session->reset();\\n\\n\\t\\t\\t\\tmyfile.close();\\n\\n\\t\\t\\t\\tstd::string msg = \\\"downloadURL(\\\" + resp->fileName + \\\") >> Exception: \\\" + exc.displayText();\\n\\n\\t\\t\\t\\tresp->timeTakenToDownload = ofGetElapsedTimef() - resp->timeDowloadStarted;\\n\\n\\t\\t\\t\\tif (resp->timeTakenToDownload > timeOut){\\n\\n\\t\\t\\t\\t\\tmsg = \\\"downloadURLtoDiskBlocking() >> TimeOut! (\\\" + resp->fileName + \\\")\\\";\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 94,\n \"score\": 5.86977766135613\n },\n {\n \"content\": \"\\t\\tmsg += \\\"] \\\";\\n\\n\\t\\tmsg += std::string( r->downloadToDisk ? ofFilePath::getFileName(r->absolutePath) : \\\"\\\");\\n\\n\\t\\tmsg += \\\" (\\\" + bytesToHumanReadable((long long)r->downloadSpeed, 1) + \\\"/s\\\";\\n\\n\\t\\tif(r->serverReportedSize > 0){\\n\\n\\t\\t\\tmsg += \\\" | \\\" + bytesToHumanReadable(r->serverReportedSize, 1) + \\\" file)\\\";\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tmsg += \\\")\\\";\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tunlock();\\n\\n\\treturn msg;\\n\\n}\\n\\n\\n\\n\\n\\nstd::string ofxSimpleHttp::drawableString(int urlLen){\\n\\n\\n\\n\\tstd::string aux;\\n\\n\\tlock();\\n\\n\\tint n = q.size();\\n\\n\\tif( isThreadRunning() && n > 0 ){\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 95,\n \"score\": 5.747129308651704\n },\n {\n \"content\": \"float ofxSimpleHttp::getAvgDownloadSpeed(){\\n\\n\\treturn avgDownloadSpeed;\\n\\n}\\n\\n\\n\\n\\n\\nstd::string ofxSimpleHttp::minimalDrawableString(){\\n\\n\\n\\n\\tstd::string msg;\\n\\n\\tlock();\\n\\n\\tint n = q.size();\\n\\n\\tif( isThreadRunning() && n > 0 ){\\n\\n\\t\\tofxSimpleHttpResponse * r = q.front();\\n\\n\\t\\tchar aux[16];\\n\\n\\t\\tsprintf(aux, \\\"% 4d%%\\\", (int)(r->downloadProgress * 100.0f));\\n\\n\\t\\tmsg += std::string(aux) + \\\" [\\\";\\n\\n\\t\\tfloat barLen = 12;\\n\\n\\t\\tfloat numFill = r->downloadProgress * barLen;\\n\\n\\t\\tfor(int i = 0; i < barLen; i++){\\n\\n\\t\\t\\tmsg += std::string(i < numFill ? \\\"*\\\" : \\\" \\\");\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 96,\n \"score\": 5.719555012050627\n },\n {\n \"content\": \" SHA1_Update(context, finalcount, 8); /* Should cause a SHA1_Transform() */\\n\\n for (i = 0; i < SHA1_DIGEST_SIZE; i++) {\\n\\n digest[i] = (uint8_t)\\n\\n ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);\\n\\n }\\n\\n\\n\\n /* Wipe variables */\\n\\n i = 0;\\n\\n memset(context->buffer, 0, 64);\\n\\n memset(context->state, 0, 20);\\n\\n memset(context->count, 0, 8);\\n\\n memset(finalcount, 0, 8);\\t/* SWR */\\n\\n}\\n\\n\\n\\n//-----------------------------------------------------------------------------\\n\\n\\n\\nvoid sha1_32a ( const void * key, int len, uint32_t seed, void * out )\\n\\n{\\n\\n SHA1_CTX context;\\n\\n\\n\",\n \"file_path\": \"libs/sha1/sha1.cpp\",\n \"rank\": 97,\n \"score\": 5.655032096750761\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tresp->timeTakenToDownload = 0;\\n\\n\\t\\tok = true;\\n\\n\\t}\\n\\n\\n\\n\\t//enqueue the operation result!\\n\\n\\tif (sendResultThroughEvents ){\\n\\n\\n\\n\\t\\tif ( resp->notifyOnSuccess ){\\n\\n\\n\\n\\t\\t\\tif(idleTimeAfterEachDownload > 0.0f){\\n\\n\\t\\t\\t\\tofSleepMillis(idleTimeAfterEachDownload * 1000);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tif (beingCalledFromMainThread){ //we running on main thread, we can just snd the notif from here\\n\\n\\n\\n\\t\\t\\t\\tofNotifyEvent( httpResponse, *resp, this );\\n\\n\\n\\n\\t\\t\\t}else{ //we are running from a bg thread\\n\",\n \"file_path\": \"src/ofxSimpleHttp.cpp\",\n \"rank\": 98,\n \"score\": 5.6225075677152905\n },\n {\n \"content\": \"}\\n\\n\\n\\n\\n\\nint main(int argc, char** argv)\\n\\n{\\n\\n int k;\\n\\n SHA1_CTX context;\\n\\n uint8_t digest[20];\\n\\n char output[80];\\n\\n\\n\\n fprintf(stdout, \\\"verifying SHA-1 implementation... \\\");\\n\\n\\n\\n for (k = 0; k < 2; k++){\\n\\n SHA1_Init(&context);\\n\\n SHA1_Update(&context, (uint8_t*)test_data[k], strlen(test_data[k]));\\n\\n SHA1_Final(&context, digest);\\n\\n digest_to_hex(digest, output);\\n\\n\\n\\n if (strcmp(output, test_results[k])) {\\n\\n fprintf(stdout, \\\"FAIL\\\\n\\\");\\n\",\n \"file_path\": \"libs/sha1/sha1.cpp\",\n \"rank\": 99,\n \"score\": 5.597978025450921\n }\n]","isConversational":false}}},{"rowIdx":379,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"lizy1.kurisu/include/lizy1/impl/kurisu/BuiltInCase.hpp"},"repo_name":{"kind":"string","value":"li-zhong-yuan/lizy1.kurisu"},"commit":{"kind":"string","value":"dba9136bfc966e2e81bee2b469ae4cc3a8157ca4"},"file_code":{"kind":"string","value":"\nnamespace lizy1::kurisu::impl_K {\n template<class T> constexpr std::uint64_t fundamental_digest()\n {\n \n if constexpr(std::same_as<T, std::nullptr_t>)\n return 0x0000000000000000;\n \n if constexpr(_in<T, _P<signed char, unsigned char>>::value)\n return 0x3CFE619CFCD8B82B; \n \n if constexpr(_in<T, _P<std::int64_t, std::uint64_t>>::value)\n return 0x66128932B8AD5CC4; \n \n if constexpr(std::same_as<T, float>)\n return 0x7610A451BF5CF3B4; \n \n if constexpr(std::same_as<T, double>)\n return 0x811C5E393414342A; \n \n if constexpr(std::same_as<T, long double>)\n return 0x4B0070DF621771A5; \n }\n}\n\ntemplate<lizy1::kurisu::Nullptr T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() { return fundamental_digest<T>(); }\n\n template<class Os> static void __dump__(Os &, T const&) {}\n template<class Is> static void __load__(Is &, T &) {}\n};\n\ntemplate<lizy1::kurisu::Integral T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\nprotected:\n using bA = typename std::is_signed<T>::type; \n using bB = _in<T, type::_P<bool, char, signed char, \\\n unsigned char, std::int8_t, std::uint8_t>>; \n using tC = _C<bA::value, signed char, unsigned char>; \n using tD = _C<bA::value, std::int64_t, std::uint64_t>; \n using tE = _C<bB::value, tC, tD>; \n\npublic:\n static constexpr std::uint64_t __digest__() { return fundamental_digest<tE>(); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump_machine_bytes(os, static_cast<tE>(t)); }\n template<IStream Is> static void __load__(Is &is, T & t) { t = static_cast<T>(load_machine_bytes<tE>(is)); }\n};\n\ntemplate<lizy1::kurisu::FloatingPoint T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() { return fundamental_digest<T>(); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump_machine_bytes(os, t); }\n template<IStream Is> static void __load__(Is &is, T & t) { load_machine_bytes(is, t); }\n};\n\ntemplate<lizy1::kurisu::Enumeration T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n using U = std::underlying_type_t<T>;\n\n static constexpr std::uint64_t __digest__() { return digest<U>(); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump(os, static_cast<U>(t)); }\n template<IStream Is> static void __load__(Is &is, T & t) { t = T{ construct<U>(is) }; }\n};\n\ntemplate<lizy1::kurisu::Array T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n using U = type::_Ur<decltype(std::declval<T &>()[0])>; \n\n static constexpr std::uint64_t __digest__()\n {\n constexpr std::uint64_t feature_code = 0xDEBB5C656EBA9F75; \n constexpr std::uint64_t element_digest = digest<U>();\n constexpr std::uint64_t size = sizeof(T) / sizeof(U);\n return combine_digests({ feature_code, element_digest, size });\n }\n\n template<class Os> requires Dumpable<const U, Os> static void __dump__(Os &os, T const& t) { for(auto &x : t) dump(os, x); }\n template<class Os> requires Dumpable<U , Os> static void __dump__(Os &os, T & t) { for(auto &x : t) dump(os, x); }\n template<class Is> requires Loadable<U , Is> static void __load__(Is &is, T & t) { for(auto &x : t) load(is, x); }\n};\n\nnamespace lizy1::kurisu::impl_K {\n\n template<class Is, class... Ts> \\\n constexpr bool is_aggregate_constructible(std::tuple<Ts...> *) \\\n { return (Constructible<_Ucr<Ts>, Is> && ...); }\n\n template<class T, class Is, class... Ts> \\\n inline T construct_aggregate(Is &is, std::tuple<Ts...> *) \\\n { return T{ construct<_A<Ts>>(is)... }; }\n\n}\n\ntemplate<lizy1::kurisu::Aggregate T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() \\\n { return digest<decltype(unpack(std::declval<T &>()))>(); }\n\n template<class Os> \\\n requires requires(T const& t) { { unpack(t) } -> Dumpable<Os>; } \\\n static void __dump__(Os &os, T const& t) { dump(os, unpack(t)); }\n\n template<class Os> \\\n requires requires(T &t) { { unpack(t) } -> Dumpable<Os>; } \\\n static void __dump__(Os &os, T &t) { dump(os, unpack(t)); }\n\n template<class Is> \\\n requires requires(T &t) { { unpack(t) } -> Loadable<Is>; } \\\n static void __load__(Is &is, T &t) { load(is, unpack(t)); }\n\n template<class Is>\n requires (is_aggregate_constructible<Is>((decltype(unpack(std::declval<T &>())) *)0))\n static T __construct__(Is &is)\n {\n return construct_aggregate<T>(is, (decltype(unpack(std::declval<T &>())) *)0);\n }\n};\n"},"prefix":{"kind":"string","value":"\nnamespace lizy1::kurisu::impl_K {\n template<class T> constexpr std::uint64_t fundamental_digest()\n {\n \n if constexpr(std::same_as<T, std::nullptr_t>)\n return 0x0000000000000000;\n \n if constexpr(_in<T, _P<signed char, unsigned char>>::value)\n return 0x3CFE619CFCD8B82B; \n \n if constexpr(_in<T, _P<std::int64_t, std::uint64_t>>::value)\n return 0x66128932B8AD5CC4; \n \n if constexpr(std::same_as<T, float>)\n return 0x7610A451BF5CF3B4; \n \n if constexpr(std::same_as<T, double>)\n return 0x811C5E393414342A; \n \n if constexpr(std::same_as<T, long double>)\n return 0x4B0070DF621771A5; \n }\n}\n\ntemplate<lizy1::kurisu::Nullptr T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() { return fundamental_digest<T>(); }\n\n template<class Os> static void __dump__(Os &, T const&) {}\n template<class Is> static void __load__(Is &, T &) {}\n};\n\ntemplate<lizy1::kurisu::Integral T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\nprotected:\n using bA = typename std::is_signed<T>::type; \n using bB = _in<T, type::_P<bool, char, signed char, \\\n unsigned char, std::int8_t, std::uint8_t>>; \n using tC = _C<bA::value, signed char, unsigned char>; \n using tD = _C<bA::value, std::int64_t, std::uint64_t>; \n using tE = _C<bB::value, tC, tD>; \n\npublic:\n static constexpr std::uint64_t __digest__() { return fundamental_digest<tE>(); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump_machine_bytes(os, static_cast<tE>(t)); }\n template<IStream Is> static void __load__(Is &is, T & t) { t = static_cast<T>(load_machine_bytes<tE>(is)); }\n};\n\ntemplate<lizy1::kurisu::FloatingPoint T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() { return fundamental_digest<T>("},"suffix":{"kind":"string","value":" constexpr std::uint64_t size = sizeof(T) / sizeof(U);\n return combine_digests({ feature_code, element_digest, size });\n }\n\n template<class Os> requires Dumpable<const U, Os> static void __dump__(Os &os, T const& t) { for(auto &x : t) dump(os, x); }\n template<class Os> requires Dumpable<U , Os> static void __dump__(Os &os, T & t) { for(auto &x : t) dump(os, x); }\n template<class Is> requires Loadable<U , Is> static void __load__(Is &is, T & t) { for(auto &x : t) load(is, x); }\n};\n\nnamespace lizy1::kurisu::impl_K {\n\n template<class Is, class... Ts> \\\n constexpr bool is_aggregate_constructible(std::tuple<Ts...> *) \\\n { return (Constructible<_Ucr<Ts>, Is> && ...); }\n\n template<class T, class Is, class... Ts> \\\n inline T construct_aggregate(Is &is, std::tuple<Ts...> *) \\\n { return T{ construct<_A<Ts>>(is)... }; }\n\n}\n\ntemplate<lizy1::kurisu::Aggregate T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n static constexpr std::uint64_t __digest__() \\\n { return digest<decltype(unpack(std::declval<T &>()))>(); }\n\n template<class Os> \\\n requires requires(T const& t) { { unpack(t) } -> Dumpable<Os>; } \\\n static void __dump__(Os &os, T const& t) { dump(os, unpack(t)); }\n\n template<class Os> \\\n requires requires(T &t) { { unpack(t) } -> Dumpable<Os>; } \\\n static void __dump__(Os &os, T &t) { dump(os, unpack(t)); }\n\n template<class Is> \\\n requires requires(T &t) { { unpack(t) } -> Loadable<Is>; } \\\n static void __load__(Is &is, T &t) { load(is, unpack(t)); }\n\n template<class Is>\n requires (is_aggregate_constructible<Is>((decltype(unpack(std::declval<T &>())) *)0))\n static T __construct__(Is &is)\n {\n return construct_aggregate<T>(is, (decltype(unpack(std::declval<T &>())) *)0);\n }\n};\n"},"middle":{"kind":"string","value":"); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump_machine_bytes(os, t); }\n template<IStream Is> static void __load__(Is &is, T & t) { load_machine_bytes(is, t); }\n};\n\ntemplate<lizy1::kurisu::Enumeration T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n using U = std::underlying_type_t<T>;\n\n static constexpr std::uint64_t __digest__() { return digest<U>(); }\n\n template<OStream Os> static void __dump__(Os &os, T const& t) { dump(os, static_cast<U>(t)); }\n template<IStream Is> static void __load__(Is &is, T & t) { t = T{ construct<U>(is) }; }\n};\n\ntemplate<lizy1::kurisu::Array T> struct lizy1::kurisu::impl_K::BuiltInCase<T>\n{\n using U = type::_Ur<decltype(std::declval<T &>()[0])>; \n\n static constexpr std::uint64_t __digest__()\n {\n constexpr std::uint64_t feature_code = 0xDEBB5C656EBA9F75; \n constexpr std::uint64_t element_digest = digest<U>();\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":380,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"ttk/core/vtk/ttkFiberSurface/ttkFiberSurface.cpp"},"repo_name":{"kind":"string","value":"julesvidal/wasserstein-pd-barycenter"},"commit":{"kind":"string","value":"1f62a5e1c40700030357b2bfb9a2f86fe4736861"},"file_code":{"kind":"string","value":"#include <ttkFiberSurface.h>\n\nusing namespace std;\nusing namespace ttk;\n\nvtkStandardNewMacro(ttkFiberSurface)\n\nttkFiberSurface::ttkFiberSurface(){\n UseAllCores = true;\n RangeCoordinates = true;\n EdgeParameterization = true;\n EdgeIds = true;\n TetIds = true;\n CaseIds = true;\n PointMerge = false;\n RangeOctree = true;\n PointMergeDistanceThreshold = 0.000001;\n SetNumberOfInputPorts(2);\n}\n\nttkFiberSurface::~ttkFiberSurface(){\n}\nint ttkFiberSurface::doIt(vector<vtkDataSet *> &inputs,\n vector<vtkDataSet *> &outputs){\n \n Memory m;\n Timer t;\n \n vtkDataSet *input = inputs[0];\n vtkUnstructuredGrid *polygon = vtkUnstructuredGrid::SafeDownCast(inputs[1]);\n vtkPolyData *output = vtkPolyData::SafeDownCast(outputs[0]);\n \n vtkDataArray *dataUfield = NULL, *dataVfield = NULL,\n *polygonUfield = NULL, *polygonVfield = NULL;\n \n if(DataUcomponent.length()){\n dataUfield = input->GetPointData()->GetArray(DataUcomponent.data());\n }\n else{\n \n dataUfield = input->GetPointData()->GetArray(0);\n }\n if(!dataUfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error1: Could not find data array '\"\n << DataUcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -1;\n }\n \n if(DataVcomponent.length()){\n dataVfield = input->GetPointData()->GetArray(DataVcomponent.data());\n }\n else{\n \n dataVfield = input->GetPointData()->GetArray(0);\n }\n if(!dataVfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error2: Could not find data array '\"\n << DataVcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -2;\n }\n \n if(PolygonUcomponent.length()){\n polygonUfield = polygon->GetPointData()->GetArray(PolygonUcomponent.data());\n }\n else{\n \n polygonUfield = polygon->GetPointData()->GetArray(0);\n }\n if(!polygonUfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error3: Could not find data array '\"\n << PolygonUcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -3;\n }\n \n if(PolygonVcomponent.length()){\n polygonVfield = polygon->GetPointData()->GetArray(PolygonVcomponent.data());\n }\n else{\n \n polygonVfield = polygon->GetPointData()->GetArray(0);\n }\n if(!polygonVfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error4: Could not find data array '\"\n << PolygonVcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -4;\n }\n \n if(!((input->GetDataObjectType() == VTK_UNSTRUCTURED_GRID)\n\n ||(input->GetDataObjectType() == VTK_IMAGE_DATA))){\n\n stringstream msg;\n msg << \"[ttkFiberSurface] Error5: Unsupported VTK data-structure (\"\n << input->GetDataObjectType() << \")\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -5;\n }\n \n Triangulation *triangulation = ttkTriangulation::getTriangulation(input);\n \n if(!triangulation)\n return -1;\n triangulation->setWrapper(this);\n fiberSurface_.setupTriangulation(triangulation);\n fiberSurface_.setWrapper(this);\n outputVertexList_.clear();\n fiberSurface_.setGlobalVertexList(&outputVertexList_);\n fiberSurface_.setInputField(\n dataUfield->GetVoidPointer(0),\n dataVfield->GetVoidPointer(0));\n fiberSurface_.setPolygonEdgeNumber(polygon->GetNumberOfCells());\n threadedTriangleList_.resize(polygon->GetNumberOfCells());\n threadedVertexList_.resize(polygon->GetNumberOfCells());\n fiberSurface_.setPolygon(&inputPolygon_);\n \n fiberSurface_.setPointMerging(PointMerge);\n fiberSurface_.setPointMergingThreshold(PointMergeDistanceThreshold);\n \n#ifdef TTK_ENABLE_FIBER_SURFACE_WITH_RANGE_OCTREE\n if((!RangeOctree)\n ||(dataUfield->GetMTime() > GetMTime())\n ||(dataVfield->GetMTime() > GetMTime())){\n \n {\n stringstream msg;\n msg << \"[ttkFiberSurface] Resetting octree...\" << endl;\n dMsg(cout, msg.str(), infoMsg);\n }\n \n fiberSurface_.flushOctree();\n Modified();\n }\n#endif\n \n inputPolygon_.clear();\n \n#if !defined(_WIN32) || defined(_WIN32) && defined(VTK_USE_64BIT_IDS)\n const long long int *cellArray = polygon->GetCells()->GetPointer();\n#else\n int* pt = polygon->GetCells()->GetPointer();\n long long extra_pt = *pt;\n const long long int *cellArray = &extra_pt;\n#endif\n SimplexId cellNumber = polygon->GetNumberOfCells();\n\n SimplexId vertexId0, vertexId1;\n pair<pair<double, double>, pair<double, double> > rangeEdge;\n\n for(SimplexId i = 0; i < cellNumber; i++){\n\n vertexId0 = cellArray[3*i + 1];\n vertexId1 = cellArray[3*i + 2];\n \n rangeEdge.first.first = polygonUfield->GetTuple1(vertexId0);\n rangeEdge.first.second = polygonVfield->GetTuple1(vertexId0);\n \n rangeEdge.second.first = polygonUfield->GetTuple1(vertexId1);\n rangeEdge.second.second = polygonVfield->GetTuple1(vertexId1);\n \n inputPolygon_.push_back(rangeEdge);\n }\n \n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n threadedTriangleList_[i].clear();\n fiberSurface_.setTriangleList(i, &(threadedTriangleList_[i]));\n threadedVertexList_[i].clear();\n fiberSurface_.setVertexList(i, &(threadedVertexList_[i]));\n }\n \n#ifdef TTK_ENABLE_FIBER_SURFACE_WITH_RANGE_OCTREE\n switch(vtkTemplate2PackMacro(dataUfield->GetDataType(),\n dataVfield->GetDataType())){\n ttkTemplate2Macro({\n if (RangeOctree)\n fiberSurface_.buildOctree<VTK_T1 TTK_COMMA VTK_T2>();\n fiberSurface_.computeSurface<VTK_T1 TTK_COMMA VTK_T2>();\n });\n }\n#else\n switch(vtkTemplate2PackMacro(dataUfield->GetDataType(),\n dataVfield->GetDataType())){\n ttkTemplate2Macro(fiberSurface_.computeSurface<VTK_T1 TTK_COMMA VTK_T2>());\n }\n#endif\n \n \n \n \n \n SimplexId triangleNumber = 0;\n \n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n triangleNumber += threadedTriangleList_[i].size();\n }\n \n vtkSmartPointer<vtkPoints> outputVertexList = \n vtkSmartPointer<vtkPoints>::New();\n vtkSmartPointer<vtkDoubleArray> outputU = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkDoubleArray> outputV = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkDoubleArray> outputParameterization = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkCellArray> outputTriangleList = \n vtkSmartPointer<vtkCellArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputEdgeIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputTetIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputCaseIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n \n if(RangeCoordinates){\n outputU->SetName(DataUcomponent.data());\n outputU->SetNumberOfTuples(outputVertexList_.size());\n \n outputV->SetName(DataVcomponent.data());\n outputV->SetNumberOfTuples(outputVertexList_.size());\n }\n \n if(EdgeParameterization){\n outputParameterization->SetName(\"EdgeParameterization\");\n outputParameterization->SetNumberOfTuples(outputVertexList_.size());\n }\n \n outputVertexList->SetNumberOfPoints(outputVertexList_.size());\n output->SetPoints(outputVertexList);\n \n#ifdef TTK_ENABLE_OPENMP\n#pragma omp parallel for num_threads(threadNumber_)\n#endif\n for(SimplexId i = 0; i < (SimplexId) outputVertexList_.size(); i++){\n outputVertexList->SetPoint(i, \n outputVertexList_[i].p_[0], \n outputVertexList_[i].p_[1], \n outputVertexList_[i].p_[2]);\n if(RangeCoordinates){\n outputU->SetTuple1(i, outputVertexList_[i].uv_.first);\n outputV->SetTuple1(i, outputVertexList_[i].uv_.second);\n }\n if(EdgeParameterization){\n outputParameterization->SetTuple1(i, outputVertexList_[i].t_);\n }\n }\n if(RangeCoordinates){\n output->GetPointData()->AddArray(outputU);\n output->GetPointData()->AddArray(outputV);\n }\n else{\n output->GetPointData()->RemoveArray(DataUcomponent.data());\n output->GetPointData()->RemoveArray(DataVcomponent.data());\n }\n if(EdgeParameterization){\n output->GetPointData()->AddArray(outputParameterization);\n }\n else{\n output->GetPointData()->RemoveArray(\"EdgeParameterization\");\n }\n \n if(EdgeIds){\n outputEdgeIds->SetName(\"EdgeIds\");\n outputEdgeIds->SetNumberOfTuples(triangleNumber);\n }\n \n if(TetIds){\n outputTetIds->SetName(\"TetIds\");\n outputTetIds->SetNumberOfTuples(triangleNumber);\n }\n \n if(CaseIds){\n outputCaseIds->SetName(\"CaseIds\");\n outputCaseIds->SetNumberOfTuples(triangleNumber);\n }\n \n vtkSmartPointer<vtkIdList> idList = vtkSmartPointer<vtkIdList>::New();\n idList->SetNumberOfIds(3);\n \n triangleNumber = 0;\n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n for(SimplexId j = 0; j < (SimplexId) threadedTriangleList_[i].size(); j++){\n for(int k = 0; k < 3; k++){\n idList->SetId(k, threadedTriangleList_[i][j].vertexIds_[k]);\n }\n outputTriangleList->InsertNextCell(idList);\n if(EdgeIds){\n outputEdgeIds->SetTuple1(triangleNumber, i);\n }\n if(TetIds){\n outputTetIds->SetTuple1(triangleNumber, \n threadedTriangleList_[i][j].tetId_);\n }\n if(CaseIds){\n outputCaseIds->SetTuple1(triangleNumber,\n threadedTriangleList_[i][j].caseId_);\n }\n triangleNumber++;\n }\n }\n output->SetPolys(outputTriangleList);\n if(EdgeIds){\n output->GetCellData()->AddArray(outputEdgeIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"EdgeIds\");\n }\n if(TetIds){\n output->GetCellData()->AddArray(outputTetIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"TetIds\");\n }\n if(CaseIds){\n output->GetCellData()->AddArray(outputCaseIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"CaseIds\");\n }\n \n {\n stringstream msg;\n msg << \"[ttkFiberSurface] Memory usage: \" << m.getElapsedUsage() \n << \" MB.\" << endl;\n dMsg(cout, msg.str(), memoryMsg);\n }\n \n return 0;\n}\n"},"prefix":{"kind":"string","value":"#include <ttkFiberSurface.h>\n\nusing namespace std;\nusing namespace ttk;\n\nvtkStandardNewMacro(ttkFiberSurface)\n\nttkFiberSurface::ttkFiberSurface(){\n UseAllCores = true;\n RangeCoordinates = true;\n EdgeParameterization = true;\n EdgeIds = true;\n TetIds = true;\n CaseIds = "},"suffix":{"kind":"string","value":"\n\nttkFiberSurface::~ttkFiberSurface(){\n}\nint ttkFiberSurface::doIt(vector<vtkDataSet *> &inputs,\n vector<vtkDataSet *> &outputs){\n \n Memory m;\n Timer t;\n \n vtkDataSet *input = inputs[0];\n vtkUnstructuredGrid *polygon = vtkUnstructuredGrid::SafeDownCast(inputs[1]);\n vtkPolyData *output = vtkPolyData::SafeDownCast(outputs[0]);\n \n vtkDataArray *dataUfield = NULL, *dataVfield = NULL,\n *polygonUfield = NULL, *polygonVfield = NULL;\n \n if(DataUcomponent.length()){\n dataUfield = input->GetPointData()->GetArray(DataUcomponent.data());\n }\n else{\n \n dataUfield = input->GetPointData()->GetArray(0);\n }\n if(!dataUfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error1: Could not find data array '\"\n << DataUcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -1;\n }\n \n if(DataVcomponent.length()){\n dataVfield = input->GetPointData()->GetArray(DataVcomponent.data());\n }\n else{\n \n dataVfield = input->GetPointData()->GetArray(0);\n }\n if(!dataVfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error2: Could not find data array '\"\n << DataVcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -2;\n }\n \n if(PolygonUcomponent.length()){\n polygonUfield = polygon->GetPointData()->GetArray(PolygonUcomponent.data());\n }\n else{\n \n polygonUfield = polygon->GetPointData()->GetArray(0);\n }\n if(!polygonUfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error3: Could not find data array '\"\n << PolygonUcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -3;\n }\n \n if(PolygonVcomponent.length()){\n polygonVfield = polygon->GetPointData()->GetArray(PolygonVcomponent.data());\n }\n else{\n \n polygonVfield = polygon->GetPointData()->GetArray(0);\n }\n if(!polygonVfield){\n stringstream msg;\n msg << \"[ttkFiberSurface] Error4: Could not find data array '\"\n << PolygonVcomponent << \"'!\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -4;\n }\n \n if(!((input->GetDataObjectType() == VTK_UNSTRUCTURED_GRID)\n\n ||(input->GetDataObjectType() == VTK_IMAGE_DATA))){\n\n stringstream msg;\n msg << \"[ttkFiberSurface] Error5: Unsupported VTK data-structure (\"\n << input->GetDataObjectType() << \")\" << endl;\n dMsg(cerr, msg.str(), fatalMsg);\n return -5;\n }\n \n Triangulation *triangulation = ttkTriangulation::getTriangulation(input);\n \n if(!triangulation)\n return -1;\n triangulation->setWrapper(this);\n fiberSurface_.setupTriangulation(triangulation);\n fiberSurface_.setWrapper(this);\n outputVertexList_.clear();\n fiberSurface_.setGlobalVertexList(&outputVertexList_);\n fiberSurface_.setInputField(\n dataUfield->GetVoidPointer(0),\n dataVfield->GetVoidPointer(0));\n fiberSurface_.setPolygonEdgeNumber(polygon->GetNumberOfCells());\n threadedTriangleList_.resize(polygon->GetNumberOfCells());\n threadedVertexList_.resize(polygon->GetNumberOfCells());\n fiberSurface_.setPolygon(&inputPolygon_);\n \n fiberSurface_.setPointMerging(PointMerge);\n fiberSurface_.setPointMergingThreshold(PointMergeDistanceThreshold);\n \n#ifdef TTK_ENABLE_FIBER_SURFACE_WITH_RANGE_OCTREE\n if((!RangeOctree)\n ||(dataUfield->GetMTime() > GetMTime())\n ||(dataVfield->GetMTime() > GetMTime())){\n \n {\n stringstream msg;\n msg << \"[ttkFiberSurface] Resetting octree...\" << endl;\n dMsg(cout, msg.str(), infoMsg);\n }\n \n fiberSurface_.flushOctree();\n Modified();\n }\n#endif\n \n inputPolygon_.clear();\n \n#if !defined(_WIN32) || defined(_WIN32) && defined(VTK_USE_64BIT_IDS)\n const long long int *cellArray = polygon->GetCells()->GetPointer();\n#else\n int* pt = polygon->GetCells()->GetPointer();\n long long extra_pt = *pt;\n const long long int *cellArray = &extra_pt;\n#endif\n SimplexId cellNumber = polygon->GetNumberOfCells();\n\n SimplexId vertexId0, vertexId1;\n pair<pair<double, double>, pair<double, double> > rangeEdge;\n\n for(SimplexId i = 0; i < cellNumber; i++){\n\n vertexId0 = cellArray[3*i + 1];\n vertexId1 = cellArray[3*i + 2];\n \n rangeEdge.first.first = polygonUfield->GetTuple1(vertexId0);\n rangeEdge.first.second = polygonVfield->GetTuple1(vertexId0);\n \n rangeEdge.second.first = polygonUfield->GetTuple1(vertexId1);\n rangeEdge.second.second = polygonVfield->GetTuple1(vertexId1);\n \n inputPolygon_.push_back(rangeEdge);\n }\n \n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n threadedTriangleList_[i].clear();\n fiberSurface_.setTriangleList(i, &(threadedTriangleList_[i]));\n threadedVertexList_[i].clear();\n fiberSurface_.setVertexList(i, &(threadedVertexList_[i]));\n }\n \n#ifdef TTK_ENABLE_FIBER_SURFACE_WITH_RANGE_OCTREE\n switch(vtkTemplate2PackMacro(dataUfield->GetDataType(),\n dataVfield->GetDataType())){\n ttkTemplate2Macro({\n if (RangeOctree)\n fiberSurface_.buildOctree<VTK_T1 TTK_COMMA VTK_T2>();\n fiberSurface_.computeSurface<VTK_T1 TTK_COMMA VTK_T2>();\n });\n }\n#else\n switch(vtkTemplate2PackMacro(dataUfield->GetDataType(),\n dataVfield->GetDataType())){\n ttkTemplate2Macro(fiberSurface_.computeSurface<VTK_T1 TTK_COMMA VTK_T2>());\n }\n#endif\n \n \n \n \n \n SimplexId triangleNumber = 0;\n \n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n triangleNumber += threadedTriangleList_[i].size();\n }\n \n vtkSmartPointer<vtkPoints> outputVertexList = \n vtkSmartPointer<vtkPoints>::New();\n vtkSmartPointer<vtkDoubleArray> outputU = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkDoubleArray> outputV = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkDoubleArray> outputParameterization = \n vtkSmartPointer<vtkDoubleArray>::New();\n vtkSmartPointer<vtkCellArray> outputTriangleList = \n vtkSmartPointer<vtkCellArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputEdgeIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputTetIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n vtkSmartPointer<ttkSimplexIdTypeArray> outputCaseIds = \n vtkSmartPointer<ttkSimplexIdTypeArray>::New();\n \n if(RangeCoordinates){\n outputU->SetName(DataUcomponent.data());\n outputU->SetNumberOfTuples(outputVertexList_.size());\n \n outputV->SetName(DataVcomponent.data());\n outputV->SetNumberOfTuples(outputVertexList_.size());\n }\n \n if(EdgeParameterization){\n outputParameterization->SetName(\"EdgeParameterization\");\n outputParameterization->SetNumberOfTuples(outputVertexList_.size());\n }\n \n outputVertexList->SetNumberOfPoints(outputVertexList_.size());\n output->SetPoints(outputVertexList);\n \n#ifdef TTK_ENABLE_OPENMP\n#pragma omp parallel for num_threads(threadNumber_)\n#endif\n for(SimplexId i = 0; i < (SimplexId) outputVertexList_.size(); i++){\n outputVertexList->SetPoint(i, \n outputVertexList_[i].p_[0], \n outputVertexList_[i].p_[1], \n outputVertexList_[i].p_[2]);\n if(RangeCoordinates){\n outputU->SetTuple1(i, outputVertexList_[i].uv_.first);\n outputV->SetTuple1(i, outputVertexList_[i].uv_.second);\n }\n if(EdgeParameterization){\n outputParameterization->SetTuple1(i, outputVertexList_[i].t_);\n }\n }\n if(RangeCoordinates){\n output->GetPointData()->AddArray(outputU);\n output->GetPointData()->AddArray(outputV);\n }\n else{\n output->GetPointData()->RemoveArray(DataUcomponent.data());\n output->GetPointData()->RemoveArray(DataVcomponent.data());\n }\n if(EdgeParameterization){\n output->GetPointData()->AddArray(outputParameterization);\n }\n else{\n output->GetPointData()->RemoveArray(\"EdgeParameterization\");\n }\n \n if(EdgeIds){\n outputEdgeIds->SetName(\"EdgeIds\");\n outputEdgeIds->SetNumberOfTuples(triangleNumber);\n }\n \n if(TetIds){\n outputTetIds->SetName(\"TetIds\");\n outputTetIds->SetNumberOfTuples(triangleNumber);\n }\n \n if(CaseIds){\n outputCaseIds->SetName(\"CaseIds\");\n outputCaseIds->SetNumberOfTuples(triangleNumber);\n }\n \n vtkSmartPointer<vtkIdList> idList = vtkSmartPointer<vtkIdList>::New();\n idList->SetNumberOfIds(3);\n \n triangleNumber = 0;\n for(SimplexId i = 0; i < (SimplexId) threadedTriangleList_.size(); i++){\n for(SimplexId j = 0; j < (SimplexId) threadedTriangleList_[i].size(); j++){\n for(int k = 0; k < 3; k++){\n idList->SetId(k, threadedTriangleList_[i][j].vertexIds_[k]);\n }\n outputTriangleList->InsertNextCell(idList);\n if(EdgeIds){\n outputEdgeIds->SetTuple1(triangleNumber, i);\n }\n if(TetIds){\n outputTetIds->SetTuple1(triangleNumber, \n threadedTriangleList_[i][j].tetId_);\n }\n if(CaseIds){\n outputCaseIds->SetTuple1(triangleNumber,\n threadedTriangleList_[i][j].caseId_);\n }\n triangleNumber++;\n }\n }\n output->SetPolys(outputTriangleList);\n if(EdgeIds){\n output->GetCellData()->AddArray(outputEdgeIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"EdgeIds\");\n }\n if(TetIds){\n output->GetCellData()->AddArray(outputTetIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"TetIds\");\n }\n if(CaseIds){\n output->GetCellData()->AddArray(outputCaseIds);\n }\n else{\n output->GetCellData()->RemoveArray(\"CaseIds\");\n }\n \n {\n stringstream msg;\n msg << \"[ttkFiberSurface] Memory usage: \" << m.getElapsedUsage() \n << \" MB.\" << endl;\n dMsg(cout, msg.str(), memoryMsg);\n }\n \n return 0;\n}\n"},"middle":{"kind":"string","value":"true;\n PointMerge = false;\n RangeOctree = true;\n PointMergeDistanceThreshold = 0.000001;\n SetNumberOfInputPorts(2);\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":" class AtomicVector : public std::vector<type>\n\n {\n\n private:\n\n std::size_t nextId;\n\n // for initialization\n\n const type defaultValue;\n\n\n\n public:\n\n AtomicVector(const std::size_t initSize = 1, const type &dv = type{})\n\n : std::vector<type>(), nextId(0), defaultValue{dv}\n\n {\n\n#ifndef TTK_ENABLE_KAMIKAZE\n\n if (!initSize) {\n\n std::cout << \"Caution, Atomic vector need a non-0 init size !\" << std::endl;\n\n std::vector<type>::resize(1, defaultValue);\n\n } else\n\n#endif\n\n {\n\n std::vector<type>::resize(initSize, defaultValue);\n\n }\n","file_path":"ttk/core/base/ftmTree/AtomicVector.h","rank":0,"score":69033.67509844416},{"content":"namespace ttk\n\n{\n\nnamespace ftm\n\n{\n\n // Compute parameters (global)\n\n struct Params {\n\n TreeType treeType;\n\n bool segm = true;\n\n bool normalize = true;\n\n bool advStats = true;\n\n int samplingLvl = 0;\n\n };\n\n\n\n#ifdef TTK_ENABLE_FTM_TREE_STATS_TIME\n\n struct ActiveTask {\n\n float begin = -1;\n\n float end = -1;\n\n SimplexId origin = nullVertex;\n\n };\n\n#endif\n\n\n\n // Scalar related containers (global)\n\n struct Scalars {\n\n SimplexId size;\n\n void* values;\n\n void* offsets;\n\n\n\n std::shared_ptr<std::vector<SimplexId>> sortedVertices, mirrorVertices;\n\n\n\n // Need vertices to be sorted : use mirrorVertices.\n\n\n\n bool isLower(SimplexId a, SimplexId b) const\n\n {\n\n return (*mirrorVertices)[a] < (*mirrorVertices)[b];\n\n }\n\n bool isEqLower(SimplexId a, SimplexId b) const\n\n {\n\n return (*mirrorVertices)[a] <= (*mirrorVertices)[b];\n\n }\n\n\n\n bool isHigher(SimplexId a, SimplexId b) const\n\n {\n\n return (*mirrorVertices)[a] > (*mirrorVertices)[b];\n\n }\n\n bool isEqHigher(SimplexId a, SimplexId b) const\n\n {\n\n return (*mirrorVertices)[a] >= (*mirrorVertices)[b];\n\n }\n\n\n\n Scalars()\n\n : size(0),\n\n values(nullptr),\n\n offsets(nullptr),\n\n sortedVertices(nullptr),\n\n mirrorVertices(nullptr)\n\n {\n\n }\n\n\n\n // Heavy\n\n Scalars(const Scalars& o)\n\n : size(o.size),\n\n values(o.values),\n\n offsets(o.offsets),\n\n sortedVertices(o.sortedVertices),\n\n mirrorVertices(o.mirrorVertices)\n\n {\n\n std::cout << \"copy in depth, bad perfs\" << std::endl;\n\n }\n\n\n\n // Sort\n\n template <typename type>\n\n void qsort(type arr[], const long int begin, const long int stop,\n\n std::function<bool(type, type)> comp) const\n\n {\n\n if (begin >= stop)\n\n return;\n\n\n\n static const long int MINSIZE = 10;\n\n\n\n long int left = begin - 1;\n\n long int right = stop + 1;\n\n const type pivot = arr[begin];\n\n\n\n while (1) {\n\n while (comp(pivot, arr[--right]))\n\n ;\n\n while (++left <= stop && !comp(pivot, arr[left]))\n\n ;\n\n\n\n if (left < right)\n\n swap_el<type>(arr, left, right);\n\n else\n\n break;\n\n }\n\n\n\n swap_el<type>(arr, begin, right);\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp task untied if (right - begin > MINSIZE)\n\n#endif\n\n qsort(arr, begin, right - 1, comp);\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp task untied if (stop - right > MINSIZE)\n\n#endif \n\n qsort(arr, right + 1, stop, comp);\n\n }\n\n\n\n private:\n\n template <typename type>\n\n static void swap_el(type arr[], const size_t a, const size_t b)\n\n {\n\n const type tmp = arr[a];\n\n arr[a] = arr[b];\n\n arr[b] = tmp;\n\n }\n\n };\n\n\n\n struct CurrentState {\n\n SimplexId vertex;\n\n boost::heap::fibonacci_heap<SimplexId, boost::heap::compare<VertCompFN>> propagation;\n\n\n\n CurrentState(SimplexId startVert, VertCompFN vertComp)\n\n : vertex(startVert), propagation(vertComp)\n\n {\n\n }\n\n\n\n CurrentState(VertCompFN vertComp)\n\n : vertex(nullVertex), propagation(vertComp)\n\n {\n\n // will need to use setStartVert before use\n\n }\n\n\n\n void setStartVert(const SimplexId v)\n\n {\n\n vertex = v;\n\n }\n\n\n\n SimplexId getNextMinVertex(void)\n\n {\n\n vertex = propagation.top();\n\n propagation.pop();\n\n return vertex;\n\n }\n\n\n\n void addNewVertex(const SimplexId v)\n\n {\n\n propagation.emplace(v);\n\n }\n\n\n\n void merge(CurrentState& other)\n\n {\n\n propagation.merge(other.propagation);\n\n vertex = propagation.top();\n\n }\n\n\n\n bool empty()\n\n {\n\n return propagation.empty();\n\n }\n\n\n\n // DEBUG ONLY\n\n bool find(SimplexId v)\n\n {\n\n return std::find(propagation.begin(), propagation.end(), v) != propagation.end();\n\n }\n","file_path":"ttk/core/base/ftmTree/Structures.h","rank":1,"score":46674.56527775849},{"content":"namespace ttk{\n\n /// \\brief Identifier type for simplices of any dimension.\n\n using LongSimplexId = long long int;\n\n\n\n /// \\brief Identifier type for simplices of any dimension.\n\n#ifdef TTK_ENABLE_64BIT_IDS\n\n using SimplexId = long long int;\n\n#else\n\n using SimplexId = int;\n\n#endif\n\n\n\n /// \\brief Identifier type for threads (i.e. with OpenMP).\n\n using ThreadId = int;\n\n\n\n /// \\brief Identifier type for tasks (i.e. with OpenMP).\n\n using TaskId = int;\n\n\n\n /// default name for mask scalar field\n\n const char MaskScalarFieldName[]=\"ttkMaskScalarField\";\n\n\n\n /// default name for vertex scalar field\n\n const char VertexScalarFieldName[]=\"ttkVertexScalarField\";\n\n\n\n /// default name for offset scalar field\n\n const char OffsetScalarFieldName[]=\"ttkOffsetScalarField\";\n\n\n\n /// default name for bivariate offset fields\n\n const char OffsetFieldUName[]=\"ttkOffsetFieldU\";\n\n const char OffsetFieldVName[]=\"ttkOffsetFieldV\";\n\n\n\n /// default value for critical index\n\n enum class CriticalType { \n\n Local_minimum = 0, Saddle1, Saddle2, Local_maximum, Degenerate, Regular };\n","file_path":"ttk/core/base/common/DataTypes.h","rank":2,"score":46674.56527775849},{"content":"namespace ttk {\n\n\ttemplate<typename dataType>\n\n\tstd::vector<KDTree<dataType>*> KDTree<dataType>::build(dataType* data, const int& ptNumber, const int& dimension, std::vector<std::vector<dataType>>& weights, const int weight_number){\n\n\t\tstd::vector<KDTree<dataType>*> correspondance_map(ptNumber);\n\n\t\t// First, perform a argsort on the data\n\n\t\t// initialize original index locations\n\n\t\tfor(int axis = 0; axis<dimension; axis++){\n\n\t\t\tcoords_min_.push_back(std::numeric_limits<dataType>::lowest());\n\n\t\t\tcoords_max_.push_back(std::numeric_limits<dataType>::max());\n\n\t\t}\n\n\t\tstd::vector<int> idx(ptNumber);\n\n\t\tfor(int i=0; i<ptNumber; i++){\n\n\t\t\tidx[i] = i;\n\n\t\t}\n\n\t\t// sort indexes based on comparing values in coordinates\n\n\t\tsort(idx.begin(), idx.end(), [&](int i1, int i2) {return data[dimension*i1+coords_number_] < data[dimension*i2+coords_number_];});\n\n\t\tint median_loc = (int) (ptNumber-1)/2;\n\n\t\tint median_idx = idx[median_loc];\n\n\t\tcorrespondance_map[median_idx] = this;\n\n\t\t\n\n\t\tfor(int axis=0; axis<dimension; axis++){\n\n\t\t\tcoordinates_.push_back(data[dimension*median_idx + axis]); \n\n\t\t}\n\n\t\tfor(int i=0; i<weight_number; i++){\n\n\t\t\tweight_.push_back(weights[i][median_idx]);\n\n\t\t\tmin_subweights_.push_back(weights[i][median_idx]);\n\n\t\t}\n\n\n\n\t\tid_ = median_idx;\n\n\t\tparent_ = nullptr;\n\n\t\tlevel_ = 0;\n\n\t\t\n\n\t\tif(idx.size()>2){\n\n\t\t\t// Build left leaf\n\n\t\t\tstd::vector<int> idx_left;\n\n\t\t\tfor(int i=0; i<median_loc; i++){\n\n\t\t\t\tidx_left.push_back(idx[i]);\n\n\t\t\t}\n\n\t\t\t\n\n\t\t\tKDTree* left = new KDTree(this, (coords_number_+1)%dimension, true);\n\n\t\t\tleft->buildRecursive(data, idx_left, ptNumber, dimension, this, correspondance_map, weights, weight_number);\n\n\t\t\tleft_ = left;\n\n\t\t}\n\n\t\t\n\n\t\tif(idx.size()>1){\n\n\t\t\t// Build right leaf\n\n\t\t\tstd::vector<int> idx_right(ptNumber - median_loc - 1);\n\n\t\t\tfor(int i=0; i<ptNumber - median_loc - 1; i++){\n\n\t\t\t\tidx_right[i] = idx[i + median_loc + 1];\n\n\t\t\t}\n\n\t\t\tKDTree* right = new KDTree(this, (coords_number_+1)%dimension, false);\n\n\t\t\tright->buildRecursive(data, idx_right, ptNumber, dimension, this, correspondance_map, weights, weight_number);\n\n\t\t\tright_ = right;\n\n\t\t}\n\n\n\n\t\treturn correspondance_map;\n\n\t}\n\n\t\n\n\n\n\ttemplate<typename dataType>\n\n\tvoid KDTree<dataType>::buildRecursive(dataType* data, std::vector<int> idx_side, const int& ptNumber, const int& dimension, KDTree<dataType>* parent, std::vector<KDTree<dataType>*>& correspondance_map, std::vector<std::vector<dataType>>& weights, const int weight_number){\n\n\t\t// First, perform a argsort on the data\n\n\t\tsort(idx_side.begin(), idx_side.end(), [&](int i1, int i2) {return data[dimension*i1 + coords_number_] < data[dimension*i2 + coords_number_]; });\n\n\t\tint median_loc = (int) (idx_side.size()-1)/2;\n\n\t\tint median_idx = idx_side[median_loc];\n\n\t\tcorrespondance_map[median_idx] = this;\n\n\t\t\n\n\t\tfor(int axis=0; axis<dimension; axis++){\n\n\t\t\tcoordinates_.push_back(data[dimension*median_idx + axis]);\n\n\t\t}\n\n\t\t\n\n\t\tid_ = median_idx;\n\n\t\tparent_ = parent;\n\n\t\tlevel_ = parent->level_ +1;\n\n\t\t\n\n\t\tfor(int i=0; i<weight_number; i++){\n\n\t\t\tweight_.push_back(weights[i][median_idx]);\n\n\t\t\tmin_subweights_.push_back(weights[i][median_idx]);\n\n\t\t}\n\n\t\t\n\n\t\tif(idx_side.size()>1){\n\n\t\t\t// Once we get to a leaf, update min_subweights of the parents\n\n\t\t\tfor(int w=0; w<weight_number; w++){\n\n\t\t\t\tthis->updateMinSubweight(w);\n\n\t\t\t}\n\n\t\t}\n\n\t\t\t\n\n\t\t// Create bounding box\n\n\t\tfor(int axis = 0; axis<dimension; axis++){\n\n\t\t\tcoords_min_.push_back(parent_->coords_min_[axis]);\n\n\t\t\tcoords_max_.push_back(parent_->coords_max_[axis]);\n\n\t\t}\n\n\t\tif(is_left_ && !this->isRoot()){\n\n\t\t\tcoords_max_[parent_->coords_number_] = parent_->coordinates_[parent_->coords_number_];\n\n\t\t}\n\n\t\telse if(!is_left_ && !this->isRoot()){\n\n\t\t\tcoords_min_[parent_->coords_number_] = parent_->coordinates_[parent_->coords_number_];\n\n\t\t}\n\n\t\t\n\n\t\tif(idx_side.size()>2){\n\n\t\t\t// Build left leaf\n\n\t\t\tstd::vector<int> idx_left(median_loc);\n\n\t\t\tfor(int i=0; i<median_loc; i++){\n\n\t\t\t\tidx_left[i] = idx_side[i];\n\n\t\t\t}\n\n\t\t\t\n\n\t\t\tKDTree* left = new KDTree(this, (coords_number_+1)%dimension, true);\n\n\t\t\tleft->buildRecursive(data, idx_left, ptNumber, dimension, this, correspondance_map, weights, weight_number);\n\n\t\t\tleft_ = left;\n\n\t\t}\n\n\t\t\n\n\t\tif(idx_side.size()>1){\n\n\t\t\t// Build right leaf\n\n\t\t\tstd::vector<int> idx_right(idx_side.size() - median_loc-1);\n\n\t\t\tfor(unsigned int i=0; i<idx_side.size() - median_loc-1; i++){\n\n\t\t\t\tidx_right[i] = idx_side[i + median_loc + 1];\n\n\t\t\t}\n\n\t\t\tKDTree* right = new KDTree(this, (coords_number_+1)%dimension, false);\n\n\t\t\tright->buildRecursive(data, idx_right, ptNumber, dimension, this, correspondance_map, weights, weight_number);\n\n\t\t\tright_ = right;\n\n\t\t}\n\n\t\treturn;\n\n\t}\t\n","file_path":"ttk/core/base/kdTree/buildWeights.h","rank":3,"score":46541.78294768764},{"content":"namespace ttk{\n\n \n\n template <class dataTypeU, class dataTypeV> class JacobiSet : public Debug{\n\n\n\n public:\n\n \n\n JacobiSet();\n\n \n\n ~JacobiSet();\n\n\n\n int connectivityPreprocessing(const std::vector<std::vector<SimplexId> > &edgeStarList,\n\n std::vector<std::vector<std::pair<SimplexId, SimplexId> > > &edgeFanLinkEdgeLists,\n\n std::vector<std::vector<LongSimplexId> > &edgeFans,\n\n std::vector<SimplexId> &sosOffsets) const;\n\n \n\n int execute(std::vector<std::pair<SimplexId, char> > &jacobiSet);\n\n \n\n char getCriticalType(const SimplexId &edgeId);\n\n \n\n int perturbate(const dataTypeU &uEpsilon = pow(10, -DBL_DIG),\n\n const dataTypeV &vEpsilon = pow(10, -DBL_DIG)) const;\n\n \n\n int setEdgeFans(const std::vector<std::vector<SimplexId> > *edgeFans){\n\n edgeFans_ = edgeFans;\n\n return 0;\n\n }\n\n \n\n int setEdgeFanLinkEdgeList(\n\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeFanLinkEdgeLists){\n\n edgeFanLinkEdgeLists_ = edgeFanLinkEdgeLists;\n\n return 0;\n\n }\n\n \n\n int setEdgeList(const std::vector<std::pair<SimplexId, SimplexId> > *edgeList){\n\n edgeList_ = edgeList;\n\n return 0;\n\n }\n\n \n\n int setInputField(const void *uField, const void *vField){\n\n \n\n uField_ = uField;\n\n vField_ = vField;\n\n return 0;\n\n }\n\n \n\n int setSosOffsets(std::vector<SimplexId> *sosOffsets){\n\n // legacy API\n\n return setSosOffsetsU(sosOffsets);\n\n }\n\n \n\n int setSosOffsetsU(std::vector<SimplexId> *sosOffsets){\n\n sosOffsetsU_ = sosOffsets;\n\n return 0;\n\n }\n\n \n\n int setSosOffsetsV(std::vector<SimplexId> *sosOffsets){\n\n sosOffsetsV_ = sosOffsets;\n\n return 0;\n\n }\n\n\n\n // NOTE: here it's not clear how vtk builds vtkIdType \n\n // to check on bigger data-sets\n\n int setTetList(const SimplexId *tetList){\n\n tetList_ = tetList;\n\n return 0;\n\n }\n\n \n\n int setVertexNumber(const SimplexId &vertexNumber){\n\n vertexNumber_ = vertexNumber;\n\n return 0;\n\n }\n\n \n\n int setupTriangulation(Triangulation *triangulation){\n\n \n\n triangulation_ = triangulation;\n\n \n\n // pre-condition functions\n\n if(triangulation_){\n\n triangulation_->preprocessEdges();\n\n triangulation_->preprocessEdgeStars();\n\n }\n\n \n\n return 0;\n\n }\n\n \n\n protected:\n\n \n\n int executeLegacy(std::vector<std::pair<SimplexId, char> > &jacobiSet);\n\n \n\n SimplexId vertexNumber_;\n\n const SimplexId *tetList_;\n\n const void *uField_, *vField_;\n\n const std::vector<std::pair<SimplexId, SimplexId> > *edgeList_;\n\n // for each edge, one skeleton of its triangle fan\n\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeFanLinkEdgeLists_;\n\n // for each edge, the one skeleton of its triangle fan\n\n const std::vector<std::vector<SimplexId> > *edgeFans_;\n\n std::vector<SimplexId> *sosOffsetsU_, *sosOffsetsV_;\n\n std::vector<SimplexId> localSosOffsetsU_, localSosOffsetsV_;\n\n Triangulation *triangulation_;\n\n };\n","file_path":"ttk/core/base/jacobiSet/JacobiSet.h","rank":4,"score":46541.78294768764},{"content":"namespace ttk\n\n{\n\nnamespace cf\n\n{\n\n\n\n// ------------------- Contour Forests\n\n\n\n// Process\n\n// {\n\n\n\ntemplate <typename scalarType>\n\nint ContourForests::build()\n\n{\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n omp_set_num_threads(parallelParams_.nbThreads);\n\n#endif\n\n\n\n DebugTimer timerTOTAL;\n\n\n\n // -----------\n\n // Paramemters\n\n // -----------\n\n initTreeType();\n\n initNbScalars();\n\n initNbPartitions();\n\n initSoS();\n\n\n\n if (params_->debugLevel >= 2) {\n\n // print params:\n\n std::cout << \"threads :\" << \n\nstatic_cast<unsigned>(parallelParams_.nbThreads) << std::endl;\n\n std::cout << \"partitions : \" \n\n<<static_cast<unsigned>(parallelParams_.nbPartitions) << std::endl;\n\n if(params_->simplifyThreshold){\n\n std::cout << \"simplify method : \" << params_->simplifyMethod << \n\nstd::endl;\n\n std::cout << \"simplify thresh.: \" << params_->simplifyThreshold << \n\nstd::endl;\n\n }\n\n }\n\n printDebug(timerTOTAL, \"Initialization \");\n\n\n\n // ---------\n\n // Sort Step\n\n // ---------\n\n\n\n DebugTimer timerSort;\n\n sortInput<scalarType>();\n\n printDebug(timerSort, \"Sort scalars (+mirror) \");\n\n\n\n // -------------------\n\n // Interface & Overlap\n\n // -------------------\n\n\n\n DebugTimer timerInitOverlap;\n\n initInterfaces();\n\n initOverlap();\n\n if(params_->debugLevel > 3){\n\n for (idInterface i = 0; i < parallelParams_.nbInterfaces; i++) {\n\n std::cout << \"interface : \" << static_cast<unsigned>(i);\n\n std::cout << \" seed : \" << parallelData_.interfaces[i].getSeed();\n\n std::cout << std::endl;\n\n }\n\n }\n\n printDebug(timerInitOverlap, \"Interface and overlap init. \");\n\n\n\n // -----------------------\n\n // Allocate parallel trees\n\n // -----------------------\n\n\n\n DebugTimer timerAllocPara;\n\n // Union find std::vector for each partition\n\n std::vector<std::vector<ExtendedUnionFind *>> \n\nvect_baseUF_JT(parallelParams_.nbPartitions),\n\n \n\nvect_baseUF_ST(parallelParams_.nbPartitions);\n\n const SimplexId &resSize = (scalars_->size / parallelParams_.nbPartitions) / \n\n10;\n\n\n\n parallelData_.trees.clear();\n\n parallelData_.trees.reserve(parallelParams_.nbPartitions);\n\n\n\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\n\n // Tree array initialization\n\n parallelData_.trees.emplace_back(params_,mesh_,scalars_, tree);\n\n }\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp parallel for num_threads(parallelParams_.nbPartitions) \\\n\nschedule(static)\n\n#endif\n\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\n\n // Tree array initialization\n\n parallelData_.trees[tree].flush();\n\n\n\n // UF-array reserve\n\n vect_baseUF_JT[tree].resize(scalars_->size);\n\n vect_baseUF_ST[tree].resize(scalars_->size);\n\n\n\n // Statistical reserve\n\n parallelData_.trees[tree].jt_->treeData_.nodes.reserve(resSize);\n\n parallelData_.trees[tree].jt_->treeData_.superArcs.reserve(resSize);\n\n parallelData_.trees[tree].st_->treeData_.nodes.reserve(resSize);\n\n parallelData_.trees[tree].st_->treeData_.superArcs.reserve(resSize);\n\n\n\n }\n\n printDebug(timerAllocPara, \"Parallel allocations \");\n\n\n\n // -------------------------\n\n // Build trees in partitions\n\n // -------------------------\n\n\n\n DebugTimer timerbuild;\n\n parallelBuild<scalarType>(vect_baseUF_JT, vect_baseUF_ST);\n\n\n\n if (params_->debugLevel >= 4) {\n\n if (params_->treeType == TreeType::Contour) {\n\n for (idPartition i = 0; i < parallelParams_.nbPartitions; i++) {\n\n std::cout << i << \" :\" << std::endl;\n\n parallelData_.trees[i].printTree2();\n\n std::cout << \"-----\" << std::endl;\n\n }\n\n } else {\n\n for (idPartition i = 0; i < parallelParams_.nbPartitions; i++) {\n\n std::cout << i << \" jt:\" << std::endl;\n\n parallelData_.trees[i].jt_->printTree2();\n\n std::cout << i << \" st:\" << std::endl;\n\n parallelData_.trees[i].st_->printTree2();\n\n std::cout << \"-----\" << std::endl;\n\n }\n\n }\n\n }\n\n\n\n printDebug(timerbuild, \"ParallelBuild \");\n\n\n\n // --------------------\n\n // Stitching partitions\n\n // --------------------\n\n\n\n DebugTimer timerZip;\n\n if (parallelParams_.partitionNum == -1 && parallelParams_.nbPartitions > 1 ) \n\n{\n\n stitch();\n\n for (idPartition p = 0; p < parallelParams_.nbPartitions; ++p) {\n\n \n\nparallelData_.trees[p].parallelInitNodeValence(parallelParams_.nbThreads);\n\n }\n\n }\n\n\n\n if (params_->debugLevel >= 4) {\n\n printVectCT();\n\n }\n\n\n\n printDebug(timerZip, \"Stitch \");\n\n\n\n // -------------------------------------------------\n\n // Unification : create one tree from stitched trees\n\n // -------------------------------------------------\n\n\n\n DebugTimer timerUnify;\n\n if (params_->treeType == TreeType::Contour) {\n\n if(parallelParams_.partitionNum >= 0){\n\n if (parallelParams_.partitionNum > parallelParams_.nbInterfaces) {\n\n clone(¶llelData_.trees[parallelParams_.nbPartitions - 1]);\n\n } else {\n\n clone(¶llelData_.trees[parallelParams_.partitionNum]);\n\n }\n\n } else if (parallelParams_.nbPartitions == 1) {\n\n clone(¶llelData_.trees[0]);\n\n } else {\n\n unify();\n\n // for global simlify\n\n parallelInitNodeValence(parallelParams_.nbThreads);\n\n }\n\n } else {\n\n if(parallelParams_.partitionNum >= 0){\n\n if(parallelParams_.partitionNum > parallelParams_.nbInterfaces){\n\n jt_->clone(parallelData_.trees[parallelParams_.nbInterfaces].jt_);\n\n st_->clone(parallelData_.trees[parallelParams_.nbInterfaces].st_);\n\n } else {\n\n jt_->clone(parallelData_.trees[parallelParams_.partitionNum].jt_);\n\n st_->clone(parallelData_.trees[parallelParams_.partitionNum].st_);\n\n }\n\n } else if (parallelParams_.nbPartitions == 1) {\n\n jt_->clone(parallelData_.trees[0].jt_);\n\n st_->clone(parallelData_.trees[0].st_);\n\n } else {\n\n unify();\n\n jt_->parallelInitNodeValence(parallelParams_.nbThreads);\n\n st_->parallelInitNodeValence(parallelParams_.nbThreads);\n\n }\n\n }\n\n\n\n printDebug(timerUnify, \"Create Contour tree \");\n\n\n\n // -------------------\n\n // Simplification step\n\n // -------------------\n\n\n\n if (params_->treeType == TreeType::Contour && parallelParams_.partitionNum \n\n== -1 &&\n\n params_->simplifyThreshold) {\n\n DebugTimer timerGlobalSimplify;\n\n SimplexId simplifed = globalSimplify<scalarType>(-1, nullVertex);\n\n if(params_->debugLevel >=1){\n\n printDebug(timerGlobalSimplify, \"Simplify Contour tree \");\n\n std::cout << \" ( \" << simplifed << \" pairs merged )\" << std::endl;\n\n }\n\n }\n\n\n\n printDebug(timerTOTAL, \"TOTAL \");\n\n\n\n // ------------------------------\n\n // Debug print and memory reclaim\n\n // ------------------------------\n\n\n\n if (params_->debugLevel >= 5) {\n\n if(params_->treeType == TreeType::Contour)\n\n printTree2();\n\n else {\n\n std::cout << \"JT :\" << std::endl;\n\n jt_->printTree2();\n\n std::cout << \"ST :\" << std::endl;\n\n st_->printTree2();\n\n }\n\n } else if (params_->debugLevel > 2) {\n\n if(params_->treeType == TreeType::Contour)\n\n std::cout << \"max node : \" << getNumberOfNodes() << std::endl;\n\n else {\n\n std::cout << \"JT max node : \" << jt_->getNumberOfNodes() << \n\nstd::endl;\n\n std::cout << \"ST max node : \" << st_->getNumberOfNodes() << \n\nstd::endl;\n\n }\n\n }\n\n\n\n if (params_->treeType == TreeType::Contour) {\n\n updateSegmentation();\n\n } else {\n\n jt_->updateSegmentation();\n\n st_->updateSegmentation();\n\n }\n\n\n\n // reclaim memory\n\n {\n\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\n\n parallelData_.trees[tree].jt_->treeData_.nodes.shrink_to_fit();\n\n parallelData_.trees[tree].jt_->treeData_.superArcs.shrink_to_fit();\n\n parallelData_.trees[tree].st_->treeData_.nodes.shrink_to_fit();\n\n parallelData_.trees[tree].st_->treeData_.superArcs.shrink_to_fit();\n\n }\n\n // Not while arc segmentation depends on std::vector in partitions\n\n //parallelData_.interfaces.clear();\n\n //parallelData_.trees.clear();\n\n }\n\n\n\n return 0;\n\n}\n\n\n\ntemplate <typename scalarType>\n\nint ContourForests::parallelBuild(std::vector<std::vector<ExtendedUnionFind *>> \n\n&vect_baseUF_JT,\n\n std::vector<std::vector<ExtendedUnionFind *>> \n\n&vect_baseUF_ST)\n\n{\n\n std::vector<float> timeSimplify(parallelParams_.nbPartitions, 0);\n\n std::vector<float> speedProcess(parallelParams_.nbPartitions*2, 0);\n\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\n\n SimplexId nbPairMerged = 0;\n\n#endif\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n omp_set_nested(1);\n\n#endif\n\n\n\n//std::cout << \"NO PARALLEL DEBUG MODE\" << std::endl;\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp parallel for num_threads(parallelParams_.nbPartitions) \\\n\nschedule(static)\n\n#endif\n\n for (idPartition i = 0; i < parallelParams_.nbPartitions; ++i) {\n\n DebugTimer timerMergeTree;\n\n\n\n // ------------------------------------------------------\n\n // Skip partition that are not asked to compute if needed\n\n // ------------------------------------------------------\n\n\n\n if (parallelParams_.partitionNum != -1 && parallelParams_.partitionNum != \n\ni)\n\n continue;\n\n\n\n // ------------------------------------------------------\n\n // Retrieve boundary & overlap list for current partition\n\n // ------------------------------------------------------\n\n\n\n std::tuple<SimplexId, SimplexId> rangeJT = getJTRange(i);\n\n std::tuple<SimplexId, SimplexId> rangeST = getSTRange(i);\n\n std::tuple<SimplexId, SimplexId> seedsPos = getSeedsPos(i);\n\n std::tuple<std::vector<SimplexId>, std::vector<SimplexId>> overlaps = \n\ngetOverlaps(i);\n\n const SimplexId &partitionSize = abs(std::get<0>(rangeJT) - \n\nstd::get<1>(rangeJT)) +\n\n std::get<0>(overlaps).size() + \n\nstd::get<1>(overlaps).size();\n\n\n\n // ---------------\n\n // Build JT and ST\n\n // ---------------\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp parallel sections num_threads(2) if (parallelParams_.lessPartition)\n\n#endif\n\n {\n\n\n\n // if less partition : we built JT and ST in parallel\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp section\n\n#endif\n\n {\n\n if(params_->treeType == TreeType::Join\n\n || params_->treeType == TreeType::Contour\n\n || params_->treeType == TreeType::JoinAndSplit)\n\n {\n\n DebugTimer timerSimplify;\n\n DebugTimer timerBuild;\n\n parallelData_.trees[i].getJoinTree()->build(vect_baseUF_JT[i],\n\n std::get<0>(overlaps), std::get<1>(overlaps),\n\n std::get<0>(rangeJT), std::get<1>(rangeJT),\n\n std::get<0>(seedsPos), std::get<1>(seedsPos)\n\n );\n\n speedProcess[i] = partitionSize / timerBuild.getElapsedTime();\n\n\n\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\n\n timerSimplify.reStart();\n\n const SimplexId tmpMerge =\n\n \n\nparallelData_.trees[i].getJoinTree()->localSimplify<scalarType>(\n\n std::get<0>(seedsPos), std::get<1>(seedsPos));\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp atomic update\n\n#endif\n\n timeSimplify[i] += timerSimplify.getElapsedTime();\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp atomic update\n\n#endif\n\n nbPairMerged += tmpMerge;\n\n#endif\n\n }\n\n }\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp section\n\n#endif\n\n {\n\n if(params_->treeType == TreeType::Split\n\n || params_->treeType == TreeType::Contour\n\n || params_->treeType == TreeType::JoinAndSplit)\n\n {\n\n DebugTimer timerSimplify;\n\n DebugTimer timerBuild;\n\n parallelData_.trees[i].getSplitTree()->build(vect_baseUF_ST[i],\n\n std::get<1>(overlaps), std::get<0>(overlaps),\n\n std::get<0>(rangeST), std::get<1>(rangeST),\n\n std::get<0>(seedsPos), std::get<1>(seedsPos)\n\n );\n\n speedProcess[parallelParams_.nbPartitions + i] =\n\n partitionSize / timerBuild.getElapsedTime();\n\n\n\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\n\n timerSimplify.reStart();\n\n const SimplexId tmpMerge =\n\n \n\nparallelData_.trees[i].getSplitTree()->localSimplify<scalarType>(\n\n std::get<0>(seedsPos), std::get<1>(seedsPos));\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp atomic update\n\n#endif\n\n timeSimplify[i] += timerSimplify.getElapsedTime();\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp atomic update\n\n#endif\n\n nbPairMerged += tmpMerge;\n\n#endif\n\n }\n\n }\n\n\n\n\n\n }\n\n\n\n {\n\n std::stringstream mt;\n\n mt << \"[ParallelBuild] Merge Tree \" << static_cast<unsigned>(i)\n\n << \" constructed in : \" << timerMergeTree.getElapsedTime() << \n\nstd::endl;\n\n dMsg(std::cout, mt.str(), infoMsg);\n\n }\n\n\n\n // Update segmentation of each arc if needed\n\n if ( params_->simplifyThreshold || params_->treeType != \n\nTreeType::Contour){\n\n DebugTimer timerUpdateSegm;\n\n parallelData_.trees[i].getJoinTree()->updateSegmentation();\n\n parallelData_.trees[i].getSplitTree()->updateSegmentation();\n\n\n\n if (params_->debugLevel >= 3) {\n\n std::cout << \"Local MT : updated in \" << \n\ntimerUpdateSegm.getElapsedTime() << std::endl;\n\n }\n\n }\n\n\n\n // ---------------\n\n // Combine JT & ST\n\n // ---------------\n\n\n\n if (params_->treeType == TreeType::Contour) {\n\n DebugTimer timerCombine;\n\n\n\n // clone here if we do not want to destry original merge trees!\n\n auto *jt = parallelData_.trees[i].getJoinTree();\n\n auto *st = parallelData_.trees[i].getSplitTree();\n\n\n\n // Copy missing nodes of a tree to the other one\n\n // Maintain this traversal order for good insertion\n\n for (idNode t = 0; t < st->getNumberOfNodes(); ++t) {\n\n if (!st->getNode(t)->isHidden()) {\n\n // std::cout << \"insert in jt : \" << \n\n // st->getNode(t)->getVertexId() << std::endl;\n\n jt->insertNode(st->getNode(t), true);\n\n }\n\n }\n\n // and vice versa\n\n for (idNode t = 0; t < jt->getNumberOfNodes(); ++t) {\n\n if (!jt->getNode(t)->isHidden()) {\n\n // std::cout << \"insert in st : \" << \n\n // jt->getNode(t)->getVertexId() << std::endl;\n\n st->insertNode(jt->getNode(t), true);\n\n }\n\n }\n\n\n\n // debug print current JT / ST\n\n if (params_->debugLevel >= 6) {\n\n std::cout << \"Local JT :\" << std::endl;\n\n parallelData_.trees[i].getJoinTree()->printTree2();\n\n std::cout << \"Local ST :\" << std::endl;\n\n parallelData_.trees[i].getSplitTree()->printTree2();\n\n std::cout << \"combine\" << std::endl;\n\n }\n\n\n\n // Combine, destroy JT and ST to compute CT\n\n parallelData_.trees[i].combine(std::get<0>(seedsPos), \n\nstd::get<1>(seedsPos));\n\n parallelData_.trees[i].updateSegmentation();\n\n\n\n if (params_->debugLevel > 2) {\n\n printDebug(timerCombine, \"Trees combined in \");\n\n }\n\n\n\n // debug print CT\n\n if (params_->debugLevel >= 4) {\n\n parallelData_.trees[i].printTree2();\n\n }\n\n } else {\n\n if (params_->debugLevel >= 6) {\n\n std::cout << \"Local JT :\" << std::endl;\n\n parallelData_.trees[i].getJoinTree()->printTree2();\n\n std::cout << \"Local ST :\" << std::endl;\n\n parallelData_.trees[i].getSplitTree()->printTree2();\n\n std::cout << \"combine\" << std::endl;\n\n }\n\n }\n\n }\n\n\n\n // -------------------------------------\n\n // Print process speed and simplify info\n\n // -------------------------------------\n\n\n\n if(params_->debugLevel > 2) {\n\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\n\n if (params_->simplifyThreshold) {\n\n auto maxSimplifIt = max_element(timeSimplify.cbegin(), \n\ntimeSimplify.cend());\n\n float maxSimplif = *maxSimplifIt;\n\n std::cout \n\n << \"Local simplification maximum time :\" \n\n << maxSimplif;\n\n std::cout << \" ( \" << nbPairMerged << \" pairs merged )\" << std::endl;\n\n }\n\n#endif\n\n auto maxProcSpeed = max_element(speedProcess.cbegin(), \n\nspeedProcess.cend());\n\n auto minProcSpeed = min_element(speedProcess.cbegin(), \n\nspeedProcess.cend());\n\n std::cout << \"process speed : \";\n\n std::cout << \" min is \" << *minProcSpeed << \" vert/sec\";\n\n std::cout << \" max is \" << *maxProcSpeed << \" vert/sec\";\n\n std::cout << std::endl;\n\n }\n\n\n\n return 0;\n\n}\n\n\n\n//}\n\n\n\n}\n","file_path":"ttk/core/base/contourForests/ContourForestsTemplate.h","rank":5,"score":46413.79000936405},{"content":"namespace ttk\n\n{\n\nnamespace cf\n\n{\n\n// Init\n\n// {\n\n\n\ntemplate <typename scalarType>\n\nvoid MergeTree::sortInput(void)\n\n{\n\n const auto &nbVertices = scalars_->size;\n\n auto & sortedVect = scalars_->sortedVertices;\n\n\n\n if (!sortedVect.size()) {\n\n auto indirect_sort = [&](const size_t &a, const size_t &b) {\n\n return isLower<scalarType>(a, b);\n\n };\n\n\n\n sortedVect.resize(nbVertices, 0);\n\n iota(sortedVect.begin(), sortedVect.end(), 0);\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\n\n // ensure this namespace exists\n\n __gnu_parallel::sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\n\n# else\n\n sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\n\n# endif\n\n#else\n\n sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\n\n#endif\n\n }\n\n\n\n if (!scalars_->mirrorVertices.size()) {\n\n scalars_->mirrorVertices.resize(nbVertices);\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp parallel for\n\n#endif\n\n for (SimplexId i = 0; i < nbVertices; i++) {\n\n scalars_->mirrorVertices[sortedVect[i]] = i;\n\n }\n\n }\n\n}\n\n// }\n\n\n\n// Process\n\n// {\n\n\n\n// Simplify\n\n\n\ntemplate <typename scalarType>\n\nSimplexId MergeTree::localSimplify(const SimplexId &posSeed0, const SimplexId &posSeed1)\n\n{\n\n\n\n // if null threshold, leave\n\n if (!params_->simplifyThreshold) {\n\n return 0;\n\n }\n\n\n\n const bool DEBUG = false;\n\n\n\n // -----------------\n\n // Persistance pairs\n\n // -----------------\n\n // {\n\n\n\n std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> pairs;\n\n computePersistencePairs<scalarType>(pairs);\n\n\n\n if (DEBUG) {\n\n std::cout << \"pairs : ( threshold : \" << params_->simplifyThreshold \n\n << \" )\" << std::endl;\n\n for (const auto &p : pairs) {\n\n const SimplexId & thisOriginVert = std::get<0>(p);\n\n const SimplexId & thisEndVert = std::get<1>(p);\n\n const scalarType &thisPersist = std::get<2>(p);\n\n const bool thisNeedUp = std::get<3>(p);\n\n std::cout << thisOriginVert << \" - \" << thisEndVert << \" : \" << \n\nthisPersist;\n\n std::cout << \" ( \" << thisNeedUp << \" )\" << std::endl;\n\n }\n\n std::cout << std::endl;\n\n }\n\n\n\n // }\n\n // --------------\n\n // Simplify\n\n // --------------\n\n // {\n\n\n\n return simplifyTree<scalarType>(posSeed0, posSeed1, pairs);\n\n\n\n // }\n\n}\n\n\n\ntemplate <typename scalarType>\n\nSimplexId MergeTree::globalSimplify(const SimplexId posSeed0, const SimplexId \n\nposSeed1)\n\n{\n\n\n\n // if null threshold, leave\n\n if (!params_->simplifyThreshold) {\n\n return 0;\n\n }\n\n\n\n //---------------------\n\n // Sort Nodes\n\n //---------------------\n\n //{\n\n\n\n auto isLowerComp = [&](const idNode &n1, const idNode &n2) {\n\n return isLower(getNode(n1)->getVertexId(), getNode(n2)->getVertexId());\n\n };\n\n\n\n const auto nbNode = getNumberOfNodes();\n\n\n\n std::vector<idNode> sortedNodes(nbNode);\n\n iota(sortedNodes.begin(), sortedNodes.end(), 0);\n\n// Sort nodes by vertex scalar\n\n//{\n\n#ifdef TTK_ENABLE_OPENMP\n\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\n\n __gnu_parallel::sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\n\n#else\n\n sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\n\n#endif\n\n#else\n\n sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\n\n#endif\n\n//}\n\n\n\n //}\n\n //---------------------\n\n // Make pairs\n\n //---------------------\n\n //{\n\n\n\n // origin, end, persistance, needToGoUp\n\n std::vector<std::tuple<SimplexId, SimplexId, scalarType,bool>> pairsJT;\n\n std::vector<std::tuple<SimplexId, SimplexId, scalarType,bool>> pairsST;\n\n\n\n recoverMTPairs<scalarType>(sortedNodes, pairsJT, pairsST);\n\n\n\n //}\n\n //---------------------\n\n // Fusionne & Sort pairs\n\n //---------------------\n\n //{\n\n\n\n auto pairComp = [](const std::tuple<SimplexId, SimplexId, scalarType, bool> \n\n&a,\n\n const std::tuple<SimplexId, SimplexId, scalarType, bool> \n\n&b) {\n\n // sort by persistence\n\n return std::get<2>(a) < std::get<2>(b);\n\n };\n\n\n\n std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> sortedPairs;\n\n size_t sizePJT = pairsJT.size(), sizePST = pairsST.size();\n\n\n\n sortedPairs.reserve(sizePJT + sizePST);\n\n\n\n sortedPairs.insert(sortedPairs.end(), pairsJT.begin(), pairsJT.end());\n\n sortedPairs.insert(sortedPairs.end(), pairsST.begin(), pairsST.end());\n\n\n\n // Sort pairs by persistence\n\n //{\n\n // IS SET STILL BETTER ? (parallel sort) TODO\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\n\n __gnu_parallel::sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\n\n# else\n\n sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\n\n# endif\n\n#else\n\n sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\n\n#endif\n\n\n\n auto last = unique(sortedPairs.begin(), sortedPairs.end());\n\n sortedPairs.erase(last, sortedPairs.end());\n\n\n\n //}\n\n //---------------------\n\n // Traverse pairs and merge on the tree\n\n //---------------------\n\n //{\n\n\n\n // identify subtrees and merge them in recept'arcs\n\n return simplifyTree<scalarType>(posSeed0, posSeed1, sortedPairs);\n\n //}\n\n}\n\n\n\ntemplate <typename scalarType>\n\nSimplexId MergeTree::simplifyTree(\n\n const SimplexId &posSeed0, const SimplexId &posSeed1,\n\n const std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> \n\n&sortedPairs)\n\n{\n\n const auto nbNode = getNumberOfNodes();\n\n const auto nbArcs = getNumberOfSuperArcs();\n\n // Retain the relation between merge coming from st, jt\n\n // also retain info about what we keep\n\n std::vector<ExtendedUnionFind *> subtreeUF(nbNode, nullptr);\n\n\n\n // nb arc seen below / above this node\n\n std::vector<std::pair<idSuperArc, idSuperArc>> valenceOffset(nbNode, \n\nstd::make_pair(0,0));\n\n SimplexId nbPairMerged = 0;\n\n\n\n const bool DEBUG = false;\n\n\n\n if (DEBUG) {\n\n std::cout << \"Imapct simplify on tree btwn : \" << posSeed0 << \" and \" << \n\nposSeed1 << std::endl;\n\n }\n\n\n\n //----------\n\n // Make subtrees\n\n //-----------\n\n //{\n\n\n\n std::queue<std::tuple<idNode,bool>> node2see;\n\n\n\n // Add the origin of all pairs that need to merge\n\n for (const auto & pp : sortedPairs) {\n\n if (std::get<2>(pp) < params_->simplifyThreshold ) {\n\n const SimplexId &thisOriginVert = std::get<0>(pp);\n\n const SimplexId &thisEndVert = std::get<1>(pp);\n\n const idNode & thisOriginId = \n\ngetCorrespondingNodeId(thisOriginVert);\n\n\n\n if (scalars_->mirrorVertices[thisOriginVert] <= posSeed0 ||\n\n scalars_->mirrorVertices[thisOriginVert] >= posSeed1 ||\n\n scalars_->mirrorVertices[thisEndVert] <= posSeed0 ||\n\n scalars_->mirrorVertices[thisEndVert] >= posSeed1) {\n\n continue;\n\n }\n\n\n\n node2see.emplace(thisOriginId, std::get<3>(pp));\n\n subtreeUF[thisOriginId] = new ExtendedUnionFind(0);\n\n ++nbPairMerged;\n\n if(DEBUG){\n\n std::cout << \"willSee \" << printNode(thisOriginId) << std::endl;\n\n }\n\n } else break;\n\n }\n\n\n\n //---\n\n // In UF :\n\n // Origin is the size of the segmentation\n\n // Data is negative : -idNodeRoot-1\n\n // Data is positive : Receptacle Arc id\n\n //--\n\n // Use the queue to mark Arc that will be merged and UF to identify\n\n // subtree. When a node have only one way out : enqueue it to continue \n\n //travresall\n\n while (!node2see.empty()) {\n\n idNode curNodeId;\n\n bool needToGoUp; // identify up/down traversall\n\n\n\n std::tie(curNodeId, needToGoUp) = node2see.front(); \n\n // should have only one arc valid to take\n\n node2see.pop();\n\n\n\n if (DEBUG) {\n\n std::cout << \"process : \" << printNode(curNodeId) << std::endl;\n\n }\n\n\n\n // Here we take the only available arc :\n\n idSuperArc mergingArcId;\n\n idNode parentNodeId;\n\n // continue traversall\n\n if(needToGoUp){\n\n mergingArcId = newUpArc(curNodeId, subtreeUF);\n\n parentNodeId = getSuperArc(mergingArcId)->getUpNodeId();\n\n ++valenceOffset[curNodeId].second;\n\n ++valenceOffset[parentNodeId].first;\n\n } else {\n\n mergingArcId = newDownArc(curNodeId, subtreeUF);\n\n parentNodeId = getSuperArc(mergingArcId)->getDownNodeId();\n\n ++valenceOffset[curNodeId].first;\n\n ++valenceOffset[parentNodeId].second;\n\n }\n\n\n\n markThisArc(subtreeUF, curNodeId, mergingArcId, parentNodeId);\n\n\n\n // if we have processed all but one arc of this node, we nee to continue \n\n // traversall\n\n // throug it\n\n if (valenceOffset[parentNodeId].first + \n\nvalenceOffset[parentNodeId].second + 1 ==\n\n getNode(parentNodeId)->getValence()) {\n\n // only one way out, is it up ?\n\n node2see.emplace(parentNodeId, valenceOffset[parentNodeId].second + \n\n1 ==\n\n \n\ngetNode(parentNodeId)->getUpValence());\n\n if(DEBUG){\n\n std::cout << \" add to see \" << printNode(parentNodeId) << \n\nstd::endl;\n\n }\n\n }\n\n } // end while node2see\n\n\n\n // for each node valenceOffset is the number of arc attached to this node \n\n // that will merge\n\n\n\n // Debug print\n\n if (DEBUG) {\n\n std::cout << \"node subtrees before creating receptarc \" << std::endl;\n\n for (idNode nid = 0; nid < nbNode; nid++) {\n\n if (subtreeUF[nid]) {\n\n std::cout << \"node \" << getNode(nid)->getVertexId() \n\n << \" is in subtree rooted :\";\n\n const idNode &root = -subtreeUF[nid]->find()->getData() - 1;\n\n std::cout << getNode(root)->getVertexId();\n\n const SimplexId &segmSize = subtreeUF[nid]->find()->getOrigin();\n\n std::cout << \" with segmentation of \" << segmSize << std::endl;\n\n }\n\n }\n\n }\n\n\n\n //}\n\n //----------\n\n // Create the recept'arcs\n\n //-----------\n\n //{\n\n\n\n // Add the origin of all pairs that need to merge\n\n for (const auto & pp : sortedPairs) {\n\n if (std::get<2>(pp) < params_->simplifyThreshold ) {\n\n const SimplexId &thisOriginVert = std::get<0>(pp);\n\n const SimplexId &thisEndVert = std::get<1>(pp);\n\n const idNode & thisOriginId = \n\ngetCorrespondingNodeId(thisOriginVert);\n\n //const idNode & thisEndId = getCorrespondingNode(thisEndVert);\n\n\n\n if (scalars_->mirrorVertices[thisOriginVert] <= posSeed0 ||\n\n scalars_->mirrorVertices[thisOriginVert] >= posSeed1 ||\n\n scalars_->mirrorVertices[thisEndVert] <= posSeed0 ||\n\n scalars_->mirrorVertices[thisEndVert] >= posSeed1) {\n\n continue;\n\n }\n\n\n\n if (subtreeUF[thisOriginId]->find()->getData() < 0) {\n\n // create receptarc\n\n const idNode &subtreeRoot = \n\n-subtreeUF[thisOriginId]->find()->getData() - 1;\n\n // The id of the next arc to be created : NOT PARALLEL\n\n const idSuperArc receptArcId = treeData_.superArcs.size();\n\n // down , up, segmentation size\n\n // create the receptacle arc and merge arc not in sub-tree in it\n\n const std::tuple<idNode, idNode, SimplexId> &receptArc =\n\n createReceptArc(subtreeRoot, receptArcId, subtreeUF, \n\nvalenceOffset);\n\n\n\n // make superArc and do the makeAlloc on it\n\n const bool overlapB =\n\n \n\nscalars_->mirrorVertices[getNode(std::get<0>(receptArc))->getVertexId()] < \n\nposSeed0;\n\n const bool overlapA =\n\n \n\nscalars_->mirrorVertices[getNode(std::get<1>(receptArc))->getVertexId()] >= \n\nposSeed1;\n\n const idSuperArc na = makeSuperArc(std::get<0>(receptArc), \n\nstd::get<1>(receptArc), overlapB, overlapA, nullptr, -1);\n\n\n\n if(overlapB){\n\n treeData_.arcsCrossingBelow.emplace_back(na);\n\n }\n\n\n\n if(overlapA){\n\n treeData_.arcsCrossingAbove.emplace_back(na);\n\n }\n\n\n\n subtreeUF[thisOriginId]->find()->setData(receptArcId);\n\n getSuperArc(receptArcId)->makeAllocGlobal(std::get<2>(receptArc));\n\n\n\n if (DEBUG) {\n\n std::cout << \"create arc : \" << printArc(receptArcId)\n\n << \" with segm : \" << std::get<2>(receptArc) << std::endl;\n\n }\n\n }\n","file_path":"ttk/core/base/contourForestsTree/MergeTreeTemplate.h","rank":6,"score":46290.331926858074},{"content":"namespace ttk\n\n{\n\nnamespace ftm\n\n{\n\n\n\ntemplate <typename scalarType, typename idType>\n\nvoid ftm::FTMTree_MT::sortInput(void)\n\n{\n\n const auto &nbVertices = scalars_->size;\n\n\n\n auto *sortedVect = scalars_->sortedVertices.get();\n\n if (sortedVect == nullptr) {\n\n sortedVect = new std::vector<SimplexId>(0);\n\n scalars_->sortedVertices.reset(sortedVect);\n\n } else {\n\n sortedVect->clear();\n\n }\n\n\n\n auto indirect_sort = [&](const size_t &a, const size_t &b) { return isLower<scalarType,idType>(a, b); };\n\n\n\n sortedVect->resize(nbVertices, 0);\n\n std::iota(sortedVect->begin(), sortedVect->end(), 0);\n\n\n\n// #pragma omp parallel\n\n// #pragma omp single\n\n// scalars_->qsort<SimplexId>(sortedVect->data(), 0, scalars_->size -1, indirect_sort);\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n# ifdef __clang__\n\n std::cout << \"Caution, outside GCC, sequential sort\" << std::endl;\n\n std::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\n\n# else\n\n __gnu_parallel::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\n\n# endif\n\n#else\n\n std::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\n\n#endif\n\n\n\n auto *mirrorVert = scalars_->mirrorVertices.get();\n\n if (mirrorVert == nullptr) {\n\n mirrorVert = new std::vector<SimplexId>(0);\n\n scalars_->mirrorVertices.reset(mirrorVert);\n\n } else {\n\n mirrorVert->clear();\n\n }\n\n\n\n scalars_->mirrorVertices->resize(nbVertices);\n\n\n\n#ifdef TTK_ENABLE_OPENMP\n\n#pragma omp parallel for\n\n#endif\n\n for (SimplexId i = 0; i < nbVertices; i++) {\n\n (*scalars_->mirrorVertices)[(*sortedVect)[i]] = i;\n\n }\n\n}\n\n\n\n}\n","file_path":"ttk/core/base/ftmTree/FTMTree_MT_Template.h","rank":7,"score":46290.331926858074},{"content":"namespace ttk{\n\n\n\n template <class dataType> class ScalarFieldCriticalPoints : public Debug{\n\n\n\n public:\n\n \n\n ScalarFieldCriticalPoints();\n\n \n\n ~ScalarFieldCriticalPoints();\n\n\n\n /// Execute the package.\n\n /// \\param argment Dummy integer argument.\n\n /// \\return Returns 0 upon success, negative values otherwise.\n\n int execute();\n\n \n\n char getCriticalType(const SimplexId &vertexId) const{\n\n \n\n return getCriticalType(vertexId, triangulation_);\n\n }\n\n\n\n char getCriticalType(const SimplexId &vertexId,\n\n Triangulation *triangulation) const;\n\n \n\n char getCriticalType(const SimplexId &vertexId,\n\n const std::vector<std::pair<SimplexId, SimplexId> > &vertexLinkEdgeList) const;\n\n \n\n static bool isSosHigherThan(const SimplexId &offset0, const dataType &value0,\n\n const SimplexId &offset1, const dataType &value1){\n\n \n\n return ((value0 > value1)||((value0 == value1)&&(offset0 > offset1)));\n\n }\n\n \n\n static bool isSosLowerThan(const SimplexId &offset0, const dataType &value0,\n\n const SimplexId &offset1, const dataType &value1){\n\n \n\n return ((value0 < value1)||((value0 == value1)&&(offset0 < offset1)));\n\n }\n\n \n\n int setDomainDimension(const int &dimension){\n\n \n\n dimension_ = dimension;\n\n \n\n return 0;\n\n }\n\n \n\n int setOutput(std::vector<std::pair<SimplexId, char> > *criticalPoints){\n\n \n\n criticalPoints_ = criticalPoints;\n\n \n\n return 0;\n\n }\n\n \n\n int setupTriangulation(Triangulation *triangulation){\n\n \n\n triangulation_ = triangulation;\n\n \n\n // pre-condition functions\n\n if(triangulation_){\n\n triangulation_->preprocessVertexNeighbors();\n\n triangulation_->preprocessVertexStars();\n\n }\n\n \n\n return 0;\n\n }\n\n \n\n int setScalarValues(const void *data){\n\n \n\n scalarValues_ = (const dataType *) data;\n\n \n\n return 0;\n\n }\n\n \n\n int setSosOffsets(std::vector<SimplexId> *offsets){\n\n \n\n sosOffsets_ = offsets;\n\n \n\n return 0;\n\n }\n\n \n\n int setVertexLinkEdgeLists(\n\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeList){\n\n \n\n vertexLinkEdgeLists_ = edgeList;\n\n \n\n return 0;\n\n }\n\n \n\n /// Set the number of vertices in the scalar field.\n\n /// \\param vertexNumber Number of vertices in the data-set.\n\n /// \\return Returns 0 upon success, negative values otherwise. \n\n int setVertexNumber(const SimplexId &vertexNumber){\n\n vertexNumber_ = vertexNumber;\n\n return 0;\n\n }\n\n \n\n \n\n protected:\n\n \n\n int dimension_;\n\n SimplexId vertexNumber_;\n\n const dataType *scalarValues_;\n\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *vertexLinkEdgeLists_;\n\n std::vector<std::pair<SimplexId, char> > *criticalPoints_;\n\n std::vector<SimplexId> *sosOffsets_;\n\n std::vector<SimplexId> localSosOffSets_;\n\n Triangulation *triangulation_;\n\n };\n","file_path":"ttk/core/base/scalarFieldCriticalPoints/ScalarFieldCriticalPoints.h","rank":8,"score":46056.08928306435},{"content":"using namespace ttk;\n","file_path":"ttk/core/base/persistenceDiagramsBarycenter/PDBarycenterImpl.h","rank":9,"score":43655.506951274365},{"content":"using namespace ttk;\n","file_path":"ttk/core/base/persistenceDiagramsClustering/PDClusteringImpl.h","rank":10,"score":43655.506951274365},{"content":"#else\n\nclass ttkTriangulation : public ttk::Debug {\n\n#endif\n\n\n\n public:\n\n \n\n ttkTriangulation();\n\n ~ttkTriangulation();\n\n \n\n /// Allocates the memory for the internal ttk::Triangulation data-structure.\n\n /// \\warning Internal TTK usage only.\n\n int allocate();\n\n \n\n /// Retrieves a pointer to the internal ttk::Triangulation of the current \n\n /// object. Traversal can only be performed on a ttk::Triangulation object.\n\n /// \\return Returns a pointer to a valid ttk::Triangulation object upon \n\n /// success, NULL otherwise.\n\n /// \\sa ttk::Triangulation\n\n ttk::Triangulation* getTriangulation(){ return triangulation_;};\n\n \n\n /// Retrieves a pointer to a ttk::Triangulation object from a vtkDataSet.\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":11,"score":34069.2373668983},{"content":"class ttkKeyHandler : public ttk::Debug{\n\n \n\n public:\n\n \n\n virtual int OnKeyPress(\n\n vtkRenderWindowInteractor *interactor, std::string &key) = 0;\n\n};\n\n\n","file_path":"ttk/core/vtk/ttkUserInterfaceBase/ttkUserInterfaceBase.h","rank":12,"score":33660.27519716504},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKCOMMONDATAMODEL_EXPORT ttkTriangulation : public ttk::Debug {\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":13,"score":31808.848403716274},{"content":"#else\n\nclass ttkFTMTree : public vtkDataSetAlgorithm, public ttk::Wrapper\n\n#endif\n\n{\n\n public:\n\n static ttkFTMTree* New();\n\n\n\n vtkTypeMacro(ttkFTMTree, vtkDataSetAlgorithm);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n void SetThreadNumber(int threadNumber)\n\n {\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n\n\n void SetUseAllCores(bool onOff)\n\n {\n\n UseAllCores = onOff;\n","file_path":"ttk/core/vtk/ttkFTMTree/ttkFTMTree.h","rank":14,"score":29561.08868701747},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkFTMTree : public vtkDataSetAlgorithm, public ttk::Wrapper\n","file_path":"ttk/core/vtk/ttkFTMTree/ttkFTMTree.h","rank":15,"score":27903.49833768591},{"content":"#!/usr/bin/env pvpython\n\n\n\n#/// \\ingroup examples\n\n#/// \\author Julien Tierny <julien.tierny@lip6.fr>\n\n#/// \\date October 2017.\n\n#/// \n\n#/// \\brief Minimalist python TTK example pipeline, including:\n\n#/// -# The computation of a persistence curve\n\n#/// -# The computation of a persistence diagram\n\n#/// -# The selection of the most persistent pairs of the diagram\n\n#/// -# The pre-simplification of the data according to this selection\n\n#/// -# The computation of the Morse-Smale complex on this simplified data\n\n#/// -# The storage of the output of this pipeline to disk.\n\n#///\n\n#/// This example reproduces the Figure 1 of the TTK companion paper:\n\n#/// \"The Topology ToolKit\", J. Tierny, G. Favelier, J. Levine, C. Gueunet, M.\n\n#/// Michaux., IEEE Transactions on Visualization and Computer Graphics, Proc.\n\n#/// of IEEE VIS 2017.\n\n\n\nfrom paraview.simple import *\n\n\n\nif len(sys.argv) == 2:\n\n inputFilePath = sys.argv[1]\n\nelse:\n\n print(\"Missing mandatory argument: Path to input VTU file\")\n\n sys.exit() \n\n\n\n# 1. loading the input data\n\ninputData = XMLUnstructuredGridReader(FileName=[inputFilePath])\n\n\n\n# 2. computing the persistence curve\n\npersistenceCurve = TTKPersistenceCurve(inputData)\n\n\n\n# 3. computing the persitence diagram\n\npersistenceDiagram = TTKPersistenceDiagram(inputData)\n\n\n\n# 4. selecting the critical point pairs\n\ncriticalPointPairs = Threshold(persistenceDiagram)\n\ncriticalPointPairs.Scalars = ['CELLS', 'PairIdentifier']\n\ncriticalPointPairs.ThresholdRange = [-0.1, 999999]\n\n\n\n# 5. selecting the most persistent pairs\n\npersistentPairs = Threshold(criticalPointPairs)\n\npersistentPairs.Scalars = ['CELLS', 'Persistence']\n\npersistentPairs.ThresholdRange = [0.05, 999999]\n\n\n\n# 6. simplifying the input data to remove non-persistent pairs\n\ntopologicalSimplification = TTKTopologicalSimplification(\n\n Domain=inputData, Constraints=persistentPairs)\n\n\n\n# 7. computing the Morse-Smale complex\n\nmorseSmaleComplex = TTKMorseSmaleComplex(topologicalSimplification)\n\n\n\n# 8. saving the output data\n\nSaveData('curve.vtk', OutputPort(persistenceCurve, 3))\n\nSaveData('separatrices.vtu', OutputPort(morseSmaleComplex, 1))\n\nSaveData('segmentation.vtu', OutputPort(morseSmaleComplex, 3))\n","file_path":"ttk/examples/python/ttkExample-python.py","rank":16,"score":24351.23999180596},{"content":"def doIt(X, method, ncomponents, nneighbors, njobs, rstate, params):\n\n\n\n import importlib\n\n\n\n # check if numpy is installed\n\n loader = importlib.find_loader('numpy')\n\n found = loader is not None\n\n if found:\n\n print(\"[DimensionReduction] Python: numpy module found.\")\n\n else:\n\n print(\"[DimensionReduction] Python error: numpy module not found.\")\n\n return 0\n\n\n\n # check if scipy is installed\n\n loader = importlib.find_loader('scipy')\n\n found = loader is not None\n\n if found:\n\n print(\"[DimensionReduction] Python: scipy module found.\")\n\n else:\n\n print(\"[DimensionReduction] Python error: scipy module not found.\")\n\n return 0\n\n\n\n # check if scikit-learn is installed\n\n loader = importlib.find_loader('sklearn')\n\n found = loader is not None\n\n if found:\n\n print(\"[DimensionReduction] Python: sklearn module found.\")\n\n else:\n\n print(\"[DimensionReduction] Python error: sklearn module not found.\")\n\n return 0\n\n\n\n from sklearn import manifold\n\n from sklearn import decomposition\n\n import numpy as np\n\n from sys import platform\n\n \n\n if platform == \"darwin\":\n\n import sklearn\n\n sklearn.utils.parallel_backend('threading')\n\n\n\n if rstate > 0:\n\n np.random.seed(0)\n\n\n\n try:\n\n if method == 0:\n\n seParams = params[0]\n\n if seParams[2] == \"None\":\n\n se = manifold.SpectralEmbedding(n_components=ncomponents,\n\n affinity=seParams[0],\n\n gamma=seParams[1],\n\n eigen_solver=None,\n\n n_neighbors=nneighbors,\n\n n_jobs=njobs)\n\n else:\n\n se = manifold.SpectralEmbedding(n_components=ncomponents,\n\n affinity=seParams[0],\n\n gamma=seParams[1],\n\n eigen_solver=seParams[2],\n\n n_neighbors=nneighbors,\n\n n_jobs=njobs)\n\n Y = se.fit_transform(X)\n\n elif method == 1:\n\n lleParams = params[1]\n\n lle = manifold.LocallyLinearEmbedding(n_neighbors=nneighbors,\n\n n_components=ncomponents,\n\n reg=lleParams[0],\n\n eigen_solver=lleParams[1],\n\n tol=lleParams[2],\n\n max_iter=lleParams[3],\n\n method=lleParams[4],\n\n hessian_tol=lleParams[5],\n\n modified_tol=lleParams[6],\n\n neighbors_algorithm=lleParams[7],\n\n n_jobs=njobs)\n\n Y = lle.fit_transform(X)\n\n elif method == 2:\n\n mdsParams = params[2]\n\n mds = manifold.MDS(n_components=ncomponents,\n\n metric=mdsParams[0],\n\n n_init=mdsParams[1],\n\n max_iter=mdsParams[2],\n\n verbose=mdsParams[3],\n\n eps=mdsParams[4],\n\n dissimilarity=mdsParams[5],\n\n n_jobs=njobs)\n\n Y = mds.fit_transform(X)\n\n elif method == 3:\n\n tsneParams = params[3]\n\n tsne = manifold.TSNE(n_components=ncomponents,\n\n perplexity=tsneParams[0],\n\n early_exaggeration=tsneParams[1],\n\n learning_rate=tsneParams[2],\n\n n_iter=tsneParams[3],\n\n n_iter_without_progress=tsneParams[4],\n\n min_grad_norm=tsneParams[5],\n\n metric=tsneParams[6],\n\n init=tsneParams[7],\n\n verbose=tsneParams[8],\n\n method=tsneParams[9],\n\n angle=tsneParams[10])\n\n Y = tsne.fit_transform(X)\n\n elif method == 4:\n\n isoParams = params[4]\n\n iso = manifold.Isomap(n_neighbors=nneighbors,\n\n n_components=ncomponents,\n\n eigen_solver=isoParams[0],\n\n tol=isoParams[1],\n\n max_iter=isoParams[2],\n\n path_method=isoParams[3],\n\n neighbors_algorithm=isoParams[4],\n\n n_jobs=njobs)\n\n Y = iso.fit_transform(X)\n\n elif method == 5:\n\n pcaParams = params[5]\n\n if pcaParams[4] == \"auto\":\n\n pca = decomposition.PCA(n_components=ncomponents,\n\n copy=pcaParams[0],\n\n whiten=pcaParams[1],\n\n svd_solver=pcaParams[2],\n\n tol=pcaParams[3],\n\n iterated_power=\"auto\")\n\n else:\n\n pca = decomposition.PCA(n_components=ncomponents,\n\n copy=pcaParams[0],\n\n whiten=pcaParams[1],\n\n svd_solver=pcaParams[2],\n\n tol=pcaParams[3],\n\n iterated_power=int(pcaParams[4]))\n\n Y = pca.fit_transform(X)\n\n\n\n L = [Y.shape[0], Y.shape[1], np.ravel(Y, 'F')]\n\n return L\n\n except Exception as inst:\n\n print('[DimensionReduction] Error: unexpected behaviour detected in the python script.')\n\n print(type(inst)) # the exception instance\n\n print(inst.args) # arguments stored in .args\n\n print(inst)\n\n return []\n","file_path":"ttk/core/base/dimensionReduction/dimensionReduction.py","rank":17,"score":22362.879955300094},{"content":"#else\n\nclass ttkFiber\n\n#endif\n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkFiber* New();\n\n \n\n vtkTypeMacro(ttkFiber, vtkDataSetAlgorithm);\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n void SetThreads(){\n\n if(!UseAllCores)\n\n threadNumber_ = ThreadNumber;\n\n else{\n\n threadNumber_ = ttk::OsCall::getNumberOfCores();\n\n }\n\n Modified();\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":18,"score":9026.325166417297},{"content":"#else\n\nclass ttkIdentifiers\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkIdentifiers* New();\n\n \n\n vtkTypeMacro(ttkIdentifiers, vtkDataSetAlgorithm);\n\n\n\n vtkSetMacro(CellFieldName, std::string);\n\n vtkGetMacro(CellFieldName, std::string);\n\n\n\n vtkSetMacro(VertexFieldName, std::string);\n\n vtkGetMacro(VertexFieldName, std::string);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n void SetThreads(){\n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":19,"score":9026.325166417297},{"content":"#else\n\nclass ttkForEachRow\n\n#endif\n\n: public vtkMultiBlockDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkForEachRow* New();\n\n vtkTypeMacro(ttkForEachRow, vtkMultiBlockDataSetAlgorithm)\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n void SetThreads(){\n\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\n\n Modified();\n\n }\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n void SetUseAllCores(bool onOff){\n","file_path":"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h","rank":20,"score":9026.325166417297},{"content":"#else\n\nclass ttkBlank\n\n#endif\n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkBlank* New();\n\n vtkTypeMacro(ttkBlank, vtkDataSetAlgorithm)\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n \n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n\n }\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":21,"score":9026.325166417297},{"content":"#else\n\nclass ttkOFFWriter \n\n#endif\n\n : public vtkDataSetWriter{\n\n \n\n public:\n\n \n\n vtkTypeMacro(ttkOFFWriter, vtkDataSetWriter);\n\n void PrintSelf(ostream &os, vtkIndent indent) override;\n\n\n\n static ttkOFFWriter *New();\n\n\n\n // Description:\n\n // Specify file name of the .abc file.\n\n vtkSetStringMacro(FileName);\n\n vtkGetStringMacro(FileName);\n\n\n\n protected:\n\n ttkOFFWriter();\n\n ~ttkOFFWriter();\n\n \n","file_path":"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h","rank":22,"score":9026.325166417297},{"content":"#else\n\nclass ttkEndFor\n\n#endif\n\n: public vtkPassInputTypeAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkEndFor* New();\n\n vtkTypeMacro(ttkEndFor, vtkPassInputTypeAlgorithm)\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n void SetThreads(){\n\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\n\n Modified();\n\n }\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n void SetUseAllCores(bool onOff){\n","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":23,"score":9026.325166417297},{"content":"#else\n\nclass ttkOFFReader \n\n#endif\n\n : public vtkUnstructuredGridAlgorithm\n\n{\n\n public:\n\n vtkTypeMacro(ttkOFFReader, vtkUnstructuredGridAlgorithm);\n\n void PrintSelf(ostream &os, vtkIndent indent) override;\n\n\n\n static ttkOFFReader *New();\n\n\n\n // Description:\n\n // Specify file name of the .abc file.\n\n vtkSetStringMacro(FileName);\n\n vtkGetStringMacro(FileName);\n\n\n\n protected:\n\n ttkOFFReader();\n\n ~ttkOFFReader() = default;\n\n\n\n int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override;\n","file_path":"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h","rank":24,"score":9026.325166417297},{"content":"#else\n\nclass ttkUnstructuredGrid :\n\n#endif\n\n public ttkTriangulation,\n\n public vtkUnstructuredGrid{\n\n\n\n public:\n\n static ttkUnstructuredGrid* New();\n\n ttkTypeMacro(ttkUnstructuredGrid, vtkUnstructuredGrid);\n\n \n\n void CopyStructure(vtkDataSet *other);\n\n\n\n void DeepCopy(vtkDataObject *other);\n\n\n\n void ShallowCopy(vtkDataObject *other);\n\n \n\n protected:\n\n \n\n ttkUnstructuredGrid();\n\n\n\n ~ttkUnstructuredGrid();\n\n \n\n};\n\n\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":25,"score":8922.120517228102},{"content":"#else\n\nclass ttkPolyData :\n\n#endif\n\n public ttkTriangulation,\n\n public vtkPolyData{\n\n\n\n public:\n\n static ttkPolyData* New();\n\n ttkTypeMacro(ttkPolyData, vtkPolyData);\n\n\n\n void CopyStructure(vtkDataSet *other);\n\n\n\n void DeepCopy(vtkDataObject *other);\n\n\n\n void ShallowCopy(vtkDataObject *other);\n\n \n\n protected:\n\n \n\n ttkPolyData();\n\n\n\n ~ttkPolyData();\n\n \n\n};\n\n\n\n#endif // _TTK_TRIANGULATION_H\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":26,"score":8922.120517228102},{"content":"#else\n\nclass ttkImageData :\n\n#endif\n\n public ttkTriangulation,\n\n public vtkImageData{\n\n\n\n public:\n\n static ttkImageData* New();\n\n ttkTypeMacro(ttkImageData, vtkImageData);\n\n\n\n void CopyStructure(vtkDataSet *other);\n\n\n\n void DeepCopy(vtkDataObject *other);\n\n\n\n void ShallowCopy(vtkDataObject *other);\n\n \n\n protected:\n\n \n\n ttkImageData();\n\n\n\n ~ttkImageData();\n\n \n\n};\n\n\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":27,"score":8922.120517228102},{"content":"#else\n\nclass ttkTriangulationFilter\n\n#endif\n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkTriangulationFilter* New();\n\n \n\n vtkTypeMacro(ttkTriangulationFilter, vtkDataSetAlgorithm);\n\n \n\n protected:\n\n \n\n ttkTriangulationFilter();\n\n ~ttkTriangulationFilter(){};\n\n \n\n int RequestData(vtkInformation *request, \n\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override;\n\n \n\n int RequestDataObject(vtkInformation *request,\n\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override;\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":28,"score":8922.120517228102},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkForEachRow\n","file_path":"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h","rank":29,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkOFFReader\n","file_path":"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h","rank":30,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkEndFor\n","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":31,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkIdentifiers\n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":32,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkBlank\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":33,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKIOLEGACY_EXPORT ttkOFFWriter\n","file_path":"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h","rank":34,"score":8826.133300188498},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkFiber\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":35,"score":8826.133300188498},{"content":"// break;\n\n// }\n\n// \n\n// return 1;\n\n// }\n\n // end of TODO-3\n\n \n\n \n\n protected:\n\n \n\n ttkBlank(){\n\n \n\n // init\n\n SomeIntegerArgument = 1;\n\n SomeDoubleArgument = 1;\n\n SomeOption = true;\n\n outputScalarField_ = NULL;\n\n \n\n UseAllCores = true;\n\n \n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":36,"score":8794.208610383143},{"content":" }\n\n \n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n } \n\n \n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n\n }\n\n // end of default ttk setters\n\n \n\n vtkGetMacro(Ucomponent, std::string);\n\n vtkSetMacro(Ucomponent, std::string);\n\n \n\n vtkGetMacro(Uvalue, double);\n\n vtkSetMacro(Uvalue, double);\n\n \n\n vtkGetMacro(Vcomponent, std::string);\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":37,"score":8792.283787226974},{"content":" private:\\\n\n int doIt(std::vector<vtkDataSet *> &inputs, std::vector<vtkDataSet *> &outputs);\\\n\n \\\n\n bool needsToAbort() override { return GetAbortExecute();};\\\n\n \\\n\n int updateProgress(const float &progress) override { \\\n\n UpdateProgress(progress);\\\n\n return 0;\\\n\n };\\\n\n protected:\\\n\n bool UseAllCores;\\\n\n int ThreadNumber;\\\n\n \n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":38,"score":8791.539628917673},{"content":"/// ttk::Triangulation class documentation.\n\n/// \\sa ttk::Triangulation\n\n\n\n#ifndef _TTK_TRIANGULATION_H\n\n#define _TTK_TRIANGULATION_H\n\n\n\n// c++ includes\n\n#include <algorithm>\n\n\n\n// base code includes\n\n#include <Triangulation.h>\n\n#include <Wrapper.h>\n\n\n\n// VTK includes\n\n#include <vtkCellArray.h>\n\n#include <vtkDataSet.h>\n\n#include <vtkDataSetAlgorithm.h>\n\n#include <vtkFiltersCoreModule.h>\n\n#include <vtkImageData.h>\n\n#include <vtkInformation.h>\n\n#include <vtkInformationVector.h>\n\n#include <vtkObjectFactory.h>\n\n#include <vtkPolyData.h>\n\n#include <vtkSmartPointer.h>\n\n#include <vtkUnstructuredGrid.h>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":39,"score":8791.385132537045},{"content":"#ifndef _TTK_IDENTIFIERS_H\n\n#define _TTK_IDENTIFIERS_H\n\n\n\n// VTK includes -- to adapt\n\n#include <vtkCellData.h>\n\n#include <vtkDataArray.h>\n\n#include <vtkDataSet.h>\n\n#include <vtkDataSetAlgorithm.h>\n\n#include <vtkFiltersCoreModule.h>\n\n#include <vtkInformation.h>\n\n#include <vtkIntArray.h>\n\n#include <vtkIdTypeArray.h>\n\n#include <vtkObjectFactory.h>\n\n#include <vtkPointData.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// ttk code includes\n\n#include <ttkWrapper.h>\n\n\n\n// in this example, this wrapper takes a data-set on the input and produces a \n\n// data-set on the output - to adapt.\n\n// see the documentation of the vtkAlgorithm class to decide from which VTK \n\n// class your wrapper should inherit.\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":40,"score":8790.98641412488},{"content":"///\n\n/// \\b Related \\b publication \\n\n\n/// \"Fast and Exact Fiber Surface Extraction for Tetrahedral Meshes\" \\n \n\n/// Pavol Klacansky, Julien Tierny, Hamish Carr, Zhao Geng \\n \n\n/// IEEE Transactions on Visualization and Computer Graphics, 2016.\n\n///\n\n/// \\sa ttkFiberSurface\n\n///\n\n#ifndef _TTK_FIBER_H\n\n#define _TTK_FIBER_H\n\n\n\n// VTK includes -- to adapt\n\n#include <vtkContourFilter.h>\n\n#include <vtkDataSet.h>\n\n#include <vtkDataSetAlgorithm.h>\n\n#include <vtkFiltersCoreModule.h>\n\n#include <vtkInformation.h>\n\n#include <vtkObjectFactory.h>\n\n#include <vtkPointData.h>\n\n#include <vtkPolyData.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// ttk code includes\n\n#include <Wrapper.h>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":41,"score":8790.92178932386},{"content":" protected:\n\n \n\n ttkIdentifiers();\n\n \n\n ~ttkIdentifiers();\n\n \n\n int RequestData(vtkInformation *request, \n\n vtkInformationVector **inputVector, vtkInformationVector *outputVector);\n\n \n\n \n\n private:\n\n \n\n bool UseAllCores;\n\n ttk::ThreadId ThreadNumber;\n\n std::string CellFieldName, VertexFieldName;\n\n \n\n // base code features\n\n int doIt(vtkDataSet *input, vtkDataSet *output);\n\n \n\n bool needsToAbort();\n\n \n\n int updateProgress(const float &progress);\n\n \n\n};\n\n\n\n#endif // _TTK_IDENTIFIERS_H\n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":42,"score":8790.756104828082},{"content":"/// \\ingroup vtk\n\n/// \\class ttkOFFWriter\n\n/// \\author Julien Tierny\n\n/// \\date December 2017.<julien.tierny@lip6.fr>\n\n/// \\brief ttkOFFWriter - Object File Format Writer\n\n///\n\n/// Writes an .off file into VTK format.\n\n\n\n#pragma once\n\n\n\n#include <vtkPoints.h>\n\n#include <vtkSmartPointer.h>\n\n#include <vtkDataSetWriter.h>\n\n\n\n#include <string>\n\n#include <vector>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h","rank":43,"score":8790.459129545006},{"content":" private:\n\n \n\n bool UseAllCores;\n\n int ThreadNumber;\n\n \n\n double Uvalue, Vvalue;\n\n std::string Ucomponent, Vcomponent;\n\n \n\n // base code features\n\n int doIt(vtkDataSet *input, vtkPolyData *output);\n\n \n\n bool needsToAbort();\n\n \n\n int updateProgress(const float &progress);\n\n \n\n};\n\n\n\n#endif // _TTK_RANGEPOLYGON_H\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":44,"score":8790.40644058054},{"content":"/// \\ingroup vtk\n\n/// \\class ttkForEachRow\n\n/// \\author Jonas Lukasczyk <jl@jluk.de>\n\n/// \\date 01.11.2018\n\n///\n\n/// \\brief TTK VTK-filter that iterates over rows of a vtkTable.\n\n///\n\n/// This filter works in conjunction with the ttkEndFor filter to iterate over rows of a vtkTable.\n\n///\n\n/// \\param Input vtkTable table that will be iterated over\n\n/// \\param Output vtkTable table that contains only one row of the input\n\n\n\n#pragma once\n\n\n\n// VTK includes\n\n#include <vtkMultiBlockDataSetAlgorithm.h>\n\n\n\n// TTK includes\n\n#include <ttkWrapper.h>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h","rank":45,"score":8790.339281565708},{"content":"\n\n// VTK includes -- to adapt\n\n#include <vtkCharArray.h>\n\n#include <vtkDataArray.h>\n\n#include <vtkDataSet.h>\n\n#include <vtkDataSetAlgorithm.h>\n\n#include <vtkDoubleArray.h>\n\n#include <vtkFiltersCoreModule.h>\n\n#include <vtkFloatArray.h>\n\n#include <vtkInformation.h>\n\n#include <vtkIntArray.h>\n\n#include <vtkObjectFactory.h>\n\n#include <vtkPointData.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// ttk code includes\n\n#include <Blank.h>\n\n#include <ttkWrapper.h>\n\n\n\n// in this example, this wrapper takes a data-set on the input and produces a \n\n// data-set on the output - to adapt.\n\n// see the documentation of the vtkAlgorithm class to decide from which VTK \n\n// class your wrapper should inherit.\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":46,"score":8790.303540052275},{"content":"/// \\ingroup vtk\n\n/// \\class ttkEndFor\n\n/// \\author Jonas Lukasczyk <jl@jluk.de>\n\n/// \\date 01.11.2018\n\n///\n\n/// \\brief TTK VTK-filter that requests data as long as it is available.\n\n///\n\n/// This filter requests more data as long as the maximum number of elements is not reached. This filter works in conjunction with the ttkForEachRow filter.\n\n///\n\n/// \\param Input vtkDataObject that will be passed through after all iterations.\n\n/// \\param Output vtkDataObject Shallow copy of the input\n\n\n\n#pragma once\n\n\n\n// VTK includes\n\n#include <vtkPassInputTypeAlgorithm.h>\n\n\n\n// TTK includes\n\n#include <ttkWrapper.h>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":47,"score":8790.234752152184},{"content":"/// \\ingroup vtk\n\n/// \\class ttkOFFReader\n\n/// \\author Charles Gueunet <charles.gueunet@kitware.com>\n\n/// \\date December 2017.\n\n/// \\brief ttkOFFReader - Object File Format Reader\n\n///\n\n/// Load an .off file into VTK format\n\n///\n\n/// Note: This reader is not able to deal with comment on the file\n\n\n\n#pragma once\n\n\n\n#include <vtkFiltersCoreModule.h>\n\n#include \"vtkPoints.h\"\n\n#include \"vtkSmartPointer.h\"\n\n#include \"vtkUnstructuredGridAlgorithm.h\"\n\n\n\n#include <string>\n\n#include <vector>\n\n\n\n#ifndef TTK_PLUGIN\n","file_path":"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h","rank":48,"score":8790.21841495429},{"content":"/// \\defgroup vtk vtk\n\n/// \\brief The Topology ToolKit - VTK wrapping code for the processing \n\n/// packages.\n\n/// @{\n\n/// \\ingroup vtk\n\n/// \\class ttkWrapper\n\n/// \\author Julien Tierny <julien.tierny@lip6.fr>\n\n/// \\date February 2016.\n\n/// \n\n\n\n#pragma once\n\n\n\n#include <vtkDataSetAlgorithm.h>\n\n#include <vtkImageData.h>\n\n#include <vtkPolyData.h>\n\n#include <vtkUnstructuredGrid.h>\n\n\n\n#include <Wrapper.h>\n\n#include <ttkTriangulation.h>\n\n\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":49,"score":8789.85520473457},{"content":" if(!UseAllCores)\n\n threadNumber_ = ThreadNumber;\n\n else{\n\n threadNumber_ = ttk::OsCall::getNumberOfCores();\n\n }\n\n Modified();\n\n }\n\n \n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n } \n\n \n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n\n }\n\n // end of default ttk setters\n\n \n\n \n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":50,"score":8789.252675440264},{"content":"#endif\n\n\n\n#ifndef _MSC_VER \n\n#define ttkTemplateMacro(s) vtkTemplateMacro((s));\n\n#define ttkTemplate2Macro(s) vtkTemplate2Macro((s));\n\n#else\n\n#define ttkTemplateMacro(s) vtkTemplateMacro(s);\n\n#define ttkTemplate2Macro(s) vtkTemplate2Macro(s);\n\n#endif\n\n\n\n#ifdef TTK_ENABLE_64BIT_IDS\n\nusing ttkSimplexIdTypeArray = vtkIdTypeArray;\n\n#else\n\nusing ttkSimplexIdTypeArray = vtkIntArray;\n\n#endif\n\n\n\n#define TTK_COMMA ,\n\n\n\n// Macros for vtkWrappers\n\n#define TTK_POLY_DATA_NEW(i, ouputInformation, dataTYpe)\\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":51,"score":8789.176999954927},{"content":"\n\n int countVertsData(std::string line);\n\n int countCellsData(std::string line);\n\n int processLineVert(vtkIdType curLine, std::string &line);\n\n int processLineCell(vtkIdType curLine, std::string &line);\n\n\n\n private:\n\n ttkOFFReader(const ttkOFFReader &) = delete;\n\n void operator=(const ttkOFFReader &) = delete;\n\n\n\n char *FileName;\n\n vtkIdType nbVerts_, nbCells_;\n\n vtkIdType nbVertsData_, nbCellsData_;\n\n\n\n vtkSmartPointer<vtkUnstructuredGrid> mesh_;\n\n vtkSmartPointer<vtkPoints> points_;\n\n std::vector<vtkSmartPointer<vtkDoubleArray>> vertScalars_;\n\n std::vector<vtkSmartPointer<vtkDoubleArray>> cellScalars_;\n\n};\n","file_path":"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h","rank":52,"score":8788.521943115149},{"content":" /// \\warning This function will return a non null pointer if and only if\n\n /// the VTK data-set has undergone a ttkTriangulationFilter (i.e. if it\n\n /// is the direct output of a ttkTriangulationFilter or if a\n\n /// ttkTriangulationFilter has been called in an earlier stage of the \n\n /// pipeline).\n\n /// \\param dataSet Input VTK data-set.\n\n /// \\return Returns a pointer to a valid ttk::Triangulation object upon \n\n /// success, NULL otherwise.\n\n /// \\sa ttk::Triangulation\n\n /// \\sa ttkWrapper\n\n /// \\sa ttkTriangulationFilter\n\n static ttk::Triangulation* getTriangulation(vtkDataSet *dataSet);\n\n \n\n /// Translates the current triangulation into a vtkUnstructuredGrid object.\n\n /// This function, used in conjunction with a vtkXMLUnstructuredGridWriter\n\n /// object, can be useful to store the current triangulation on disk as a\n\n /// VTU file.\n\n /// \\return Returns a valid pointer to a vtkUnstructuredGrid object \n\n /// representing the current triangulation.\n\n ///\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":53,"score":8788.36880118505},{"content":" \\\n\n if(((int) inputs.size() == GetNumberOfInputPorts())\\\n\n &&((int) outputs.size() == GetNumberOfOutputPorts()))\\\n\n doIt(inputs, outputs);\\\n\n \\\n\n return 1;\\\n\n }\n\n\n\n#define TTK_SETUP()\\\n\n public:\\\n\n TTK_PIPELINE_REQUEST();\\\n\n TTK_OUTPUT_MANAGEMENT();\\\n\n void SetThreads(){\\\n\n if(!UseAllCores)\\\n\n threadNumber_ = ThreadNumber;\\\n\n else{\\\n\n threadNumber_ = ttk::OsCall::getNumberOfCores();\\\n\n }\\\n\n Modified();\\\n\n }\\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":54,"score":8788.039329697312},{"content":"/// \\ingroup vtk\n\n/// \\class ttkBlank\n\n/// \\author Your Name Here <Your Email Address Here>\n\n/// \\date The Date Here.\n\n///\n\n/// \\brief TTK VTK-filter that wraps the blank processing package.\n\n///\n\n/// VTK wrapping code for the @Blank package.\n\n/// \n\n/// \\param Input Input scalar field (vtkDataSet)\n\n/// \\param Output Output scalar field (vtkDataSet)\n\n///\n\n/// This filter can be used as any other VTK filter (for instance, by using the \n\n/// sequence of calls SetInputData(), Update(), GetOutput()).\n\n///\n\n/// See the related ParaView example state files for usage examples within a \n\n/// VTK pipeline.\n\n///\n\n/// \\sa ttk::Blank\n\n#pragma once\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":55,"score":8787.788010233258},{"content":"/// \\ingroup vtk\n\n/// \\class ttkIdentifiers\n\n/// \\author Julien Tierny <julien.tierny@lip6.fr>\n\n/// \\date August 2015.\n\n///\n\n/// \\brief TTK VTK-filter that computes the global identifiers for each vertex \n\n/// and each cell as point data and cell data scalar fields.\n\n///\n\n/// This filter is useful to retrieve the global identifiers of vertices or \n\n/// cells in subsequent filters throughout the VTK pipeline.\n\n///\n\n/// \\param Input Input data-set (vtkDataSet)\n\n/// \\param Output Output data-set with identifier fields (vtkDataSet)\n\n///\n\n/// This filter can be used as any other VTK filter (for instance, by using the \n\n/// sequence of calls SetInputData(), Update(), GetOutput()).\n\n///\n\n/// See the related ParaView example state files for usage examples within a \n\n/// VTK pipeline.\n\n///\n","file_path":"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h","rank":56,"score":8787.13250978188},{"content":" // TODO-1\n\n // Specify the number of input and output ports.\n\n // By default, this filter has one input and one output.\n\n // In this example, we define 2 inputs and 2 outputs.\n\n// SetNumberOfInputPorts(2);\n\n// SetNumberOfOutputPorts(2);\n\n // end of TODO-1\n\n }\n\n \n\n ~ttkBlank(){};\n\n \n\n TTK_SETUP();\n\n \n\n \n\n private:\n\n \n\n int SomeIntegerArgument;\n\n double SomeDoubleArgument;\n\n bool SomeOption;\n\n std::string ScalarField;\n\n vtkDataArray *outputScalarField_;\n\n ttk::blank::Blank blank_;\n\n \n\n};\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":57,"score":8787.104586430376},{"content":"\n\n protected:\n\n\n\n ttkForEachRow(){\n\n UseAllCores = false;\n\n\n\n SetNumberOfInputPorts(1);\n\n SetNumberOfOutputPorts(1);\n\n }\n\n ~ttkForEachRow(){};\n\n\n\n bool UseAllCores;\n\n int ThreadNumber;\n\n\n\n int RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\n\n int RequestData(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\n\n\n\n private:\n\n\n\n bool needsToAbort() override { return GetAbortExecute(); };\n\n int updateProgress(const float &progress) override {\n\n UpdateProgress(progress);\n\n return 0;\n\n };\n\n};","file_path":"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h","rank":58,"score":8786.900648935421},{"content":" TTK_POLY_DATA_NEW(i, outputInformation, dataType);\\\n\n }\\\n\n }\\\n\n \\\n\n return 1;\\\n\n }\\\n\n public:\n\n \n\n#define TTK_PIPELINE_REQUEST() \\\n\n protected:\\\n\n std::vector<vtkSmartPointer<ttkTriangulationFilter> > inputTriangulations_;\\\n\n int RequestData(vtkInformation *request, \\\n\n vtkInformationVector **inputVector, \\\n\n vtkInformationVector *outputVector) override {\\\n\n \\\n\n if((int) inputTriangulations_.size() != GetNumberOfInputPorts()){\\\n\n inputTriangulations_.resize(GetNumberOfInputPorts());\\\n\n for(int i = 0; i < (int) inputTriangulations_.size(); i++){\\\n\n inputTriangulations_[i] = \\\n\n vtkSmartPointer<ttkTriangulationFilter>::New();\\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":59,"score":8786.760835569705},{"content":" }\n\n\n\n protected:\n\n\n\n ttkEndFor(){\n\n nextIndex = 0;\n\n\n\n UseAllCores = false;\n\n\n\n SetNumberOfInputPorts(2);\n\n SetNumberOfOutputPorts(1);\n\n }\n\n ~ttkEndFor(){};\n\n\n\n bool UseAllCores;\n\n int ThreadNumber;\n\n\n\n int RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\n\n int RequestUpdateExtent(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\n\n int RequestData(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\n","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":60,"score":8786.723056202558},{"content":" vtkSetMacro(Vcomponent, std::string);\n\n \n\n vtkGetMacro(Vvalue, double);\n\n vtkSetMacro(Vvalue, double);\n\n \n\n int FillOutputPortInformation(int port, vtkInformation *info){\n\n info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkPolyData\"); \n\n return 1;\n\n }\n\n \n\n protected:\n\n \n\n ttkFiber();\n\n \n\n ~ttkFiber();\n\n \n\n int RequestData(vtkInformation *request, \n\n vtkInformationVector **inputVector, vtkInformationVector *outputVector);\n\n \n\n \n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":61,"score":8786.07475663211},{"content":"/// \\ingroup vtk\n\n/// \\class ttkFiber\n\n/// \\author Julien Tierny <julien.tierny@lip6.fr>\n\n/// \\date May 2016.\n\n///\n\n/// \\brief TTK VTK-filter for fiber computation on bivariate volumetric data.\n\n///\n\n/// Given a point in the range, this filter computes its fiber (i.e. pre-image) \n\n/// on bivariate volumetric data. The bivariate input data must be provided as \n\n/// two independent scalar fields attached as point data to the input geometry.\n\n///\n\n/// \\param Input Input bivariate volumetric data-set, either regular grid or\n\n/// triangulation (vtkDataSet)\n\n/// \\param Output Fiber (vtkPolyData)\n\n///\n\n/// This filter can be used as any other VTK filter (for instance, by using the \n\n/// sequence of calls SetInputData(), Update(), GetOutput()).\n\n///\n\n/// See the related ParaView example state files for usage examples within a \n\n/// VTK pipeline.\n","file_path":"ttk/core/vtk/ttkFiber/ttkFiber.h","rank":62,"score":8785.965159263718},{"content":" // end of default ttk setters\n\n \n\n \n\n // TODO-4\n\n // set-getters macros to define from each variable you want to access from \n\n // the outside (in particular from paraview) - to adapt.\n\n // Note that the XML file for the ParaView plug-in specification needs to be\n\n // edited accordingly.\n\n vtkSetMacro(SomeIntegerArgument, int);\n\n vtkGetMacro(SomeIntegerArgument, int);\n\n \n\n vtkSetMacro(SomeDoubleArgument, double);\n\n vtkGetMacro(SomeDoubleArgument, double);\n\n \n\n vtkSetMacro(SomeOption, bool);\n\n vtkGetMacro(SomeOption, bool);\n\n \n\n vtkSetMacro(ScalarField, std::string);\n\n vtkGetMacro(ScalarField, std::string);\n\n // end of TODO-4\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":63,"score":8785.324101715189},{"content":" /// \\warning If the encapsulated ttk::Triangulation object is representing \n\n /// implicitly a regular grid, this grid will be explicitly converted into \n\n /// a triangulation in the output vtkUnstructuredGrid object. This is \n\n /// likely to be very memory-expensive.\n\n vtkUnstructuredGrid* getVtkUnstructuredGrid();\n\n \n\n /// Check if the connectivity of the input data-set \\p dataSet changed \n\n /// since the last time the VTK object \\p callingObject has been modified.\n\n /// This function is particularly useful in vtkWrappers to check if the \n\n /// input geometry changed (requiring a reset of the computation or not).\n\n /// \\param dataSet Input VTK data-set.\n\n /// \\param callingObject Calling VTK object (typically a vtkWrapper)\n\n /// \\return Returns 0 upon success, negative values otherwise.\n\n /// \\sa ttkFTMTree\n\n /// \\sa vtkMorseSmaleComplex\n\n /// \\sa vtkReebSpace\n\n static bool hasChangedConnectivity(ttk::Triangulation *triangulation,\n\n vtkDataSet *dataSet, vtkObject *callingObject);\n\n \n\n /// Specify the input VTK object representing a triangulation or a regular \n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":64,"score":8784.844691566275},{"content":" UseAllCores = onOff;\n\n SetThreads();\n\n }\n\n // end of default ttk setters\n\n\n\n int FillInputPortInformation(int port, vtkInformation* info) override {\n\n switch(port){\n\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkTable\"); break;\n\n default: return 0;\n\n }\n\n return 1;\n\n }\n\n\n\n int FillOutputPortInformation(int port, vtkInformation* info) override {\n\n switch(port){\n\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkTable\"); break;\n\n default: return 0;\n\n }\n\n return 1;\n\n }\n","file_path":"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h","rank":65,"score":8784.689240958782},{"content":" int OpenFile();\n\n virtual void WriteData() override;\n\n \n\n char *FileName;\n\n ofstream *Stream;\n\n \n\n private:\n\n ttkOFFWriter(const ttkOFFWriter &) = delete;\n\n void operator=(const ttkOFFWriter &) = delete;\n\n\n\n};\n","file_path":"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h","rank":66,"score":8784.091310207483},{"content":" UseAllCores = onOff;\n\n SetThreads();\n\n }\n\n // end of default ttk setters\n\n\n\n int FillInputPortInformation(int port, vtkInformation* info) override {\n\n switch(port){\n\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkDataObject\"); break;\n\n case 1: info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkTable\"); break;\n\n default: return 0;\n\n }\n\n return 1;\n\n }\n\n\n\n int FillOutputPortInformation(int port, vtkInformation* info) override {\n\n switch(port){\n\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkDataObject\"); break;\n\n default: return 0;\n\n }\n\n return 1;\n","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":67,"score":8784.026514512123},{"content":" int RequestDataObject(vtkInformation *request, \\\n\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override {\\\n\n \\\n\n vtkDataSetAlgorithm::RequestDataObject(\\\n\n request, inputVector, outputVector);\\\n\n \\\n\n for(int i = 0; i < GetNumberOfOutputPorts(); i++){\\\n\n \\\n\n vtkInformation *outputInformation =\\\n\n outputVector->GetInformationObject(i);\\\n\n \\\n\n vtkDataSet *output = vtkDataSet::SafeDownCast(\\\n\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\n\n \\\n\n if(output){\\\n\n \\\n\n std::string dataType = output->GetClassName();\\\n\n \\\n\n TTK_UNSTRUCTURED_GRID_NEW(i, outputInformation, dataType);\\\n\n \\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":68,"score":8783.756815085357},{"content":" \\\n\n ttkUnstructuredGrid *data = ttkUnstructuredGrid::SafeDownCast(\\\n\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\n\n \\\n\n if(!data){\\\n\n data = ttkUnstructuredGrid::New();\\\n\n outputInformation->Set(vtkDataObject::DATA_OBJECT(), data);\\\n\n data->FastDelete();\\\n\n data->CopyInformationFromPipeline(outputInformation);\\\n\n GetOutputPortInformation(i)->Set(\\\n\n vtkDataObject::DATA_EXTENT_TYPE(), data->GetExtentType());\\\n\n }\\\n\n \\\n\n if((data)&&(!data->getTriangulation())){\\\n\n data->allocate();\\\n\n }\\\n\n }\n\n\n\n#define TTK_OUTPUT_MANAGEMENT() \\\n\n protected: \\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":69,"score":8783.48770007721},{"content":"/// ttk::Triangulation supports both explicit and implicit triangulations: \n\n/// -# Explicit triangulations with vtkUnstructuredGrid or vtkPolyData \n\n/// objects: Given a vtkUnstructuredGrid or a vtkPolyData representing a valid \n\n/// triangulation, ttk:Triangulation provides time efficient accesses \n\n/// (requiring adequate pre-processing, see the ttk::Triangulation class \n\n/// documentation).\n\n/// -# Implicit triangulations with vtkImageData objects: Given a vtkImageData\n\n/// representing a regular grid, ttk::Triangulation will perform an implicit \n\n/// triangulation of the grid, enabling both time and memory efficient \n\n/// traversals of triangulations of regular grids.\n\n///\n\n/// Apart from pre-processes, ttk::Triangulation requires no memory overhead in\n\n/// addition to the input vtkUnstructuredGrid, vtkPolyData or vtkImageData \n\n/// objects (the actual data is passed through pointers). This also means that \n\n/// the input VTK objects (vtkUnstructuredGrid, vtkPolyData or vtkImageData) \n\n/// must persist as long as their corresponding ttk::Triangulation object \n\n/// (unspecified behavior otherwise).\n\n///\n\n/// \\note\n\n/// Only pre-process the information you need! See the \n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":70,"score":8783.386466920301},{"content":" if(dataType == \"vtkPolyData\"){\\\n\n ttkPolyData *data = ttkPolyData::SafeDownCast(\\\n\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\n\n \\\n\n if(!data){\\\n\n data = ttkPolyData::New();\\\n\n outputInformation->Set(vtkDataObject::DATA_OBJECT(), data);\\\n\n data->FastDelete();\\\n\n data->CopyInformationFromPipeline(outputInformation);\\\n\n GetOutputPortInformation(i)->Set(\\\n\n vtkDataObject::DATA_EXTENT_TYPE(), data->GetExtentType());\\\n\n }\\\n\n \\\n\n if((data)&&(!data->getTriangulation())){\\\n\n data->allocate();\\\n\n }\\\n\n }\n\n\n\n#define TTK_UNSTRUCTURED_GRID_NEW(i, ouputInformation, dataTYpe)\\\n\n if(dataType == \"vtkUnstructuredGrid\"){\\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":71,"score":8783.206275248749},{"content":"/// \\ingroup vtk\n\n/// \\class ttkTriangulation\n\n/// \\author Julien Tierny <julien.tierny@lip6.fr>\n\n/// \\date January 2016.\n\n/// \n\n/// \\brief ttkTriangulation is a wrapper for the ttk::Triangulation class, which\n\n/// provides time and memory efficient traversal methods on triangulations of \n\n/// piecewise linear manifolds. It provides the following features:\n\n/// -# Given a vertex, it provides: the list of edges that are connected to \n\n/// it, the list of its neighbors, its link, its star, etc.\n\n/// -# Given an edge, it provides: its vertices, its star, etc.\n\n/// -# Given a triangle, its provides: its vertices, its edges, etc.\n\n/// -# Given a tetrahedron, its provides: its vertices, its edges, its \n\n/// neighbor tetrahedra, etc.\n\n/// -# Given a triangulation, it provides: its list of vertices, edges, \n\n/// triangles and tetrahedra.\n\n///\n\n/// ttk::Triangulation implements faster accesses than, more general-purpose, \n\n/// competing VTK data structures such as the vtkUnstructuredGrid class.\n\n/// \n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":72,"score":8783.156521768593},{"content":" \n\n int shallowCopy(vtkDataObject *other);\n\n \n\n\n\n bool hasAllocated_;\n\n \n\n vtkDataSet *inputDataSet_;\n\n vtkSmartPointer<vtkPoints> \n\n vtkPoints_;\n\n vtkSmartPointer<vtkUnstructuredGrid>\n\n vtkUnstructuredGrid_;\n\n \n\n ttk::Triangulation *triangulation_;\n\n \n\n private:\n\n \n\n};\n\n\n\n// Internal things to allow the ttkTriangulation to travel through a VTK \n\n// pipeline.\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":73,"score":8782.931494993572},{"content":" }\\\n\n }\\\n\n \\\n\n std::vector<vtkDataSet *> inputs(GetNumberOfInputPorts(), NULL);\\\n\n std::vector<vtkDataSet *> outputs(GetNumberOfOutputPorts(), NULL);\\\n\n \\\n\n for(int i = 0; i < GetNumberOfInputPorts(); i++){\\\n\n vtkDataSet *input = vtkDataSet::GetData(inputVector[i]);\\\n\n if(input){\\\n\n inputTriangulations_[i]->SetInputData(input);\\\n\n inputTriangulations_[i]->Update();\\\n\n inputs[i] = inputTriangulations_[i]->GetOutput();\\\n\n }\\\n\n }\\\n\n for(int i = 0; i < GetNumberOfOutputPorts(); i++){\\\n\n outputs[i] = vtkDataSet::SafeDownCast(\\\n\n \\\n\n outputVector->GetInformationObject(i)->Get(\\\n\n vtkDataObject::DATA_OBJECT()));\\\n\n }\\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":74,"score":8782.247683682388},{"content":" /// grid.\n\n /// \\param dataSet Input VTK object (vtkImageData, vtkPolyData or \n\n /// vtkUnstructuredGrid).\n\n /// \\return Returns 0 upon success, negative values otherwise.\n\n ///\n\n /// \\warning If the internal ttk::Triangulation object is already \n\n /// representing a valid triangulation, this information will be \n\n /// over-written (which means that pre-processing functions should \n\n /// be called again).\n\n /// \n\n /// \\warning For memory-efficiency purposes, this function makes NO DATA \n\n /// COPY. This means that, if the object \\p dataSet is destroyed after this \n\n /// function, the behavior of the internal ttk::Triangulation will be \n\n /// unspecified (well, this is a nice way to say it's gonna crash).\n\n int setInputData(vtkDataSet *dataSet);\n\n \n\n \n\n protected:\n\n \n\n int deepCopy(vtkDataObject *other);\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":75,"score":8782.051368729724},{"content":"#define ttkTypeMacro(thisClass, superClass) \\\n\n protected: \\\n\n const char* GetClassNameInternal() const{ \\\n\n return #superClass; \\\n\n } \\\n\n public: \\\n\n typedef superClass Superclass; \\\n\n static bool IsTypeOf(const char *type){ \\\n\n if(!strcmp(\"superClass\", type)){ \\\n\n return 1;\\\n\n } \\\n\n return superClass::IsTypeOf(type); \\\n\n } \\\n\n int IsA(const char *type){ \\\n\n return this->thisClass::IsTypeOf(type); \\\n\n } \\\n\n static thisClass* SafeDownCast(vtkObjectBase *o){ \\\n\n if((o)&&(o->IsA(\"thisClass\"))){ \\\n\n return static_cast<thisClass *>(o); \\\n\n } \\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":76,"score":8781.546597486249},{"content":" return NULL;\\\n\n } \\\n\n thisClass *NewInstance() const { \\\n\n return thisClass::SafeDownCast(this->NewInstanceInternal()); \\\n\n }\\\n\n protected: \\\n\n vtkObjectBase* NewInstanceInternal() const{ \\\n\n return thisClass::New();\\\n\n } \\\n\n public:\\\n\n\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":77,"score":8777.689020324144},{"content":"#if VTK_MAJOR_VERSION <= 8\n\n#define vtkTemplate2Macro(call) \\\n\n vtkTemplate2MacroCase1(VTK_DOUBLE, double, call); \\\n\n vtkTemplate2MacroCase1(VTK_FLOAT, float, call); \\\n\n vtkTemplate2MacroCase1(VTK_LONG_LONG, long long, call); \\\n\n vtkTemplate2MacroCase1(VTK_UNSIGNED_LONG_LONG, unsigned long long, call); \\\n\n vtkTemplate2MacroCase1(VTK_ID_TYPE, vtkIdType, call); \\\n\n vtkTemplate2MacroCase1(VTK_LONG, long, call); \\\n\n vtkTemplate2MacroCase1(VTK_UNSIGNED_LONG, unsigned long, call); \\\n\n vtkTemplate2MacroCase1(VTK_INT, int, call); \\\n\n vtkTemplate2MacroCase1(VTK_UNSIGNED_INT, unsigned int, call); \\\n\n vtkTemplate2MacroCase1(VTK_SHORT, short, call); \\\n\n vtkTemplate2MacroCase1(VTK_UNSIGNED_SHORT, unsigned short, call); \\\n\n vtkTemplate2MacroCase1(VTK_CHAR, char, call); \\\n\n vtkTemplate2MacroCase1(VTK_SIGNED_CHAR, signed char, call); \\\n\n vtkTemplate2MacroCase1(VTK_UNSIGNED_CHAR, unsigned char, call)\n\n#define vtkTemplate2MacroCase1(type1N, type1, call) \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_DOUBLE, double, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_FLOAT, float, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_LONG_LONG, long long, call); \\\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":78,"score":8777.689020324144},{"content":"\n\n private:\n\n\n\n double nextIndex;\n\n\n\n bool needsToAbort() override { return GetAbortExecute(); };\n\n int updateProgress(const float &progress) override {\n\n UpdateProgress(progress);\n\n return 0;\n\n };\n\n};","file_path":"ttk/core/vtk/ttkEndFor/ttkEndFor.h","rank":79,"score":8777.689020324144},{"content":" vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_LONG_LONG, unsigned long long, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_ID_TYPE, vtkIdType, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_LONG, long, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_LONG, unsigned long, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_INT, int, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_INT, unsigned int, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_SHORT, short, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_SHORT, unsigned short, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_CHAR, char, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_SIGNED_CHAR, signed char, call); \\\n\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_CHAR, unsigned char, call)\n\n#define vtkTemplate2MacroCase2(type1N, type1, type2N, type2, call) \\\n\n case vtkTemplate2PackMacro(type1N, type2N): { \\\n\n typedef type1 VTK_T1; \\\n\n typedef type2 VTK_T2; \\\n\n call; \\\n\n }; break\n\n#define vtkTemplate2PackMacro(type1N, type2N) \\\n\n ((((type1N) & 0xFF) << 8) | \\\n\n((type2N) & 0xFF))\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":80,"score":8777.689020324144},{"content":"\n\n // TODO-2\n\n // Over-ride the input types.\n\n // By default, this filter has one input and one output, of the same type.\n\n // Here, you can re-define the input types, on a per input basis.\n\n // In this example, the first input type is forced to vtkUnstructuredGrid.\n\n // The second input type is forced to vtkImageData.\n\n// int FillInputPortInformation(int port, vtkInformation *info) override {\n\n// \n\n// switch(port){\n\n// case 0:\n\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkUnstructuredGrid\"); \n\n// break;\n\n// case 1:\n\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkImageData\"); \n\n// break;\n\n// default:\n\n// break;\n\n// }\n\n// \n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":81,"score":8777.689020324144},{"content":" \n\n private:\n\n \n\n bool needsToAbort() override;\n\n \n\n int updateProgress(const float &progress) override;\n\n \n\n};\n\n\n\n/// @}\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":82,"score":8777.689020324144},{"content":"// return 1;\n\n// }\n\n // end of TODO-2\n\n \n\n // TODO-3\n\n // Over-ride the output types.\n\n // By default, this filter has one input and one output, of the same type.\n\n // Here, you can re-define the output types, on a per output basis.\n\n // In this example, the first output type is forced to vtkUnstructuredGrid.\n\n // The second output type is forced to vtkImageData.\n\n// int FillOutputPortInformation(int port, vtkInformation *info) override {\n\n// \n\n// switch(port){\n\n// case 0:\n\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkUnstructuredGrid\"); \n\n// break;\n\n// case 1:\n\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkImageData\"); \n\n// break;\n\n// default:\n","file_path":"ttk/core/vtk/ttkBlank/ttkBlank.h","rank":83,"score":8777.689020324144},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKCOMMONDATAMODEL_EXPORT ttkPolyData :\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":84,"score":8726.605188497328},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKCOMMONDATAMODEL_EXPORT ttkUnstructuredGrid :\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":85,"score":8726.605188497328},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKFILTERSCORE_EXPORT ttkTriangulationFilter\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkWrapper.h","rank":86,"score":8726.605188497328},{"content":"#ifndef TTK_PLUGIN\n\nclass VTKCOMMONDATAMODEL_EXPORT ttkImageData :\n","file_path":"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h","rank":87,"score":8726.605188497328},{"content":"#else\n\nclass ttkBlockAggregator\n\n#endif\n\n: public vtkMultiBlockDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkBlockAggregator* New();\n\n vtkTypeMacro(ttkBlockAggregator, vtkMultiBlockDataSetAlgorithm)\n\n\n\n vtkSetMacro(ForceReset, bool);\n\n vtkGetMacro(ForceReset, bool);\n\n\n\n vtkSetMacro(FlattenInput, bool);\n\n vtkGetMacro(FlattenInput, bool);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n void SetThreads(){\n\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\n\n Modified();\n","file_path":"ttk/core/vtk/ttkBlockAggregator/ttkBlockAggregator.h","rank":88,"score":8720.76628401961},{"content":"#else\n\nclass ttkIntegralLines\n\n#endif\n\n: public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkIntegralLines* New();\n\n\n\n vtkTypeMacro(ttkIntegralLines, vtkDataSetAlgorithm);\n\n\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n\n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n","file_path":"ttk/core/vtk/ttkIntegralLines/ttkIntegralLines.h","rank":89,"score":8720.76628401961},{"content":"#else\n\nclass ttkLDistance\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper \n\n{\n\n\n\n public:\n\n \n\n static ttkLDistance* New();\n\n \n\n vtkTypeMacro(ttkLDistance, vtkDataSetAlgorithm);\n\n \n\n // Default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n \n\n void SetThreadNumber(int threadNumber) {\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n } \n\n \n\n void SetUseAllCores(bool onOff) {\n","file_path":"ttk/core/vtk/ttkLDistance/ttkLDistance.h","rank":90,"score":8720.76628401961},{"content":"#else\n\nclass ttkContourForests\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n \n\n \n\n public:\n\n \n\n static ttkContourForests* New();\n\n\n\n vtkTypeMacro(ttkContourForests, vtkDataSetAlgorithm);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n vtkSetMacro(FieldId, int);\n\n\n\n void SetThreadNumber(int threadNumber);\n\n void SetDebugLevel(int d);\n\n void SetUseAllCores(bool onOff);\n\n // end of default ttk setters\n","file_path":"ttk/core/vtk/ttkContourForests/ttkContourForests.h","rank":91,"score":8720.76628401961},{"content":"#else\n\nclass ttkJacobiSet\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkJacobiSet* New();\n\n \n\n vtkTypeMacro(ttkJacobiSet, vtkDataSetAlgorithm);\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n } \n\n \n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n","file_path":"ttk/core/vtk/ttkJacobiSet/ttkJacobiSet.h","rank":92,"score":8720.76628401961},{"content":"#else\n\nclass ttkManifoldCheck\n\n#endif\n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkManifoldCheck* New();\n\n vtkTypeMacro(ttkManifoldCheck, vtkDataSetAlgorithm)\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n \n\n void SetThreadNumber(int threadNumber){\\\n\n ThreadNumber = threadNumber;\\\n\n SetThreads();\\\n\n }\\\n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n\n }\n","file_path":"ttk/core/vtk/ttkManifoldCheck/ttkManifoldCheck.h","rank":93,"score":8720.76628401961},{"content":"#else\n\nclass ttkCinemaReader\n\n#endif\n\n: public vtkTableReader, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkCinemaReader* New();\n\n vtkTypeMacro(ttkCinemaReader, vtkTableReader)\n\n\n\n vtkSetMacro(DatabasePath, std::string);\n\n vtkGetMacro(DatabasePath, std::string);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n void SetThreads(){\n\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\n\n Modified();\n\n }\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n","file_path":"ttk/core/vtk/ttkCinemaReader/ttkCinemaReader.h","rank":94,"score":8720.76628401961},{"content":"#else\n\nclass ttkGeometrySmoother\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkGeometrySmoother* New();\n\n \n\n vtkTypeMacro(ttkGeometrySmoother, vtkDataSetAlgorithm);\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n \n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n } \n\n \n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n","file_path":"ttk/core/vtk/ttkGeometrySmoother/ttkGeometrySmoother.h","rank":95,"score":8720.76628401961},{"content":"#else\n\nclass ttkIcoSphere\n\n#endif\n\n: public vtkUnstructuredGridAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkIcoSphere* New();\n\n vtkTypeMacro(ttkIcoSphere, vtkUnstructuredGridAlgorithm)\n\n\n\n vtkSetMacro(Subdivisions, int);\n\n vtkGetMacro(Subdivisions, int);\n\n\n\n vtkSetVector3Macro(Center, float);\n\n vtkGetVector3Macro(Center, float);\n\n\n\n vtkSetMacro(Radius, float);\n\n vtkGetMacro(Radius, float);\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n","file_path":"ttk/core/vtk/ttkIcoSphere/ttkIcoSphere.h","rank":96,"score":8720.76628401961},{"content":"#else\n\nclass ttkCinemaQuery\n\n#endif\n\n: public vtkTableAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n static ttkCinemaQuery* New();\n\n vtkTypeMacro(ttkCinemaQuery, vtkTableAlgorithm)\n\n\n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n void SetThreads(){\n\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\n\n Modified();\n\n }\n\n void SetThreadNumber(int threadNumber){\n\n ThreadNumber = threadNumber;\n\n SetThreads();\n\n }\n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n","file_path":"ttk/core/vtk/ttkCinemaQuery/ttkCinemaQuery.h","rank":97,"score":8720.76628401961},{"content":"#else\n\nclass ttkMeshGraph\n\n#endif\n\n: public vtkUnstructuredGridAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n\n\n static ttkMeshGraph* New();\n\n vtkTypeMacro(ttkMeshGraph, vtkUnstructuredGridAlgorithm)\n\n\n\n vtkSetMacro(UseVariableSize, bool);\n\n vtkGetMacro(UseVariableSize, bool);\n\n\n\n vtkSetMacro(SizeFieldName, std::string);\n\n vtkGetMacro(SizeFieldName, std::string);\n\n\n\n vtkSetMacro(SizeAxis, int);\n\n vtkGetMacro(SizeAxis, int);\n\n\n\n vtkSetMacro(SizeScale, float);\n\n vtkGetMacro(SizeScale, float);\n","file_path":"ttk/core/vtk/ttkMeshGraph/ttkMeshGraph.h","rank":98,"score":8720.76628401961},{"content":"#else\n\nclass ttkIdentifierRandomizer\n\n#endif \n\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\n\n\n\n public:\n\n \n\n static ttkIdentifierRandomizer* New();\n\n vtkTypeMacro(ttkIdentifierRandomizer, vtkDataSetAlgorithm)\n\n \n\n // default ttk setters\n\n vtkSetMacro(debugLevel_, int);\n\n \n\n void SetThreadNumber(int threadNumber){\\\n\n ThreadNumber = threadNumber;\\\n\n SetThreads();\\\n\n }\\\n\n void SetUseAllCores(bool onOff){\n\n UseAllCores = onOff;\n\n SetThreads();\n\n }\n","file_path":"ttk/core/vtk/ttkIdentifierRandomizer/ttkIdentifierRandomizer.h","rank":99,"score":8720.76628401961}],"string":"[\n {\n \"content\": \" class AtomicVector : public std::vector<type>\\n\\n {\\n\\n private:\\n\\n std::size_t nextId;\\n\\n // for initialization\\n\\n const type defaultValue;\\n\\n\\n\\n public:\\n\\n AtomicVector(const std::size_t initSize = 1, const type &dv = type{})\\n\\n : std::vector<type>(), nextId(0), defaultValue{dv}\\n\\n {\\n\\n#ifndef TTK_ENABLE_KAMIKAZE\\n\\n if (!initSize) {\\n\\n std::cout << \\\"Caution, Atomic vector need a non-0 init size !\\\" << std::endl;\\n\\n std::vector<type>::resize(1, defaultValue);\\n\\n } else\\n\\n#endif\\n\\n {\\n\\n std::vector<type>::resize(initSize, defaultValue);\\n\\n }\\n\",\n \"file_path\": \"ttk/core/base/ftmTree/AtomicVector.h\",\n \"rank\": 0,\n \"score\": 69033.67509844416\n },\n {\n \"content\": \"namespace ttk\\n\\n{\\n\\nnamespace ftm\\n\\n{\\n\\n // Compute parameters (global)\\n\\n struct Params {\\n\\n TreeType treeType;\\n\\n bool segm = true;\\n\\n bool normalize = true;\\n\\n bool advStats = true;\\n\\n int samplingLvl = 0;\\n\\n };\\n\\n\\n\\n#ifdef TTK_ENABLE_FTM_TREE_STATS_TIME\\n\\n struct ActiveTask {\\n\\n float begin = -1;\\n\\n float end = -1;\\n\\n SimplexId origin = nullVertex;\\n\\n };\\n\\n#endif\\n\\n\\n\\n // Scalar related containers (global)\\n\\n struct Scalars {\\n\\n SimplexId size;\\n\\n void* values;\\n\\n void* offsets;\\n\\n\\n\\n std::shared_ptr<std::vector<SimplexId>> sortedVertices, mirrorVertices;\\n\\n\\n\\n // Need vertices to be sorted : use mirrorVertices.\\n\\n\\n\\n bool isLower(SimplexId a, SimplexId b) const\\n\\n {\\n\\n return (*mirrorVertices)[a] < (*mirrorVertices)[b];\\n\\n }\\n\\n bool isEqLower(SimplexId a, SimplexId b) const\\n\\n {\\n\\n return (*mirrorVertices)[a] <= (*mirrorVertices)[b];\\n\\n }\\n\\n\\n\\n bool isHigher(SimplexId a, SimplexId b) const\\n\\n {\\n\\n return (*mirrorVertices)[a] > (*mirrorVertices)[b];\\n\\n }\\n\\n bool isEqHigher(SimplexId a, SimplexId b) const\\n\\n {\\n\\n return (*mirrorVertices)[a] >= (*mirrorVertices)[b];\\n\\n }\\n\\n\\n\\n Scalars()\\n\\n : size(0),\\n\\n values(nullptr),\\n\\n offsets(nullptr),\\n\\n sortedVertices(nullptr),\\n\\n mirrorVertices(nullptr)\\n\\n {\\n\\n }\\n\\n\\n\\n // Heavy\\n\\n Scalars(const Scalars& o)\\n\\n : size(o.size),\\n\\n values(o.values),\\n\\n offsets(o.offsets),\\n\\n sortedVertices(o.sortedVertices),\\n\\n mirrorVertices(o.mirrorVertices)\\n\\n {\\n\\n std::cout << \\\"copy in depth, bad perfs\\\" << std::endl;\\n\\n }\\n\\n\\n\\n // Sort\\n\\n template <typename type>\\n\\n void qsort(type arr[], const long int begin, const long int stop,\\n\\n std::function<bool(type, type)> comp) const\\n\\n {\\n\\n if (begin >= stop)\\n\\n return;\\n\\n\\n\\n static const long int MINSIZE = 10;\\n\\n\\n\\n long int left = begin - 1;\\n\\n long int right = stop + 1;\\n\\n const type pivot = arr[begin];\\n\\n\\n\\n while (1) {\\n\\n while (comp(pivot, arr[--right]))\\n\\n ;\\n\\n while (++left <= stop && !comp(pivot, arr[left]))\\n\\n ;\\n\\n\\n\\n if (left < right)\\n\\n swap_el<type>(arr, left, right);\\n\\n else\\n\\n break;\\n\\n }\\n\\n\\n\\n swap_el<type>(arr, begin, right);\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp task untied if (right - begin > MINSIZE)\\n\\n#endif\\n\\n qsort(arr, begin, right - 1, comp);\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp task untied if (stop - right > MINSIZE)\\n\\n#endif \\n\\n qsort(arr, right + 1, stop, comp);\\n\\n }\\n\\n\\n\\n private:\\n\\n template <typename type>\\n\\n static void swap_el(type arr[], const size_t a, const size_t b)\\n\\n {\\n\\n const type tmp = arr[a];\\n\\n arr[a] = arr[b];\\n\\n arr[b] = tmp;\\n\\n }\\n\\n };\\n\\n\\n\\n struct CurrentState {\\n\\n SimplexId vertex;\\n\\n boost::heap::fibonacci_heap<SimplexId, boost::heap::compare<VertCompFN>> propagation;\\n\\n\\n\\n CurrentState(SimplexId startVert, VertCompFN vertComp)\\n\\n : vertex(startVert), propagation(vertComp)\\n\\n {\\n\\n }\\n\\n\\n\\n CurrentState(VertCompFN vertComp)\\n\\n : vertex(nullVertex), propagation(vertComp)\\n\\n {\\n\\n // will need to use setStartVert before use\\n\\n }\\n\\n\\n\\n void setStartVert(const SimplexId v)\\n\\n {\\n\\n vertex = v;\\n\\n }\\n\\n\\n\\n SimplexId getNextMinVertex(void)\\n\\n {\\n\\n vertex = propagation.top();\\n\\n propagation.pop();\\n\\n return vertex;\\n\\n }\\n\\n\\n\\n void addNewVertex(const SimplexId v)\\n\\n {\\n\\n propagation.emplace(v);\\n\\n }\\n\\n\\n\\n void merge(CurrentState& other)\\n\\n {\\n\\n propagation.merge(other.propagation);\\n\\n vertex = propagation.top();\\n\\n }\\n\\n\\n\\n bool empty()\\n\\n {\\n\\n return propagation.empty();\\n\\n }\\n\\n\\n\\n // DEBUG ONLY\\n\\n bool find(SimplexId v)\\n\\n {\\n\\n return std::find(propagation.begin(), propagation.end(), v) != propagation.end();\\n\\n }\\n\",\n \"file_path\": \"ttk/core/base/ftmTree/Structures.h\",\n \"rank\": 1,\n \"score\": 46674.56527775849\n },\n {\n \"content\": \"namespace ttk{\\n\\n /// \\\\brief Identifier type for simplices of any dimension.\\n\\n using LongSimplexId = long long int;\\n\\n\\n\\n /// \\\\brief Identifier type for simplices of any dimension.\\n\\n#ifdef TTK_ENABLE_64BIT_IDS\\n\\n using SimplexId = long long int;\\n\\n#else\\n\\n using SimplexId = int;\\n\\n#endif\\n\\n\\n\\n /// \\\\brief Identifier type for threads (i.e. with OpenMP).\\n\\n using ThreadId = int;\\n\\n\\n\\n /// \\\\brief Identifier type for tasks (i.e. with OpenMP).\\n\\n using TaskId = int;\\n\\n\\n\\n /// default name for mask scalar field\\n\\n const char MaskScalarFieldName[]=\\\"ttkMaskScalarField\\\";\\n\\n\\n\\n /// default name for vertex scalar field\\n\\n const char VertexScalarFieldName[]=\\\"ttkVertexScalarField\\\";\\n\\n\\n\\n /// default name for offset scalar field\\n\\n const char OffsetScalarFieldName[]=\\\"ttkOffsetScalarField\\\";\\n\\n\\n\\n /// default name for bivariate offset fields\\n\\n const char OffsetFieldUName[]=\\\"ttkOffsetFieldU\\\";\\n\\n const char OffsetFieldVName[]=\\\"ttkOffsetFieldV\\\";\\n\\n\\n\\n /// default value for critical index\\n\\n enum class CriticalType { \\n\\n Local_minimum = 0, Saddle1, Saddle2, Local_maximum, Degenerate, Regular };\\n\",\n \"file_path\": \"ttk/core/base/common/DataTypes.h\",\n \"rank\": 2,\n \"score\": 46674.56527775849\n },\n {\n \"content\": \"namespace ttk {\\n\\n\\ttemplate<typename dataType>\\n\\n\\tstd::vector<KDTree<dataType>*> KDTree<dataType>::build(dataType* data, const int& ptNumber, const int& dimension, std::vector<std::vector<dataType>>& weights, const int weight_number){\\n\\n\\t\\tstd::vector<KDTree<dataType>*> correspondance_map(ptNumber);\\n\\n\\t\\t// First, perform a argsort on the data\\n\\n\\t\\t// initialize original index locations\\n\\n\\t\\tfor(int axis = 0; axis<dimension; axis++){\\n\\n\\t\\t\\tcoords_min_.push_back(std::numeric_limits<dataType>::lowest());\\n\\n\\t\\t\\tcoords_max_.push_back(std::numeric_limits<dataType>::max());\\n\\n\\t\\t}\\n\\n\\t\\tstd::vector<int> idx(ptNumber);\\n\\n\\t\\tfor(int i=0; i<ptNumber; i++){\\n\\n\\t\\t\\tidx[i] = i;\\n\\n\\t\\t}\\n\\n\\t\\t// sort indexes based on comparing values in coordinates\\n\\n\\t\\tsort(idx.begin(), idx.end(), [&](int i1, int i2) {return data[dimension*i1+coords_number_] < data[dimension*i2+coords_number_];});\\n\\n\\t\\tint median_loc = (int) (ptNumber-1)/2;\\n\\n\\t\\tint median_idx = idx[median_loc];\\n\\n\\t\\tcorrespondance_map[median_idx] = this;\\n\\n\\t\\t\\n\\n\\t\\tfor(int axis=0; axis<dimension; axis++){\\n\\n\\t\\t\\tcoordinates_.push_back(data[dimension*median_idx + axis]); \\n\\n\\t\\t}\\n\\n\\t\\tfor(int i=0; i<weight_number; i++){\\n\\n\\t\\t\\tweight_.push_back(weights[i][median_idx]);\\n\\n\\t\\t\\tmin_subweights_.push_back(weights[i][median_idx]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tid_ = median_idx;\\n\\n\\t\\tparent_ = nullptr;\\n\\n\\t\\tlevel_ = 0;\\n\\n\\t\\t\\n\\n\\t\\tif(idx.size()>2){\\n\\n\\t\\t\\t// Build left leaf\\n\\n\\t\\t\\tstd::vector<int> idx_left;\\n\\n\\t\\t\\tfor(int i=0; i<median_loc; i++){\\n\\n\\t\\t\\t\\tidx_left.push_back(idx[i]);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t\\n\\n\\t\\t\\tKDTree* left = new KDTree(this, (coords_number_+1)%dimension, true);\\n\\n\\t\\t\\tleft->buildRecursive(data, idx_left, ptNumber, dimension, this, correspondance_map, weights, weight_number);\\n\\n\\t\\t\\tleft_ = left;\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tif(idx.size()>1){\\n\\n\\t\\t\\t// Build right leaf\\n\\n\\t\\t\\tstd::vector<int> idx_right(ptNumber - median_loc - 1);\\n\\n\\t\\t\\tfor(int i=0; i<ptNumber - median_loc - 1; i++){\\n\\n\\t\\t\\t\\tidx_right[i] = idx[i + median_loc + 1];\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tKDTree* right = new KDTree(this, (coords_number_+1)%dimension, false);\\n\\n\\t\\t\\tright->buildRecursive(data, idx_right, ptNumber, dimension, this, correspondance_map, weights, weight_number);\\n\\n\\t\\t\\tright_ = right;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\treturn correspondance_map;\\n\\n\\t}\\n\\n\\t\\n\\n\\n\\n\\ttemplate<typename dataType>\\n\\n\\tvoid KDTree<dataType>::buildRecursive(dataType* data, std::vector<int> idx_side, const int& ptNumber, const int& dimension, KDTree<dataType>* parent, std::vector<KDTree<dataType>*>& correspondance_map, std::vector<std::vector<dataType>>& weights, const int weight_number){\\n\\n\\t\\t// First, perform a argsort on the data\\n\\n\\t\\tsort(idx_side.begin(), idx_side.end(), [&](int i1, int i2) {return data[dimension*i1 + coords_number_] < data[dimension*i2 + coords_number_]; });\\n\\n\\t\\tint median_loc = (int) (idx_side.size()-1)/2;\\n\\n\\t\\tint median_idx = idx_side[median_loc];\\n\\n\\t\\tcorrespondance_map[median_idx] = this;\\n\\n\\t\\t\\n\\n\\t\\tfor(int axis=0; axis<dimension; axis++){\\n\\n\\t\\t\\tcoordinates_.push_back(data[dimension*median_idx + axis]);\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tid_ = median_idx;\\n\\n\\t\\tparent_ = parent;\\n\\n\\t\\tlevel_ = parent->level_ +1;\\n\\n\\t\\t\\n\\n\\t\\tfor(int i=0; i<weight_number; i++){\\n\\n\\t\\t\\tweight_.push_back(weights[i][median_idx]);\\n\\n\\t\\t\\tmin_subweights_.push_back(weights[i][median_idx]);\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tif(idx_side.size()>1){\\n\\n\\t\\t\\t// Once we get to a leaf, update min_subweights of the parents\\n\\n\\t\\t\\tfor(int w=0; w<weight_number; w++){\\n\\n\\t\\t\\t\\tthis->updateMinSubweight(w);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t\\t\\n\\n\\t\\t// Create bounding box\\n\\n\\t\\tfor(int axis = 0; axis<dimension; axis++){\\n\\n\\t\\t\\tcoords_min_.push_back(parent_->coords_min_[axis]);\\n\\n\\t\\t\\tcoords_max_.push_back(parent_->coords_max_[axis]);\\n\\n\\t\\t}\\n\\n\\t\\tif(is_left_ && !this->isRoot()){\\n\\n\\t\\t\\tcoords_max_[parent_->coords_number_] = parent_->coordinates_[parent_->coords_number_];\\n\\n\\t\\t}\\n\\n\\t\\telse if(!is_left_ && !this->isRoot()){\\n\\n\\t\\t\\tcoords_min_[parent_->coords_number_] = parent_->coordinates_[parent_->coords_number_];\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tif(idx_side.size()>2){\\n\\n\\t\\t\\t// Build left leaf\\n\\n\\t\\t\\tstd::vector<int> idx_left(median_loc);\\n\\n\\t\\t\\tfor(int i=0; i<median_loc; i++){\\n\\n\\t\\t\\t\\tidx_left[i] = idx_side[i];\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t\\n\\n\\t\\t\\tKDTree* left = new KDTree(this, (coords_number_+1)%dimension, true);\\n\\n\\t\\t\\tleft->buildRecursive(data, idx_left, ptNumber, dimension, this, correspondance_map, weights, weight_number);\\n\\n\\t\\t\\tleft_ = left;\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tif(idx_side.size()>1){\\n\\n\\t\\t\\t// Build right leaf\\n\\n\\t\\t\\tstd::vector<int> idx_right(idx_side.size() - median_loc-1);\\n\\n\\t\\t\\tfor(unsigned int i=0; i<idx_side.size() - median_loc-1; i++){\\n\\n\\t\\t\\t\\tidx_right[i] = idx_side[i + median_loc + 1];\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tKDTree* right = new KDTree(this, (coords_number_+1)%dimension, false);\\n\\n\\t\\t\\tright->buildRecursive(data, idx_right, ptNumber, dimension, this, correspondance_map, weights, weight_number);\\n\\n\\t\\t\\tright_ = right;\\n\\n\\t\\t}\\n\\n\\t\\treturn;\\n\\n\\t}\\t\\n\",\n \"file_path\": \"ttk/core/base/kdTree/buildWeights.h\",\n \"rank\": 3,\n \"score\": 46541.78294768764\n },\n {\n \"content\": \"namespace ttk{\\n\\n \\n\\n template <class dataTypeU, class dataTypeV> class JacobiSet : public Debug{\\n\\n\\n\\n public:\\n\\n \\n\\n JacobiSet();\\n\\n \\n\\n ~JacobiSet();\\n\\n\\n\\n int connectivityPreprocessing(const std::vector<std::vector<SimplexId> > &edgeStarList,\\n\\n std::vector<std::vector<std::pair<SimplexId, SimplexId> > > &edgeFanLinkEdgeLists,\\n\\n std::vector<std::vector<LongSimplexId> > &edgeFans,\\n\\n std::vector<SimplexId> &sosOffsets) const;\\n\\n \\n\\n int execute(std::vector<std::pair<SimplexId, char> > &jacobiSet);\\n\\n \\n\\n char getCriticalType(const SimplexId &edgeId);\\n\\n \\n\\n int perturbate(const dataTypeU &uEpsilon = pow(10, -DBL_DIG),\\n\\n const dataTypeV &vEpsilon = pow(10, -DBL_DIG)) const;\\n\\n \\n\\n int setEdgeFans(const std::vector<std::vector<SimplexId> > *edgeFans){\\n\\n edgeFans_ = edgeFans;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setEdgeFanLinkEdgeList(\\n\\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeFanLinkEdgeLists){\\n\\n edgeFanLinkEdgeLists_ = edgeFanLinkEdgeLists;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setEdgeList(const std::vector<std::pair<SimplexId, SimplexId> > *edgeList){\\n\\n edgeList_ = edgeList;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setInputField(const void *uField, const void *vField){\\n\\n \\n\\n uField_ = uField;\\n\\n vField_ = vField;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setSosOffsets(std::vector<SimplexId> *sosOffsets){\\n\\n // legacy API\\n\\n return setSosOffsetsU(sosOffsets);\\n\\n }\\n\\n \\n\\n int setSosOffsetsU(std::vector<SimplexId> *sosOffsets){\\n\\n sosOffsetsU_ = sosOffsets;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setSosOffsetsV(std::vector<SimplexId> *sosOffsets){\\n\\n sosOffsetsV_ = sosOffsets;\\n\\n return 0;\\n\\n }\\n\\n\\n\\n // NOTE: here it's not clear how vtk builds vtkIdType \\n\\n // to check on bigger data-sets\\n\\n int setTetList(const SimplexId *tetList){\\n\\n tetList_ = tetList;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setVertexNumber(const SimplexId &vertexNumber){\\n\\n vertexNumber_ = vertexNumber;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setupTriangulation(Triangulation *triangulation){\\n\\n \\n\\n triangulation_ = triangulation;\\n\\n \\n\\n // pre-condition functions\\n\\n if(triangulation_){\\n\\n triangulation_->preprocessEdges();\\n\\n triangulation_->preprocessEdgeStars();\\n\\n }\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n protected:\\n\\n \\n\\n int executeLegacy(std::vector<std::pair<SimplexId, char> > &jacobiSet);\\n\\n \\n\\n SimplexId vertexNumber_;\\n\\n const SimplexId *tetList_;\\n\\n const void *uField_, *vField_;\\n\\n const std::vector<std::pair<SimplexId, SimplexId> > *edgeList_;\\n\\n // for each edge, one skeleton of its triangle fan\\n\\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeFanLinkEdgeLists_;\\n\\n // for each edge, the one skeleton of its triangle fan\\n\\n const std::vector<std::vector<SimplexId> > *edgeFans_;\\n\\n std::vector<SimplexId> *sosOffsetsU_, *sosOffsetsV_;\\n\\n std::vector<SimplexId> localSosOffsetsU_, localSosOffsetsV_;\\n\\n Triangulation *triangulation_;\\n\\n };\\n\",\n \"file_path\": \"ttk/core/base/jacobiSet/JacobiSet.h\",\n \"rank\": 4,\n \"score\": 46541.78294768764\n },\n {\n \"content\": \"namespace ttk\\n\\n{\\n\\nnamespace cf\\n\\n{\\n\\n\\n\\n// ------------------- Contour Forests\\n\\n\\n\\n// Process\\n\\n// {\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nint ContourForests::build()\\n\\n{\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n omp_set_num_threads(parallelParams_.nbThreads);\\n\\n#endif\\n\\n\\n\\n DebugTimer timerTOTAL;\\n\\n\\n\\n // -----------\\n\\n // Paramemters\\n\\n // -----------\\n\\n initTreeType();\\n\\n initNbScalars();\\n\\n initNbPartitions();\\n\\n initSoS();\\n\\n\\n\\n if (params_->debugLevel >= 2) {\\n\\n // print params:\\n\\n std::cout << \\\"threads :\\\" << \\n\\nstatic_cast<unsigned>(parallelParams_.nbThreads) << std::endl;\\n\\n std::cout << \\\"partitions : \\\" \\n\\n<<static_cast<unsigned>(parallelParams_.nbPartitions) << std::endl;\\n\\n if(params_->simplifyThreshold){\\n\\n std::cout << \\\"simplify method : \\\" << params_->simplifyMethod << \\n\\nstd::endl;\\n\\n std::cout << \\\"simplify thresh.: \\\" << params_->simplifyThreshold << \\n\\nstd::endl;\\n\\n }\\n\\n }\\n\\n printDebug(timerTOTAL, \\\"Initialization \\\");\\n\\n\\n\\n // ---------\\n\\n // Sort Step\\n\\n // ---------\\n\\n\\n\\n DebugTimer timerSort;\\n\\n sortInput<scalarType>();\\n\\n printDebug(timerSort, \\\"Sort scalars (+mirror) \\\");\\n\\n\\n\\n // -------------------\\n\\n // Interface & Overlap\\n\\n // -------------------\\n\\n\\n\\n DebugTimer timerInitOverlap;\\n\\n initInterfaces();\\n\\n initOverlap();\\n\\n if(params_->debugLevel > 3){\\n\\n for (idInterface i = 0; i < parallelParams_.nbInterfaces; i++) {\\n\\n std::cout << \\\"interface : \\\" << static_cast<unsigned>(i);\\n\\n std::cout << \\\" seed : \\\" << parallelData_.interfaces[i].getSeed();\\n\\n std::cout << std::endl;\\n\\n }\\n\\n }\\n\\n printDebug(timerInitOverlap, \\\"Interface and overlap init. \\\");\\n\\n\\n\\n // -----------------------\\n\\n // Allocate parallel trees\\n\\n // -----------------------\\n\\n\\n\\n DebugTimer timerAllocPara;\\n\\n // Union find std::vector for each partition\\n\\n std::vector<std::vector<ExtendedUnionFind *>> \\n\\nvect_baseUF_JT(parallelParams_.nbPartitions),\\n\\n \\n\\nvect_baseUF_ST(parallelParams_.nbPartitions);\\n\\n const SimplexId &resSize = (scalars_->size / parallelParams_.nbPartitions) / \\n\\n10;\\n\\n\\n\\n parallelData_.trees.clear();\\n\\n parallelData_.trees.reserve(parallelParams_.nbPartitions);\\n\\n\\n\\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\\n\\n // Tree array initialization\\n\\n parallelData_.trees.emplace_back(params_,mesh_,scalars_, tree);\\n\\n }\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp parallel for num_threads(parallelParams_.nbPartitions) \\\\\\n\\nschedule(static)\\n\\n#endif\\n\\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\\n\\n // Tree array initialization\\n\\n parallelData_.trees[tree].flush();\\n\\n\\n\\n // UF-array reserve\\n\\n vect_baseUF_JT[tree].resize(scalars_->size);\\n\\n vect_baseUF_ST[tree].resize(scalars_->size);\\n\\n\\n\\n // Statistical reserve\\n\\n parallelData_.trees[tree].jt_->treeData_.nodes.reserve(resSize);\\n\\n parallelData_.trees[tree].jt_->treeData_.superArcs.reserve(resSize);\\n\\n parallelData_.trees[tree].st_->treeData_.nodes.reserve(resSize);\\n\\n parallelData_.trees[tree].st_->treeData_.superArcs.reserve(resSize);\\n\\n\\n\\n }\\n\\n printDebug(timerAllocPara, \\\"Parallel allocations \\\");\\n\\n\\n\\n // -------------------------\\n\\n // Build trees in partitions\\n\\n // -------------------------\\n\\n\\n\\n DebugTimer timerbuild;\\n\\n parallelBuild<scalarType>(vect_baseUF_JT, vect_baseUF_ST);\\n\\n\\n\\n if (params_->debugLevel >= 4) {\\n\\n if (params_->treeType == TreeType::Contour) {\\n\\n for (idPartition i = 0; i < parallelParams_.nbPartitions; i++) {\\n\\n std::cout << i << \\\" :\\\" << std::endl;\\n\\n parallelData_.trees[i].printTree2();\\n\\n std::cout << \\\"-----\\\" << std::endl;\\n\\n }\\n\\n } else {\\n\\n for (idPartition i = 0; i < parallelParams_.nbPartitions; i++) {\\n\\n std::cout << i << \\\" jt:\\\" << std::endl;\\n\\n parallelData_.trees[i].jt_->printTree2();\\n\\n std::cout << i << \\\" st:\\\" << std::endl;\\n\\n parallelData_.trees[i].st_->printTree2();\\n\\n std::cout << \\\"-----\\\" << std::endl;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n printDebug(timerbuild, \\\"ParallelBuild \\\");\\n\\n\\n\\n // --------------------\\n\\n // Stitching partitions\\n\\n // --------------------\\n\\n\\n\\n DebugTimer timerZip;\\n\\n if (parallelParams_.partitionNum == -1 && parallelParams_.nbPartitions > 1 ) \\n\\n{\\n\\n stitch();\\n\\n for (idPartition p = 0; p < parallelParams_.nbPartitions; ++p) {\\n\\n \\n\\nparallelData_.trees[p].parallelInitNodeValence(parallelParams_.nbThreads);\\n\\n }\\n\\n }\\n\\n\\n\\n if (params_->debugLevel >= 4) {\\n\\n printVectCT();\\n\\n }\\n\\n\\n\\n printDebug(timerZip, \\\"Stitch \\\");\\n\\n\\n\\n // -------------------------------------------------\\n\\n // Unification : create one tree from stitched trees\\n\\n // -------------------------------------------------\\n\\n\\n\\n DebugTimer timerUnify;\\n\\n if (params_->treeType == TreeType::Contour) {\\n\\n if(parallelParams_.partitionNum >= 0){\\n\\n if (parallelParams_.partitionNum > parallelParams_.nbInterfaces) {\\n\\n clone(¶llelData_.trees[parallelParams_.nbPartitions - 1]);\\n\\n } else {\\n\\n clone(¶llelData_.trees[parallelParams_.partitionNum]);\\n\\n }\\n\\n } else if (parallelParams_.nbPartitions == 1) {\\n\\n clone(¶llelData_.trees[0]);\\n\\n } else {\\n\\n unify();\\n\\n // for global simlify\\n\\n parallelInitNodeValence(parallelParams_.nbThreads);\\n\\n }\\n\\n } else {\\n\\n if(parallelParams_.partitionNum >= 0){\\n\\n if(parallelParams_.partitionNum > parallelParams_.nbInterfaces){\\n\\n jt_->clone(parallelData_.trees[parallelParams_.nbInterfaces].jt_);\\n\\n st_->clone(parallelData_.trees[parallelParams_.nbInterfaces].st_);\\n\\n } else {\\n\\n jt_->clone(parallelData_.trees[parallelParams_.partitionNum].jt_);\\n\\n st_->clone(parallelData_.trees[parallelParams_.partitionNum].st_);\\n\\n }\\n\\n } else if (parallelParams_.nbPartitions == 1) {\\n\\n jt_->clone(parallelData_.trees[0].jt_);\\n\\n st_->clone(parallelData_.trees[0].st_);\\n\\n } else {\\n\\n unify();\\n\\n jt_->parallelInitNodeValence(parallelParams_.nbThreads);\\n\\n st_->parallelInitNodeValence(parallelParams_.nbThreads);\\n\\n }\\n\\n }\\n\\n\\n\\n printDebug(timerUnify, \\\"Create Contour tree \\\");\\n\\n\\n\\n // -------------------\\n\\n // Simplification step\\n\\n // -------------------\\n\\n\\n\\n if (params_->treeType == TreeType::Contour && parallelParams_.partitionNum \\n\\n== -1 &&\\n\\n params_->simplifyThreshold) {\\n\\n DebugTimer timerGlobalSimplify;\\n\\n SimplexId simplifed = globalSimplify<scalarType>(-1, nullVertex);\\n\\n if(params_->debugLevel >=1){\\n\\n printDebug(timerGlobalSimplify, \\\"Simplify Contour tree \\\");\\n\\n std::cout << \\\" ( \\\" << simplifed << \\\" pairs merged )\\\" << std::endl;\\n\\n }\\n\\n }\\n\\n\\n\\n printDebug(timerTOTAL, \\\"TOTAL \\\");\\n\\n\\n\\n // ------------------------------\\n\\n // Debug print and memory reclaim\\n\\n // ------------------------------\\n\\n\\n\\n if (params_->debugLevel >= 5) {\\n\\n if(params_->treeType == TreeType::Contour)\\n\\n printTree2();\\n\\n else {\\n\\n std::cout << \\\"JT :\\\" << std::endl;\\n\\n jt_->printTree2();\\n\\n std::cout << \\\"ST :\\\" << std::endl;\\n\\n st_->printTree2();\\n\\n }\\n\\n } else if (params_->debugLevel > 2) {\\n\\n if(params_->treeType == TreeType::Contour)\\n\\n std::cout << \\\"max node : \\\" << getNumberOfNodes() << std::endl;\\n\\n else {\\n\\n std::cout << \\\"JT max node : \\\" << jt_->getNumberOfNodes() << \\n\\nstd::endl;\\n\\n std::cout << \\\"ST max node : \\\" << st_->getNumberOfNodes() << \\n\\nstd::endl;\\n\\n }\\n\\n }\\n\\n\\n\\n if (params_->treeType == TreeType::Contour) {\\n\\n updateSegmentation();\\n\\n } else {\\n\\n jt_->updateSegmentation();\\n\\n st_->updateSegmentation();\\n\\n }\\n\\n\\n\\n // reclaim memory\\n\\n {\\n\\n for (idPartition tree = 0; tree < parallelParams_.nbPartitions; ++tree) {\\n\\n parallelData_.trees[tree].jt_->treeData_.nodes.shrink_to_fit();\\n\\n parallelData_.trees[tree].jt_->treeData_.superArcs.shrink_to_fit();\\n\\n parallelData_.trees[tree].st_->treeData_.nodes.shrink_to_fit();\\n\\n parallelData_.trees[tree].st_->treeData_.superArcs.shrink_to_fit();\\n\\n }\\n\\n // Not while arc segmentation depends on std::vector in partitions\\n\\n //parallelData_.interfaces.clear();\\n\\n //parallelData_.trees.clear();\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nint ContourForests::parallelBuild(std::vector<std::vector<ExtendedUnionFind *>> \\n\\n&vect_baseUF_JT,\\n\\n std::vector<std::vector<ExtendedUnionFind *>> \\n\\n&vect_baseUF_ST)\\n\\n{\\n\\n std::vector<float> timeSimplify(parallelParams_.nbPartitions, 0);\\n\\n std::vector<float> speedProcess(parallelParams_.nbPartitions*2, 0);\\n\\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\\n\\n SimplexId nbPairMerged = 0;\\n\\n#endif\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n omp_set_nested(1);\\n\\n#endif\\n\\n\\n\\n//std::cout << \\\"NO PARALLEL DEBUG MODE\\\" << std::endl;\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp parallel for num_threads(parallelParams_.nbPartitions) \\\\\\n\\nschedule(static)\\n\\n#endif\\n\\n for (idPartition i = 0; i < parallelParams_.nbPartitions; ++i) {\\n\\n DebugTimer timerMergeTree;\\n\\n\\n\\n // ------------------------------------------------------\\n\\n // Skip partition that are not asked to compute if needed\\n\\n // ------------------------------------------------------\\n\\n\\n\\n if (parallelParams_.partitionNum != -1 && parallelParams_.partitionNum != \\n\\ni)\\n\\n continue;\\n\\n\\n\\n // ------------------------------------------------------\\n\\n // Retrieve boundary & overlap list for current partition\\n\\n // ------------------------------------------------------\\n\\n\\n\\n std::tuple<SimplexId, SimplexId> rangeJT = getJTRange(i);\\n\\n std::tuple<SimplexId, SimplexId> rangeST = getSTRange(i);\\n\\n std::tuple<SimplexId, SimplexId> seedsPos = getSeedsPos(i);\\n\\n std::tuple<std::vector<SimplexId>, std::vector<SimplexId>> overlaps = \\n\\ngetOverlaps(i);\\n\\n const SimplexId &partitionSize = abs(std::get<0>(rangeJT) - \\n\\nstd::get<1>(rangeJT)) +\\n\\n std::get<0>(overlaps).size() + \\n\\nstd::get<1>(overlaps).size();\\n\\n\\n\\n // ---------------\\n\\n // Build JT and ST\\n\\n // ---------------\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp parallel sections num_threads(2) if (parallelParams_.lessPartition)\\n\\n#endif\\n\\n {\\n\\n\\n\\n // if less partition : we built JT and ST in parallel\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp section\\n\\n#endif\\n\\n {\\n\\n if(params_->treeType == TreeType::Join\\n\\n || params_->treeType == TreeType::Contour\\n\\n || params_->treeType == TreeType::JoinAndSplit)\\n\\n {\\n\\n DebugTimer timerSimplify;\\n\\n DebugTimer timerBuild;\\n\\n parallelData_.trees[i].getJoinTree()->build(vect_baseUF_JT[i],\\n\\n std::get<0>(overlaps), std::get<1>(overlaps),\\n\\n std::get<0>(rangeJT), std::get<1>(rangeJT),\\n\\n std::get<0>(seedsPos), std::get<1>(seedsPos)\\n\\n );\\n\\n speedProcess[i] = partitionSize / timerBuild.getElapsedTime();\\n\\n\\n\\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\\n\\n timerSimplify.reStart();\\n\\n const SimplexId tmpMerge =\\n\\n \\n\\nparallelData_.trees[i].getJoinTree()->localSimplify<scalarType>(\\n\\n std::get<0>(seedsPos), std::get<1>(seedsPos));\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp atomic update\\n\\n#endif\\n\\n timeSimplify[i] += timerSimplify.getElapsedTime();\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp atomic update\\n\\n#endif\\n\\n nbPairMerged += tmpMerge;\\n\\n#endif\\n\\n }\\n\\n }\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp section\\n\\n#endif\\n\\n {\\n\\n if(params_->treeType == TreeType::Split\\n\\n || params_->treeType == TreeType::Contour\\n\\n || params_->treeType == TreeType::JoinAndSplit)\\n\\n {\\n\\n DebugTimer timerSimplify;\\n\\n DebugTimer timerBuild;\\n\\n parallelData_.trees[i].getSplitTree()->build(vect_baseUF_ST[i],\\n\\n std::get<1>(overlaps), std::get<0>(overlaps),\\n\\n std::get<0>(rangeST), std::get<1>(rangeST),\\n\\n std::get<0>(seedsPos), std::get<1>(seedsPos)\\n\\n );\\n\\n speedProcess[parallelParams_.nbPartitions + i] =\\n\\n partitionSize / timerBuild.getElapsedTime();\\n\\n\\n\\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\\n\\n timerSimplify.reStart();\\n\\n const SimplexId tmpMerge =\\n\\n \\n\\nparallelData_.trees[i].getSplitTree()->localSimplify<scalarType>(\\n\\n std::get<0>(seedsPos), std::get<1>(seedsPos));\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp atomic update\\n\\n#endif\\n\\n timeSimplify[i] += timerSimplify.getElapsedTime();\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp atomic update\\n\\n#endif\\n\\n nbPairMerged += tmpMerge;\\n\\n#endif\\n\\n }\\n\\n }\\n\\n\\n\\n\\n\\n }\\n\\n\\n\\n {\\n\\n std::stringstream mt;\\n\\n mt << \\\"[ParallelBuild] Merge Tree \\\" << static_cast<unsigned>(i)\\n\\n << \\\" constructed in : \\\" << timerMergeTree.getElapsedTime() << \\n\\nstd::endl;\\n\\n dMsg(std::cout, mt.str(), infoMsg);\\n\\n }\\n\\n\\n\\n // Update segmentation of each arc if needed\\n\\n if ( params_->simplifyThreshold || params_->treeType != \\n\\nTreeType::Contour){\\n\\n DebugTimer timerUpdateSegm;\\n\\n parallelData_.trees[i].getJoinTree()->updateSegmentation();\\n\\n parallelData_.trees[i].getSplitTree()->updateSegmentation();\\n\\n\\n\\n if (params_->debugLevel >= 3) {\\n\\n std::cout << \\\"Local MT : updated in \\\" << \\n\\ntimerUpdateSegm.getElapsedTime() << std::endl;\\n\\n }\\n\\n }\\n\\n\\n\\n // ---------------\\n\\n // Combine JT & ST\\n\\n // ---------------\\n\\n\\n\\n if (params_->treeType == TreeType::Contour) {\\n\\n DebugTimer timerCombine;\\n\\n\\n\\n // clone here if we do not want to destry original merge trees!\\n\\n auto *jt = parallelData_.trees[i].getJoinTree();\\n\\n auto *st = parallelData_.trees[i].getSplitTree();\\n\\n\\n\\n // Copy missing nodes of a tree to the other one\\n\\n // Maintain this traversal order for good insertion\\n\\n for (idNode t = 0; t < st->getNumberOfNodes(); ++t) {\\n\\n if (!st->getNode(t)->isHidden()) {\\n\\n // std::cout << \\\"insert in jt : \\\" << \\n\\n // st->getNode(t)->getVertexId() << std::endl;\\n\\n jt->insertNode(st->getNode(t), true);\\n\\n }\\n\\n }\\n\\n // and vice versa\\n\\n for (idNode t = 0; t < jt->getNumberOfNodes(); ++t) {\\n\\n if (!jt->getNode(t)->isHidden()) {\\n\\n // std::cout << \\\"insert in st : \\\" << \\n\\n // jt->getNode(t)->getVertexId() << std::endl;\\n\\n st->insertNode(jt->getNode(t), true);\\n\\n }\\n\\n }\\n\\n\\n\\n // debug print current JT / ST\\n\\n if (params_->debugLevel >= 6) {\\n\\n std::cout << \\\"Local JT :\\\" << std::endl;\\n\\n parallelData_.trees[i].getJoinTree()->printTree2();\\n\\n std::cout << \\\"Local ST :\\\" << std::endl;\\n\\n parallelData_.trees[i].getSplitTree()->printTree2();\\n\\n std::cout << \\\"combine\\\" << std::endl;\\n\\n }\\n\\n\\n\\n // Combine, destroy JT and ST to compute CT\\n\\n parallelData_.trees[i].combine(std::get<0>(seedsPos), \\n\\nstd::get<1>(seedsPos));\\n\\n parallelData_.trees[i].updateSegmentation();\\n\\n\\n\\n if (params_->debugLevel > 2) {\\n\\n printDebug(timerCombine, \\\"Trees combined in \\\");\\n\\n }\\n\\n\\n\\n // debug print CT\\n\\n if (params_->debugLevel >= 4) {\\n\\n parallelData_.trees[i].printTree2();\\n\\n }\\n\\n } else {\\n\\n if (params_->debugLevel >= 6) {\\n\\n std::cout << \\\"Local JT :\\\" << std::endl;\\n\\n parallelData_.trees[i].getJoinTree()->printTree2();\\n\\n std::cout << \\\"Local ST :\\\" << std::endl;\\n\\n parallelData_.trees[i].getSplitTree()->printTree2();\\n\\n std::cout << \\\"combine\\\" << std::endl;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // -------------------------------------\\n\\n // Print process speed and simplify info\\n\\n // -------------------------------------\\n\\n\\n\\n if(params_->debugLevel > 2) {\\n\\n#ifdef TTK_ENABLE_CONTOUR_FORESTS_PARALLEL_SIMPLIFY\\n\\n if (params_->simplifyThreshold) {\\n\\n auto maxSimplifIt = max_element(timeSimplify.cbegin(), \\n\\ntimeSimplify.cend());\\n\\n float maxSimplif = *maxSimplifIt;\\n\\n std::cout \\n\\n << \\\"Local simplification maximum time :\\\" \\n\\n << maxSimplif;\\n\\n std::cout << \\\" ( \\\" << nbPairMerged << \\\" pairs merged )\\\" << std::endl;\\n\\n }\\n\\n#endif\\n\\n auto maxProcSpeed = max_element(speedProcess.cbegin(), \\n\\nspeedProcess.cend());\\n\\n auto minProcSpeed = min_element(speedProcess.cbegin(), \\n\\nspeedProcess.cend());\\n\\n std::cout << \\\"process speed : \\\";\\n\\n std::cout << \\\" min is \\\" << *minProcSpeed << \\\" vert/sec\\\";\\n\\n std::cout << \\\" max is \\\" << *maxProcSpeed << \\\" vert/sec\\\";\\n\\n std::cout << std::endl;\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\n//}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"ttk/core/base/contourForests/ContourForestsTemplate.h\",\n \"rank\": 5,\n \"score\": 46413.79000936405\n },\n {\n \"content\": \"namespace ttk\\n\\n{\\n\\nnamespace cf\\n\\n{\\n\\n// Init\\n\\n// {\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nvoid MergeTree::sortInput(void)\\n\\n{\\n\\n const auto &nbVertices = scalars_->size;\\n\\n auto & sortedVect = scalars_->sortedVertices;\\n\\n\\n\\n if (!sortedVect.size()) {\\n\\n auto indirect_sort = [&](const size_t &a, const size_t &b) {\\n\\n return isLower<scalarType>(a, b);\\n\\n };\\n\\n\\n\\n sortedVect.resize(nbVertices, 0);\\n\\n iota(sortedVect.begin(), sortedVect.end(), 0);\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\\n\\n // ensure this namespace exists\\n\\n __gnu_parallel::sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\\n\\n# else\\n\\n sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\\n\\n# endif\\n\\n#else\\n\\n sort(sortedVect.begin(), sortedVect.end(), indirect_sort);\\n\\n#endif\\n\\n }\\n\\n\\n\\n if (!scalars_->mirrorVertices.size()) {\\n\\n scalars_->mirrorVertices.resize(nbVertices);\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp parallel for\\n\\n#endif\\n\\n for (SimplexId i = 0; i < nbVertices; i++) {\\n\\n scalars_->mirrorVertices[sortedVect[i]] = i;\\n\\n }\\n\\n }\\n\\n}\\n\\n// }\\n\\n\\n\\n// Process\\n\\n// {\\n\\n\\n\\n// Simplify\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nSimplexId MergeTree::localSimplify(const SimplexId &posSeed0, const SimplexId &posSeed1)\\n\\n{\\n\\n\\n\\n // if null threshold, leave\\n\\n if (!params_->simplifyThreshold) {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n const bool DEBUG = false;\\n\\n\\n\\n // -----------------\\n\\n // Persistance pairs\\n\\n // -----------------\\n\\n // {\\n\\n\\n\\n std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> pairs;\\n\\n computePersistencePairs<scalarType>(pairs);\\n\\n\\n\\n if (DEBUG) {\\n\\n std::cout << \\\"pairs : ( threshold : \\\" << params_->simplifyThreshold \\n\\n << \\\" )\\\" << std::endl;\\n\\n for (const auto &p : pairs) {\\n\\n const SimplexId & thisOriginVert = std::get<0>(p);\\n\\n const SimplexId & thisEndVert = std::get<1>(p);\\n\\n const scalarType &thisPersist = std::get<2>(p);\\n\\n const bool thisNeedUp = std::get<3>(p);\\n\\n std::cout << thisOriginVert << \\\" - \\\" << thisEndVert << \\\" : \\\" << \\n\\nthisPersist;\\n\\n std::cout << \\\" ( \\\" << thisNeedUp << \\\" )\\\" << std::endl;\\n\\n }\\n\\n std::cout << std::endl;\\n\\n }\\n\\n\\n\\n // }\\n\\n // --------------\\n\\n // Simplify\\n\\n // --------------\\n\\n // {\\n\\n\\n\\n return simplifyTree<scalarType>(posSeed0, posSeed1, pairs);\\n\\n\\n\\n // }\\n\\n}\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nSimplexId MergeTree::globalSimplify(const SimplexId posSeed0, const SimplexId \\n\\nposSeed1)\\n\\n{\\n\\n\\n\\n // if null threshold, leave\\n\\n if (!params_->simplifyThreshold) {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n //---------------------\\n\\n // Sort Nodes\\n\\n //---------------------\\n\\n //{\\n\\n\\n\\n auto isLowerComp = [&](const idNode &n1, const idNode &n2) {\\n\\n return isLower(getNode(n1)->getVertexId(), getNode(n2)->getVertexId());\\n\\n };\\n\\n\\n\\n const auto nbNode = getNumberOfNodes();\\n\\n\\n\\n std::vector<idNode> sortedNodes(nbNode);\\n\\n iota(sortedNodes.begin(), sortedNodes.end(), 0);\\n\\n// Sort nodes by vertex scalar\\n\\n//{\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\\n\\n __gnu_parallel::sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\\n\\n#else\\n\\n sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\\n\\n#endif\\n\\n#else\\n\\n sort(sortedNodes.begin(), sortedNodes.end(), isLowerComp);\\n\\n#endif\\n\\n//}\\n\\n\\n\\n //}\\n\\n //---------------------\\n\\n // Make pairs\\n\\n //---------------------\\n\\n //{\\n\\n\\n\\n // origin, end, persistance, needToGoUp\\n\\n std::vector<std::tuple<SimplexId, SimplexId, scalarType,bool>> pairsJT;\\n\\n std::vector<std::tuple<SimplexId, SimplexId, scalarType,bool>> pairsST;\\n\\n\\n\\n recoverMTPairs<scalarType>(sortedNodes, pairsJT, pairsST);\\n\\n\\n\\n //}\\n\\n //---------------------\\n\\n // Fusionne & Sort pairs\\n\\n //---------------------\\n\\n //{\\n\\n\\n\\n auto pairComp = [](const std::tuple<SimplexId, SimplexId, scalarType, bool> \\n\\n&a,\\n\\n const std::tuple<SimplexId, SimplexId, scalarType, bool> \\n\\n&b) {\\n\\n // sort by persistence\\n\\n return std::get<2>(a) < std::get<2>(b);\\n\\n };\\n\\n\\n\\n std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> sortedPairs;\\n\\n size_t sizePJT = pairsJT.size(), sizePST = pairsST.size();\\n\\n\\n\\n sortedPairs.reserve(sizePJT + sizePST);\\n\\n\\n\\n sortedPairs.insert(sortedPairs.end(), pairsJT.begin(), pairsJT.end());\\n\\n sortedPairs.insert(sortedPairs.end(), pairsST.begin(), pairsST.end());\\n\\n\\n\\n // Sort pairs by persistence\\n\\n //{\\n\\n // IS SET STILL BETTER ? (parallel sort) TODO\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n# ifdef _GLIBCXX_PARALLEL_FEATURES_H\\n\\n __gnu_parallel::sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\\n\\n# else\\n\\n sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\\n\\n# endif\\n\\n#else\\n\\n sort(sortedPairs.begin(), sortedPairs.end(), pairComp);\\n\\n#endif\\n\\n\\n\\n auto last = unique(sortedPairs.begin(), sortedPairs.end());\\n\\n sortedPairs.erase(last, sortedPairs.end());\\n\\n\\n\\n //}\\n\\n //---------------------\\n\\n // Traverse pairs and merge on the tree\\n\\n //---------------------\\n\\n //{\\n\\n\\n\\n // identify subtrees and merge them in recept'arcs\\n\\n return simplifyTree<scalarType>(posSeed0, posSeed1, sortedPairs);\\n\\n //}\\n\\n}\\n\\n\\n\\ntemplate <typename scalarType>\\n\\nSimplexId MergeTree::simplifyTree(\\n\\n const SimplexId &posSeed0, const SimplexId &posSeed1,\\n\\n const std::vector<std::tuple<SimplexId, SimplexId, scalarType, bool>> \\n\\n&sortedPairs)\\n\\n{\\n\\n const auto nbNode = getNumberOfNodes();\\n\\n const auto nbArcs = getNumberOfSuperArcs();\\n\\n // Retain the relation between merge coming from st, jt\\n\\n // also retain info about what we keep\\n\\n std::vector<ExtendedUnionFind *> subtreeUF(nbNode, nullptr);\\n\\n\\n\\n // nb arc seen below / above this node\\n\\n std::vector<std::pair<idSuperArc, idSuperArc>> valenceOffset(nbNode, \\n\\nstd::make_pair(0,0));\\n\\n SimplexId nbPairMerged = 0;\\n\\n\\n\\n const bool DEBUG = false;\\n\\n\\n\\n if (DEBUG) {\\n\\n std::cout << \\\"Imapct simplify on tree btwn : \\\" << posSeed0 << \\\" and \\\" << \\n\\nposSeed1 << std::endl;\\n\\n }\\n\\n\\n\\n //----------\\n\\n // Make subtrees\\n\\n //-----------\\n\\n //{\\n\\n\\n\\n std::queue<std::tuple<idNode,bool>> node2see;\\n\\n\\n\\n // Add the origin of all pairs that need to merge\\n\\n for (const auto & pp : sortedPairs) {\\n\\n if (std::get<2>(pp) < params_->simplifyThreshold ) {\\n\\n const SimplexId &thisOriginVert = std::get<0>(pp);\\n\\n const SimplexId &thisEndVert = std::get<1>(pp);\\n\\n const idNode & thisOriginId = \\n\\ngetCorrespondingNodeId(thisOriginVert);\\n\\n\\n\\n if (scalars_->mirrorVertices[thisOriginVert] <= posSeed0 ||\\n\\n scalars_->mirrorVertices[thisOriginVert] >= posSeed1 ||\\n\\n scalars_->mirrorVertices[thisEndVert] <= posSeed0 ||\\n\\n scalars_->mirrorVertices[thisEndVert] >= posSeed1) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n node2see.emplace(thisOriginId, std::get<3>(pp));\\n\\n subtreeUF[thisOriginId] = new ExtendedUnionFind(0);\\n\\n ++nbPairMerged;\\n\\n if(DEBUG){\\n\\n std::cout << \\\"willSee \\\" << printNode(thisOriginId) << std::endl;\\n\\n }\\n\\n } else break;\\n\\n }\\n\\n\\n\\n //---\\n\\n // In UF :\\n\\n // Origin is the size of the segmentation\\n\\n // Data is negative : -idNodeRoot-1\\n\\n // Data is positive : Receptacle Arc id\\n\\n //--\\n\\n // Use the queue to mark Arc that will be merged and UF to identify\\n\\n // subtree. When a node have only one way out : enqueue it to continue \\n\\n //travresall\\n\\n while (!node2see.empty()) {\\n\\n idNode curNodeId;\\n\\n bool needToGoUp; // identify up/down traversall\\n\\n\\n\\n std::tie(curNodeId, needToGoUp) = node2see.front(); \\n\\n // should have only one arc valid to take\\n\\n node2see.pop();\\n\\n\\n\\n if (DEBUG) {\\n\\n std::cout << \\\"process : \\\" << printNode(curNodeId) << std::endl;\\n\\n }\\n\\n\\n\\n // Here we take the only available arc :\\n\\n idSuperArc mergingArcId;\\n\\n idNode parentNodeId;\\n\\n // continue traversall\\n\\n if(needToGoUp){\\n\\n mergingArcId = newUpArc(curNodeId, subtreeUF);\\n\\n parentNodeId = getSuperArc(mergingArcId)->getUpNodeId();\\n\\n ++valenceOffset[curNodeId].second;\\n\\n ++valenceOffset[parentNodeId].first;\\n\\n } else {\\n\\n mergingArcId = newDownArc(curNodeId, subtreeUF);\\n\\n parentNodeId = getSuperArc(mergingArcId)->getDownNodeId();\\n\\n ++valenceOffset[curNodeId].first;\\n\\n ++valenceOffset[parentNodeId].second;\\n\\n }\\n\\n\\n\\n markThisArc(subtreeUF, curNodeId, mergingArcId, parentNodeId);\\n\\n\\n\\n // if we have processed all but one arc of this node, we nee to continue \\n\\n // traversall\\n\\n // throug it\\n\\n if (valenceOffset[parentNodeId].first + \\n\\nvalenceOffset[parentNodeId].second + 1 ==\\n\\n getNode(parentNodeId)->getValence()) {\\n\\n // only one way out, is it up ?\\n\\n node2see.emplace(parentNodeId, valenceOffset[parentNodeId].second + \\n\\n1 ==\\n\\n \\n\\ngetNode(parentNodeId)->getUpValence());\\n\\n if(DEBUG){\\n\\n std::cout << \\\" add to see \\\" << printNode(parentNodeId) << \\n\\nstd::endl;\\n\\n }\\n\\n }\\n\\n } // end while node2see\\n\\n\\n\\n // for each node valenceOffset is the number of arc attached to this node \\n\\n // that will merge\\n\\n\\n\\n // Debug print\\n\\n if (DEBUG) {\\n\\n std::cout << \\\"node subtrees before creating receptarc \\\" << std::endl;\\n\\n for (idNode nid = 0; nid < nbNode; nid++) {\\n\\n if (subtreeUF[nid]) {\\n\\n std::cout << \\\"node \\\" << getNode(nid)->getVertexId() \\n\\n << \\\" is in subtree rooted :\\\";\\n\\n const idNode &root = -subtreeUF[nid]->find()->getData() - 1;\\n\\n std::cout << getNode(root)->getVertexId();\\n\\n const SimplexId &segmSize = subtreeUF[nid]->find()->getOrigin();\\n\\n std::cout << \\\" with segmentation of \\\" << segmSize << std::endl;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n //}\\n\\n //----------\\n\\n // Create the recept'arcs\\n\\n //-----------\\n\\n //{\\n\\n\\n\\n // Add the origin of all pairs that need to merge\\n\\n for (const auto & pp : sortedPairs) {\\n\\n if (std::get<2>(pp) < params_->simplifyThreshold ) {\\n\\n const SimplexId &thisOriginVert = std::get<0>(pp);\\n\\n const SimplexId &thisEndVert = std::get<1>(pp);\\n\\n const idNode & thisOriginId = \\n\\ngetCorrespondingNodeId(thisOriginVert);\\n\\n //const idNode & thisEndId = getCorrespondingNode(thisEndVert);\\n\\n\\n\\n if (scalars_->mirrorVertices[thisOriginVert] <= posSeed0 ||\\n\\n scalars_->mirrorVertices[thisOriginVert] >= posSeed1 ||\\n\\n scalars_->mirrorVertices[thisEndVert] <= posSeed0 ||\\n\\n scalars_->mirrorVertices[thisEndVert] >= posSeed1) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if (subtreeUF[thisOriginId]->find()->getData() < 0) {\\n\\n // create receptarc\\n\\n const idNode &subtreeRoot = \\n\\n-subtreeUF[thisOriginId]->find()->getData() - 1;\\n\\n // The id of the next arc to be created : NOT PARALLEL\\n\\n const idSuperArc receptArcId = treeData_.superArcs.size();\\n\\n // down , up, segmentation size\\n\\n // create the receptacle arc and merge arc not in sub-tree in it\\n\\n const std::tuple<idNode, idNode, SimplexId> &receptArc =\\n\\n createReceptArc(subtreeRoot, receptArcId, subtreeUF, \\n\\nvalenceOffset);\\n\\n\\n\\n // make superArc and do the makeAlloc on it\\n\\n const bool overlapB =\\n\\n \\n\\nscalars_->mirrorVertices[getNode(std::get<0>(receptArc))->getVertexId()] < \\n\\nposSeed0;\\n\\n const bool overlapA =\\n\\n \\n\\nscalars_->mirrorVertices[getNode(std::get<1>(receptArc))->getVertexId()] >= \\n\\nposSeed1;\\n\\n const idSuperArc na = makeSuperArc(std::get<0>(receptArc), \\n\\nstd::get<1>(receptArc), overlapB, overlapA, nullptr, -1);\\n\\n\\n\\n if(overlapB){\\n\\n treeData_.arcsCrossingBelow.emplace_back(na);\\n\\n }\\n\\n\\n\\n if(overlapA){\\n\\n treeData_.arcsCrossingAbove.emplace_back(na);\\n\\n }\\n\\n\\n\\n subtreeUF[thisOriginId]->find()->setData(receptArcId);\\n\\n getSuperArc(receptArcId)->makeAllocGlobal(std::get<2>(receptArc));\\n\\n\\n\\n if (DEBUG) {\\n\\n std::cout << \\\"create arc : \\\" << printArc(receptArcId)\\n\\n << \\\" with segm : \\\" << std::get<2>(receptArc) << std::endl;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"ttk/core/base/contourForestsTree/MergeTreeTemplate.h\",\n \"rank\": 6,\n \"score\": 46290.331926858074\n },\n {\n \"content\": \"namespace ttk\\n\\n{\\n\\nnamespace ftm\\n\\n{\\n\\n\\n\\ntemplate <typename scalarType, typename idType>\\n\\nvoid ftm::FTMTree_MT::sortInput(void)\\n\\n{\\n\\n const auto &nbVertices = scalars_->size;\\n\\n\\n\\n auto *sortedVect = scalars_->sortedVertices.get();\\n\\n if (sortedVect == nullptr) {\\n\\n sortedVect = new std::vector<SimplexId>(0);\\n\\n scalars_->sortedVertices.reset(sortedVect);\\n\\n } else {\\n\\n sortedVect->clear();\\n\\n }\\n\\n\\n\\n auto indirect_sort = [&](const size_t &a, const size_t &b) { return isLower<scalarType,idType>(a, b); };\\n\\n\\n\\n sortedVect->resize(nbVertices, 0);\\n\\n std::iota(sortedVect->begin(), sortedVect->end(), 0);\\n\\n\\n\\n// #pragma omp parallel\\n\\n// #pragma omp single\\n\\n// scalars_->qsort<SimplexId>(sortedVect->data(), 0, scalars_->size -1, indirect_sort);\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n# ifdef __clang__\\n\\n std::cout << \\\"Caution, outside GCC, sequential sort\\\" << std::endl;\\n\\n std::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\\n\\n# else\\n\\n __gnu_parallel::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\\n\\n# endif\\n\\n#else\\n\\n std::sort(sortedVect->begin(), sortedVect->end(), indirect_sort);\\n\\n#endif\\n\\n\\n\\n auto *mirrorVert = scalars_->mirrorVertices.get();\\n\\n if (mirrorVert == nullptr) {\\n\\n mirrorVert = new std::vector<SimplexId>(0);\\n\\n scalars_->mirrorVertices.reset(mirrorVert);\\n\\n } else {\\n\\n mirrorVert->clear();\\n\\n }\\n\\n\\n\\n scalars_->mirrorVertices->resize(nbVertices);\\n\\n\\n\\n#ifdef TTK_ENABLE_OPENMP\\n\\n#pragma omp parallel for\\n\\n#endif\\n\\n for (SimplexId i = 0; i < nbVertices; i++) {\\n\\n (*scalars_->mirrorVertices)[(*sortedVect)[i]] = i;\\n\\n }\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"ttk/core/base/ftmTree/FTMTree_MT_Template.h\",\n \"rank\": 7,\n \"score\": 46290.331926858074\n },\n {\n \"content\": \"namespace ttk{\\n\\n\\n\\n template <class dataType> class ScalarFieldCriticalPoints : public Debug{\\n\\n\\n\\n public:\\n\\n \\n\\n ScalarFieldCriticalPoints();\\n\\n \\n\\n ~ScalarFieldCriticalPoints();\\n\\n\\n\\n /// Execute the package.\\n\\n /// \\\\param argment Dummy integer argument.\\n\\n /// \\\\return Returns 0 upon success, negative values otherwise.\\n\\n int execute();\\n\\n \\n\\n char getCriticalType(const SimplexId &vertexId) const{\\n\\n \\n\\n return getCriticalType(vertexId, triangulation_);\\n\\n }\\n\\n\\n\\n char getCriticalType(const SimplexId &vertexId,\\n\\n Triangulation *triangulation) const;\\n\\n \\n\\n char getCriticalType(const SimplexId &vertexId,\\n\\n const std::vector<std::pair<SimplexId, SimplexId> > &vertexLinkEdgeList) const;\\n\\n \\n\\n static bool isSosHigherThan(const SimplexId &offset0, const dataType &value0,\\n\\n const SimplexId &offset1, const dataType &value1){\\n\\n \\n\\n return ((value0 > value1)||((value0 == value1)&&(offset0 > offset1)));\\n\\n }\\n\\n \\n\\n static bool isSosLowerThan(const SimplexId &offset0, const dataType &value0,\\n\\n const SimplexId &offset1, const dataType &value1){\\n\\n \\n\\n return ((value0 < value1)||((value0 == value1)&&(offset0 < offset1)));\\n\\n }\\n\\n \\n\\n int setDomainDimension(const int &dimension){\\n\\n \\n\\n dimension_ = dimension;\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setOutput(std::vector<std::pair<SimplexId, char> > *criticalPoints){\\n\\n \\n\\n criticalPoints_ = criticalPoints;\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setupTriangulation(Triangulation *triangulation){\\n\\n \\n\\n triangulation_ = triangulation;\\n\\n \\n\\n // pre-condition functions\\n\\n if(triangulation_){\\n\\n triangulation_->preprocessVertexNeighbors();\\n\\n triangulation_->preprocessVertexStars();\\n\\n }\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setScalarValues(const void *data){\\n\\n \\n\\n scalarValues_ = (const dataType *) data;\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setSosOffsets(std::vector<SimplexId> *offsets){\\n\\n \\n\\n sosOffsets_ = offsets;\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n int setVertexLinkEdgeLists(\\n\\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *edgeList){\\n\\n \\n\\n vertexLinkEdgeLists_ = edgeList;\\n\\n \\n\\n return 0;\\n\\n }\\n\\n \\n\\n /// Set the number of vertices in the scalar field.\\n\\n /// \\\\param vertexNumber Number of vertices in the data-set.\\n\\n /// \\\\return Returns 0 upon success, negative values otherwise. \\n\\n int setVertexNumber(const SimplexId &vertexNumber){\\n\\n vertexNumber_ = vertexNumber;\\n\\n return 0;\\n\\n }\\n\\n \\n\\n \\n\\n protected:\\n\\n \\n\\n int dimension_;\\n\\n SimplexId vertexNumber_;\\n\\n const dataType *scalarValues_;\\n\\n const std::vector<std::vector<std::pair<SimplexId, SimplexId> > > *vertexLinkEdgeLists_;\\n\\n std::vector<std::pair<SimplexId, char> > *criticalPoints_;\\n\\n std::vector<SimplexId> *sosOffsets_;\\n\\n std::vector<SimplexId> localSosOffSets_;\\n\\n Triangulation *triangulation_;\\n\\n };\\n\",\n \"file_path\": \"ttk/core/base/scalarFieldCriticalPoints/ScalarFieldCriticalPoints.h\",\n \"rank\": 8,\n \"score\": 46056.08928306435\n },\n {\n \"content\": \"using namespace ttk;\\n\",\n \"file_path\": \"ttk/core/base/persistenceDiagramsBarycenter/PDBarycenterImpl.h\",\n \"rank\": 9,\n \"score\": 43655.506951274365\n },\n {\n \"content\": \"using namespace ttk;\\n\",\n \"file_path\": \"ttk/core/base/persistenceDiagramsClustering/PDClusteringImpl.h\",\n \"rank\": 10,\n \"score\": 43655.506951274365\n },\n {\n \"content\": \"#else\\n\\nclass ttkTriangulation : public ttk::Debug {\\n\\n#endif\\n\\n\\n\\n public:\\n\\n \\n\\n ttkTriangulation();\\n\\n ~ttkTriangulation();\\n\\n \\n\\n /// Allocates the memory for the internal ttk::Triangulation data-structure.\\n\\n /// \\\\warning Internal TTK usage only.\\n\\n int allocate();\\n\\n \\n\\n /// Retrieves a pointer to the internal ttk::Triangulation of the current \\n\\n /// object. Traversal can only be performed on a ttk::Triangulation object.\\n\\n /// \\\\return Returns a pointer to a valid ttk::Triangulation object upon \\n\\n /// success, NULL otherwise.\\n\\n /// \\\\sa ttk::Triangulation\\n\\n ttk::Triangulation* getTriangulation(){ return triangulation_;};\\n\\n \\n\\n /// Retrieves a pointer to a ttk::Triangulation object from a vtkDataSet.\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 11,\n \"score\": 34069.2373668983\n },\n {\n \"content\": \"class ttkKeyHandler : public ttk::Debug{\\n\\n \\n\\n public:\\n\\n \\n\\n virtual int OnKeyPress(\\n\\n vtkRenderWindowInteractor *interactor, std::string &key) = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"ttk/core/vtk/ttkUserInterfaceBase/ttkUserInterfaceBase.h\",\n \"rank\": 12,\n \"score\": 33660.27519716504\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKCOMMONDATAMODEL_EXPORT ttkTriangulation : public ttk::Debug {\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 13,\n \"score\": 31808.848403716274\n },\n {\n \"content\": \"#else\\n\\nclass ttkFTMTree : public vtkDataSetAlgorithm, public ttk::Wrapper\\n\\n#endif\\n\\n{\\n\\n public:\\n\\n static ttkFTMTree* New();\\n\\n\\n\\n vtkTypeMacro(ttkFTMTree, vtkDataSetAlgorithm);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n void SetThreadNumber(int threadNumber)\\n\\n {\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n\\n\\n void SetUseAllCores(bool onOff)\\n\\n {\\n\\n UseAllCores = onOff;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFTMTree/ttkFTMTree.h\",\n \"rank\": 14,\n \"score\": 29561.08868701747\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkFTMTree : public vtkDataSetAlgorithm, public ttk::Wrapper\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFTMTree/ttkFTMTree.h\",\n \"rank\": 15,\n \"score\": 27903.49833768591\n },\n {\n \"content\": \"#!/usr/bin/env pvpython\\n\\n\\n\\n#/// \\\\ingroup examples\\n\\n#/// \\\\author Julien Tierny <julien.tierny@lip6.fr>\\n\\n#/// \\\\date October 2017.\\n\\n#/// \\n\\n#/// \\\\brief Minimalist python TTK example pipeline, including:\\n\\n#/// -# The computation of a persistence curve\\n\\n#/// -# The computation of a persistence diagram\\n\\n#/// -# The selection of the most persistent pairs of the diagram\\n\\n#/// -# The pre-simplification of the data according to this selection\\n\\n#/// -# The computation of the Morse-Smale complex on this simplified data\\n\\n#/// -# The storage of the output of this pipeline to disk.\\n\\n#///\\n\\n#/// This example reproduces the Figure 1 of the TTK companion paper:\\n\\n#/// \\\"The Topology ToolKit\\\", J. Tierny, G. Favelier, J. Levine, C. Gueunet, M.\\n\\n#/// Michaux., IEEE Transactions on Visualization and Computer Graphics, Proc.\\n\\n#/// of IEEE VIS 2017.\\n\\n\\n\\nfrom paraview.simple import *\\n\\n\\n\\nif len(sys.argv) == 2:\\n\\n inputFilePath = sys.argv[1]\\n\\nelse:\\n\\n print(\\\"Missing mandatory argument: Path to input VTU file\\\")\\n\\n sys.exit() \\n\\n\\n\\n# 1. loading the input data\\n\\ninputData = XMLUnstructuredGridReader(FileName=[inputFilePath])\\n\\n\\n\\n# 2. computing the persistence curve\\n\\npersistenceCurve = TTKPersistenceCurve(inputData)\\n\\n\\n\\n# 3. computing the persitence diagram\\n\\npersistenceDiagram = TTKPersistenceDiagram(inputData)\\n\\n\\n\\n# 4. selecting the critical point pairs\\n\\ncriticalPointPairs = Threshold(persistenceDiagram)\\n\\ncriticalPointPairs.Scalars = ['CELLS', 'PairIdentifier']\\n\\ncriticalPointPairs.ThresholdRange = [-0.1, 999999]\\n\\n\\n\\n# 5. selecting the most persistent pairs\\n\\npersistentPairs = Threshold(criticalPointPairs)\\n\\npersistentPairs.Scalars = ['CELLS', 'Persistence']\\n\\npersistentPairs.ThresholdRange = [0.05, 999999]\\n\\n\\n\\n# 6. simplifying the input data to remove non-persistent pairs\\n\\ntopologicalSimplification = TTKTopologicalSimplification(\\n\\n Domain=inputData, Constraints=persistentPairs)\\n\\n\\n\\n# 7. computing the Morse-Smale complex\\n\\nmorseSmaleComplex = TTKMorseSmaleComplex(topologicalSimplification)\\n\\n\\n\\n# 8. saving the output data\\n\\nSaveData('curve.vtk', OutputPort(persistenceCurve, 3))\\n\\nSaveData('separatrices.vtu', OutputPort(morseSmaleComplex, 1))\\n\\nSaveData('segmentation.vtu', OutputPort(morseSmaleComplex, 3))\\n\",\n \"file_path\": \"ttk/examples/python/ttkExample-python.py\",\n \"rank\": 16,\n \"score\": 24351.23999180596\n },\n {\n \"content\": \"def doIt(X, method, ncomponents, nneighbors, njobs, rstate, params):\\n\\n\\n\\n import importlib\\n\\n\\n\\n # check if numpy is installed\\n\\n loader = importlib.find_loader('numpy')\\n\\n found = loader is not None\\n\\n if found:\\n\\n print(\\\"[DimensionReduction] Python: numpy module found.\\\")\\n\\n else:\\n\\n print(\\\"[DimensionReduction] Python error: numpy module not found.\\\")\\n\\n return 0\\n\\n\\n\\n # check if scipy is installed\\n\\n loader = importlib.find_loader('scipy')\\n\\n found = loader is not None\\n\\n if found:\\n\\n print(\\\"[DimensionReduction] Python: scipy module found.\\\")\\n\\n else:\\n\\n print(\\\"[DimensionReduction] Python error: scipy module not found.\\\")\\n\\n return 0\\n\\n\\n\\n # check if scikit-learn is installed\\n\\n loader = importlib.find_loader('sklearn')\\n\\n found = loader is not None\\n\\n if found:\\n\\n print(\\\"[DimensionReduction] Python: sklearn module found.\\\")\\n\\n else:\\n\\n print(\\\"[DimensionReduction] Python error: sklearn module not found.\\\")\\n\\n return 0\\n\\n\\n\\n from sklearn import manifold\\n\\n from sklearn import decomposition\\n\\n import numpy as np\\n\\n from sys import platform\\n\\n \\n\\n if platform == \\\"darwin\\\":\\n\\n import sklearn\\n\\n sklearn.utils.parallel_backend('threading')\\n\\n\\n\\n if rstate > 0:\\n\\n np.random.seed(0)\\n\\n\\n\\n try:\\n\\n if method == 0:\\n\\n seParams = params[0]\\n\\n if seParams[2] == \\\"None\\\":\\n\\n se = manifold.SpectralEmbedding(n_components=ncomponents,\\n\\n affinity=seParams[0],\\n\\n gamma=seParams[1],\\n\\n eigen_solver=None,\\n\\n n_neighbors=nneighbors,\\n\\n n_jobs=njobs)\\n\\n else:\\n\\n se = manifold.SpectralEmbedding(n_components=ncomponents,\\n\\n affinity=seParams[0],\\n\\n gamma=seParams[1],\\n\\n eigen_solver=seParams[2],\\n\\n n_neighbors=nneighbors,\\n\\n n_jobs=njobs)\\n\\n Y = se.fit_transform(X)\\n\\n elif method == 1:\\n\\n lleParams = params[1]\\n\\n lle = manifold.LocallyLinearEmbedding(n_neighbors=nneighbors,\\n\\n n_components=ncomponents,\\n\\n reg=lleParams[0],\\n\\n eigen_solver=lleParams[1],\\n\\n tol=lleParams[2],\\n\\n max_iter=lleParams[3],\\n\\n method=lleParams[4],\\n\\n hessian_tol=lleParams[5],\\n\\n modified_tol=lleParams[6],\\n\\n neighbors_algorithm=lleParams[7],\\n\\n n_jobs=njobs)\\n\\n Y = lle.fit_transform(X)\\n\\n elif method == 2:\\n\\n mdsParams = params[2]\\n\\n mds = manifold.MDS(n_components=ncomponents,\\n\\n metric=mdsParams[0],\\n\\n n_init=mdsParams[1],\\n\\n max_iter=mdsParams[2],\\n\\n verbose=mdsParams[3],\\n\\n eps=mdsParams[4],\\n\\n dissimilarity=mdsParams[5],\\n\\n n_jobs=njobs)\\n\\n Y = mds.fit_transform(X)\\n\\n elif method == 3:\\n\\n tsneParams = params[3]\\n\\n tsne = manifold.TSNE(n_components=ncomponents,\\n\\n perplexity=tsneParams[0],\\n\\n early_exaggeration=tsneParams[1],\\n\\n learning_rate=tsneParams[2],\\n\\n n_iter=tsneParams[3],\\n\\n n_iter_without_progress=tsneParams[4],\\n\\n min_grad_norm=tsneParams[5],\\n\\n metric=tsneParams[6],\\n\\n init=tsneParams[7],\\n\\n verbose=tsneParams[8],\\n\\n method=tsneParams[9],\\n\\n angle=tsneParams[10])\\n\\n Y = tsne.fit_transform(X)\\n\\n elif method == 4:\\n\\n isoParams = params[4]\\n\\n iso = manifold.Isomap(n_neighbors=nneighbors,\\n\\n n_components=ncomponents,\\n\\n eigen_solver=isoParams[0],\\n\\n tol=isoParams[1],\\n\\n max_iter=isoParams[2],\\n\\n path_method=isoParams[3],\\n\\n neighbors_algorithm=isoParams[4],\\n\\n n_jobs=njobs)\\n\\n Y = iso.fit_transform(X)\\n\\n elif method == 5:\\n\\n pcaParams = params[5]\\n\\n if pcaParams[4] == \\\"auto\\\":\\n\\n pca = decomposition.PCA(n_components=ncomponents,\\n\\n copy=pcaParams[0],\\n\\n whiten=pcaParams[1],\\n\\n svd_solver=pcaParams[2],\\n\\n tol=pcaParams[3],\\n\\n iterated_power=\\\"auto\\\")\\n\\n else:\\n\\n pca = decomposition.PCA(n_components=ncomponents,\\n\\n copy=pcaParams[0],\\n\\n whiten=pcaParams[1],\\n\\n svd_solver=pcaParams[2],\\n\\n tol=pcaParams[3],\\n\\n iterated_power=int(pcaParams[4]))\\n\\n Y = pca.fit_transform(X)\\n\\n\\n\\n L = [Y.shape[0], Y.shape[1], np.ravel(Y, 'F')]\\n\\n return L\\n\\n except Exception as inst:\\n\\n print('[DimensionReduction] Error: unexpected behaviour detected in the python script.')\\n\\n print(type(inst)) # the exception instance\\n\\n print(inst.args) # arguments stored in .args\\n\\n print(inst)\\n\\n return []\\n\",\n \"file_path\": \"ttk/core/base/dimensionReduction/dimensionReduction.py\",\n \"rank\": 17,\n \"score\": 22362.879955300094\n },\n {\n \"content\": \"#else\\n\\nclass ttkFiber\\n\\n#endif\\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkFiber* New();\\n\\n \\n\\n vtkTypeMacro(ttkFiber, vtkDataSetAlgorithm);\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n void SetThreads(){\\n\\n if(!UseAllCores)\\n\\n threadNumber_ = ThreadNumber;\\n\\n else{\\n\\n threadNumber_ = ttk::OsCall::getNumberOfCores();\\n\\n }\\n\\n Modified();\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 18,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkIdentifiers\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkIdentifiers* New();\\n\\n \\n\\n vtkTypeMacro(ttkIdentifiers, vtkDataSetAlgorithm);\\n\\n\\n\\n vtkSetMacro(CellFieldName, std::string);\\n\\n vtkGetMacro(CellFieldName, std::string);\\n\\n\\n\\n vtkSetMacro(VertexFieldName, std::string);\\n\\n vtkGetMacro(VertexFieldName, std::string);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n void SetThreads(){\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 19,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkForEachRow\\n\\n#endif\\n\\n: public vtkMultiBlockDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkForEachRow* New();\\n\\n vtkTypeMacro(ttkForEachRow, vtkMultiBlockDataSetAlgorithm)\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n void SetThreads(){\\n\\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\\n\\n Modified();\\n\\n }\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n void SetUseAllCores(bool onOff){\\n\",\n \"file_path\": \"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h\",\n \"rank\": 20,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkBlank\\n\\n#endif\\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkBlank* New();\\n\\n vtkTypeMacro(ttkBlank, vtkDataSetAlgorithm)\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 21,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkOFFWriter \\n\\n#endif\\n\\n : public vtkDataSetWriter{\\n\\n \\n\\n public:\\n\\n \\n\\n vtkTypeMacro(ttkOFFWriter, vtkDataSetWriter);\\n\\n void PrintSelf(ostream &os, vtkIndent indent) override;\\n\\n\\n\\n static ttkOFFWriter *New();\\n\\n\\n\\n // Description:\\n\\n // Specify file name of the .abc file.\\n\\n vtkSetStringMacro(FileName);\\n\\n vtkGetStringMacro(FileName);\\n\\n\\n\\n protected:\\n\\n ttkOFFWriter();\\n\\n ~ttkOFFWriter();\\n\\n \\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h\",\n \"rank\": 22,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkEndFor\\n\\n#endif\\n\\n: public vtkPassInputTypeAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkEndFor* New();\\n\\n vtkTypeMacro(ttkEndFor, vtkPassInputTypeAlgorithm)\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n void SetThreads(){\\n\\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\\n\\n Modified();\\n\\n }\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n void SetUseAllCores(bool onOff){\\n\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 23,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkOFFReader \\n\\n#endif\\n\\n : public vtkUnstructuredGridAlgorithm\\n\\n{\\n\\n public:\\n\\n vtkTypeMacro(ttkOFFReader, vtkUnstructuredGridAlgorithm);\\n\\n void PrintSelf(ostream &os, vtkIndent indent) override;\\n\\n\\n\\n static ttkOFFReader *New();\\n\\n\\n\\n // Description:\\n\\n // Specify file name of the .abc file.\\n\\n vtkSetStringMacro(FileName);\\n\\n vtkGetStringMacro(FileName);\\n\\n\\n\\n protected:\\n\\n ttkOFFReader();\\n\\n ~ttkOFFReader() = default;\\n\\n\\n\\n int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h\",\n \"rank\": 24,\n \"score\": 9026.325166417297\n },\n {\n \"content\": \"#else\\n\\nclass ttkUnstructuredGrid :\\n\\n#endif\\n\\n public ttkTriangulation,\\n\\n public vtkUnstructuredGrid{\\n\\n\\n\\n public:\\n\\n static ttkUnstructuredGrid* New();\\n\\n ttkTypeMacro(ttkUnstructuredGrid, vtkUnstructuredGrid);\\n\\n \\n\\n void CopyStructure(vtkDataSet *other);\\n\\n\\n\\n void DeepCopy(vtkDataObject *other);\\n\\n\\n\\n void ShallowCopy(vtkDataObject *other);\\n\\n \\n\\n protected:\\n\\n \\n\\n ttkUnstructuredGrid();\\n\\n\\n\\n ~ttkUnstructuredGrid();\\n\\n \\n\\n};\\n\\n\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 25,\n \"score\": 8922.120517228102\n },\n {\n \"content\": \"#else\\n\\nclass ttkPolyData :\\n\\n#endif\\n\\n public ttkTriangulation,\\n\\n public vtkPolyData{\\n\\n\\n\\n public:\\n\\n static ttkPolyData* New();\\n\\n ttkTypeMacro(ttkPolyData, vtkPolyData);\\n\\n\\n\\n void CopyStructure(vtkDataSet *other);\\n\\n\\n\\n void DeepCopy(vtkDataObject *other);\\n\\n\\n\\n void ShallowCopy(vtkDataObject *other);\\n\\n \\n\\n protected:\\n\\n \\n\\n ttkPolyData();\\n\\n\\n\\n ~ttkPolyData();\\n\\n \\n\\n};\\n\\n\\n\\n#endif // _TTK_TRIANGULATION_H\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 26,\n \"score\": 8922.120517228102\n },\n {\n \"content\": \"#else\\n\\nclass ttkImageData :\\n\\n#endif\\n\\n public ttkTriangulation,\\n\\n public vtkImageData{\\n\\n\\n\\n public:\\n\\n static ttkImageData* New();\\n\\n ttkTypeMacro(ttkImageData, vtkImageData);\\n\\n\\n\\n void CopyStructure(vtkDataSet *other);\\n\\n\\n\\n void DeepCopy(vtkDataObject *other);\\n\\n\\n\\n void ShallowCopy(vtkDataObject *other);\\n\\n \\n\\n protected:\\n\\n \\n\\n ttkImageData();\\n\\n\\n\\n ~ttkImageData();\\n\\n \\n\\n};\\n\\n\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 27,\n \"score\": 8922.120517228102\n },\n {\n \"content\": \"#else\\n\\nclass ttkTriangulationFilter\\n\\n#endif\\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkTriangulationFilter* New();\\n\\n \\n\\n vtkTypeMacro(ttkTriangulationFilter, vtkDataSetAlgorithm);\\n\\n \\n\\n protected:\\n\\n \\n\\n ttkTriangulationFilter();\\n\\n ~ttkTriangulationFilter(){};\\n\\n \\n\\n int RequestData(vtkInformation *request, \\n\\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override;\\n\\n \\n\\n int RequestDataObject(vtkInformation *request,\\n\\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 28,\n \"score\": 8922.120517228102\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkForEachRow\\n\",\n \"file_path\": \"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h\",\n \"rank\": 29,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkOFFReader\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h\",\n \"rank\": 30,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkEndFor\\n\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 31,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkIdentifiers\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 32,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkBlank\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 33,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKIOLEGACY_EXPORT ttkOFFWriter\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h\",\n \"rank\": 34,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkFiber\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 35,\n \"score\": 8826.133300188498\n },\n {\n \"content\": \"// break;\\n\\n// }\\n\\n// \\n\\n// return 1;\\n\\n// }\\n\\n // end of TODO-3\\n\\n \\n\\n \\n\\n protected:\\n\\n \\n\\n ttkBlank(){\\n\\n \\n\\n // init\\n\\n SomeIntegerArgument = 1;\\n\\n SomeDoubleArgument = 1;\\n\\n SomeOption = true;\\n\\n outputScalarField_ = NULL;\\n\\n \\n\\n UseAllCores = true;\\n\\n \\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 36,\n \"score\": 8794.208610383143\n },\n {\n \"content\": \" }\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n } \\n\\n \\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\\n // end of default ttk setters\\n\\n \\n\\n vtkGetMacro(Ucomponent, std::string);\\n\\n vtkSetMacro(Ucomponent, std::string);\\n\\n \\n\\n vtkGetMacro(Uvalue, double);\\n\\n vtkSetMacro(Uvalue, double);\\n\\n \\n\\n vtkGetMacro(Vcomponent, std::string);\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 37,\n \"score\": 8792.283787226974\n },\n {\n \"content\": \" private:\\\\\\n\\n int doIt(std::vector<vtkDataSet *> &inputs, std::vector<vtkDataSet *> &outputs);\\\\\\n\\n \\\\\\n\\n bool needsToAbort() override { return GetAbortExecute();};\\\\\\n\\n \\\\\\n\\n int updateProgress(const float &progress) override { \\\\\\n\\n UpdateProgress(progress);\\\\\\n\\n return 0;\\\\\\n\\n };\\\\\\n\\n protected:\\\\\\n\\n bool UseAllCores;\\\\\\n\\n int ThreadNumber;\\\\\\n\\n \\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 38,\n \"score\": 8791.539628917673\n },\n {\n \"content\": \"/// ttk::Triangulation class documentation.\\n\\n/// \\\\sa ttk::Triangulation\\n\\n\\n\\n#ifndef _TTK_TRIANGULATION_H\\n\\n#define _TTK_TRIANGULATION_H\\n\\n\\n\\n// c++ includes\\n\\n#include <algorithm>\\n\\n\\n\\n// base code includes\\n\\n#include <Triangulation.h>\\n\\n#include <Wrapper.h>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkCellArray.h>\\n\\n#include <vtkDataSet.h>\\n\\n#include <vtkDataSetAlgorithm.h>\\n\\n#include <vtkFiltersCoreModule.h>\\n\\n#include <vtkImageData.h>\\n\\n#include <vtkInformation.h>\\n\\n#include <vtkInformationVector.h>\\n\\n#include <vtkObjectFactory.h>\\n\\n#include <vtkPolyData.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n#include <vtkUnstructuredGrid.h>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 39,\n \"score\": 8791.385132537045\n },\n {\n \"content\": \"#ifndef _TTK_IDENTIFIERS_H\\n\\n#define _TTK_IDENTIFIERS_H\\n\\n\\n\\n// VTK includes -- to adapt\\n\\n#include <vtkCellData.h>\\n\\n#include <vtkDataArray.h>\\n\\n#include <vtkDataSet.h>\\n\\n#include <vtkDataSetAlgorithm.h>\\n\\n#include <vtkFiltersCoreModule.h>\\n\\n#include <vtkInformation.h>\\n\\n#include <vtkIntArray.h>\\n\\n#include <vtkIdTypeArray.h>\\n\\n#include <vtkObjectFactory.h>\\n\\n#include <vtkPointData.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// ttk code includes\\n\\n#include <ttkWrapper.h>\\n\\n\\n\\n// in this example, this wrapper takes a data-set on the input and produces a \\n\\n// data-set on the output - to adapt.\\n\\n// see the documentation of the vtkAlgorithm class to decide from which VTK \\n\\n// class your wrapper should inherit.\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 40,\n \"score\": 8790.98641412488\n },\n {\n \"content\": \"///\\n\\n/// \\\\b Related \\\\b publication \\\\n\\n\\n/// \\\"Fast and Exact Fiber Surface Extraction for Tetrahedral Meshes\\\" \\\\n \\n\\n/// Pavol Klacansky, Julien Tierny, Hamish Carr, Zhao Geng \\\\n \\n\\n/// IEEE Transactions on Visualization and Computer Graphics, 2016.\\n\\n///\\n\\n/// \\\\sa ttkFiberSurface\\n\\n///\\n\\n#ifndef _TTK_FIBER_H\\n\\n#define _TTK_FIBER_H\\n\\n\\n\\n// VTK includes -- to adapt\\n\\n#include <vtkContourFilter.h>\\n\\n#include <vtkDataSet.h>\\n\\n#include <vtkDataSetAlgorithm.h>\\n\\n#include <vtkFiltersCoreModule.h>\\n\\n#include <vtkInformation.h>\\n\\n#include <vtkObjectFactory.h>\\n\\n#include <vtkPointData.h>\\n\\n#include <vtkPolyData.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// ttk code includes\\n\\n#include <Wrapper.h>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 41,\n \"score\": 8790.92178932386\n },\n {\n \"content\": \" protected:\\n\\n \\n\\n ttkIdentifiers();\\n\\n \\n\\n ~ttkIdentifiers();\\n\\n \\n\\n int RequestData(vtkInformation *request, \\n\\n vtkInformationVector **inputVector, vtkInformationVector *outputVector);\\n\\n \\n\\n \\n\\n private:\\n\\n \\n\\n bool UseAllCores;\\n\\n ttk::ThreadId ThreadNumber;\\n\\n std::string CellFieldName, VertexFieldName;\\n\\n \\n\\n // base code features\\n\\n int doIt(vtkDataSet *input, vtkDataSet *output);\\n\\n \\n\\n bool needsToAbort();\\n\\n \\n\\n int updateProgress(const float &progress);\\n\\n \\n\\n};\\n\\n\\n\\n#endif // _TTK_IDENTIFIERS_H\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 42,\n \"score\": 8790.756104828082\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkOFFWriter\\n\\n/// \\\\author Julien Tierny\\n\\n/// \\\\date December 2017.<julien.tierny@lip6.fr>\\n\\n/// \\\\brief ttkOFFWriter - Object File Format Writer\\n\\n///\\n\\n/// Writes an .off file into VTK format.\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <vtkPoints.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n#include <vtkDataSetWriter.h>\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h\",\n \"rank\": 43,\n \"score\": 8790.459129545006\n },\n {\n \"content\": \" private:\\n\\n \\n\\n bool UseAllCores;\\n\\n int ThreadNumber;\\n\\n \\n\\n double Uvalue, Vvalue;\\n\\n std::string Ucomponent, Vcomponent;\\n\\n \\n\\n // base code features\\n\\n int doIt(vtkDataSet *input, vtkPolyData *output);\\n\\n \\n\\n bool needsToAbort();\\n\\n \\n\\n int updateProgress(const float &progress);\\n\\n \\n\\n};\\n\\n\\n\\n#endif // _TTK_RANGEPOLYGON_H\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 44,\n \"score\": 8790.40644058054\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkForEachRow\\n\\n/// \\\\author Jonas Lukasczyk <jl@jluk.de>\\n\\n/// \\\\date 01.11.2018\\n\\n///\\n\\n/// \\\\brief TTK VTK-filter that iterates over rows of a vtkTable.\\n\\n///\\n\\n/// This filter works in conjunction with the ttkEndFor filter to iterate over rows of a vtkTable.\\n\\n///\\n\\n/// \\\\param Input vtkTable table that will be iterated over\\n\\n/// \\\\param Output vtkTable table that contains only one row of the input\\n\\n\\n\\n#pragma once\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkMultiBlockDataSetAlgorithm.h>\\n\\n\\n\\n// TTK includes\\n\\n#include <ttkWrapper.h>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h\",\n \"rank\": 45,\n \"score\": 8790.339281565708\n },\n {\n \"content\": \"\\n\\n// VTK includes -- to adapt\\n\\n#include <vtkCharArray.h>\\n\\n#include <vtkDataArray.h>\\n\\n#include <vtkDataSet.h>\\n\\n#include <vtkDataSetAlgorithm.h>\\n\\n#include <vtkDoubleArray.h>\\n\\n#include <vtkFiltersCoreModule.h>\\n\\n#include <vtkFloatArray.h>\\n\\n#include <vtkInformation.h>\\n\\n#include <vtkIntArray.h>\\n\\n#include <vtkObjectFactory.h>\\n\\n#include <vtkPointData.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// ttk code includes\\n\\n#include <Blank.h>\\n\\n#include <ttkWrapper.h>\\n\\n\\n\\n// in this example, this wrapper takes a data-set on the input and produces a \\n\\n// data-set on the output - to adapt.\\n\\n// see the documentation of the vtkAlgorithm class to decide from which VTK \\n\\n// class your wrapper should inherit.\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 46,\n \"score\": 8790.303540052275\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkEndFor\\n\\n/// \\\\author Jonas Lukasczyk <jl@jluk.de>\\n\\n/// \\\\date 01.11.2018\\n\\n///\\n\\n/// \\\\brief TTK VTK-filter that requests data as long as it is available.\\n\\n///\\n\\n/// This filter requests more data as long as the maximum number of elements is not reached. This filter works in conjunction with the ttkForEachRow filter.\\n\\n///\\n\\n/// \\\\param Input vtkDataObject that will be passed through after all iterations.\\n\\n/// \\\\param Output vtkDataObject Shallow copy of the input\\n\\n\\n\\n#pragma once\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkPassInputTypeAlgorithm.h>\\n\\n\\n\\n// TTK includes\\n\\n#include <ttkWrapper.h>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 47,\n \"score\": 8790.234752152184\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkOFFReader\\n\\n/// \\\\author Charles Gueunet <charles.gueunet@kitware.com>\\n\\n/// \\\\date December 2017.\\n\\n/// \\\\brief ttkOFFReader - Object File Format Reader\\n\\n///\\n\\n/// Load an .off file into VTK format\\n\\n///\\n\\n/// Note: This reader is not able to deal with comment on the file\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <vtkFiltersCoreModule.h>\\n\\n#include \\\"vtkPoints.h\\\"\\n\\n#include \\\"vtkSmartPointer.h\\\"\\n\\n#include \\\"vtkUnstructuredGridAlgorithm.h\\\"\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#ifndef TTK_PLUGIN\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h\",\n \"rank\": 48,\n \"score\": 8790.21841495429\n },\n {\n \"content\": \"/// \\\\defgroup vtk vtk\\n\\n/// \\\\brief The Topology ToolKit - VTK wrapping code for the processing \\n\\n/// packages.\\n\\n/// @{\\n\\n/// \\\\ingroup vtk\\n\\n/// \\\\class ttkWrapper\\n\\n/// \\\\author Julien Tierny <julien.tierny@lip6.fr>\\n\\n/// \\\\date February 2016.\\n\\n/// \\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <vtkDataSetAlgorithm.h>\\n\\n#include <vtkImageData.h>\\n\\n#include <vtkPolyData.h>\\n\\n#include <vtkUnstructuredGrid.h>\\n\\n\\n\\n#include <Wrapper.h>\\n\\n#include <ttkTriangulation.h>\\n\\n\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 49,\n \"score\": 8789.85520473457\n },\n {\n \"content\": \" if(!UseAllCores)\\n\\n threadNumber_ = ThreadNumber;\\n\\n else{\\n\\n threadNumber_ = ttk::OsCall::getNumberOfCores();\\n\\n }\\n\\n Modified();\\n\\n }\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n } \\n\\n \\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\\n // end of default ttk setters\\n\\n \\n\\n \\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 50,\n \"score\": 8789.252675440264\n },\n {\n \"content\": \"#endif\\n\\n\\n\\n#ifndef _MSC_VER \\n\\n#define ttkTemplateMacro(s) vtkTemplateMacro((s));\\n\\n#define ttkTemplate2Macro(s) vtkTemplate2Macro((s));\\n\\n#else\\n\\n#define ttkTemplateMacro(s) vtkTemplateMacro(s);\\n\\n#define ttkTemplate2Macro(s) vtkTemplate2Macro(s);\\n\\n#endif\\n\\n\\n\\n#ifdef TTK_ENABLE_64BIT_IDS\\n\\nusing ttkSimplexIdTypeArray = vtkIdTypeArray;\\n\\n#else\\n\\nusing ttkSimplexIdTypeArray = vtkIntArray;\\n\\n#endif\\n\\n\\n\\n#define TTK_COMMA ,\\n\\n\\n\\n// Macros for vtkWrappers\\n\\n#define TTK_POLY_DATA_NEW(i, ouputInformation, dataTYpe)\\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 51,\n \"score\": 8789.176999954927\n },\n {\n \"content\": \"\\n\\n int countVertsData(std::string line);\\n\\n int countCellsData(std::string line);\\n\\n int processLineVert(vtkIdType curLine, std::string &line);\\n\\n int processLineCell(vtkIdType curLine, std::string &line);\\n\\n\\n\\n private:\\n\\n ttkOFFReader(const ttkOFFReader &) = delete;\\n\\n void operator=(const ttkOFFReader &) = delete;\\n\\n\\n\\n char *FileName;\\n\\n vtkIdType nbVerts_, nbCells_;\\n\\n vtkIdType nbVertsData_, nbCellsData_;\\n\\n\\n\\n vtkSmartPointer<vtkUnstructuredGrid> mesh_;\\n\\n vtkSmartPointer<vtkPoints> points_;\\n\\n std::vector<vtkSmartPointer<vtkDoubleArray>> vertScalars_;\\n\\n std::vector<vtkSmartPointer<vtkDoubleArray>> cellScalars_;\\n\\n};\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFReader/ttkOFFReader.h\",\n \"rank\": 52,\n \"score\": 8788.521943115149\n },\n {\n \"content\": \" /// \\\\warning This function will return a non null pointer if and only if\\n\\n /// the VTK data-set has undergone a ttkTriangulationFilter (i.e. if it\\n\\n /// is the direct output of a ttkTriangulationFilter or if a\\n\\n /// ttkTriangulationFilter has been called in an earlier stage of the \\n\\n /// pipeline).\\n\\n /// \\\\param dataSet Input VTK data-set.\\n\\n /// \\\\return Returns a pointer to a valid ttk::Triangulation object upon \\n\\n /// success, NULL otherwise.\\n\\n /// \\\\sa ttk::Triangulation\\n\\n /// \\\\sa ttkWrapper\\n\\n /// \\\\sa ttkTriangulationFilter\\n\\n static ttk::Triangulation* getTriangulation(vtkDataSet *dataSet);\\n\\n \\n\\n /// Translates the current triangulation into a vtkUnstructuredGrid object.\\n\\n /// This function, used in conjunction with a vtkXMLUnstructuredGridWriter\\n\\n /// object, can be useful to store the current triangulation on disk as a\\n\\n /// VTU file.\\n\\n /// \\\\return Returns a valid pointer to a vtkUnstructuredGrid object \\n\\n /// representing the current triangulation.\\n\\n ///\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 53,\n \"score\": 8788.36880118505\n },\n {\n \"content\": \" \\\\\\n\\n if(((int) inputs.size() == GetNumberOfInputPorts())\\\\\\n\\n &&((int) outputs.size() == GetNumberOfOutputPorts()))\\\\\\n\\n doIt(inputs, outputs);\\\\\\n\\n \\\\\\n\\n return 1;\\\\\\n\\n }\\n\\n\\n\\n#define TTK_SETUP()\\\\\\n\\n public:\\\\\\n\\n TTK_PIPELINE_REQUEST();\\\\\\n\\n TTK_OUTPUT_MANAGEMENT();\\\\\\n\\n void SetThreads(){\\\\\\n\\n if(!UseAllCores)\\\\\\n\\n threadNumber_ = ThreadNumber;\\\\\\n\\n else{\\\\\\n\\n threadNumber_ = ttk::OsCall::getNumberOfCores();\\\\\\n\\n }\\\\\\n\\n Modified();\\\\\\n\\n }\\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 54,\n \"score\": 8788.039329697312\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkBlank\\n\\n/// \\\\author Your Name Here <Your Email Address Here>\\n\\n/// \\\\date The Date Here.\\n\\n///\\n\\n/// \\\\brief TTK VTK-filter that wraps the blank processing package.\\n\\n///\\n\\n/// VTK wrapping code for the @Blank package.\\n\\n/// \\n\\n/// \\\\param Input Input scalar field (vtkDataSet)\\n\\n/// \\\\param Output Output scalar field (vtkDataSet)\\n\\n///\\n\\n/// This filter can be used as any other VTK filter (for instance, by using the \\n\\n/// sequence of calls SetInputData(), Update(), GetOutput()).\\n\\n///\\n\\n/// See the related ParaView example state files for usage examples within a \\n\\n/// VTK pipeline.\\n\\n///\\n\\n/// \\\\sa ttk::Blank\\n\\n#pragma once\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 55,\n \"score\": 8787.788010233258\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkIdentifiers\\n\\n/// \\\\author Julien Tierny <julien.tierny@lip6.fr>\\n\\n/// \\\\date August 2015.\\n\\n///\\n\\n/// \\\\brief TTK VTK-filter that computes the global identifiers for each vertex \\n\\n/// and each cell as point data and cell data scalar fields.\\n\\n///\\n\\n/// This filter is useful to retrieve the global identifiers of vertices or \\n\\n/// cells in subsequent filters throughout the VTK pipeline.\\n\\n///\\n\\n/// \\\\param Input Input data-set (vtkDataSet)\\n\\n/// \\\\param Output Output data-set with identifier fields (vtkDataSet)\\n\\n///\\n\\n/// This filter can be used as any other VTK filter (for instance, by using the \\n\\n/// sequence of calls SetInputData(), Update(), GetOutput()).\\n\\n///\\n\\n/// See the related ParaView example state files for usage examples within a \\n\\n/// VTK pipeline.\\n\\n///\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifiers/ttkIdentifiers.h\",\n \"rank\": 56,\n \"score\": 8787.13250978188\n },\n {\n \"content\": \" // TODO-1\\n\\n // Specify the number of input and output ports.\\n\\n // By default, this filter has one input and one output.\\n\\n // In this example, we define 2 inputs and 2 outputs.\\n\\n// SetNumberOfInputPorts(2);\\n\\n// SetNumberOfOutputPorts(2);\\n\\n // end of TODO-1\\n\\n }\\n\\n \\n\\n ~ttkBlank(){};\\n\\n \\n\\n TTK_SETUP();\\n\\n \\n\\n \\n\\n private:\\n\\n \\n\\n int SomeIntegerArgument;\\n\\n double SomeDoubleArgument;\\n\\n bool SomeOption;\\n\\n std::string ScalarField;\\n\\n vtkDataArray *outputScalarField_;\\n\\n ttk::blank::Blank blank_;\\n\\n \\n\\n};\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 57,\n \"score\": 8787.104586430376\n },\n {\n \"content\": \"\\n\\n protected:\\n\\n\\n\\n ttkForEachRow(){\\n\\n UseAllCores = false;\\n\\n\\n\\n SetNumberOfInputPorts(1);\\n\\n SetNumberOfOutputPorts(1);\\n\\n }\\n\\n ~ttkForEachRow(){};\\n\\n\\n\\n bool UseAllCores;\\n\\n int ThreadNumber;\\n\\n\\n\\n int RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\\n\\n int RequestData(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\\n\\n\\n\\n private:\\n\\n\\n\\n bool needsToAbort() override { return GetAbortExecute(); };\\n\\n int updateProgress(const float &progress) override {\\n\\n UpdateProgress(progress);\\n\\n return 0;\\n\\n };\\n\\n};\",\n \"file_path\": \"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h\",\n \"rank\": 58,\n \"score\": 8786.900648935421\n },\n {\n \"content\": \" TTK_POLY_DATA_NEW(i, outputInformation, dataType);\\\\\\n\\n }\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n return 1;\\\\\\n\\n }\\\\\\n\\n public:\\n\\n \\n\\n#define TTK_PIPELINE_REQUEST() \\\\\\n\\n protected:\\\\\\n\\n std::vector<vtkSmartPointer<ttkTriangulationFilter> > inputTriangulations_;\\\\\\n\\n int RequestData(vtkInformation *request, \\\\\\n\\n vtkInformationVector **inputVector, \\\\\\n\\n vtkInformationVector *outputVector) override {\\\\\\n\\n \\\\\\n\\n if((int) inputTriangulations_.size() != GetNumberOfInputPorts()){\\\\\\n\\n inputTriangulations_.resize(GetNumberOfInputPorts());\\\\\\n\\n for(int i = 0; i < (int) inputTriangulations_.size(); i++){\\\\\\n\\n inputTriangulations_[i] = \\\\\\n\\n vtkSmartPointer<ttkTriangulationFilter>::New();\\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 59,\n \"score\": 8786.760835569705\n },\n {\n \"content\": \" }\\n\\n\\n\\n protected:\\n\\n\\n\\n ttkEndFor(){\\n\\n nextIndex = 0;\\n\\n\\n\\n UseAllCores = false;\\n\\n\\n\\n SetNumberOfInputPorts(2);\\n\\n SetNumberOfOutputPorts(1);\\n\\n }\\n\\n ~ttkEndFor(){};\\n\\n\\n\\n bool UseAllCores;\\n\\n int ThreadNumber;\\n\\n\\n\\n int RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\\n\\n int RequestUpdateExtent(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\\n\\n int RequestData(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector) override;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 60,\n \"score\": 8786.723056202558\n },\n {\n \"content\": \" vtkSetMacro(Vcomponent, std::string);\\n\\n \\n\\n vtkGetMacro(Vvalue, double);\\n\\n vtkSetMacro(Vvalue, double);\\n\\n \\n\\n int FillOutputPortInformation(int port, vtkInformation *info){\\n\\n info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkPolyData\\\"); \\n\\n return 1;\\n\\n }\\n\\n \\n\\n protected:\\n\\n \\n\\n ttkFiber();\\n\\n \\n\\n ~ttkFiber();\\n\\n \\n\\n int RequestData(vtkInformation *request, \\n\\n vtkInformationVector **inputVector, vtkInformationVector *outputVector);\\n\\n \\n\\n \\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 61,\n \"score\": 8786.07475663211\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkFiber\\n\\n/// \\\\author Julien Tierny <julien.tierny@lip6.fr>\\n\\n/// \\\\date May 2016.\\n\\n///\\n\\n/// \\\\brief TTK VTK-filter for fiber computation on bivariate volumetric data.\\n\\n///\\n\\n/// Given a point in the range, this filter computes its fiber (i.e. pre-image) \\n\\n/// on bivariate volumetric data. The bivariate input data must be provided as \\n\\n/// two independent scalar fields attached as point data to the input geometry.\\n\\n///\\n\\n/// \\\\param Input Input bivariate volumetric data-set, either regular grid or\\n\\n/// triangulation (vtkDataSet)\\n\\n/// \\\\param Output Fiber (vtkPolyData)\\n\\n///\\n\\n/// This filter can be used as any other VTK filter (for instance, by using the \\n\\n/// sequence of calls SetInputData(), Update(), GetOutput()).\\n\\n///\\n\\n/// See the related ParaView example state files for usage examples within a \\n\\n/// VTK pipeline.\\n\",\n \"file_path\": \"ttk/core/vtk/ttkFiber/ttkFiber.h\",\n \"rank\": 62,\n \"score\": 8785.965159263718\n },\n {\n \"content\": \" // end of default ttk setters\\n\\n \\n\\n \\n\\n // TODO-4\\n\\n // set-getters macros to define from each variable you want to access from \\n\\n // the outside (in particular from paraview) - to adapt.\\n\\n // Note that the XML file for the ParaView plug-in specification needs to be\\n\\n // edited accordingly.\\n\\n vtkSetMacro(SomeIntegerArgument, int);\\n\\n vtkGetMacro(SomeIntegerArgument, int);\\n\\n \\n\\n vtkSetMacro(SomeDoubleArgument, double);\\n\\n vtkGetMacro(SomeDoubleArgument, double);\\n\\n \\n\\n vtkSetMacro(SomeOption, bool);\\n\\n vtkGetMacro(SomeOption, bool);\\n\\n \\n\\n vtkSetMacro(ScalarField, std::string);\\n\\n vtkGetMacro(ScalarField, std::string);\\n\\n // end of TODO-4\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 63,\n \"score\": 8785.324101715189\n },\n {\n \"content\": \" /// \\\\warning If the encapsulated ttk::Triangulation object is representing \\n\\n /// implicitly a regular grid, this grid will be explicitly converted into \\n\\n /// a triangulation in the output vtkUnstructuredGrid object. This is \\n\\n /// likely to be very memory-expensive.\\n\\n vtkUnstructuredGrid* getVtkUnstructuredGrid();\\n\\n \\n\\n /// Check if the connectivity of the input data-set \\\\p dataSet changed \\n\\n /// since the last time the VTK object \\\\p callingObject has been modified.\\n\\n /// This function is particularly useful in vtkWrappers to check if the \\n\\n /// input geometry changed (requiring a reset of the computation or not).\\n\\n /// \\\\param dataSet Input VTK data-set.\\n\\n /// \\\\param callingObject Calling VTK object (typically a vtkWrapper)\\n\\n /// \\\\return Returns 0 upon success, negative values otherwise.\\n\\n /// \\\\sa ttkFTMTree\\n\\n /// \\\\sa vtkMorseSmaleComplex\\n\\n /// \\\\sa vtkReebSpace\\n\\n static bool hasChangedConnectivity(ttk::Triangulation *triangulation,\\n\\n vtkDataSet *dataSet, vtkObject *callingObject);\\n\\n \\n\\n /// Specify the input VTK object representing a triangulation or a regular \\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 64,\n \"score\": 8784.844691566275\n },\n {\n \"content\": \" UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\\n // end of default ttk setters\\n\\n\\n\\n int FillInputPortInformation(int port, vtkInformation* info) override {\\n\\n switch(port){\\n\\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkTable\\\"); break;\\n\\n default: return 0;\\n\\n }\\n\\n return 1;\\n\\n }\\n\\n\\n\\n int FillOutputPortInformation(int port, vtkInformation* info) override {\\n\\n switch(port){\\n\\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkTable\\\"); break;\\n\\n default: return 0;\\n\\n }\\n\\n return 1;\\n\\n }\\n\",\n \"file_path\": \"ttk/core/vtk/ttkForEachRow/ttkForEachRow.h\",\n \"rank\": 65,\n \"score\": 8784.689240958782\n },\n {\n \"content\": \" int OpenFile();\\n\\n virtual void WriteData() override;\\n\\n \\n\\n char *FileName;\\n\\n ofstream *Stream;\\n\\n \\n\\n private:\\n\\n ttkOFFWriter(const ttkOFFWriter &) = delete;\\n\\n void operator=(const ttkOFFWriter &) = delete;\\n\\n\\n\\n};\\n\",\n \"file_path\": \"ttk/core/vtk/ttkOFFWriter/ttkOFFWriter.h\",\n \"rank\": 66,\n \"score\": 8784.091310207483\n },\n {\n \"content\": \" UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\\n // end of default ttk setters\\n\\n\\n\\n int FillInputPortInformation(int port, vtkInformation* info) override {\\n\\n switch(port){\\n\\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkDataObject\\\"); break;\\n\\n case 1: info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkTable\\\"); break;\\n\\n default: return 0;\\n\\n }\\n\\n return 1;\\n\\n }\\n\\n\\n\\n int FillOutputPortInformation(int port, vtkInformation* info) override {\\n\\n switch(port){\\n\\n case 0: info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkDataObject\\\"); break;\\n\\n default: return 0;\\n\\n }\\n\\n return 1;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 67,\n \"score\": 8784.026514512123\n },\n {\n \"content\": \" int RequestDataObject(vtkInformation *request, \\\\\\n\\n vtkInformationVector **inputVector, vtkInformationVector *outputVector) override {\\\\\\n\\n \\\\\\n\\n vtkDataSetAlgorithm::RequestDataObject(\\\\\\n\\n request, inputVector, outputVector);\\\\\\n\\n \\\\\\n\\n for(int i = 0; i < GetNumberOfOutputPorts(); i++){\\\\\\n\\n \\\\\\n\\n vtkInformation *outputInformation =\\\\\\n\\n outputVector->GetInformationObject(i);\\\\\\n\\n \\\\\\n\\n vtkDataSet *output = vtkDataSet::SafeDownCast(\\\\\\n\\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\\\\n\\n \\\\\\n\\n if(output){\\\\\\n\\n \\\\\\n\\n std::string dataType = output->GetClassName();\\\\\\n\\n \\\\\\n\\n TTK_UNSTRUCTURED_GRID_NEW(i, outputInformation, dataType);\\\\\\n\\n \\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 68,\n \"score\": 8783.756815085357\n },\n {\n \"content\": \" \\\\\\n\\n ttkUnstructuredGrid *data = ttkUnstructuredGrid::SafeDownCast(\\\\\\n\\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\\\\n\\n \\\\\\n\\n if(!data){\\\\\\n\\n data = ttkUnstructuredGrid::New();\\\\\\n\\n outputInformation->Set(vtkDataObject::DATA_OBJECT(), data);\\\\\\n\\n data->FastDelete();\\\\\\n\\n data->CopyInformationFromPipeline(outputInformation);\\\\\\n\\n GetOutputPortInformation(i)->Set(\\\\\\n\\n vtkDataObject::DATA_EXTENT_TYPE(), data->GetExtentType());\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n if((data)&&(!data->getTriangulation())){\\\\\\n\\n data->allocate();\\\\\\n\\n }\\\\\\n\\n }\\n\\n\\n\\n#define TTK_OUTPUT_MANAGEMENT() \\\\\\n\\n protected: \\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 69,\n \"score\": 8783.48770007721\n },\n {\n \"content\": \"/// ttk::Triangulation supports both explicit and implicit triangulations: \\n\\n/// -# Explicit triangulations with vtkUnstructuredGrid or vtkPolyData \\n\\n/// objects: Given a vtkUnstructuredGrid or a vtkPolyData representing a valid \\n\\n/// triangulation, ttk:Triangulation provides time efficient accesses \\n\\n/// (requiring adequate pre-processing, see the ttk::Triangulation class \\n\\n/// documentation).\\n\\n/// -# Implicit triangulations with vtkImageData objects: Given a vtkImageData\\n\\n/// representing a regular grid, ttk::Triangulation will perform an implicit \\n\\n/// triangulation of the grid, enabling both time and memory efficient \\n\\n/// traversals of triangulations of regular grids.\\n\\n///\\n\\n/// Apart from pre-processes, ttk::Triangulation requires no memory overhead in\\n\\n/// addition to the input vtkUnstructuredGrid, vtkPolyData or vtkImageData \\n\\n/// objects (the actual data is passed through pointers). This also means that \\n\\n/// the input VTK objects (vtkUnstructuredGrid, vtkPolyData or vtkImageData) \\n\\n/// must persist as long as their corresponding ttk::Triangulation object \\n\\n/// (unspecified behavior otherwise).\\n\\n///\\n\\n/// \\\\note\\n\\n/// Only pre-process the information you need! See the \\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 70,\n \"score\": 8783.386466920301\n },\n {\n \"content\": \" if(dataType == \\\"vtkPolyData\\\"){\\\\\\n\\n ttkPolyData *data = ttkPolyData::SafeDownCast(\\\\\\n\\n outputInformation->Get(vtkDataObject::DATA_OBJECT()));\\\\\\n\\n \\\\\\n\\n if(!data){\\\\\\n\\n data = ttkPolyData::New();\\\\\\n\\n outputInformation->Set(vtkDataObject::DATA_OBJECT(), data);\\\\\\n\\n data->FastDelete();\\\\\\n\\n data->CopyInformationFromPipeline(outputInformation);\\\\\\n\\n GetOutputPortInformation(i)->Set(\\\\\\n\\n vtkDataObject::DATA_EXTENT_TYPE(), data->GetExtentType());\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n if((data)&&(!data->getTriangulation())){\\\\\\n\\n data->allocate();\\\\\\n\\n }\\\\\\n\\n }\\n\\n\\n\\n#define TTK_UNSTRUCTURED_GRID_NEW(i, ouputInformation, dataTYpe)\\\\\\n\\n if(dataType == \\\"vtkUnstructuredGrid\\\"){\\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 71,\n \"score\": 8783.206275248749\n },\n {\n \"content\": \"/// \\\\ingroup vtk\\n\\n/// \\\\class ttkTriangulation\\n\\n/// \\\\author Julien Tierny <julien.tierny@lip6.fr>\\n\\n/// \\\\date January 2016.\\n\\n/// \\n\\n/// \\\\brief ttkTriangulation is a wrapper for the ttk::Triangulation class, which\\n\\n/// provides time and memory efficient traversal methods on triangulations of \\n\\n/// piecewise linear manifolds. It provides the following features:\\n\\n/// -# Given a vertex, it provides: the list of edges that are connected to \\n\\n/// it, the list of its neighbors, its link, its star, etc.\\n\\n/// -# Given an edge, it provides: its vertices, its star, etc.\\n\\n/// -# Given a triangle, its provides: its vertices, its edges, etc.\\n\\n/// -# Given a tetrahedron, its provides: its vertices, its edges, its \\n\\n/// neighbor tetrahedra, etc.\\n\\n/// -# Given a triangulation, it provides: its list of vertices, edges, \\n\\n/// triangles and tetrahedra.\\n\\n///\\n\\n/// ttk::Triangulation implements faster accesses than, more general-purpose, \\n\\n/// competing VTK data structures such as the vtkUnstructuredGrid class.\\n\\n/// \\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 72,\n \"score\": 8783.156521768593\n },\n {\n \"content\": \" \\n\\n int shallowCopy(vtkDataObject *other);\\n\\n \\n\\n\\n\\n bool hasAllocated_;\\n\\n \\n\\n vtkDataSet *inputDataSet_;\\n\\n vtkSmartPointer<vtkPoints> \\n\\n vtkPoints_;\\n\\n vtkSmartPointer<vtkUnstructuredGrid>\\n\\n vtkUnstructuredGrid_;\\n\\n \\n\\n ttk::Triangulation *triangulation_;\\n\\n \\n\\n private:\\n\\n \\n\\n};\\n\\n\\n\\n// Internal things to allow the ttkTriangulation to travel through a VTK \\n\\n// pipeline.\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 73,\n \"score\": 8782.931494993572\n },\n {\n \"content\": \" }\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n std::vector<vtkDataSet *> inputs(GetNumberOfInputPorts(), NULL);\\\\\\n\\n std::vector<vtkDataSet *> outputs(GetNumberOfOutputPorts(), NULL);\\\\\\n\\n \\\\\\n\\n for(int i = 0; i < GetNumberOfInputPorts(); i++){\\\\\\n\\n vtkDataSet *input = vtkDataSet::GetData(inputVector[i]);\\\\\\n\\n if(input){\\\\\\n\\n inputTriangulations_[i]->SetInputData(input);\\\\\\n\\n inputTriangulations_[i]->Update();\\\\\\n\\n inputs[i] = inputTriangulations_[i]->GetOutput();\\\\\\n\\n }\\\\\\n\\n }\\\\\\n\\n for(int i = 0; i < GetNumberOfOutputPorts(); i++){\\\\\\n\\n outputs[i] = vtkDataSet::SafeDownCast(\\\\\\n\\n \\\\\\n\\n outputVector->GetInformationObject(i)->Get(\\\\\\n\\n vtkDataObject::DATA_OBJECT()));\\\\\\n\\n }\\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 74,\n \"score\": 8782.247683682388\n },\n {\n \"content\": \" /// grid.\\n\\n /// \\\\param dataSet Input VTK object (vtkImageData, vtkPolyData or \\n\\n /// vtkUnstructuredGrid).\\n\\n /// \\\\return Returns 0 upon success, negative values otherwise.\\n\\n ///\\n\\n /// \\\\warning If the internal ttk::Triangulation object is already \\n\\n /// representing a valid triangulation, this information will be \\n\\n /// over-written (which means that pre-processing functions should \\n\\n /// be called again).\\n\\n /// \\n\\n /// \\\\warning For memory-efficiency purposes, this function makes NO DATA \\n\\n /// COPY. This means that, if the object \\\\p dataSet is destroyed after this \\n\\n /// function, the behavior of the internal ttk::Triangulation will be \\n\\n /// unspecified (well, this is a nice way to say it's gonna crash).\\n\\n int setInputData(vtkDataSet *dataSet);\\n\\n \\n\\n \\n\\n protected:\\n\\n \\n\\n int deepCopy(vtkDataObject *other);\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 75,\n \"score\": 8782.051368729724\n },\n {\n \"content\": \"#define ttkTypeMacro(thisClass, superClass) \\\\\\n\\n protected: \\\\\\n\\n const char* GetClassNameInternal() const{ \\\\\\n\\n return #superClass; \\\\\\n\\n } \\\\\\n\\n public: \\\\\\n\\n typedef superClass Superclass; \\\\\\n\\n static bool IsTypeOf(const char *type){ \\\\\\n\\n if(!strcmp(\\\"superClass\\\", type)){ \\\\\\n\\n return 1;\\\\\\n\\n } \\\\\\n\\n return superClass::IsTypeOf(type); \\\\\\n\\n } \\\\\\n\\n int IsA(const char *type){ \\\\\\n\\n return this->thisClass::IsTypeOf(type); \\\\\\n\\n } \\\\\\n\\n static thisClass* SafeDownCast(vtkObjectBase *o){ \\\\\\n\\n if((o)&&(o->IsA(\\\"thisClass\\\"))){ \\\\\\n\\n return static_cast<thisClass *>(o); \\\\\\n\\n } \\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 76,\n \"score\": 8781.546597486249\n },\n {\n \"content\": \" return NULL;\\\\\\n\\n } \\\\\\n\\n thisClass *NewInstance() const { \\\\\\n\\n return thisClass::SafeDownCast(this->NewInstanceInternal()); \\\\\\n\\n }\\\\\\n\\n protected: \\\\\\n\\n vtkObjectBase* NewInstanceInternal() const{ \\\\\\n\\n return thisClass::New();\\\\\\n\\n } \\\\\\n\\n public:\\\\\\n\\n\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 77,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \"#if VTK_MAJOR_VERSION <= 8\\n\\n#define vtkTemplate2Macro(call) \\\\\\n\\n vtkTemplate2MacroCase1(VTK_DOUBLE, double, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_FLOAT, float, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_LONG_LONG, long long, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_UNSIGNED_LONG_LONG, unsigned long long, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_ID_TYPE, vtkIdType, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_LONG, long, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_UNSIGNED_LONG, unsigned long, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_INT, int, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_UNSIGNED_INT, unsigned int, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_SHORT, short, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_UNSIGNED_SHORT, unsigned short, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_CHAR, char, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_SIGNED_CHAR, signed char, call); \\\\\\n\\n vtkTemplate2MacroCase1(VTK_UNSIGNED_CHAR, unsigned char, call)\\n\\n#define vtkTemplate2MacroCase1(type1N, type1, call) \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_DOUBLE, double, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_FLOAT, float, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_LONG_LONG, long long, call); \\\\\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 78,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \"\\n\\n private:\\n\\n\\n\\n double nextIndex;\\n\\n\\n\\n bool needsToAbort() override { return GetAbortExecute(); };\\n\\n int updateProgress(const float &progress) override {\\n\\n UpdateProgress(progress);\\n\\n return 0;\\n\\n };\\n\\n};\",\n \"file_path\": \"ttk/core/vtk/ttkEndFor/ttkEndFor.h\",\n \"rank\": 79,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \" vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_LONG_LONG, unsigned long long, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_ID_TYPE, vtkIdType, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_LONG, long, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_LONG, unsigned long, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_INT, int, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_INT, unsigned int, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_SHORT, short, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_SHORT, unsigned short, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_CHAR, char, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_SIGNED_CHAR, signed char, call); \\\\\\n\\n vtkTemplate2MacroCase2(type1N, type1, VTK_UNSIGNED_CHAR, unsigned char, call)\\n\\n#define vtkTemplate2MacroCase2(type1N, type1, type2N, type2, call) \\\\\\n\\n case vtkTemplate2PackMacro(type1N, type2N): { \\\\\\n\\n typedef type1 VTK_T1; \\\\\\n\\n typedef type2 VTK_T2; \\\\\\n\\n call; \\\\\\n\\n }; break\\n\\n#define vtkTemplate2PackMacro(type1N, type2N) \\\\\\n\\n ((((type1N) & 0xFF) << 8) | \\\\\\n\\n((type2N) & 0xFF))\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 80,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \"\\n\\n // TODO-2\\n\\n // Over-ride the input types.\\n\\n // By default, this filter has one input and one output, of the same type.\\n\\n // Here, you can re-define the input types, on a per input basis.\\n\\n // In this example, the first input type is forced to vtkUnstructuredGrid.\\n\\n // The second input type is forced to vtkImageData.\\n\\n// int FillInputPortInformation(int port, vtkInformation *info) override {\\n\\n// \\n\\n// switch(port){\\n\\n// case 0:\\n\\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkUnstructuredGrid\\\"); \\n\\n// break;\\n\\n// case 1:\\n\\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkImageData\\\"); \\n\\n// break;\\n\\n// default:\\n\\n// break;\\n\\n// }\\n\\n// \\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 81,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \" \\n\\n private:\\n\\n \\n\\n bool needsToAbort() override;\\n\\n \\n\\n int updateProgress(const float &progress) override;\\n\\n \\n\\n};\\n\\n\\n\\n/// @}\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 82,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \"// return 1;\\n\\n// }\\n\\n // end of TODO-2\\n\\n \\n\\n // TODO-3\\n\\n // Over-ride the output types.\\n\\n // By default, this filter has one input and one output, of the same type.\\n\\n // Here, you can re-define the output types, on a per output basis.\\n\\n // In this example, the first output type is forced to vtkUnstructuredGrid.\\n\\n // The second output type is forced to vtkImageData.\\n\\n// int FillOutputPortInformation(int port, vtkInformation *info) override {\\n\\n// \\n\\n// switch(port){\\n\\n// case 0:\\n\\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkUnstructuredGrid\\\"); \\n\\n// break;\\n\\n// case 1:\\n\\n// info->Set(vtkDataObject::DATA_TYPE_NAME(), \\\"vtkImageData\\\"); \\n\\n// break;\\n\\n// default:\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlank/ttkBlank.h\",\n \"rank\": 83,\n \"score\": 8777.689020324144\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKCOMMONDATAMODEL_EXPORT ttkPolyData :\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 84,\n \"score\": 8726.605188497328\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKCOMMONDATAMODEL_EXPORT ttkUnstructuredGrid :\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 85,\n \"score\": 8726.605188497328\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKFILTERSCORE_EXPORT ttkTriangulationFilter\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkWrapper.h\",\n \"rank\": 86,\n \"score\": 8726.605188497328\n },\n {\n \"content\": \"#ifndef TTK_PLUGIN\\n\\nclass VTKCOMMONDATAMODEL_EXPORT ttkImageData :\\n\",\n \"file_path\": \"ttk/core/vtk/ttkTriangulation/ttkTriangulation.h\",\n \"rank\": 87,\n \"score\": 8726.605188497328\n },\n {\n \"content\": \"#else\\n\\nclass ttkBlockAggregator\\n\\n#endif\\n\\n: public vtkMultiBlockDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkBlockAggregator* New();\\n\\n vtkTypeMacro(ttkBlockAggregator, vtkMultiBlockDataSetAlgorithm)\\n\\n\\n\\n vtkSetMacro(ForceReset, bool);\\n\\n vtkGetMacro(ForceReset, bool);\\n\\n\\n\\n vtkSetMacro(FlattenInput, bool);\\n\\n vtkGetMacro(FlattenInput, bool);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n void SetThreads(){\\n\\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\\n\\n Modified();\\n\",\n \"file_path\": \"ttk/core/vtk/ttkBlockAggregator/ttkBlockAggregator.h\",\n \"rank\": 88,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkIntegralLines\\n\\n#endif\\n\\n: public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkIntegralLines* New();\\n\\n\\n\\n vtkTypeMacro(ttkIntegralLines, vtkDataSetAlgorithm);\\n\\n\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n\\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIntegralLines/ttkIntegralLines.h\",\n \"rank\": 89,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkLDistance\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper \\n\\n{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkLDistance* New();\\n\\n \\n\\n vtkTypeMacro(ttkLDistance, vtkDataSetAlgorithm);\\n\\n \\n\\n // Default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n \\n\\n void SetThreadNumber(int threadNumber) {\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n } \\n\\n \\n\\n void SetUseAllCores(bool onOff) {\\n\",\n \"file_path\": \"ttk/core/vtk/ttkLDistance/ttkLDistance.h\",\n \"rank\": 90,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkContourForests\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n \\n\\n \\n\\n public:\\n\\n \\n\\n static ttkContourForests* New();\\n\\n\\n\\n vtkTypeMacro(ttkContourForests, vtkDataSetAlgorithm);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n vtkSetMacro(FieldId, int);\\n\\n\\n\\n void SetThreadNumber(int threadNumber);\\n\\n void SetDebugLevel(int d);\\n\\n void SetUseAllCores(bool onOff);\\n\\n // end of default ttk setters\\n\",\n \"file_path\": \"ttk/core/vtk/ttkContourForests/ttkContourForests.h\",\n \"rank\": 91,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkJacobiSet\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkJacobiSet* New();\\n\\n \\n\\n vtkTypeMacro(ttkJacobiSet, vtkDataSetAlgorithm);\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n } \\n\\n \\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkJacobiSet/ttkJacobiSet.h\",\n \"rank\": 92,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkManifoldCheck\\n\\n#endif\\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkManifoldCheck* New();\\n\\n vtkTypeMacro(ttkManifoldCheck, vtkDataSetAlgorithm)\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\\\\\n\\n ThreadNumber = threadNumber;\\\\\\n\\n SetThreads();\\\\\\n\\n }\\\\\\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\",\n \"file_path\": \"ttk/core/vtk/ttkManifoldCheck/ttkManifoldCheck.h\",\n \"rank\": 93,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkCinemaReader\\n\\n#endif\\n\\n: public vtkTableReader, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkCinemaReader* New();\\n\\n vtkTypeMacro(ttkCinemaReader, vtkTableReader)\\n\\n\\n\\n vtkSetMacro(DatabasePath, std::string);\\n\\n vtkGetMacro(DatabasePath, std::string);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n void SetThreads(){\\n\\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\\n\\n Modified();\\n\\n }\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkCinemaReader/ttkCinemaReader.h\",\n \"rank\": 94,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkGeometrySmoother\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkGeometrySmoother* New();\\n\\n \\n\\n vtkTypeMacro(ttkGeometrySmoother, vtkDataSetAlgorithm);\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n } \\n\\n \\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkGeometrySmoother/ttkGeometrySmoother.h\",\n \"rank\": 95,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkIcoSphere\\n\\n#endif\\n\\n: public vtkUnstructuredGridAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkIcoSphere* New();\\n\\n vtkTypeMacro(ttkIcoSphere, vtkUnstructuredGridAlgorithm)\\n\\n\\n\\n vtkSetMacro(Subdivisions, int);\\n\\n vtkGetMacro(Subdivisions, int);\\n\\n\\n\\n vtkSetVector3Macro(Center, float);\\n\\n vtkGetVector3Macro(Center, float);\\n\\n\\n\\n vtkSetMacro(Radius, float);\\n\\n vtkGetMacro(Radius, float);\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIcoSphere/ttkIcoSphere.h\",\n \"rank\": 96,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkCinemaQuery\\n\\n#endif\\n\\n: public vtkTableAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n static ttkCinemaQuery* New();\\n\\n vtkTypeMacro(ttkCinemaQuery, vtkTableAlgorithm)\\n\\n\\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n void SetThreads(){\\n\\n threadNumber_ = !UseAllCores ? ThreadNumber : ttk::OsCall::getNumberOfCores();\\n\\n Modified();\\n\\n }\\n\\n void SetThreadNumber(int threadNumber){\\n\\n ThreadNumber = threadNumber;\\n\\n SetThreads();\\n\\n }\\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\",\n \"file_path\": \"ttk/core/vtk/ttkCinemaQuery/ttkCinemaQuery.h\",\n \"rank\": 97,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkMeshGraph\\n\\n#endif\\n\\n: public vtkUnstructuredGridAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n\\n\\n static ttkMeshGraph* New();\\n\\n vtkTypeMacro(ttkMeshGraph, vtkUnstructuredGridAlgorithm)\\n\\n\\n\\n vtkSetMacro(UseVariableSize, bool);\\n\\n vtkGetMacro(UseVariableSize, bool);\\n\\n\\n\\n vtkSetMacro(SizeFieldName, std::string);\\n\\n vtkGetMacro(SizeFieldName, std::string);\\n\\n\\n\\n vtkSetMacro(SizeAxis, int);\\n\\n vtkGetMacro(SizeAxis, int);\\n\\n\\n\\n vtkSetMacro(SizeScale, float);\\n\\n vtkGetMacro(SizeScale, float);\\n\",\n \"file_path\": \"ttk/core/vtk/ttkMeshGraph/ttkMeshGraph.h\",\n \"rank\": 98,\n \"score\": 8720.76628401961\n },\n {\n \"content\": \"#else\\n\\nclass ttkIdentifierRandomizer\\n\\n#endif \\n\\n : public vtkDataSetAlgorithm, public ttk::Wrapper{\\n\\n\\n\\n public:\\n\\n \\n\\n static ttkIdentifierRandomizer* New();\\n\\n vtkTypeMacro(ttkIdentifierRandomizer, vtkDataSetAlgorithm)\\n\\n \\n\\n // default ttk setters\\n\\n vtkSetMacro(debugLevel_, int);\\n\\n \\n\\n void SetThreadNumber(int threadNumber){\\\\\\n\\n ThreadNumber = threadNumber;\\\\\\n\\n SetThreads();\\\\\\n\\n }\\\\\\n\\n void SetUseAllCores(bool onOff){\\n\\n UseAllCores = onOff;\\n\\n SetThreads();\\n\\n }\\n\",\n \"file_path\": \"ttk/core/vtk/ttkIdentifierRandomizer/ttkIdentifierRandomizer.h\",\n \"rank\": 99,\n \"score\": 8720.76628401961\n }\n]","isConversational":false}}},{"rowIdx":381,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/GrainViewer/Ui/Gui.cpp"},"repo_name":{"kind":"string","value":"eliemichel/GrainViewer"},"commit":{"kind":"string","value":"91d4922b3185ada90508f0944f2691ba8eba45e3"},"file_code":{"kind":"string","value":"\n\n#include <OpenGL>\n\n#include \"Logger.h\"\n#include \"Gui.h\"\n#include \"Window.h\"\n#include \"Scene.h\"\n#include \"Dialog.h\"\n#include \"RuntimeObject.h\"\n#include \"ShaderPool.h\"\n#include \"GlobalTimer.h\"\n#include \"Ui/SceneDialog.h\"\n#include \"Ui/DeferredShadingDialog.h\"\n#include \"Ui/WorldDialog.h\"\n#include \"Ui/GlobalTimerDialog.h\"\n\n#include <GLFW/glfw3.h>\n#include <imgui.h>\n#include \"imgui_impl_glfw.h\"\n#include \"imgui_impl_opengl3.h\"\n\n#include <iostream>\n\nusing namespace std;\n\n#include \"LightGizmoDialog.h\"\n#include \"FarGrainRendererDialog.h\"\n#include \"TransformDialog.h\"\n#include \"PointCloudSplitterDialog.h\"\n#include \"InstanceGrainRendererDialog.h\"\n#include \"ImpostorGrainRendererDialog.h\"\n#include \"GrainBehaviorDialog.h\"\n#include \"MeshRendererDialog.h\"\n#include \"QuadMeshDataDialog.h\"\nstatic std::shared_ptr<Dialog> makeComponentDialog(std::string type, std::shared_ptr<Behavior> component) {\n#define handleBehavior(T) \\\n\tif (type == BehaviorRegistryEntry<T>::Name()) { \\\n\t\tauto dialog = DialogFactory<T>().MakeShared(); \\\n\t\tdialog->setControlledBehavior(std::dynamic_pointer_cast<T>(component)); \\\n\t\treturn std::dynamic_pointer_cast<Dialog>(dialog); \\\n\t}\n\thandleBehavior(LightGizmo);\n\thandleBehavior(FarGrainRenderer);\n\thandleBehavior(TransformBehavior);\n\thandleBehavior(PointCloudSplitter);\n\thandleBehavior(InstanceGrainRenderer);\n\thandleBehavior(ImpostorGrainRenderer);\n\thandleBehavior(GrainBehavior);\n\thandleBehavior(MeshRenderer);\n\thandleBehavior(QuadMeshData);\n\treturn nullptr;\n#undef handleType\n}\n\nvoid Gui::Init(const Window & window)\n{\n\tIMGUI_CHECKVERSION();\n\tImGui::CreateContext();\n\tImGuiIO& io = ImGui::GetIO(); (void)io;\n\tImGui_ImplGlfw_InitForOpenGL(window.glfw(), true);\n\tImGui_ImplOpenGL3_Init(\"#version 150\");\n\tImGui::GetStyle().WindowRounding = 0.0f;\n}\n\nvoid Gui::NewFrame()\n{\n\tImGui_ImplOpenGL3_NewFrame();\n\tImGui_ImplGlfw_NewFrame();\n\tImGui::NewFrame();\n}\n\nvoid Gui::DrawFrame()\n{\n\tImGui::Render();\n\tImGui_ImplOpenGL3_RenderDrawData(ImGui::GetDrawData());\n}\n\nvoid Gui::Shutdown()\n{\n\tImGui_ImplOpenGL3_Shutdown();\n\tImGui_ImplGlfw_Shutdown();\n\tImGui::DestroyContext();\n}\n\nstatic void printUsage() {\n\tcerr\n\t\t<< \"GrainViewer -- real time grain viewer\" << endl\n\t\t<< \"Author : Élie Michel (http://perso.telecom-paristech.fr/~emichel)\" << endl\n\t\t<< endl\n\t\t<< \"Keyboard commands\" << endl\n\t\t<< \"------------------\" << endl\n\t\t<< \" r: Reload shaders\" << endl\n\t\t<< \" ctrl+r: Reload scene\" << endl\n\t\t<< \" p: Toggle panel\" << endl\n\t\t<< \" a: Tilt camera left\" << endl\n\t\t<< \" e: Tilt camera right\" << endl\n\t\t<< \" d: Switch deferred shading on/off\" << endl\n\t\t<< \" c: Print camera matrix (row major)\" << endl\n\t\t<< \" <space>: Pause physics\" << endl\n\t\t<< \" ?: Print help\" << endl\n\t\t<< \" q, <esc>: Quit\" << endl\n\t\t<< endl;\n}\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mode) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onKey(key, scancode, action, mode);\n}\n\nstatic void cursor_pos_callback(GLFWwindow* window, double x, double y) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onCursorPosition(x, y);\n}\n\nstatic void mouse_button_callback(GLFWwindow* window, int button, int action, int mods) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onMouseButton(button, action, mods);\n}\n\nstatic void window_size_callback(GLFWwindow* window, int width, int height) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onResize(width, height);\n}\n\nstatic void scroll_callback(GLFWwindow* window, double xoffset, double yoffset) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onScroll(xoffset, yoffset);\n}\n\nvoid Gui::setupCallbacks()\n{\n\tif (auto window = m_window.lock()) {\n\t\tglfwSetWindowUserPointer(window->glfw(), static_cast<void*>(this));\n\t\tglfwSetKeyCallback(window->glfw(), key_callback);\n\t\tglfwSetCursorPosCallback(window->glfw(), cursor_pos_callback);\n\t\tglfwSetMouseButtonCallback(window->glfw(), mouse_button_callback);\n\t\tglfwSetWindowSizeCallback(window->glfw(), window_size_callback);\n\t\tglfwSetScrollCallback(window->glfw(), scroll_callback);\n\t}\n}\n\nGui::Gui(std::shared_ptr<Window> window)\n\t: m_window(window)\n\t, m_scene(nullptr)\n{\n\tsetupCallbacks();\n\n\tInit(*window);\n\n\tint width, height;\n\tglfwGetFramebufferSize(window->glfw(), &width, &height);\n\tonResize(width, height);\n}\n\nGui::~Gui() {\n\tShutdown();\n}\n\nvoid Gui::setScene(std::shared_ptr<Scene> scene)\n{\n\tm_scene = scene;\n\tsetupDialogs();\n}\n\nvoid Gui::beforeLoading()\n{\n\tNewFrame();\n\tImGui::SetNextWindowSize(ImVec2(m_windowWidth, m_windowHeight));\n\tImGui::SetNextWindowPos(ImVec2(0.f, 0.f));\n\tImGui::Begin(\"Reload\", nullptr,\n\t\tImGuiWindowFlags_NoResize |\n\t\tImGuiWindowFlags_NoMove |\n\t\tImGuiWindowFlags_NoCollapse |\n\t\tImGuiWindowFlags_NoTitleBar);\n\tImGui::Text(\" \");\n\tImGui::Text(\" \");\n\tImGui::Text(\"Loading scene...\");\n\tImGui::End();\n\tDrawFrame();\n\tif (auto window = m_window.lock()) {\n\t\tglfwSwapBuffers(window->glfw());\n\t}\n}\n\nvoid Gui::afterLoading()\n{\n\tif (auto window = m_window.lock()) {\n\t\tint width, height;\n\t\tglfwGetFramebufferSize(window->glfw(), &width, &height);\n\t\tonResize(width, height);\n\t}\n\n\tm_startTime = static_cast<float>(glfwGetTime());\n\tsetupDialogs();\n}\n\nvoid Gui::setupDialogs()\n{\n\tm_dialogGroups.clear();\n\tif (m_scene) {\n\t\taddDialogGroup<DeferredShadingDialog>(\"Deferred Shading\", m_scene->deferredShader());\n\t\taddDialogGroup<WorldDialog>(\"World\", m_scene->world());\n\t\taddDialogGroup<GlobalTimerDialog>(\"Timers\", GlobalTimer::GetInstance());\n\t\taddDialogGroup<SceneDialog>(\"Scene:\", m_scene);\n\n\t\tfor (const auto& obj : m_scene->objects()) {\n\t\t\tDialogGroup group;\n\t\t\tgroup.title = \" - \" + obj->name;\n\t\t\tIBehaviorHolder::ConstBehaviorIterator it, end;\n\t\t\tfor (it = obj->cbeginBehaviors(), end = obj->cendBehaviors(); it != end; ++it) {\n\t\t\t\tauto dialog = makeComponentDialog(it->first, it->second);\n\t\t\t\tif (dialog) {\n\t\t\t\t\tgroup.dialogs.push_back(dialog);\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_dialogGroups.push_back(group);\n\t\t}\n\t}\n}\n\nvoid Gui::update() {\n\tupdateImGui();\n\tif (m_scene) {\n\t\tm_scene->update(static_cast<float>(glfwGetTime()) - m_startTime);\n\t\tif (auto window = m_window.lock()) {\n\t\t\tif (m_scene->mustQuit()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::updateImGui() {\n\tNewFrame();\n\tImVec4 clear_color = ImColor(114, 144, 154);\n\tstatic float f = 0.0f;\n\tImGui::SetNextWindowPos(ImVec2(0.f, 0.f));\n\tImGui::SetNextWindowSize(ImVec2(420.f, 0.f));\n\tImGui::Begin(\"Framerate\", nullptr,\n\t\tImGuiWindowFlags_NoResize |\n\t\tImGuiWindowFlags_NoMove |\n\t\tImGuiWindowFlags_NoCollapse |\n\t\tImGuiWindowFlags_NoTitleBar);\n\tint frame = m_scene ? m_scene->frame() : 0;\n\tImGui::Text(\"Application average %.3f ms/frame (%.1f FPS) | #%d\", 1000.0f / ImGui::GetIO().Framerate, ImGui::GetIO().Framerate, frame);\n\tImGui::End();\n\n\t\n\tint dialogId = 0;\n\tfor (auto & dg : m_dialogGroups) {\n\t\tImGui::PushID(dialogId++);\n\t\tfor (auto d : dg.dialogs) {\n\t\t\td->drawHandles(0, 0, m_windowWidth, m_windowHeight);\n\t\t}\n\t\tImGui::PopID();\n\t}\n\n\tif (m_showPanel) {\n\t\tImGui::SetNextWindowSize(ImVec2(m_panelWidth, m_windowHeight));\n\t\tImGui::SetNextWindowPos(ImVec2(m_windowWidth - m_panelWidth, 0.f));\n\t\tImGui::Begin(\"Dialogs\", nullptr,\n\t\t\tImGuiWindowFlags_NoResize |\n\t\t\tImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse |\n\t\t\tImGuiWindowFlags_NoTitleBar);\n\n\t\t\n\t\tImGui::PushID(0);\n\n\t\tint dialogId = 0;\n\t\tbool pressed;\n\t\tfor (auto & dg : m_dialogGroups) {\n\t\t\tImGui::PushID(dialogId);\n\t\t\tdialogId += static_cast<int>(dg.dialogs.size());\n\t\t\tpressed = ImGui::Selectable(dg.title.c_str(), &dg.enabled);\n\t\t\tif (pressed && m_isControlPressed == 0) {\n\t\t\t\t\n\t\t\t\tfor (auto & other : m_dialogGroups) {\n\t\t\t\t\tother.enabled = &other == &dg;\n\t\t\t\t}\n\t\t\t}\n\t\t\tImGui::PopID();\n\t\t}\n\n\t\tImGui::PopID();\n\t\t\n\t\t\n\t\tImGui::PushID(1);\n\n\t\tdialogId = 0;\n\t\tfor (auto & dg : m_dialogGroups) {\n\t\t\tif (dg.enabled) {\n\t\t\t\tfor (auto d : dg.dialogs) {\n\t\t\t\t\tImGui::PushID(dialogId++);\n\t\t\t\t\td->draw();\n\t\t\t\t\tImGui::PopID();\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdialogId += static_cast<int>(dg.dialogs.size());\n\t\t\t}\n\t\t}\n\n\t\tImGui::PopID();\n\n\t\tImGui::End();\n\t}\n}\n\nvoid Gui::render() {\n\tif (m_scene) {\n\t\tm_scene->render();\n\t}\n\n\tif (!m_scene || m_scene->properties().ui) {\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tDrawFrame();\n\t}\n\n\tif (m_scene) {\n\t\tm_scene->onPostRender(static_cast<float>(glfwGetTime()) - m_startTime);\n\t}\n}\n\nvoid Gui::onResize(int width, int height) {\n\tm_windowWidth = static_cast<float>(width);\n\tm_windowHeight = static_cast<float>(height);\n\n\tif (auto window = m_window.lock()) {\n\t\tint fbWidth, fbHeight;\n\t\tglfwGetFramebufferSize(window->glfw(), &fbWidth, &fbHeight);\n\t\tglViewport(0, 0, fbWidth, fbHeight);\n\t\tif (m_scene) {\n\t\t\tm_scene->setResolution(fbWidth, fbHeight);\n\t\t}\n\t}\n}\n\n#define forAllCameras(method) \\\nfor (auto& camera : m_scene->cameras()) { \\\n\tif (camera->properties().controlInViewport) { \\\n\t\tcamera->method(); \\\n\t} \\\n}\n\nvoid Gui::onMouseButton(int button, int action, int mods) {\n\tif (m_imguiFocus || !m_scene) {\n\t\treturn;\n\t}\n\n\tm_isMouseMoveStarted = action == GLFW_PRESS;\n\n\tswitch (button) {\n\tcase GLFW_MOUSE_BUTTON_LEFT:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMouseRotation);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMouseRotation);\n\t\t}\n\t\tbreak;\n\n\tcase GLFW_MOUSE_BUTTON_MIDDLE:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMouseZoom);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMouseZoom);\n\t\t}\n\t\tbreak;\n\n\tcase GLFW_MOUSE_BUTTON_RIGHT:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMousePanning);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMousePanning);\n\t\t}\n\t\tbreak;\n\t}\n}\n\nvoid Gui::onCursorPosition(double x, double y) {\n\tdouble limit = static_cast<double>(m_windowWidth) - static_cast<double>(m_panelWidth);\n\tm_imguiFocus = x >= limit && m_showPanel && !m_isMouseMoveStarted;\n\n\tif (m_imguiFocus) {\n\t\treturn;\n\t}\n\n\tif (m_scene) {\n\t\tfor (auto& camera : m_scene->cameras()) {\n\t\t\tif (camera->properties().controlInViewport) {\n\t\t\t\tcamera->updateMousePosition(static_cast<float>(x), static_cast<float>(y));\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::onScroll(double xoffset, double yoffset) {\n\tif (m_imguiFocus) {\n\t\treturn;\n\t}\n\n\tif (m_scene) {\n\t\tfor (auto& camera : m_scene->cameras()) {\n\t\t\tif (camera->properties().controlInViewport) {\n\t\t\t\tcamera->zoom(- 2 * static_cast<float>(yoffset));\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::onKey(int key, int scancode, int action, int mods) {\n\tif (action == GLFW_PRESS) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_ESCAPE:\n\t\t\tif (auto window = getWindow().lock()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t++m_isControlPressed;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_RELEASE) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t\n\t\t\tm_isControlPressed = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_PRESS && !m_imguiFocus) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_ESCAPE:\n\t\t\tif (auto window = m_window.lock()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_P:\n\t\t\tm_showPanel = !m_showPanel;\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t++m_isControlPressed;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_PRESS && !m_imguiFocus && m_scene) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_R:\n\t\t\tif (mods & GLFW_MOD_CONTROL) {\n\t\t\t\tbeforeLoading();\n\t\t\t\tShaderPool::Clear();\n\t\t\t\tm_scene->load(m_scene->filename());\n\t\t\t\tafterLoading();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tm_scene->reloadShaders();\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_U:\n\t\t\tm_scene->properties().ui = !m_scene->properties().ui;\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_A:\n\t\t\tforAllCameras(tiltLeft);\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_E:\n\t\t\tforAllCameras(tiltRight);\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_C:\n\t\t\tif (mods & GLFW_MOD_CONTROL) {\n\t\t\t\tShaderPool::Clear();\n\t\t\t\tm_scene->clear();\n\t\t\t} else {\n\t\t\t\tif (m_scene->viewportCamera()) {\n\t\t\t\t\tglm::mat4 m = m_scene->viewportCamera()->viewMatrix();\n\t\t\t\t\tDEBUG_LOG << \"View Matrix: \\n\"\n\t\t\t\t\t\t<< \"[\" << m[0][0] << \",\" << m[0][1] << \",\" << m[0][2] << \",\" << m[0][3]\n\t\t\t\t\t\t<< \",\" << m[1][0] << \",\" << m[1][1] << \",\" << m[1][2] << \",\" << m[1][3]\n\t\t\t\t\t\t<< \",\" << m[2][0] << \",\" << m[2][1] << \",\" << m[2][2] << \",\" << m[2][3]\n\t\t\t\t\t\t<< \",\" << m[3][0] << \",\" << m[3][1] << \",\" << m[3][2] << \",\" << m[3][3] << \"]\";\n\n\t\t\t\t\tstd::ostringstream ss;\n\t\t\t\t\tm_scene->viewportCamera()->serialize(ss);\n\t\t\t\t\tDEBUG_LOG << ss.str();\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_SPACE:\n\t\t\tm_scene->togglePause();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n#undef forAllCameras\n"},"prefix":{"kind":"string","value":"\n\n#include <OpenGL>\n\n#include \"Logger.h\"\n#include \"Gui.h\"\n#include \"Window.h\"\n#include \"Scene.h\"\n#include \"Dialog.h\"\n#include \"RuntimeObject.h\"\n#include \"ShaderPool.h\"\n#include \"GlobalTimer.h\"\n#include \"Ui/SceneDialog.h\"\n#include \"Ui/DeferredShadingDialog.h\"\n#include \"Ui/WorldDialog.h\"\n#include \"Ui/GlobalTimerDialog.h\"\n\n#include <GLFW/glfw3.h>\n#include <imgui.h>\n#include \"imgui_impl_glfw.h\"\n#include \"imgui_impl_opengl3.h\"\n\n#include <iostream>\n\nusing namespace std;\n\n#include \"LightGizmoDialog.h\"\n#include \"FarGrainRendererDialog.h\"\n#include \"TransformDialog.h\"\n#include \"PointCloudSplitterDialog.h\"\n#include \"InstanceGrainRendererDialog.h\"\n#include \"ImpostorGrainRendererDialog.h\"\n#include \"GrainBehaviorDialog.h\"\n#include \"MeshRendererDialog.h\"\n#include \"QuadMeshDataDialog.h\"\nstatic std::shared_ptr<Dialog> makeComponentDialog(std::string type, std::shared_ptr<Behavior> component) {\n#define handleBehavior(T) \\\n\tif (type == BehaviorRegistryEntry<T>::Name()) { \\\n\t\tauto dialog = DialogFactory<T>().MakeShared(); \\\n\t\tdialog->setControlledBehavior(std::dynamic_pointer_cast<T>(component)); \\\n\t\treturn std::dynamic_pointer_cast<Dialog>(dialog); \\\n\t}\n\thandleBehavior(LightGizmo);\n\thandleBehavior(FarGrainRenderer);\n\thandleBehavior(TransformBehavior);\n\thandleBehavior(PointCloudSplitter);\n\thandleBehavior(InstanceGrainRenderer);\n\thandleBehavior(ImpostorGrainRenderer);\n\thandleBehavior(GrainBehavior);\n\thandleBehavior(MeshRenderer);\n\thandleBehavior(QuadMeshData);\n\treturn nullptr;\n#undef handleType\n}\n\nvoid Gui::Init(const Window & window)\n{\n\tIMGUI_CHECKVERSION();\n\tImGui::CreateContext();\n\tImGuiIO& io = ImGui::GetIO(); (void)io;\n\tImGui_ImplGlfw_InitForOpenGL(window.glfw(), true);\n\tImGui_ImplOpenGL3_Init(\"#version 150\");\n\tImGui::GetStyle().WindowRounding = 0.0f;\n}\n\nvoid Gui::NewFrame()\n{\n\tImGui_ImplOpenGL3_NewFrame();\n\tImGui_ImplGlfw_NewFrame();\n\tImGui::NewFrame();\n}\n\nvoid Gui::DrawFrame()\n{\n\tImGui::Render();\n\tImGui_ImplOpenGL3_RenderDrawData(ImGui::GetDrawData());\n}\n\nvoid Gui::Shutdown()\n{\n\tImGui_ImplOpenGL3_Shutdown();\n\tImGui_ImplGlfw_Shutdown();\n\tImGui::DestroyContext();\n}\n\nstatic void printUsage() {\n\tcerr\n\t\t<< \"GrainViewer -- real time grain viewer\" << endl\n\t\t<< \"Author : Élie Michel (http://perso.telecom-paristech.fr/~emichel)\" << endl\n\t\t<< endl\n\t\t<< \"Keyboard commands\" << endl\n\t\t<< \"------------------\" << endl\n\t\t<< \" r: Reload shaders\" << endl\n\t\t<< \" ctrl+r: Reload scene\" << endl\n\t\t<< \" p: Toggle panel\" << endl\n\t\t<< \" a: Tilt camera left\" << endl\n\t\t<< \" e: Tilt camera right\" << endl\n\t\t<< \" d: Switch deferred shading on/off\" << endl\n\t\t<< \" c: Print camera matrix (row major)\" << endl\n\t\t<< \" <space>: Pause physics\" << endl\n\t\t<< \" ?: Print help\" << endl\n\t\t<< \" q, <esc>: Quit\" << endl\n\t\t<< endl;\n}\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mode) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onKey(key, scancode, action, mode);\n}\n\nstatic void cursor_pos_callback(GLFWwindow* window, double x, double y) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onCursorPosition(x, y);\n}\n\nstatic void mouse_button_callback(GLFWwindow* window, int button, int action, int mods) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onMouseButton(button, action, mods);\n}\n\nstatic void window_size_callback(GLFWwindow* window, int width, int height) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onResize(width, height);\n}\n\nstatic void scroll_callback(GLFWwindow* window, double xoffset, double yoffset) {\n\tGui* gui = static_cast<Gui*>(glfwGetWindowUserPointer(window));\n\tgui->onScroll(xoffset, yoffset);\n}\n\nvoid Gui::setupCallbacks()\n{\n\tif (auto window = m_window.lock()) {\n\t\tglfwSetWindowUserPointer(window->glfw(), static_cast<void*>(this));\n\t\tglfwSetKeyCallback(window->glfw(), key_callback);\n\t\tglfwSetCursorPosCallback(window->glfw(), cursor_pos_callback);\n\t\tglfwSetMouseButtonCallback(window->glfw(), mouse_button_callback);\n\t\tglfwSetWindowSizeCallback(window->glfw(), window_size_callback);\n\t\tglfwSetScrollCallback(window->glfw(), scroll_callback);\n\t}\n}\n\nGui::Gui(std::shared_ptr<Window> window)\n\t: m_window(window)\n\t, m_scene(nullptr)\n{\n\tsetupCallbacks();\n\n\tInit(*window);\n\n\tint width, height;\n\tglfwGetFramebufferSize(window->glfw(), &width, &height);\n\tonResize(width, height);\n}\n\nGui::~Gui() {\n\tShutdown();\n}\n\nvoid Gui::setScene(std::shared_ptr<Scene> scene)\n{\n\tm_scene = scene;\n\tsetupDialogs();\n}\n\nvoid Gui::beforeLoading()\n{\n\tNewFrame();\n\tImGui::SetNextWindowSize(ImVec2(m_windowWidth, m_windowHeight));\n\tImGui::SetNextWindowPos(ImVec2(0.f, 0.f));\n\tImGui::Begin(\"Reload\", nullptr,\n\t\tImGuiWindowFlags_NoResize |\n\t\tImGuiWindowFlags_NoMove |\n\t\tImGuiWindowFlags_NoCollapse |\n\t\tImGuiWindowFlags_NoTitleBar);\n\tImGui::Text(\" \");\n\tImGui::Text(\" \");\n\tImGui::Text(\"Loading scene...\");\n\tImGui::End();\n\tDrawFrame();\n\tif (auto window = m_window.lock()) {\n\t\tglfwSwapBuffers(window->glfw());\n\t}\n}\n\nvoid Gui::afterLoading()\n{\n\tif (auto window = m_window.lock()) {\n\t\tint width, height;\n\t\tglfwGetFramebufferSize(window->glfw(), &width, &height);\n\t\tonResize(width, height);\n\t}\n\n\tm_startTime = static_cast<float>(glfwGetTime());\n\tsetupDialogs();\n}\n\nvoid Gui::setupDialogs()\n{\n\tm_dialogGroups.clear();\n\tif (m_scene) {\n\t\taddDialogGroup<DeferredShadingDialog>(\"Deferred Shading\", m_scene->deferredShader());\n\t\taddDialogGroup<WorldDialog>(\"World\", m_scene->world());\n\t\taddDialogGroup<GlobalTimerDialo"},"suffix":{"kind":"string","value":"\n\nvoid Gui::update() {\n\tupdateImGui();\n\tif (m_scene) {\n\t\tm_scene->update(static_cast<float>(glfwGetTime()) - m_startTime);\n\t\tif (auto window = m_window.lock()) {\n\t\t\tif (m_scene->mustQuit()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::updateImGui() {\n\tNewFrame();\n\tImVec4 clear_color = ImColor(114, 144, 154);\n\tstatic float f = 0.0f;\n\tImGui::SetNextWindowPos(ImVec2(0.f, 0.f));\n\tImGui::SetNextWindowSize(ImVec2(420.f, 0.f));\n\tImGui::Begin(\"Framerate\", nullptr,\n\t\tImGuiWindowFlags_NoResize |\n\t\tImGuiWindowFlags_NoMove |\n\t\tImGuiWindowFlags_NoCollapse |\n\t\tImGuiWindowFlags_NoTitleBar);\n\tint frame = m_scene ? m_scene->frame() : 0;\n\tImGui::Text(\"Application average %.3f ms/frame (%.1f FPS) | #%d\", 1000.0f / ImGui::GetIO().Framerate, ImGui::GetIO().Framerate, frame);\n\tImGui::End();\n\n\t\n\tint dialogId = 0;\n\tfor (auto & dg : m_dialogGroups) {\n\t\tImGui::PushID(dialogId++);\n\t\tfor (auto d : dg.dialogs) {\n\t\t\td->drawHandles(0, 0, m_windowWidth, m_windowHeight);\n\t\t}\n\t\tImGui::PopID();\n\t}\n\n\tif (m_showPanel) {\n\t\tImGui::SetNextWindowSize(ImVec2(m_panelWidth, m_windowHeight));\n\t\tImGui::SetNextWindowPos(ImVec2(m_windowWidth - m_panelWidth, 0.f));\n\t\tImGui::Begin(\"Dialogs\", nullptr,\n\t\t\tImGuiWindowFlags_NoResize |\n\t\t\tImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse |\n\t\t\tImGuiWindowFlags_NoTitleBar);\n\n\t\t\n\t\tImGui::PushID(0);\n\n\t\tint dialogId = 0;\n\t\tbool pressed;\n\t\tfor (auto & dg : m_dialogGroups) {\n\t\t\tImGui::PushID(dialogId);\n\t\t\tdialogId += static_cast<int>(dg.dialogs.size());\n\t\t\tpressed = ImGui::Selectable(dg.title.c_str(), &dg.enabled);\n\t\t\tif (pressed && m_isControlPressed == 0) {\n\t\t\t\t\n\t\t\t\tfor (auto & other : m_dialogGroups) {\n\t\t\t\t\tother.enabled = &other == &dg;\n\t\t\t\t}\n\t\t\t}\n\t\t\tImGui::PopID();\n\t\t}\n\n\t\tImGui::PopID();\n\t\t\n\t\t\n\t\tImGui::PushID(1);\n\n\t\tdialogId = 0;\n\t\tfor (auto & dg : m_dialogGroups) {\n\t\t\tif (dg.enabled) {\n\t\t\t\tfor (auto d : dg.dialogs) {\n\t\t\t\t\tImGui::PushID(dialogId++);\n\t\t\t\t\td->draw();\n\t\t\t\t\tImGui::PopID();\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdialogId += static_cast<int>(dg.dialogs.size());\n\t\t\t}\n\t\t}\n\n\t\tImGui::PopID();\n\n\t\tImGui::End();\n\t}\n}\n\nvoid Gui::render() {\n\tif (m_scene) {\n\t\tm_scene->render();\n\t}\n\n\tif (!m_scene || m_scene->properties().ui) {\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tDrawFrame();\n\t}\n\n\tif (m_scene) {\n\t\tm_scene->onPostRender(static_cast<float>(glfwGetTime()) - m_startTime);\n\t}\n}\n\nvoid Gui::onResize(int width, int height) {\n\tm_windowWidth = static_cast<float>(width);\n\tm_windowHeight = static_cast<float>(height);\n\n\tif (auto window = m_window.lock()) {\n\t\tint fbWidth, fbHeight;\n\t\tglfwGetFramebufferSize(window->glfw(), &fbWidth, &fbHeight);\n\t\tglViewport(0, 0, fbWidth, fbHeight);\n\t\tif (m_scene) {\n\t\t\tm_scene->setResolution(fbWidth, fbHeight);\n\t\t}\n\t}\n}\n\n#define forAllCameras(method) \\\nfor (auto& camera : m_scene->cameras()) { \\\n\tif (camera->properties().controlInViewport) { \\\n\t\tcamera->method(); \\\n\t} \\\n}\n\nvoid Gui::onMouseButton(int button, int action, int mods) {\n\tif (m_imguiFocus || !m_scene) {\n\t\treturn;\n\t}\n\n\tm_isMouseMoveStarted = action == GLFW_PRESS;\n\n\tswitch (button) {\n\tcase GLFW_MOUSE_BUTTON_LEFT:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMouseRotation);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMouseRotation);\n\t\t}\n\t\tbreak;\n\n\tcase GLFW_MOUSE_BUTTON_MIDDLE:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMouseZoom);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMouseZoom);\n\t\t}\n\t\tbreak;\n\n\tcase GLFW_MOUSE_BUTTON_RIGHT:\n\t\tif (action == GLFW_PRESS) {\n\t\t\tforAllCameras(startMousePanning);\n\t\t}\n\t\telse {\n\t\t\tforAllCameras(stopMousePanning);\n\t\t}\n\t\tbreak;\n\t}\n}\n\nvoid Gui::onCursorPosition(double x, double y) {\n\tdouble limit = static_cast<double>(m_windowWidth) - static_cast<double>(m_panelWidth);\n\tm_imguiFocus = x >= limit && m_showPanel && !m_isMouseMoveStarted;\n\n\tif (m_imguiFocus) {\n\t\treturn;\n\t}\n\n\tif (m_scene) {\n\t\tfor (auto& camera : m_scene->cameras()) {\n\t\t\tif (camera->properties().controlInViewport) {\n\t\t\t\tcamera->updateMousePosition(static_cast<float>(x), static_cast<float>(y));\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::onScroll(double xoffset, double yoffset) {\n\tif (m_imguiFocus) {\n\t\treturn;\n\t}\n\n\tif (m_scene) {\n\t\tfor (auto& camera : m_scene->cameras()) {\n\t\t\tif (camera->properties().controlInViewport) {\n\t\t\t\tcamera->zoom(- 2 * static_cast<float>(yoffset));\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Gui::onKey(int key, int scancode, int action, int mods) {\n\tif (action == GLFW_PRESS) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_ESCAPE:\n\t\t\tif (auto window = getWindow().lock()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t++m_isControlPressed;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_RELEASE) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t\n\t\t\tm_isControlPressed = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_PRESS && !m_imguiFocus) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_ESCAPE:\n\t\t\tif (auto window = m_window.lock()) {\n\t\t\t\tglfwSetWindowShouldClose(window->glfw(), GL_TRUE);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_P:\n\t\t\tm_showPanel = !m_showPanel;\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_LEFT_CONTROL:\n\t\tcase GLFW_KEY_RIGHT_CONTROL:\n\t\t\t++m_isControlPressed;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (action == GLFW_PRESS && !m_imguiFocus && m_scene) {\n\t\tswitch (key) {\n\t\tcase GLFW_KEY_R:\n\t\t\tif (mods & GLFW_MOD_CONTROL) {\n\t\t\t\tbeforeLoading();\n\t\t\t\tShaderPool::Clear();\n\t\t\t\tm_scene->load(m_scene->filename());\n\t\t\t\tafterLoading();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tm_scene->reloadShaders();\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_U:\n\t\t\tm_scene->properties().ui = !m_scene->properties().ui;\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_A:\n\t\t\tforAllCameras(tiltLeft);\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_E:\n\t\t\tforAllCameras(tiltRight);\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_C:\n\t\t\tif (mods & GLFW_MOD_CONTROL) {\n\t\t\t\tShaderPool::Clear();\n\t\t\t\tm_scene->clear();\n\t\t\t} else {\n\t\t\t\tif (m_scene->viewportCamera()) {\n\t\t\t\t\tglm::mat4 m = m_scene->viewportCamera()->viewMatrix();\n\t\t\t\t\tDEBUG_LOG << \"View Matrix: \\n\"\n\t\t\t\t\t\t<< \"[\" << m[0][0] << \",\" << m[0][1] << \",\" << m[0][2] << \",\" << m[0][3]\n\t\t\t\t\t\t<< \",\" << m[1][0] << \",\" << m[1][1] << \",\" << m[1][2] << \",\" << m[1][3]\n\t\t\t\t\t\t<< \",\" << m[2][0] << \",\" << m[2][1] << \",\" << m[2][2] << \",\" << m[2][3]\n\t\t\t\t\t\t<< \",\" << m[3][0] << \",\" << m[3][1] << \",\" << m[3][2] << \",\" << m[3][3] << \"]\";\n\n\t\t\t\t\tstd::ostringstream ss;\n\t\t\t\t\tm_scene->viewportCamera()->serialize(ss);\n\t\t\t\t\tDEBUG_LOG << ss.str();\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase GLFW_KEY_SPACE:\n\t\t\tm_scene->togglePause();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n#undef forAllCameras\n"},"middle":{"kind":"string","value":"g>(\"Timers\", GlobalTimer::GetInstance());\n\t\taddDialogGroup<SceneDialog>(\"Scene:\", m_scene);\n\n\t\tfor (const auto& obj : m_scene->objects()) {\n\t\t\tDialogGroup group;\n\t\t\tgroup.title = \" - \" + obj->name;\n\t\t\tIBehaviorHolder::ConstBehaviorIterator it, end;\n\t\t\tfor (it = obj->cbeginBehaviors(), end = obj->cendBehaviors(); it != end; ++it) {\n\t\t\t\tauto dialog = makeComponentDialog(it->first, it->second);\n\t\t\t\tif (dialog) {\n\t\t\t\t\tgroup.dialogs.push_back(dialog);\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_dialogGroups.push_back(group);\n\t\t}\n\t}\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"class DeferredShadingDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid drawHandles(float x, float y, float w, float h) override;\n\n\tvoid setController(std::weak_ptr<GlDeferredShader> shading) { m_cont = shading; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<GlDeferredShader> m_cont;\n\n};\n","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.h","rank":0,"score":250529.7370123773},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include \"Dialog.h\"\n\n#include \"GlDeferredShader.h\"\n\n\n\n#include <memory>\n\n\n","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.h","rank":1,"score":209794.68330255308},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.h","rank":2,"score":209792.60358511625},{"content":"class GlDeferredShader;\n","file_path":"src/GrainViewer/Scene.h","rank":3,"score":209646.06110032668},{"content":"class SceneDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setController(std::weak_ptr<Scene> scene) { m_cont = scene; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<Scene> m_cont;\n\n};\n","file_path":"src/GrainViewer/Ui/SceneDialog.h","rank":4,"score":209115.00366870622},{"content":"class Window;\n","file_path":"src/GrainViewer/Ui/Gui.h","rank":5,"score":207104.15554968888},{"content":"class Scene;\n","file_path":"src/GrainViewer/Ui/Gui.h","rank":6,"score":207016.34915488012},{"content":"class Dialog;\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <memory>\n\n\n","file_path":"src/GrainViewer/Ui/Gui.h","rank":7,"score":206854.80552042165},{"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/External/tinygltf/include/json.hpp","rank":8,"score":203812.99383772598},{"content":"{\n\n\tif (auto cont = m_cont.lock()) {\n\n\t\tif (ImGui::CollapsingHeader(\"Deferred Shading\", ImGuiTreeNodeFlags_DefaultOpen)) {\n\n\t\t\tGlDeferredShader::Properties & props = cont->properties();\n\n\n\n\t\t\tautoUi(props);\n\n\t\t\tImGui::Text(\"Shadow Map Bias: %f\", props.ShadowMapBias());\n\n\t\t}\n\n\t}\n\n}\n\n\n\nvoid DeferredShadingDialog::drawHandles(float x, float y, float w, float h)\n\n{\n\n\tif (auto cont = m_cont.lock()) {\n\n\t\tGlDeferredShader::Properties & props = cont->properties();\n\n\n\n\t\tif (props.showSampleCount) {\n\n\t\t\tImGui::SetNextWindowPos(ImVec2(x, y + h - 60));\n\n\t\t\tImGui::SetNextWindowSize(ImVec2(540, 60));\n\n\t\t\tImGui::Begin(\"DeferredShadingDialog Handle\", nullptr,\n","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.cpp","rank":9,"score":202421.22076512894},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#include \"DeferredShadingDialog.h\"\n\n#include \"utils/guiutils.h\"\n\n#include \"utils/behaviorutils.h\"\n\n#include \"GlTexture.h\"\n\n\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\n#include <limits>\n\n#include <imgui.h>\n\n\n\nvoid DeferredShadingDialog::draw()\n","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.cpp","rank":10,"score":202414.80137244772},{"content":"\t\t\t\tImGuiWindowFlags_NoResize |\n\n\t\t\t\tImGuiWindowFlags_NoMove |\n\n\t\t\t\tImGuiWindowFlags_NoCollapse |\n\n\t\t\t\tImGuiWindowFlags_NoTitleBar);\n\n\t\t\t\n\n\t\t\tif (cont->hasColorMap()) {\n\n\t\t\t\tconst float spacing = ImGui::GetStyle().ItemSpacing.x;\n\n\n\n\t\t\t\tGLuint tex = cont->colormap().raw();\n\n\t\t\t\tImGui::Image((void*)(intptr_t)tex, ImVec2(540 - 2 * spacing, 20));\n\n\t\t\t\tImGui::Text(\"0\");\n\n\t\t\t\t\n\n\t\t\t\tstatic float inputWidth = 30.0f;\n\n\t\t\t\tImGui::SameLine(ImGui::GetWindowWidth() - spacing - inputWidth);\n\n\t\t\t\tImGui::PushItemWidth(inputWidth);\n\n\t\t\t\tImGui::InputFloat(\"##maxSampleCount\", &props.maxSampleCount, 0, 0, \"%.0f\");\n\n\t\t\t\tinputWidth = ImGui::GetItemRectSize().x;\n\n\t\t\t}\n\n\n\n\t\t\tImGui::End();\n\n\t\t}\n\n\t}\n\n}\n","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.cpp","rank":11,"score":202409.96164780163},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Ui/DeferredShadingDialog.cpp","rank":12,"score":202407.67311384843},{"content":"class Window;\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <memory>\n\n\n\n/**\n\n * Gui for tests, displaying a progress bar and some debug info\n\n */\n","file_path":"src/GrainViewer/Ui/TestGui.h","rank":13,"score":200788.8140703006},{"content":"struct underlying_type<T, true> : std::underlying_type<std::decay_t<T>> {};\n\n\n\ntemplate <typename E, bool = is_enum_v<E>>\n","file_path":"src/External/refl-cpp/include/magic_enum.hpp","rank":14,"score":187948.61908053723},{"content":"class GlDeferredShader {\n\npublic:\n\n\tenum ShadingMode {\n\n\t\tBeautyPass,\n\n\t\tNormalPass,\n\n\t\tBaseColorPass,\n\n\t\tMetallicPass,\n\n\t\tRoughnessPass,\n\n\t\tWorldPositionPass,\n\n\t\tDepthPass,\n\n\t\tRawGBuffer0,\n\n\t\tRawGBuffer1,\n\n\t\tRawGBuffer2,\n\n\t};\n\n\tstruct Properties {\n\n\t\tShadingMode shadingMode = BeautyPass;\n\n\t\tbool transparentFilm = false;\n\n\t\tbool showSampleCount = false;\n\n\t\tfloat maxSampleCount = 10;\n\n\t\tbool debugVectors = false;\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":15,"score":181480.2010682164},{"content":" stbi_io_callbacks io;\n","file_path":"src/External/tinygltf/include/stb_image.h","rank":16,"score":181177.0912757329},{"content":" stbi__uint32 type;\n","file_path":"src/External/tinygltf/include/stb_image.h","rank":17,"score":181064.29677016204},{"content":"class Camera {\n\npublic:\n\n\tenum ProjectionType {\n\n\t\tPerspectiveProjection,\n\n\t\tOrthographicProjection,\n\n\t};\n\n\tstruct OutputSettings {\n\n\t\tbool autoOutputResolution = true;\n\n\t\tint width;\n\n\t\tint height;\n\n\t\tstd::string outputFrameBase;\n\n\t\tbool isRecordEnabled = false;\n\n\t\tbool saveOnDisc = true; // if false, get pixel data from gpu but don't actually write them to disc. They can be used to measure stats\n\n\t};\n","file_path":"src/GrainViewer/Camera.h","rank":18,"score":179478.70305060587},{"content":"class Scene {\n\npublic:\n\n\tScene();\n\n\n\n\tbool load(const std::string & filename);\n\n\tconst std::string & filename() const { return m_filename; }\n\n\n\n\tvoid setResolution(int width, int height);\n\n\t\n\n\tvoid reloadShaders();\n\n\tvoid update(float time);\n\n\tvoid render() const;\n\n\tvoid onPostRender(float time);\n\n\n\n\t// Clear scene\n\n\tvoid clear();\n\n\n\n\tstd::shared_ptr<Camera> viewportCamera() const;\n\n\tinline const std::vector<std::shared_ptr<RuntimeObject>> & objects() const { return m_objects; }\n\n\tinline const std::vector<std::shared_ptr<Camera>>& cameras() const { return m_cameras; }\n","file_path":"src/GrainViewer/Scene.h","rank":19,"score":179478.70305060587},{"content":"class Shader {\n\npublic:\n\n Shader(GLenum shaderType = 0);\n\n ~Shader();\n\n\n\n /**\n\n * Load file into the shader\n\n * @param filename Shader file\n\n */\n\n bool load(const std::string &filename, const std::vector<std::string> & defines = {}, const std::map<std::string, std::string> & snippets = {});\n\n\n\n /**\n\n * Compile the shader\n\n */\n\n inline void compile() { glCompileShader(m_shaderId); }\n\n\n\n /**\n\n * Check that the shader has been successfully compiled\n\n * @param name Name displayed in error message\n\n * @param success status\n","file_path":"src/GrainViewer/Shader.h","rank":20,"score":179385.88006071266},{"content":"class Window {\n\npublic:\n\n\tWindow(int width, int height, const char *title);\n\n\t~Window();\n\n\n\n\t/**\n\n\t * @return the raw GLFWwindow object, or nullptr if initialization failed.\n\n\t */\n\n\tGLFWwindow *glfw() const;\n\n\n\n\t/**\n\n\t * @return true iff window has correctly been initialized\n\n\t */\n\n\tbool isValid() const;\n\n\n\n\tvoid pollEvents() const;\n\n\tvoid swapBuffers() const;\n\n\tbool shouldClose() const;\n\n\n\nprivate:\n\n\tGLFWwindow *m_window = nullptr;\n\n};\n","file_path":"src/GrainViewer/Ui/Window.h","rank":21,"score":174881.95420636336},{"content":"class Gui {\n\npublic:\n\n\t// For tools that don't use the main Gui\n\n\tstatic void Init(const Window & window);\n\n\tstatic void NewFrame();\n\n\tstatic void DrawFrame();\n\n\tstatic void Shutdown();\n\npublic:\n\n\tGui(std::shared_ptr<Window> window);\n\n\t~Gui();\n\n\n\n\tvoid setScene(std::shared_ptr<Scene> scene);\n\n\n\n\t// Call these resp. before and after loading the scene\n\n\tvoid beforeLoading();\n\n\tvoid afterLoading();\n\n\n\n\tvoid update();\n\n\tvoid render();\n\n\n","file_path":"src/GrainViewer/Ui/Gui.h","rank":22,"score":174798.8067738239},{"content":"class Dialog {\n\npublic:\n\n\t/**\n\n\t * Draw panel (in right-hand side bar).\n\n\t */\n\n\tvirtual void draw() {}\n\n\n\n\t/**\n\n\t * Draw on top of 3D render\n\n\t * x, y, w, h is the viewport rect\n\n\t */\n\n\tvirtual void drawHandles(float x, float y, float w, float h) {}\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"src/GrainViewer/Ui/Dialog.h","rank":23,"score":174591.76059389743},{"content":"\t\tfloat debugVectorsScale = 0.1f;\n\n\t\tfloat debugVectorsGrid = 20.0f;\n\n\t\tfloat shadowMapBiasBase = 0.1f;\n\n\t\tint shadowMapBiasExponent = -5;\n\n\n\n\t\tfloat ShadowMapBias() const;\n\n\t};\n\npublic:\n\n\tGlDeferredShader();\n\n\t~GlDeferredShader();\n\n\n\n\tvoid bindFramebuffer(const Camera& camera) const;\n\n\n\n\tbool deserialize(const rapidjson::Value & json);\n\n\tvoid reloadShaders();\n\n\tvoid update(float time);\n\n\n\n\tvoid render(const Camera & camera, const World & world, RenderType target) const;\n\n\n\n\tProperties & properties() { return m_properties; }\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":24,"score":172989.04525076345},{"content":"\tconst Properties & properties() const { return m_properties; }\n\n\n\n\tbool hasColorMap() const { return m_colormap != nullptr; }\n\n\t// Use only if hasColorMap is truc\n\n\tconst GlTexture & colormap() const { return *m_colormap; }\n\n\n\n\tvoid setBlitOffset(GLint x, GLint y) { m_blitOffset = glm::vec2(static_cast<float>(x), static_cast<float>(y)); }\n\n\n\nprivate:\n\n\tProperties m_properties;\n\n\tShaderProgram m_shader, m_debugShader;\n\n\tGLuint m_vao;\n\n\tstd::unique_ptr<GlTexture> m_colormap; // colormap used as ramp for outputting debug images\n\n\tglm::vec2 m_blitOffset = glm::vec2(0.0f); // offset when writing to output framebuffer\n\n};\n\n\n\n#define _ ReflectionAttributes::\n\nREFL_TYPE(GlDeferredShader::Properties)\n\nREFL_FIELD(shadingMode)\n\nREFL_FIELD(transparentFilm)\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":25,"score":172987.57054615513},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/GlDeferredShader.h","rank":26,"score":172979.9455604596},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include \"ShaderProgram.h\"\n\n#include \"Framebuffer.h\"\n\n#include \"Camera.h\"\n\n#include \"World.h\"\n\n#include \"RenderType.h\"\n\n#include \"utils/ReflectionAttributes.h\"\n\n\n\n#include <glm/glm.hpp>\n\n#include <rapidjson/document.h>\n\n#include <refl.hpp>\n\n\n\n#include <vector>\n\n#include <memory>\n\n\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":27,"score":172979.28813583872},{"content":"REFL_FIELD(showSampleCount)\n\nREFL_FIELD(maxSampleCount, _ HideInDialog())\n\nREFL_FIELD(debugVectors)\n\nREFL_FIELD(debugVectorsScale, _ Range(0, 2))\n\nREFL_FIELD(debugVectorsGrid, _ Range(0, 40))\n\nREFL_FIELD(shadowMapBiasBase)\n\nREFL_FIELD(shadowMapBiasExponent, _ Range(-8, 2))\n\nREFL_END\n\n#undef _\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":28,"score":172960.59679267445},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Ui/SceneDialog.h","rank":29,"score":172940.61734253404},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include \"Dialog.h\"\n\n#include \"Scene.h\"\n\n\n\n#include <memory>\n\n\n","file_path":"src/GrainViewer/Ui/SceneDialog.h","rank":30,"score":172939.12680145647},{"content":"struct is_scoped_enum<T, true> : std::bool_constant<!std::is_convertible_v<T, std::underlying_type_t<T>>> {};\n\n\n\ntemplate <typename T, bool = std::is_enum_v<T>>\n","file_path":"src/External/refl-cpp/include/magic_enum.hpp","rank":31,"score":170124.9516092033},{"content":"struct is_unscoped_enum<T, true> : std::bool_constant<std::is_convertible_v<T, std::underlying_type_t<T>>> {};\n\n\n\ntemplate <typename T, bool = std::is_enum_v<std::decay_t<T>>>\n","file_path":"src/External/refl-cpp/include/magic_enum.hpp","rank":32,"score":170124.9516092033},{"content":"class GrainBehaviorDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<GrainBehavior> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<GrainBehavior> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(GrainBehaviorDialog, GrainBehavior)\n","file_path":"src/GrainViewer/Ui/GrainBehaviorDialog.h","rank":33,"score":169898.25240448213},{"content":"struct DialogFactory<BehaviorType> { \\\n\n\tstatic std::shared_ptr<DialogType> MakeShared() { return std::make_shared<DialogType>(); } \\\n\n};\n\n\n","file_path":"src/GrainViewer/Ui/Dialog.h","rank":34,"score":168321.16975719662},{"content":"\n\n\treturn true;\n\n}\n\n\n\nvoid GlDeferredShader::bindFramebuffer(const Camera& camera) const\n\n{\n\n\tauto fbo = camera.getExtraFramebuffer(Camera::ExtraFramebufferOption::GBufferDepth);\n\n\tfbo->bind();\n\n}\n\n\n\nvoid GlDeferredShader::reloadShaders()\n\n{\n\n\tm_shader.load();\n\n\tm_debugShader.load();\n\n}\n\n\n\nvoid GlDeferredShader::update(float time)\n\n{\n\n\tm_shader.setUniform(\"uTime\", static_cast<GLfloat>(time));\n\n\tm_debugShader.setUniform(\"uTime\", static_cast<GLfloat>(time));\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":35,"score":166686.14758300834},{"content":"}\n\n\n\nvoid GlDeferredShader::render(const Camera & camera, const World & world, RenderType target) const\n\n{\n\n\tauto fbo = camera.getExtraFramebuffer(Camera::ExtraFramebufferOption::GBufferDepth);\n\n\n\n\tglClearColor(0.2f, 0.3f, 0.3f, 1.0f);\n\n\t//glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tglDepthMask(GL_TRUE);\n\n\tglDisable(GL_DEPTH_TEST);\n\n\tglDisable(GL_BLEND);\n\n\n\n\tconst ShaderProgram& shader = properties().debugVectors ? m_debugShader : m_shader;\n\n\n\n\tshader.bindUniformBlock(\"Camera\", camera.ubo());\n\n\n\n\tshader.setUniform(\"uBlitOffset\", m_blitOffset);\n\n\n\n\tGLint o = 0;\n\n\tfor (int i = 0; i < fbo->colorTextureCount(); ++i) {\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":36,"score":166672.000150556},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":37,"score":166668.84289122792},{"content":"\t\tshader.setUniform(MAKE_STR(\"gbuffer\" << i), o);\n\n\t\tglBindTextureUnit(static_cast<GLuint>(o), fbo->colorTexture(i));\n\n\t\t++o;\n\n\t}\n\n\n\n\tshader.setUniform(\"in_depth\", o);\n\n\tglBindTextureUnit(static_cast<GLuint>(o), fbo->depthTexture());\n\n\t++o;\n\n\n\n\t// TODO: Use UBO, move to World\n\n\tauto lights = world.lights();\n\n\tfor (size_t k = 0; k < lights.size(); ++k) {\n\n\t\tstd::string prefix = MAKE_STR(\"light[\" << k << \"].\");\n\n\t\tshader.setUniform(prefix + \"position_ws\", lights[k]->position());\n\n\t\tshader.setUniform(prefix + \"color\", lights[k]->color());\n\n\t\tshader.setUniform(prefix + \"matrix\", lights[k]->shadowMap().camera().projectionMatrix() * lights[k]->shadowMap().camera().viewMatrix());\n\n\t\tshader.setUniform(prefix + \"isRich\", lights[k]->isRich() ? 1 : 0);\n\n\t\tshader.setUniform(prefix + \"hasShadowMap\", lights[k]->hasShadowMap() ? 1 : 0);\n\n\t\tshader.setUniform(prefix + \"shadowMap\", o);\n\n\t\tglBindTextureUnit(static_cast<GLuint>(o), lights[k]->shadowMap().depthTexture());\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":38,"score":166667.82583581816},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#include \"Logger.h\"\n\n#include \"GlDeferredShader.h\"\n\n#include \"Light.h\"\n\n#include \"ShadowMap.h\"\n\n#include \"ResourceManager.h\"\n\n#include \"GlTexture.h\"\n\n#include \"utils/strutils.h\"\n\n#include \"utils/jsonutils.h\"\n\n#include \"utils/behaviorutils.h\"\n\n#include \"Framebuffer.h\"\n\n\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":39,"score":166665.28646380216},{"content":"bool GlDeferredShader::deserialize(const rapidjson::Value & json)\n\n{\n\n\tif (!json.IsObject()) return false;\n\n\n\n\tstd::vector<std::string> defines;\n\n\tif (jrOption(json, \"defines\", defines)) {\n\n\t\tfor (const auto& def : defines) {\n\n\t\t\tm_shader.define(def);\n\n\t\t\tm_debugShader.define(def);\n\n\t\t}\n\n\t}\n\n\tm_debugShader.define(\"DEBUG_VECTORS\");\n\n\n\n\tstd::string colormapFilename;\n\n\tif (jrOption(json, \"colormap\", colormapFilename)) {\n\n\t\tm_colormap = ResourceManager::loadTexture(colormapFilename);\n\n\t\tm_colormap->setWrapMode(GL_CLAMP_TO_EDGE);\n\n\t}\n\n\n\n\tautoDeserialize(json, m_properties);\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":40,"score":166664.32596965984},{"content":"#include <vector>\n\n#include <sstream>\n\n\n\nfloat GlDeferredShader::Properties::ShadowMapBias() const\n\n{\n\n\treturn shadowMapBiasBase * static_cast<float>(pow(10, shadowMapBiasExponent));\n\n}\n\n\n\nGlDeferredShader::GlDeferredShader()\n\n\t: m_shader(\"deferred-shader\")\n\n\t, m_debugShader(\"deferred-shader\")\n\n{\n\n\tglCreateVertexArrays(1, &m_vao);\n\n}\n\n\n\nGlDeferredShader::~GlDeferredShader()\n\n{\n\n\tglDeleteVertexArrays(1, &m_vao);\n\n}\n\n\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":41,"score":166663.19505028406},{"content":"\t\t++o;\n\n\t\tif (lights[k]->isRich()) {\n\n\t\t\tshader.setUniform(prefix + \"richShadowMap\", o);\n\n\t\t\tglBindTextureUnit(static_cast<GLuint>(o), lights[k]->shadowMap().colorTexture(0));\n\n\t\t\t++o;\n\n\t\t}\n\n\t}\n\n\n\n\tshader.setUniform(\"uIsShadowMapEnabled\", world.isShadowMapEnabled());\n\n\n\n\tautoSetUniforms(shader, m_properties);\n\n\tshader.setUniform(\"uShadowMapBias\", m_properties.ShadowMapBias());\n\n\n\n\tshader.setUniform(\"uHasColormap\", static_cast<bool>(m_colormap));\n\n\tif (m_colormap) {\n\n\t\tshader.setUniform(\"uColormap\", static_cast<GLint>(o));\n\n\t\tm_colormap->bind(static_cast<GLuint>(o));\n\n\t\t++o;\n\n\t}\n\n\n\n\tshader.use();\n\n\tglBindVertexArray(m_vao);\n\n\tglDrawArrays(GL_POINTS, 0, 1);\n\n\tglBindVertexArray(0);\n\n}\n","file_path":"src/GrainViewer/GlDeferredShader.cpp","rank":42,"score":166658.97114598923},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#include \"SceneDialog.h\"\n\n#include \"Light.h\"\n\n#include \"utils/guiutils.h\"\n\n#include \"utils/behaviorutils.h\"\n\n\n\n#include <imgui.h>\n\n#include <glm/gtc/type_ptr.hpp>\n\n\n\nvoid SceneDialog::draw()\n\n{\n\n\tif (auto cont = m_cont.lock()) {\n","file_path":"src/GrainViewer/Ui/SceneDialog.cpp","rank":43,"score":166636.71822644307},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Ui/SceneDialog.cpp","rank":44,"score":166630.94977337035},{"content":"\t\tif (ImGui::CollapsingHeader(\"Scene\", ImGuiTreeNodeFlags_DefaultOpen)) {\n\n\t\t\tif (ImGui::Button(\"Take Screenshot\")) {\n\n\t\t\t\tcont->takeScreenshot();\n\n\t\t\t}\n\n\n\n\t\t\tif (cont->isPaused()) {\n\n\t\t\t\tif (ImGui::Button(\"Play\")) {\n\n\t\t\t\t\tcont->play();\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\tif (ImGui::Button(\"Pause\")) {\n\n\t\t\t\t\tcont->pause();\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\n\t\t\tautoUi(cont->properties());\n\n\t\t}\n\n\t}\n\n}\n","file_path":"src/GrainViewer/Ui/SceneDialog.cpp","rank":45,"score":166630.41586401346},{"content":"class ImpostorGrainRendererDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<ImpostorGrainRenderer> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<ImpostorGrainRenderer> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(ImpostorGrainRendererDialog, ImpostorGrainRenderer)\n","file_path":"src/GrainViewer/Ui/ImpostorGrainRendererDialog.h","rank":46,"score":164493.0947507245},{"content":"class InstanceGrainRendererDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<InstanceGrainRenderer> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<InstanceGrainRenderer> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(InstanceGrainRendererDialog, InstanceGrainRenderer)\n","file_path":"src/GrainViewer/Ui/InstanceGrainRendererDialog.h","rank":47,"score":164493.09475072453},{"content":"class FarGrainRendererDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<FarGrainRenderer> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<FarGrainRenderer> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(FarGrainRendererDialog, FarGrainRenderer)\n","file_path":"src/GrainViewer/Ui/FarGrainRendererDialog.h","rank":48,"score":164493.0947507245},{"content":"class GlTexture;\n\n\n","file_path":"src/GrainViewer/GlDeferredShader.h","rank":49,"score":160774.8606524287},{"content":"class TurntableCamera : public Camera {\n\npublic:\n\n\tTurntableCamera();\n\n\n\n\tvoid update(float time) override {}\n\n\n\n\tvoid deserialize(const rapidjson::Value& json, const EnvironmentVariables& env, std::shared_ptr<AnimationManager> animations) override;\n\n\tstd::ostream& serialize(std::ostream& out) override;\n\n\n\nprotected:\n\n\tvoid updateDeltaMouseRotation(float x1, float y1, float x2, float y2) override;\n\n\tvoid updateDeltaMouseZoom(float x1, float y1, float x2, float y2) override;\n\n\tvoid updateDeltaMousePanning(float x1, float y1, float x2, float y2) override;\n\n\tvoid tilt(float theta);\n\n\n\nprivate:\n\n\t/**\n\n\t* Construct view matrix given quat, center and zoom\n\n\t*/\n\n\tvoid updateViewMatrix();\n\n\n\nprivate:\n\n\tglm::vec3 m_center;\n\n\tglm::quat m_quat;\n\n\tfloat m_zoom;\n\n\tfloat m_sensitivity; // relative to screen size\n\n\tfloat m_zoomSensitivity;\n\n};\n\n\n","file_path":"src/GrainViewer/TurntableCamera.h","rank":50,"score":160737.13590302636},{"content":"class WorldDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setController(std::weak_ptr<World> world) { m_cont = world; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<World> m_cont;\n\n};\n","file_path":"src/GrainViewer/Ui/WorldDialog.h","rank":51,"score":157119.01909388174},{"content":"class TransformDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<TransformBehavior> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<TransformBehavior> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(TransformDialog, TransformBehavior)\n","file_path":"src/GrainViewer/Ui/TransformDialog.h","rank":52,"score":157119.01909388174},{"content":"struct enum_traits<E, true> {\n\n using type = E;\n\n using underlying_type = typename detail::underlying_type<E>::type;\n\n\n\n inline static constexpr std::string_view type_name = detail::type_name_v<E>;\n\n\n\n inline static constexpr bool is_unscoped = detail::is_unscoped_enum<E>::value;\n\n inline static constexpr bool is_scoped = detail::is_scoped_enum<E>::value;\n\n inline static constexpr bool is_dense = detail::range_size_v<E> == detail::count_v<E>;\n\n inline static constexpr bool is_sparse = detail::range_size_v<E> != detail::count_v<E>;\n\n\n\n inline static constexpr std::size_t count = detail::count_v<E>;\n\n inline static constexpr std::array<E, count> values = detail::values_v<E>;\n\n inline static constexpr std::array<std::string_view, count> names = detail::names<E>(std::make_index_sequence<count_v<E>>{});\n\n inline static constexpr std::array<std::pair<E, std::string_view>, count> entries = detail::entries<E>(std::make_index_sequence<count_v<E>>{});\n\n\n\n [[nodiscard]] static constexpr bool reflected(E value) noexcept {\n\n return reflected(static_cast<U>(value));\n\n }\n\n\n","file_path":"src/External/refl-cpp/include/magic_enum.hpp","rank":53,"score":156495.00777940036},{"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":"src/External/tinygltf/include/json.hpp","rank":54,"score":152025.6246818939},{"content":"class LightGizmoDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<LightGizmo> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<LightGizmo> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(LightGizmoDialog, LightGizmo)\n","file_path":"src/GrainViewer/Ui/LightGizmoDialog.h","rank":55,"score":150749.98916862626},{"content":"class MeshRendererDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<MeshRenderer> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<MeshRenderer> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(MeshRendererDialog, MeshRenderer)\n","file_path":"src/GrainViewer/Ui/MeshRendererDialog.h","rank":56,"score":150749.98916862626},{"content":"class GlobalTimerDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setController(std::weak_ptr<GlobalTimer> timer) { m_cont = timer; }\n\n\tvoid drawHandles(float x, float y, float w, float h);\n\n\n\nprivate:\n\n\tstd::weak_ptr<GlobalTimer> m_cont;\n\n};\n","file_path":"src/GrainViewer/Ui/GlobalTimerDialog.h","rank":57,"score":150749.98916862626},{"content":" int x,y,w2,h2;\n","file_path":"src/External/tinygltf/include/stb_image.h","rank":58,"score":146951.81384128655},{"content":"struct is_complete_type : std::false_type {};\n\n\n\ntemplate <typename T>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":59,"score":146934.0665825149},{"content":"enum class RenderType\n\n{\n\n\t/**\n\n\t * Direct rendering, without deferred shading\n\n\t */\n\n\tDirect,\n\n\n\n\t/**\n\n\t * Default render type (deferred shading)\n\n\t */\n\n\tDefault,\n\n\n\n\t/**\n\n\t * Shadow map rendering, only depth matters\n\n\t */\n\n\tShadowMap,\n","file_path":"src/GrainViewer/RenderType.h","rank":60,"score":146254.91946517082},{"content":"bool checkShader(GLuint shader, const char *name);\n","file_path":"src/GrainViewer/utils/shader.h","rank":61,"score":146192.33506331695},{"content":"class QuadMeshDataDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<QuadMeshData> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<QuadMeshData> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(QuadMeshDataDialog, QuadMeshData)\n","file_path":"src/GrainViewer/Ui/QuadMeshDataDialog.h","rank":62,"score":145019.7718030954},{"content":"class PointCloudSplitterDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid setControlledBehavior(std::weak_ptr<PointCloudSplitter> behavior) { m_cont = behavior; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<PointCloudSplitter> m_cont;\n\n};\n\n\n\nregisterDialogForBehavior(PointCloudSplitterDialog, PointCloudSplitter)\n","file_path":"src/GrainViewer/Ui/PointCloudSplitterDialog.h","rank":63,"score":145019.7718030954},{"content":"struct is_compatible_type_impl: std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":64,"score":143688.56118836752},{"content":"registerSerializationType(int)\n","file_path":"src/GrainViewer/SerializationType.h","rank":65,"score":143164.8784430084},{"content":"class ExportCameraMatrixBuffer(Operator, ExportHelper):\n\n \"\"\"Export the camera view matrix as a raw binary buffer\"\"\"\n\n bl_idname = \"export.camera_matrix_buffer\" # important since its how bpy.ops.import_test.some_data is constructed\n\n bl_label = \"Export Camera Matrix Buffer\"\n\n\n\n filename_ext = \".bin\"\n\n\n\n filter_glob: StringProperty(\n\n default=\"*.bin\",\n\n options={'HIDDEN'},\n\n maxlen=255, # Max internal buffer length, longer would be clamped.\n\n )\n\n\n\n def execute(self, context):\n","file_path":"share/scripts/blender_export_transform_matrix.py","rank":66,"score":142648.60119484775},{"content":"\t// These must match defines in the shader (magic_enum reflexion is used to set defines)\n\n\t// the first one mirrors RenderTypeCaching (which is for diaplay)\n\n\tenum class RenderTypeShaderVariant {\n\n\t\tRENDER_TYPE_FORGET,\n\n\t\tRENDER_TYPE_CACHE,\n\n\t\tRENDER_TYPE_PRECOMPUTE,\n\n\t};\n","file_path":"src/GrainViewer/Behavior/PointCloudSplitter.h","rank":67,"score":140875.7801466399},{"content":"struct is_compatible_array_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleArrayType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":68,"score":140617.5075502597},{"content":"struct is_compatible_integer_type_impl : std::false_type {};\n\n\n\ntemplate <typename RealIntegerType, typename CompatibleNumberIntegerType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":69,"score":140617.5075502597},{"content":"struct is_compatible_object_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleObjectType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":70,"score":140617.5075502597},{"content":"struct is_constructible_object_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleObjectType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":71,"score":140617.5075502597},{"content":"struct is_constructible_array_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleArrayType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":72,"score":140617.5075502597},{"content":"struct is_constructible_string_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleStringType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":73,"score":140617.5075502597},{"content":"struct is_compatible_string_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleStringType>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":74,"score":140617.5075502597},{"content":"\n\n\tstd::shared_ptr<World> world() { return m_world; }\n\n\tstd::shared_ptr<GlDeferredShader> deferredShader() { return m_deferredShader; }\n\n\n\n\tbool mustQuit() const { return m_mustQuit; }\n\n\tint frame() const { return m_frameIndex; }\n\n\n\n\tstd::shared_ptr<RuntimeObject> findObjectByName(const std::string& name);\n\n\n\n\tvoid takeScreenshot() const;\n\n\tvoid play();\n\n\tvoid pause();\n\n\tvoid togglePause();\n\n\tbool isPaused() const;\n\n\n\npublic:\n\n\tstruct Properties {\n\n\t\tbool freezeOcclusionCamera = false;\n\n\t\tbool realTime = false;\n\n\t\tbool ui = true;\n","file_path":"src/GrainViewer/Scene.h","rank":75,"score":138909.87142259564},{"content":"\tfloat m_timeOffset = 0.0f;\n\n\tbool m_paused = false;\n\n\tfloat m_fps;\n\n\tint m_quitAfterFrame = -1; // -1 to deactivate this feature, otherwise automatically quit the program after the specified frame (usefull for batch rendering)\n\n\tbool m_mustQuit = false;\n\n\n\n\t// Post render stats\n\n\tstd::string m_outputStats; // path to stats file\n\n\tstd::vector<glm::vec3> m_statsCountColors; // colors to count pixels in render\n\n\tstd::ofstream m_outputStatsFile;\n\n\n\n\t// Not really related to the scene, save window resolution\n\n\tint m_width;\n\n\tint m_height;\n\n};\n\n\n\nREFL_TYPE(Scene::Properties)\n\nREFL_FIELD(freezeOcclusionCamera)\n\nREFL_FIELD(realTime)\n\nREFL_FIELD(ui)\n\nREFL_END\n","file_path":"src/GrainViewer/Scene.h","rank":76,"score":138902.5251753407},{"content":"\tProperties m_properties;\n\n\tstd::string m_filename;\n\n\tstd::shared_ptr<World> m_world;\n\n\tstd::shared_ptr<GlDeferredShader> m_deferredShader;\n\n\tint m_viewportCameraIndex;\n\n\tint m_occlusionCameraIndex;\n\n\tbool m_wasFreezeOcclusionCamera = false;\n\n\tstd::vector<std::shared_ptr<Camera>> m_cameras;\n\n\tstd::vector<std::shared_ptr<RuntimeObject>> m_objects;\n\n\tstd::shared_ptr<AnimationManager> m_animationManager;\n\n\tbool m_isDeferredShadingEnabled = true;\n\n\n\n\t// Framebuffer used before writing image if the output resolution is different from camera resolution\n\n\tmutable std::unique_ptr<Framebuffer> m_outputFramebuffer; // lazyly allocated in recordFrame\n\n\tint m_frameIndex = -1;\n\n\t// TODO: wrap those data into proper logic/class\n\n\tstd::vector<uint8_t> m_pixels;\n\n\tmutable std::vector<GLfloat> m_floatPixels; // for EXR screenshots\n\n\n\n\tfloat m_time;\n","file_path":"src/GrainViewer/Scene.h","rank":77,"score":138893.65462241997},{"content":"\n\n\tinline glm::mat4 viewMatrix() const { return m_uniforms.viewMatrix; }\n\n\tinline void setViewMatrix(glm::mat4 matrix) { m_uniforms.viewMatrix = matrix; } // use with caution\n\n\n\n\tinline glm::mat4 projectionMatrix() const { return m_uniforms.projectionMatrix; }\n\n\tinline void setProjectionMatrix(glm::mat4 matrix) { m_uniforms.projectionMatrix = matrix; } // use with caution\n\n\tvoid setProjectionType(ProjectionType projectionType);\n\n\n\n\tinline glm::vec2 resolution() const { return m_uniforms.resolution; }\n\n\tvoid setResolution(glm::vec2 resolution);\n\n\tinline void setResolution(int w, int h) { setResolution(glm::vec2(static_cast<float>(w), static_cast<float>(h))); }\n\n\tvoid setFreezeResolution(bool freeze);\n\n\n\n\tfloat fov() const { return m_fov; }\n\n\tfloat focalLength() const;\n\n\tvoid setFov(float fov);\n\n\n\n\tfloat nearDistance() const { return m_uniforms.uNear; }\n\n\tvoid setNearDistance(float distance);\n\n\n","file_path":"src/GrainViewer/Camera.h","rank":78,"score":138885.86192721484},{"content":"\n\n\t/**\n\n\t* Called when mouse moves and panning has started\n\n\t* x1, y1: old mouse position\n\n\t* x2, y2: new mouse position\n\n\t*/\n\n\tvirtual void updateDeltaMousePanning(float x1, float y1, float x2, float y2) {}\n\n\n\n\tvirtual void tilt(float theta) {}\n\n\n\nprivate:\n\n\t// Memory layout on GPU, matches shaders/include/uniform/camera.inc.glsl\n\n\tstruct CameraUbo {\n\n\t\tglm::mat4 viewMatrix;\n\n\t\tglm::mat4 projectionMatrix;\n\n\t\tglm::mat4 inverseViewMatrix;\n\n\t\tglm::vec2 resolution;\n\n\t\tfloat uNear = 0.001f;\n\n\t\tfloat uFar = 1000.f;\n\n\t\tfloat uLeft;\n","file_path":"src/GrainViewer/Camera.h","rank":79,"score":138885.00703478875},{"content":"\tinline void stopMousePanning() { m_isMousePanningStarted = false; }\n\n\n\n\tinline void tiltLeft() { tilt(-0.1f); }\n\n\tinline void tiltRight() { tilt(0.1f); }\n\n\n\n\tvoid updateMousePosition(float x, float y);\n\n\n\n\tvirtual void deserialize(const rapidjson::Value & json, const EnvironmentVariables & env, std::shared_ptr<AnimationManager> animations);\n\n\tvirtual std::ostream & serialize(std::ostream & out);\n\n\n\n\t/**\n\n\t * Get a framebuffer that has the same resolution as the camera, to be used\n\n\t * as intermediate step in render. Once you're done with it, release the\n\n\t * framebuffer with releaseExtraFramebuffer(). It is safe to call this\n\n\t * every frame.\n\n\t * TODO: implement a proper dynamic framebuffer pool mechanism\n\n\t */\n\n\tstd::shared_ptr<Framebuffer> getExtraFramebuffer(ExtraFramebufferOption option = ExtraFramebufferOption::Rgba32fDepth) const;\n\n\tvoid releaseExtraFramebuffer(std::shared_ptr<Framebuffer>) const;\n\n\n","file_path":"src/GrainViewer/Camera.h","rank":80,"score":138884.9571983721},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Camera.h","rank":81,"score":138884.41946057582},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Scene.h","rank":82,"score":138884.41946057582},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include <OpenGL>\n\n\n\n#include \"Camera.h\"\n\n#include \"TurntableCamera.h\"\n\n#include \"Framebuffer.h\"\n\n\n\n#include <refl.hpp>\n\n\n\n#include <memory>\n\n#include <vector>\n\n#include <string>\n\n#include <fstream>\n\n#include <sstream>\n\n\n","file_path":"src/GrainViewer/Scene.h","rank":83,"score":138879.13318322078},{"content":"\tbool m_isMouseRotationStarted, m_isMouseZoomStarted, m_isMousePanningStarted;\n\n\tbool m_isLastMouseUpToDate;\n\n\tfloat m_lastMouseX, m_lastMouseY;\n\n\n\n\tbool m_freezeResolution;\n\n\n\n\t// When resolution is freezed, this target framebuffer is allocated at the\n\n\t// fixed resolution and can be bound by the render pipeline\n\n\tstd::shared_ptr<Framebuffer> m_targetFramebuffer;\n\n\n\n\tmutable std::vector<std::shared_ptr<Framebuffer>> m_extraFramebuffers; // lazy initialized\n\n\n\n\tOutputSettings m_outputSettings;\n\n\tProjectionType m_projectionType;\n\n};\n\n\n\n#define _ ReflectionAttributes::\n\nREFL_TYPE(Camera::Properties)\n\nREFL_FIELD(viewRect)\n\nREFL_FIELD(displayInViewport)\n\nREFL_FIELD(controlInViewport)\n\nREFL_FIELD(viewLayers, _ HideInDialog())\n\nREFL_END\n\n#undef _\n","file_path":"src/GrainViewer/Camera.h","rank":84,"score":138878.51095595016},{"content":"\t};\n\n\tProperties& properties() { return m_properties; }\n\n\tconst Properties& properties() const { return m_properties; }\n\n\n\nprivate:\n\n\tvoid renderCamera(const Camera & camera) const;\n\n\tstd::shared_ptr<Camera> occlusionCamera() const;\n\n\tvoid measureStats();\n\n\t// TODO: This should be in another section of the code\n\n\tenum RecordFormat {\n\n\t\tRecordExr,\n\n\t\tRecordPng,\n\n\t};\n\n\t// Return the number of pixels in output images\n\n\tsize_t getOutputPixelCount(const Camera& camera) const;\n\n\tvoid recordFrame(const Camera & camera, const std::string & filename, RecordFormat format) const;\n\n\t// Record frame only if enabled in camera options\n\n\tvoid recordFrame(const Camera & camera) const;\n\n\n\nprivate:\n","file_path":"src/GrainViewer/Scene.h","rank":85,"score":138877.77041112236},{"content":"\t\tfloat uRight;\n\n\t\tfloat uTop;\n\n\t\tfloat uBottom;\n\n\t};\n\n\n\nprivate:\n\n\tvoid updateProjectionMatrix();\n\n\n\nprotected:\n\n\t// Core data\n\n\tProperties m_properties;\n\n\tCameraUbo m_uniforms;\n\n\tGLuint m_ubo;\n\n\n\n\t// Other data, used to build matrices but not shared with gpu\n\n\tglm::vec3 m_position;\n\n\tfloat m_fov;\n\n\tfloat m_orthographicScale;\n\n\n\n\t// Move related attributes\n","file_path":"src/GrainViewer/Camera.h","rank":86,"score":138877.6779758586},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include <OpenGL>\n\n\n\n#include \"EnvironmentVariables.h\"\n\n#include \"ViewLayerMask.h\"\n\n#include \"utils/ReflectionAttributes.h\"\n\n\n\n#include <refl.hpp>\n\n#include <rapidjson/document.h>\n\n#include <glm/glm.hpp>\n\n\n\n#include <memory>\n\n#include <string>\n\n#include <vector>\n\n\n","file_path":"src/GrainViewer/Camera.h","rank":87,"score":138873.8040856453},{"content":"\tfloat farDistance() const { return m_uniforms.uFar; }\n\n\tvoid setFarDistance(float distance);\n\n\n\n\tvoid setOrthographicScale(float orthographicScale);\n\n\tfloat orthographicScale() const { return m_orthographicScale; }\n\n\n\n\tOutputSettings & outputSettings() { return m_outputSettings; }\n\n\tconst OutputSettings & outputSettings() const { return m_outputSettings; }\n\n\n\n\tstd::shared_ptr<Framebuffer> targetFramebuffer() const { return m_targetFramebuffer; }\n\n\n\n\tinline void startMouseRotation() { m_isMouseRotationStarted = true; m_isLastMouseUpToDate = false; }\n\n\tinline void stopMouseRotation() { m_isMouseRotationStarted = false; }\n\n\n\n\tinline void startMouseZoom() { m_isMouseZoomStarted = true; m_isLastMouseUpToDate = false; }\n\n\tinline void stopMouseZoom() { m_isMouseZoomStarted = false; }\n\n\n\n\tinline void zoom(float factor) { updateDeltaMouseZoom(0, 0, 0, factor); }\n\n\t\n\n\tinline void startMousePanning() { m_isMousePanningStarted = true; m_isLastMouseUpToDate = false; }\n","file_path":"src/GrainViewer/Camera.h","rank":88,"score":138870.30256594828},{"content":"\t/**\n\n\t * Bounding circle of the projected sphere (which is an ellipsis).\n\n\t * xy is the center, z is the radius, all in pixels\n\n\t */\n\n\tglm::vec3 projectSphere(glm::vec3 center, float radius) const;\n\n\n\n\t/**\n\n\t * Convert depth value from Z-buffer to a linear depth in camera space units\n\n\t */\n\n\tfloat linearDepth(float zbufferDepth) const;\n\n\n\n\tpublic:\n\n\t\tstruct Properties {\n\n\t\t\t// xy: offset, relative to screen size\n\n\t\t\t// zw: size, relative to screen size\n\n\t\t\t// e.g. for fullscreen: (0, 0, 1, 1)\n\n\t\t\tglm::vec4 viewRect = glm::vec4(0, 0, 1, 1);\n\n\n\n\t\t\tbool displayInViewport = true;\n\n\t\t\tbool controlInViewport = true; // receive mouse input\n","file_path":"src/GrainViewer/Camera.h","rank":89,"score":138868.73597677305},{"content":"\n\n\t\t\tViewLayerMask viewLayers;\n\n\t\t};\n\n\t\tconst Properties& properties() const { return m_properties; }\n\n\t\tProperties & properties(){ return m_properties; }\n\n\n\nprotected:\n\n\t/**\n\n\t* Called when mouse moves and rotation has started\n\n\t* x1, y1: old mouse position\n\n\t* x2, y2: new mouse position\n\n\t*/\n\n\tvirtual void updateDeltaMouseRotation(float x1, float y1, float x2, float y2) {}\n\n\n\n\t/**\n\n\t* Called when mouse moves and zoom has started\n\n\t* x1, y1: old mouse position\n\n\t* x2, y2: new mouse position\n\n\t*/\n\n\tvirtual void updateDeltaMouseZoom(float x1, float y1, float x2, float y2) {}\n","file_path":"src/GrainViewer/Camera.h","rank":90,"score":138861.70679097873},{"content":"/**\n\n * This file is part of GrainViewer, the reference implementation of:\n\n *\n\n * Michel, Élie and Boubekeur, Tamy (2020).\n\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\n\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\n\n * https://doi.org/10.1111/cgf.14135\n\n *\n\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\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\n\n * deal in the Software without restriction, including without limitation the\n\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n\n * sell 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","file_path":"src/GrainViewer/Shader.h","rank":91,"score":138792.6070980899},{"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 and non-infringement. 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\n\n * from, out of or in connection with the software or the use or other dealings\n\n * in the Software.\n\n */\n\n\n\n#pragma once\n\n\n\n#include <OpenGL>\n\n\n\n#ifndef NDEBUG\n\n#include \"ShaderPreprocessor.h\"\n\n#endif\n\n\n\n#include <glm/glm.hpp>\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <set>\n\n#include <map>\n\n#include <memory>\n\n\n\n/**\n\n * Utility class providing an OO API to OpenGL shaders\n\n */\n","file_path":"src/GrainViewer/Shader.h","rank":92,"score":138786.57811784322},{"content":" */\n\n bool check(const std::string & name = \"shader\") const;\n\n\n\n inline GLuint shaderId() const { return m_shaderId; }\n\n\n\nprivate:\n\n GLuint m_shaderId;\n\n\n\n#ifndef NDEBUG\n\n\t// Keep shader source\n\n\tShaderPreprocessor m_preprocessor;\n\n#endif\n\n};\n","file_path":"src/GrainViewer/Shader.h","rank":93,"score":138776.5338371446},{"content":"struct has_from_json : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename T>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":94,"score":137142.5560099402},{"content":"struct has_to_json : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename T>\n","file_path":"src/External/tinygltf/include/json.hpp","rank":95,"score":137142.5560099402},{"content":"struct DialogFactory {\n\n\tstatic std::shared_ptr<Dialog> MakeShared() { return std::make_shared<Dialog>(); }\n\n};\n\n\n\n#define registerDialogForBehavior(DialogType, BehaviorType) \\\n\ntemplate<> \\\n","file_path":"src/GrainViewer/Ui/Dialog.h","rank":96,"score":136258.85929862515},{"content":"class ShaderProgram {\n\npublic:\n\n\tenum ShaderProgramType {\n\n\t\tRenderShader,\n\n\t\tComputeShader,\n\n\t};\n\npublic:\n\n\tShaderProgram(const std::string& shaderName = \"\");\n\n\t~ShaderProgram();\n\n\tShaderProgram(ShaderProgram&) = delete;\n\n\tShaderProgram& operator=(ShaderProgram&) = delete;\n\n\tShaderProgram(ShaderProgram&&) = default;\n\n\tShaderProgram& operator=(ShaderProgram&&) = default;\n\n\n\n\t/**\n\n\t * NB: Changing shader name does not reload it. You may want to call load() then.\n\n\t */\n\n\tinline void setShaderName(const std::string& shaderName) { m_shaderName = shaderName; }\n\n\tinline const std::string& shaderName() const { return m_shaderName; }\n\n\n","file_path":"src/GrainViewer/ShaderProgram.h","rank":97,"score":136226.9344083893},{"content":"class ShaderPool {\n\npublic:\n\n\tstatic void AddShader(\n\n\t\tconst std::string& shaderName,\n\n\t\tconst std::string& baseFile,\n\n\t\tShaderProgram::ShaderProgramType type = ShaderProgram::RenderShader,\n\n\t\tconst std::vector<std::string>& defines = {},\n\n\t\tconst std::map<std::string, std::string> & snippets = {});\n\n\n\n\t/**\n\n\t * Copy a base shader and add an extra define. If the define is already\n\n\t * activated in the original shader, this creates an alias pointing to the\n\n\t * previous shader, not a deep copy. This has no effect if there is no\n\n\t * shader called baseShaderName.\n\n\t */\n\n\tstatic void AddShaderVariant(\n\n\t\tconst std::string & shaderName,\n\n\t\tconst std::string & baseShaderName,\n\n\t\tconst std::string & define);\n\n\n","file_path":"src/GrainViewer/ShaderPool.h","rank":98,"score":136226.9344083893},{"content":"class ShaderPreprocessor {\n\npublic:\n\n\t/**\n\n\t * Load a shader from a file, and reccursively include #include'd files\n\n\t * You can specity a list of defines to #define where ever\n\n\t * `#include \"sys:defines\"` is found in the shader.\n\n\t */\n\n\tbool load(const std::string & filename, const std::vector<std::string> & defines = {}, const std::map<std::string, std::string> & snippets = {});\n\n\n\n\t/**\n\n\t * Return a buffer to the pure GLSL source, post-preprocessing, to be fed into\n\n\t * glShaderSource.\n\n\t */\n\n\tvoid source(std::vector<GLchar> & buf) const;\n\n\n\n\t/**\n\n\t * Log a traceback corresponding to the line `line` in the processed source.\n\n\t */\n\n\tvoid logTraceback(size_t line) const;\n\n\n\nprivate:\n\n\tstd::vector<std::string> m_lines;\n\n\n\nprivate:\n\n\tstatic bool loadShaderSourceAux(const std::string & filename, const std::vector<std::string> & defines, const std::map<std::string, std::string> & snippets, std::vector<std::string> & lines_accumulator);\n\n};\n\n\n","file_path":"src/GrainViewer/ShaderPreprocessor.h","rank":99,"score":136226.9344083893}],"string":"[\n {\n \"content\": \"class DeferredShadingDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid drawHandles(float x, float y, float w, float h) override;\\n\\n\\tvoid setController(std::weak_ptr<GlDeferredShader> shading) { m_cont = shading; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<GlDeferredShader> m_cont;\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.h\",\n \"rank\": 0,\n \"score\": 250529.7370123773\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include \\\"Dialog.h\\\"\\n\\n#include \\\"GlDeferredShader.h\\\"\\n\\n\\n\\n#include <memory>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.h\",\n \"rank\": 1,\n \"score\": 209794.68330255308\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.h\",\n \"rank\": 2,\n \"score\": 209792.60358511625\n },\n {\n \"content\": \"class GlDeferredShader;\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 3,\n \"score\": 209646.06110032668\n },\n {\n \"content\": \"class SceneDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setController(std::weak_ptr<Scene> scene) { m_cont = scene; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<Scene> m_cont;\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Ui/SceneDialog.h\",\n \"rank\": 4,\n \"score\": 209115.00366870622\n },\n {\n \"content\": \"class Window;\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Gui.h\",\n \"rank\": 5,\n \"score\": 207104.15554968888\n },\n {\n \"content\": \"class Scene;\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Gui.h\",\n \"rank\": 6,\n \"score\": 207016.34915488012\n },\n {\n \"content\": \"class Dialog;\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <memory>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Gui.h\",\n \"rank\": 7,\n \"score\": 206854.80552042165\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/External/tinygltf/include/json.hpp\",\n \"rank\": 8,\n \"score\": 203812.99383772598\n },\n {\n \"content\": \"{\\n\\n\\tif (auto cont = m_cont.lock()) {\\n\\n\\t\\tif (ImGui::CollapsingHeader(\\\"Deferred Shading\\\", ImGuiTreeNodeFlags_DefaultOpen)) {\\n\\n\\t\\t\\tGlDeferredShader::Properties & props = cont->properties();\\n\\n\\n\\n\\t\\t\\tautoUi(props);\\n\\n\\t\\t\\tImGui::Text(\\\"Shadow Map Bias: %f\\\", props.ShadowMapBias());\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid DeferredShadingDialog::drawHandles(float x, float y, float w, float h)\\n\\n{\\n\\n\\tif (auto cont = m_cont.lock()) {\\n\\n\\t\\tGlDeferredShader::Properties & props = cont->properties();\\n\\n\\n\\n\\t\\tif (props.showSampleCount) {\\n\\n\\t\\t\\tImGui::SetNextWindowPos(ImVec2(x, y + h - 60));\\n\\n\\t\\t\\tImGui::SetNextWindowSize(ImVec2(540, 60));\\n\\n\\t\\t\\tImGui::Begin(\\\"DeferredShadingDialog Handle\\\", nullptr,\\n\",\n \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.cpp\",\n \"rank\": 9,\n \"score\": 202421.22076512894\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#include \\\"DeferredShadingDialog.h\\\"\\n\\n#include \\\"utils/guiutils.h\\\"\\n\\n#include \\\"utils/behaviorutils.h\\\"\\n\\n#include \\\"GlTexture.h\\\"\\n\\n\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\n#include <limits>\\n\\n#include <imgui.h>\\n\\n\\n\\nvoid DeferredShadingDialog::draw()\\n\",\n \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.cpp\",\n \"rank\": 10,\n \"score\": 202414.80137244772\n },\n {\n \"content\": \"\\t\\t\\t\\tImGuiWindowFlags_NoResize |\\n\\n\\t\\t\\t\\tImGuiWindowFlags_NoMove |\\n\\n\\t\\t\\t\\tImGuiWindowFlags_NoCollapse |\\n\\n\\t\\t\\t\\tImGuiWindowFlags_NoTitleBar);\\n\\n\\t\\t\\t\\n\\n\\t\\t\\tif (cont->hasColorMap()) {\\n\\n\\t\\t\\t\\tconst float spacing = ImGui::GetStyle().ItemSpacing.x;\\n\\n\\n\\n\\t\\t\\t\\tGLuint tex = cont->colormap().raw();\\n\\n\\t\\t\\t\\tImGui::Image((void*)(intptr_t)tex, ImVec2(540 - 2 * spacing, 20));\\n\\n\\t\\t\\t\\tImGui::Text(\\\"0\\\");\\n\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tstatic float inputWidth = 30.0f;\\n\\n\\t\\t\\t\\tImGui::SameLine(ImGui::GetWindowWidth() - spacing - inputWidth);\\n\\n\\t\\t\\t\\tImGui::PushItemWidth(inputWidth);\\n\\n\\t\\t\\t\\tImGui::InputFloat(\\\"##maxSampleCount\\\", &props.maxSampleCount, 0, 0, \\\"%.0f\\\");\\n\\n\\t\\t\\t\\tinputWidth = ImGui::GetItemRectSize().x;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tImGui::End();\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.cpp\",\n \"rank\": 11,\n \"score\": 202409.96164780163\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Ui/DeferredShadingDialog.cpp\",\n \"rank\": 12,\n \"score\": 202407.67311384843\n },\n {\n \"content\": \"class Window;\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <memory>\\n\\n\\n\\n/**\\n\\n * Gui for tests, displaying a progress bar and some debug info\\n\\n */\\n\",\n \"file_path\": \"src/GrainViewer/Ui/TestGui.h\",\n \"rank\": 13,\n \"score\": 200788.8140703006\n },\n {\n \"content\": \"struct underlying_type<T, true> : std::underlying_type<std::decay_t<T>> {};\\n\\n\\n\\ntemplate <typename E, bool = is_enum_v<E>>\\n\",\n \"file_path\": \"src/External/refl-cpp/include/magic_enum.hpp\",\n \"rank\": 14,\n \"score\": 187948.61908053723\n },\n {\n \"content\": \"class GlDeferredShader {\\n\\npublic:\\n\\n\\tenum ShadingMode {\\n\\n\\t\\tBeautyPass,\\n\\n\\t\\tNormalPass,\\n\\n\\t\\tBaseColorPass,\\n\\n\\t\\tMetallicPass,\\n\\n\\t\\tRoughnessPass,\\n\\n\\t\\tWorldPositionPass,\\n\\n\\t\\tDepthPass,\\n\\n\\t\\tRawGBuffer0,\\n\\n\\t\\tRawGBuffer1,\\n\\n\\t\\tRawGBuffer2,\\n\\n\\t};\\n\\n\\tstruct Properties {\\n\\n\\t\\tShadingMode shadingMode = BeautyPass;\\n\\n\\t\\tbool transparentFilm = false;\\n\\n\\t\\tbool showSampleCount = false;\\n\\n\\t\\tfloat maxSampleCount = 10;\\n\\n\\t\\tbool debugVectors = false;\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 15,\n \"score\": 181480.2010682164\n },\n {\n \"content\": \" stbi_io_callbacks io;\\n\",\n \"file_path\": \"src/External/tinygltf/include/stb_image.h\",\n \"rank\": 16,\n \"score\": 181177.0912757329\n },\n {\n \"content\": \" stbi__uint32 type;\\n\",\n \"file_path\": \"src/External/tinygltf/include/stb_image.h\",\n \"rank\": 17,\n \"score\": 181064.29677016204\n },\n {\n \"content\": \"class Camera {\\n\\npublic:\\n\\n\\tenum ProjectionType {\\n\\n\\t\\tPerspectiveProjection,\\n\\n\\t\\tOrthographicProjection,\\n\\n\\t};\\n\\n\\tstruct OutputSettings {\\n\\n\\t\\tbool autoOutputResolution = true;\\n\\n\\t\\tint width;\\n\\n\\t\\tint height;\\n\\n\\t\\tstd::string outputFrameBase;\\n\\n\\t\\tbool isRecordEnabled = false;\\n\\n\\t\\tbool saveOnDisc = true; // if false, get pixel data from gpu but don't actually write them to disc. They can be used to measure stats\\n\\n\\t};\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 18,\n \"score\": 179478.70305060587\n },\n {\n \"content\": \"class Scene {\\n\\npublic:\\n\\n\\tScene();\\n\\n\\n\\n\\tbool load(const std::string & filename);\\n\\n\\tconst std::string & filename() const { return m_filename; }\\n\\n\\n\\n\\tvoid setResolution(int width, int height);\\n\\n\\t\\n\\n\\tvoid reloadShaders();\\n\\n\\tvoid update(float time);\\n\\n\\tvoid render() const;\\n\\n\\tvoid onPostRender(float time);\\n\\n\\n\\n\\t// Clear scene\\n\\n\\tvoid clear();\\n\\n\\n\\n\\tstd::shared_ptr<Camera> viewportCamera() const;\\n\\n\\tinline const std::vector<std::shared_ptr<RuntimeObject>> & objects() const { return m_objects; }\\n\\n\\tinline const std::vector<std::shared_ptr<Camera>>& cameras() const { return m_cameras; }\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 19,\n \"score\": 179478.70305060587\n },\n {\n \"content\": \"class Shader {\\n\\npublic:\\n\\n Shader(GLenum shaderType = 0);\\n\\n ~Shader();\\n\\n\\n\\n /**\\n\\n * Load file into the shader\\n\\n * @param filename Shader file\\n\\n */\\n\\n bool load(const std::string &filename, const std::vector<std::string> & defines = {}, const std::map<std::string, std::string> & snippets = {});\\n\\n\\n\\n /**\\n\\n * Compile the shader\\n\\n */\\n\\n inline void compile() { glCompileShader(m_shaderId); }\\n\\n\\n\\n /**\\n\\n * Check that the shader has been successfully compiled\\n\\n * @param name Name displayed in error message\\n\\n * @param success status\\n\",\n \"file_path\": \"src/GrainViewer/Shader.h\",\n \"rank\": 20,\n \"score\": 179385.88006071266\n },\n {\n \"content\": \"class Window {\\n\\npublic:\\n\\n\\tWindow(int width, int height, const char *title);\\n\\n\\t~Window();\\n\\n\\n\\n\\t/**\\n\\n\\t * @return the raw GLFWwindow object, or nullptr if initialization failed.\\n\\n\\t */\\n\\n\\tGLFWwindow *glfw() const;\\n\\n\\n\\n\\t/**\\n\\n\\t * @return true iff window has correctly been initialized\\n\\n\\t */\\n\\n\\tbool isValid() const;\\n\\n\\n\\n\\tvoid pollEvents() const;\\n\\n\\tvoid swapBuffers() const;\\n\\n\\tbool shouldClose() const;\\n\\n\\n\\nprivate:\\n\\n\\tGLFWwindow *m_window = nullptr;\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Window.h\",\n \"rank\": 21,\n \"score\": 174881.95420636336\n },\n {\n \"content\": \"class Gui {\\n\\npublic:\\n\\n\\t// For tools that don't use the main Gui\\n\\n\\tstatic void Init(const Window & window);\\n\\n\\tstatic void NewFrame();\\n\\n\\tstatic void DrawFrame();\\n\\n\\tstatic void Shutdown();\\n\\npublic:\\n\\n\\tGui(std::shared_ptr<Window> window);\\n\\n\\t~Gui();\\n\\n\\n\\n\\tvoid setScene(std::shared_ptr<Scene> scene);\\n\\n\\n\\n\\t// Call these resp. before and after loading the scene\\n\\n\\tvoid beforeLoading();\\n\\n\\tvoid afterLoading();\\n\\n\\n\\n\\tvoid update();\\n\\n\\tvoid render();\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Gui.h\",\n \"rank\": 22,\n \"score\": 174798.8067738239\n },\n {\n \"content\": \"class Dialog {\\n\\npublic:\\n\\n\\t/**\\n\\n\\t * Draw panel (in right-hand side bar).\\n\\n\\t */\\n\\n\\tvirtual void draw() {}\\n\\n\\n\\n\\t/**\\n\\n\\t * Draw on top of 3D render\\n\\n\\t * x, y, w, h is the viewport rect\\n\\n\\t */\\n\\n\\tvirtual void drawHandles(float x, float y, float w, float h) {}\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Dialog.h\",\n \"rank\": 23,\n \"score\": 174591.76059389743\n },\n {\n \"content\": \"\\t\\tfloat debugVectorsScale = 0.1f;\\n\\n\\t\\tfloat debugVectorsGrid = 20.0f;\\n\\n\\t\\tfloat shadowMapBiasBase = 0.1f;\\n\\n\\t\\tint shadowMapBiasExponent = -5;\\n\\n\\n\\n\\t\\tfloat ShadowMapBias() const;\\n\\n\\t};\\n\\npublic:\\n\\n\\tGlDeferredShader();\\n\\n\\t~GlDeferredShader();\\n\\n\\n\\n\\tvoid bindFramebuffer(const Camera& camera) const;\\n\\n\\n\\n\\tbool deserialize(const rapidjson::Value & json);\\n\\n\\tvoid reloadShaders();\\n\\n\\tvoid update(float time);\\n\\n\\n\\n\\tvoid render(const Camera & camera, const World & world, RenderType target) const;\\n\\n\\n\\n\\tProperties & properties() { return m_properties; }\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 24,\n \"score\": 172989.04525076345\n },\n {\n \"content\": \"\\tconst Properties & properties() const { return m_properties; }\\n\\n\\n\\n\\tbool hasColorMap() const { return m_colormap != nullptr; }\\n\\n\\t// Use only if hasColorMap is truc\\n\\n\\tconst GlTexture & colormap() const { return *m_colormap; }\\n\\n\\n\\n\\tvoid setBlitOffset(GLint x, GLint y) { m_blitOffset = glm::vec2(static_cast<float>(x), static_cast<float>(y)); }\\n\\n\\n\\nprivate:\\n\\n\\tProperties m_properties;\\n\\n\\tShaderProgram m_shader, m_debugShader;\\n\\n\\tGLuint m_vao;\\n\\n\\tstd::unique_ptr<GlTexture> m_colormap; // colormap used as ramp for outputting debug images\\n\\n\\tglm::vec2 m_blitOffset = glm::vec2(0.0f); // offset when writing to output framebuffer\\n\\n};\\n\\n\\n\\n#define _ ReflectionAttributes::\\n\\nREFL_TYPE(GlDeferredShader::Properties)\\n\\nREFL_FIELD(shadingMode)\\n\\nREFL_FIELD(transparentFilm)\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 25,\n \"score\": 172987.57054615513\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 26,\n \"score\": 172979.9455604596\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include \\\"ShaderProgram.h\\\"\\n\\n#include \\\"Framebuffer.h\\\"\\n\\n#include \\\"Camera.h\\\"\\n\\n#include \\\"World.h\\\"\\n\\n#include \\\"RenderType.h\\\"\\n\\n#include \\\"utils/ReflectionAttributes.h\\\"\\n\\n\\n\\n#include <glm/glm.hpp>\\n\\n#include <rapidjson/document.h>\\n\\n#include <refl.hpp>\\n\\n\\n\\n#include <vector>\\n\\n#include <memory>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 27,\n \"score\": 172979.28813583872\n },\n {\n \"content\": \"REFL_FIELD(showSampleCount)\\n\\nREFL_FIELD(maxSampleCount, _ HideInDialog())\\n\\nREFL_FIELD(debugVectors)\\n\\nREFL_FIELD(debugVectorsScale, _ Range(0, 2))\\n\\nREFL_FIELD(debugVectorsGrid, _ Range(0, 40))\\n\\nREFL_FIELD(shadowMapBiasBase)\\n\\nREFL_FIELD(shadowMapBiasExponent, _ Range(-8, 2))\\n\\nREFL_END\\n\\n#undef _\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 28,\n \"score\": 172960.59679267445\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Ui/SceneDialog.h\",\n \"rank\": 29,\n \"score\": 172940.61734253404\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include \\\"Dialog.h\\\"\\n\\n#include \\\"Scene.h\\\"\\n\\n\\n\\n#include <memory>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Ui/SceneDialog.h\",\n \"rank\": 30,\n \"score\": 172939.12680145647\n },\n {\n \"content\": \"struct is_scoped_enum<T, true> : std::bool_constant<!std::is_convertible_v<T, std::underlying_type_t<T>>> {};\\n\\n\\n\\ntemplate <typename T, bool = std::is_enum_v<T>>\\n\",\n \"file_path\": \"src/External/refl-cpp/include/magic_enum.hpp\",\n \"rank\": 31,\n \"score\": 170124.9516092033\n },\n {\n \"content\": \"struct is_unscoped_enum<T, true> : std::bool_constant<std::is_convertible_v<T, std::underlying_type_t<T>>> {};\\n\\n\\n\\ntemplate <typename T, bool = std::is_enum_v<std::decay_t<T>>>\\n\",\n \"file_path\": \"src/External/refl-cpp/include/magic_enum.hpp\",\n \"rank\": 32,\n \"score\": 170124.9516092033\n },\n {\n \"content\": \"class GrainBehaviorDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<GrainBehavior> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<GrainBehavior> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(GrainBehaviorDialog, GrainBehavior)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/GrainBehaviorDialog.h\",\n \"rank\": 33,\n \"score\": 169898.25240448213\n },\n {\n \"content\": \"struct DialogFactory<BehaviorType> { \\\\\\n\\n\\tstatic std::shared_ptr<DialogType> MakeShared() { return std::make_shared<DialogType>(); } \\\\\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Dialog.h\",\n \"rank\": 34,\n \"score\": 168321.16975719662\n },\n {\n \"content\": \"\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\nvoid GlDeferredShader::bindFramebuffer(const Camera& camera) const\\n\\n{\\n\\n\\tauto fbo = camera.getExtraFramebuffer(Camera::ExtraFramebufferOption::GBufferDepth);\\n\\n\\tfbo->bind();\\n\\n}\\n\\n\\n\\nvoid GlDeferredShader::reloadShaders()\\n\\n{\\n\\n\\tm_shader.load();\\n\\n\\tm_debugShader.load();\\n\\n}\\n\\n\\n\\nvoid GlDeferredShader::update(float time)\\n\\n{\\n\\n\\tm_shader.setUniform(\\\"uTime\\\", static_cast<GLfloat>(time));\\n\\n\\tm_debugShader.setUniform(\\\"uTime\\\", static_cast<GLfloat>(time));\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 35,\n \"score\": 166686.14758300834\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid GlDeferredShader::render(const Camera & camera, const World & world, RenderType target) const\\n\\n{\\n\\n\\tauto fbo = camera.getExtraFramebuffer(Camera::ExtraFramebufferOption::GBufferDepth);\\n\\n\\n\\n\\tglClearColor(0.2f, 0.3f, 0.3f, 1.0f);\\n\\n\\t//glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\\n\\n\\tglDepthMask(GL_TRUE);\\n\\n\\tglDisable(GL_DEPTH_TEST);\\n\\n\\tglDisable(GL_BLEND);\\n\\n\\n\\n\\tconst ShaderProgram& shader = properties().debugVectors ? m_debugShader : m_shader;\\n\\n\\n\\n\\tshader.bindUniformBlock(\\\"Camera\\\", camera.ubo());\\n\\n\\n\\n\\tshader.setUniform(\\\"uBlitOffset\\\", m_blitOffset);\\n\\n\\n\\n\\tGLint o = 0;\\n\\n\\tfor (int i = 0; i < fbo->colorTextureCount(); ++i) {\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 36,\n \"score\": 166672.000150556\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 37,\n \"score\": 166668.84289122792\n },\n {\n \"content\": \"\\t\\tshader.setUniform(MAKE_STR(\\\"gbuffer\\\" << i), o);\\n\\n\\t\\tglBindTextureUnit(static_cast<GLuint>(o), fbo->colorTexture(i));\\n\\n\\t\\t++o;\\n\\n\\t}\\n\\n\\n\\n\\tshader.setUniform(\\\"in_depth\\\", o);\\n\\n\\tglBindTextureUnit(static_cast<GLuint>(o), fbo->depthTexture());\\n\\n\\t++o;\\n\\n\\n\\n\\t// TODO: Use UBO, move to World\\n\\n\\tauto lights = world.lights();\\n\\n\\tfor (size_t k = 0; k < lights.size(); ++k) {\\n\\n\\t\\tstd::string prefix = MAKE_STR(\\\"light[\\\" << k << \\\"].\\\");\\n\\n\\t\\tshader.setUniform(prefix + \\\"position_ws\\\", lights[k]->position());\\n\\n\\t\\tshader.setUniform(prefix + \\\"color\\\", lights[k]->color());\\n\\n\\t\\tshader.setUniform(prefix + \\\"matrix\\\", lights[k]->shadowMap().camera().projectionMatrix() * lights[k]->shadowMap().camera().viewMatrix());\\n\\n\\t\\tshader.setUniform(prefix + \\\"isRich\\\", lights[k]->isRich() ? 1 : 0);\\n\\n\\t\\tshader.setUniform(prefix + \\\"hasShadowMap\\\", lights[k]->hasShadowMap() ? 1 : 0);\\n\\n\\t\\tshader.setUniform(prefix + \\\"shadowMap\\\", o);\\n\\n\\t\\tglBindTextureUnit(static_cast<GLuint>(o), lights[k]->shadowMap().depthTexture());\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 38,\n \"score\": 166667.82583581816\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#include \\\"Logger.h\\\"\\n\\n#include \\\"GlDeferredShader.h\\\"\\n\\n#include \\\"Light.h\\\"\\n\\n#include \\\"ShadowMap.h\\\"\\n\\n#include \\\"ResourceManager.h\\\"\\n\\n#include \\\"GlTexture.h\\\"\\n\\n#include \\\"utils/strutils.h\\\"\\n\\n#include \\\"utils/jsonutils.h\\\"\\n\\n#include \\\"utils/behaviorutils.h\\\"\\n\\n#include \\\"Framebuffer.h\\\"\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 39,\n \"score\": 166665.28646380216\n },\n {\n \"content\": \"bool GlDeferredShader::deserialize(const rapidjson::Value & json)\\n\\n{\\n\\n\\tif (!json.IsObject()) return false;\\n\\n\\n\\n\\tstd::vector<std::string> defines;\\n\\n\\tif (jrOption(json, \\\"defines\\\", defines)) {\\n\\n\\t\\tfor (const auto& def : defines) {\\n\\n\\t\\t\\tm_shader.define(def);\\n\\n\\t\\t\\tm_debugShader.define(def);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tm_debugShader.define(\\\"DEBUG_VECTORS\\\");\\n\\n\\n\\n\\tstd::string colormapFilename;\\n\\n\\tif (jrOption(json, \\\"colormap\\\", colormapFilename)) {\\n\\n\\t\\tm_colormap = ResourceManager::loadTexture(colormapFilename);\\n\\n\\t\\tm_colormap->setWrapMode(GL_CLAMP_TO_EDGE);\\n\\n\\t}\\n\\n\\n\\n\\tautoDeserialize(json, m_properties);\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 40,\n \"score\": 166664.32596965984\n },\n {\n \"content\": \"#include <vector>\\n\\n#include <sstream>\\n\\n\\n\\nfloat GlDeferredShader::Properties::ShadowMapBias() const\\n\\n{\\n\\n\\treturn shadowMapBiasBase * static_cast<float>(pow(10, shadowMapBiasExponent));\\n\\n}\\n\\n\\n\\nGlDeferredShader::GlDeferredShader()\\n\\n\\t: m_shader(\\\"deferred-shader\\\")\\n\\n\\t, m_debugShader(\\\"deferred-shader\\\")\\n\\n{\\n\\n\\tglCreateVertexArrays(1, &m_vao);\\n\\n}\\n\\n\\n\\nGlDeferredShader::~GlDeferredShader()\\n\\n{\\n\\n\\tglDeleteVertexArrays(1, &m_vao);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 41,\n \"score\": 166663.19505028406\n },\n {\n \"content\": \"\\t\\t++o;\\n\\n\\t\\tif (lights[k]->isRich()) {\\n\\n\\t\\t\\tshader.setUniform(prefix + \\\"richShadowMap\\\", o);\\n\\n\\t\\t\\tglBindTextureUnit(static_cast<GLuint>(o), lights[k]->shadowMap().colorTexture(0));\\n\\n\\t\\t\\t++o;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tshader.setUniform(\\\"uIsShadowMapEnabled\\\", world.isShadowMapEnabled());\\n\\n\\n\\n\\tautoSetUniforms(shader, m_properties);\\n\\n\\tshader.setUniform(\\\"uShadowMapBias\\\", m_properties.ShadowMapBias());\\n\\n\\n\\n\\tshader.setUniform(\\\"uHasColormap\\\", static_cast<bool>(m_colormap));\\n\\n\\tif (m_colormap) {\\n\\n\\t\\tshader.setUniform(\\\"uColormap\\\", static_cast<GLint>(o));\\n\\n\\t\\tm_colormap->bind(static_cast<GLuint>(o));\\n\\n\\t\\t++o;\\n\\n\\t}\\n\\n\\n\\n\\tshader.use();\\n\\n\\tglBindVertexArray(m_vao);\\n\\n\\tglDrawArrays(GL_POINTS, 0, 1);\\n\\n\\tglBindVertexArray(0);\\n\\n}\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.cpp\",\n \"rank\": 42,\n \"score\": 166658.97114598923\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#include \\\"SceneDialog.h\\\"\\n\\n#include \\\"Light.h\\\"\\n\\n#include \\\"utils/guiutils.h\\\"\\n\\n#include \\\"utils/behaviorutils.h\\\"\\n\\n\\n\\n#include <imgui.h>\\n\\n#include <glm/gtc/type_ptr.hpp>\\n\\n\\n\\nvoid SceneDialog::draw()\\n\\n{\\n\\n\\tif (auto cont = m_cont.lock()) {\\n\",\n \"file_path\": \"src/GrainViewer/Ui/SceneDialog.cpp\",\n \"rank\": 43,\n \"score\": 166636.71822644307\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Ui/SceneDialog.cpp\",\n \"rank\": 44,\n \"score\": 166630.94977337035\n },\n {\n \"content\": \"\\t\\tif (ImGui::CollapsingHeader(\\\"Scene\\\", ImGuiTreeNodeFlags_DefaultOpen)) {\\n\\n\\t\\t\\tif (ImGui::Button(\\\"Take Screenshot\\\")) {\\n\\n\\t\\t\\t\\tcont->takeScreenshot();\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tif (cont->isPaused()) {\\n\\n\\t\\t\\t\\tif (ImGui::Button(\\\"Play\\\")) {\\n\\n\\t\\t\\t\\t\\tcont->play();\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tif (ImGui::Button(\\\"Pause\\\")) {\\n\\n\\t\\t\\t\\t\\tcont->pause();\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tautoUi(cont->properties());\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/GrainViewer/Ui/SceneDialog.cpp\",\n \"rank\": 45,\n \"score\": 166630.41586401346\n },\n {\n \"content\": \"class ImpostorGrainRendererDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<ImpostorGrainRenderer> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<ImpostorGrainRenderer> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(ImpostorGrainRendererDialog, ImpostorGrainRenderer)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/ImpostorGrainRendererDialog.h\",\n \"rank\": 46,\n \"score\": 164493.0947507245\n },\n {\n \"content\": \"class InstanceGrainRendererDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<InstanceGrainRenderer> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<InstanceGrainRenderer> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(InstanceGrainRendererDialog, InstanceGrainRenderer)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/InstanceGrainRendererDialog.h\",\n \"rank\": 47,\n \"score\": 164493.09475072453\n },\n {\n \"content\": \"class FarGrainRendererDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<FarGrainRenderer> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<FarGrainRenderer> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(FarGrainRendererDialog, FarGrainRenderer)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/FarGrainRendererDialog.h\",\n \"rank\": 48,\n \"score\": 164493.0947507245\n },\n {\n \"content\": \"class GlTexture;\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/GlDeferredShader.h\",\n \"rank\": 49,\n \"score\": 160774.8606524287\n },\n {\n \"content\": \"class TurntableCamera : public Camera {\\n\\npublic:\\n\\n\\tTurntableCamera();\\n\\n\\n\\n\\tvoid update(float time) override {}\\n\\n\\n\\n\\tvoid deserialize(const rapidjson::Value& json, const EnvironmentVariables& env, std::shared_ptr<AnimationManager> animations) override;\\n\\n\\tstd::ostream& serialize(std::ostream& out) override;\\n\\n\\n\\nprotected:\\n\\n\\tvoid updateDeltaMouseRotation(float x1, float y1, float x2, float y2) override;\\n\\n\\tvoid updateDeltaMouseZoom(float x1, float y1, float x2, float y2) override;\\n\\n\\tvoid updateDeltaMousePanning(float x1, float y1, float x2, float y2) override;\\n\\n\\tvoid tilt(float theta);\\n\\n\\n\\nprivate:\\n\\n\\t/**\\n\\n\\t* Construct view matrix given quat, center and zoom\\n\\n\\t*/\\n\\n\\tvoid updateViewMatrix();\\n\\n\\n\\nprivate:\\n\\n\\tglm::vec3 m_center;\\n\\n\\tglm::quat m_quat;\\n\\n\\tfloat m_zoom;\\n\\n\\tfloat m_sensitivity; // relative to screen size\\n\\n\\tfloat m_zoomSensitivity;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/TurntableCamera.h\",\n \"rank\": 50,\n \"score\": 160737.13590302636\n },\n {\n \"content\": \"class WorldDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setController(std::weak_ptr<World> world) { m_cont = world; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<World> m_cont;\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Ui/WorldDialog.h\",\n \"rank\": 51,\n \"score\": 157119.01909388174\n },\n {\n \"content\": \"class TransformDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<TransformBehavior> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<TransformBehavior> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(TransformDialog, TransformBehavior)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/TransformDialog.h\",\n \"rank\": 52,\n \"score\": 157119.01909388174\n },\n {\n \"content\": \"struct enum_traits<E, true> {\\n\\n using type = E;\\n\\n using underlying_type = typename detail::underlying_type<E>::type;\\n\\n\\n\\n inline static constexpr std::string_view type_name = detail::type_name_v<E>;\\n\\n\\n\\n inline static constexpr bool is_unscoped = detail::is_unscoped_enum<E>::value;\\n\\n inline static constexpr bool is_scoped = detail::is_scoped_enum<E>::value;\\n\\n inline static constexpr bool is_dense = detail::range_size_v<E> == detail::count_v<E>;\\n\\n inline static constexpr bool is_sparse = detail::range_size_v<E> != detail::count_v<E>;\\n\\n\\n\\n inline static constexpr std::size_t count = detail::count_v<E>;\\n\\n inline static constexpr std::array<E, count> values = detail::values_v<E>;\\n\\n inline static constexpr std::array<std::string_view, count> names = detail::names<E>(std::make_index_sequence<count_v<E>>{});\\n\\n inline static constexpr std::array<std::pair<E, std::string_view>, count> entries = detail::entries<E>(std::make_index_sequence<count_v<E>>{});\\n\\n\\n\\n [[nodiscard]] static constexpr bool reflected(E value) noexcept {\\n\\n return reflected(static_cast<U>(value));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/External/refl-cpp/include/magic_enum.hpp\",\n \"rank\": 53,\n \"score\": 156495.00777940036\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 54,\n \"score\": 152025.6246818939\n },\n {\n \"content\": \"class LightGizmoDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<LightGizmo> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<LightGizmo> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(LightGizmoDialog, LightGizmo)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/LightGizmoDialog.h\",\n \"rank\": 55,\n \"score\": 150749.98916862626\n },\n {\n \"content\": \"class MeshRendererDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<MeshRenderer> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<MeshRenderer> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(MeshRendererDialog, MeshRenderer)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/MeshRendererDialog.h\",\n \"rank\": 56,\n \"score\": 150749.98916862626\n },\n {\n \"content\": \"class GlobalTimerDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setController(std::weak_ptr<GlobalTimer> timer) { m_cont = timer; }\\n\\n\\tvoid drawHandles(float x, float y, float w, float h);\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<GlobalTimer> m_cont;\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Ui/GlobalTimerDialog.h\",\n \"rank\": 57,\n \"score\": 150749.98916862626\n },\n {\n \"content\": \" int x,y,w2,h2;\\n\",\n \"file_path\": \"src/External/tinygltf/include/stb_image.h\",\n \"rank\": 58,\n \"score\": 146951.81384128655\n },\n {\n \"content\": \"struct is_complete_type : std::false_type {};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 59,\n \"score\": 146934.0665825149\n },\n {\n \"content\": \"enum class RenderType\\n\\n{\\n\\n\\t/**\\n\\n\\t * Direct rendering, without deferred shading\\n\\n\\t */\\n\\n\\tDirect,\\n\\n\\n\\n\\t/**\\n\\n\\t * Default render type (deferred shading)\\n\\n\\t */\\n\\n\\tDefault,\\n\\n\\n\\n\\t/**\\n\\n\\t * Shadow map rendering, only depth matters\\n\\n\\t */\\n\\n\\tShadowMap,\\n\",\n \"file_path\": \"src/GrainViewer/RenderType.h\",\n \"rank\": 60,\n \"score\": 146254.91946517082\n },\n {\n \"content\": \"bool checkShader(GLuint shader, const char *name);\\n\",\n \"file_path\": \"src/GrainViewer/utils/shader.h\",\n \"rank\": 61,\n \"score\": 146192.33506331695\n },\n {\n \"content\": \"class QuadMeshDataDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<QuadMeshData> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<QuadMeshData> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(QuadMeshDataDialog, QuadMeshData)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/QuadMeshDataDialog.h\",\n \"rank\": 62,\n \"score\": 145019.7718030954\n },\n {\n \"content\": \"class PointCloudSplitterDialog : public Dialog {\\n\\npublic:\\n\\n\\tvoid draw() override;\\n\\n\\tvoid setControlledBehavior(std::weak_ptr<PointCloudSplitter> behavior) { m_cont = behavior; }\\n\\n\\n\\nprivate:\\n\\n\\tstd::weak_ptr<PointCloudSplitter> m_cont;\\n\\n};\\n\\n\\n\\nregisterDialogForBehavior(PointCloudSplitterDialog, PointCloudSplitter)\\n\",\n \"file_path\": \"src/GrainViewer/Ui/PointCloudSplitterDialog.h\",\n \"rank\": 63,\n \"score\": 145019.7718030954\n },\n {\n \"content\": \"struct is_compatible_type_impl: std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleType>\\n\",\n \"file_path\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 64,\n \"score\": 143688.56118836752\n },\n {\n \"content\": \"registerSerializationType(int)\\n\",\n \"file_path\": \"src/GrainViewer/SerializationType.h\",\n \"rank\": 65,\n \"score\": 143164.8784430084\n },\n {\n \"content\": \"class ExportCameraMatrixBuffer(Operator, ExportHelper):\\n\\n \\\"\\\"\\\"Export the camera view matrix as a raw binary buffer\\\"\\\"\\\"\\n\\n bl_idname = \\\"export.camera_matrix_buffer\\\" # important since its how bpy.ops.import_test.some_data is constructed\\n\\n bl_label = \\\"Export Camera Matrix Buffer\\\"\\n\\n\\n\\n filename_ext = \\\".bin\\\"\\n\\n\\n\\n filter_glob: StringProperty(\\n\\n default=\\\"*.bin\\\",\\n\\n options={'HIDDEN'},\\n\\n maxlen=255, # Max internal buffer length, longer would be clamped.\\n\\n )\\n\\n\\n\\n def execute(self, context):\\n\",\n \"file_path\": \"share/scripts/blender_export_transform_matrix.py\",\n \"rank\": 66,\n \"score\": 142648.60119484775\n },\n {\n \"content\": \"\\t// These must match defines in the shader (magic_enum reflexion is used to set defines)\\n\\n\\t// the first one mirrors RenderTypeCaching (which is for diaplay)\\n\\n\\tenum class RenderTypeShaderVariant {\\n\\n\\t\\tRENDER_TYPE_FORGET,\\n\\n\\t\\tRENDER_TYPE_CACHE,\\n\\n\\t\\tRENDER_TYPE_PRECOMPUTE,\\n\\n\\t};\\n\",\n \"file_path\": \"src/GrainViewer/Behavior/PointCloudSplitter.h\",\n \"rank\": 67,\n \"score\": 140875.7801466399\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 68,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 69,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 70,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 71,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 72,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 73,\n \"score\": 140617.5075502597\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\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 74,\n \"score\": 140617.5075502597\n },\n {\n \"content\": \"\\n\\n\\tstd::shared_ptr<World> world() { return m_world; }\\n\\n\\tstd::shared_ptr<GlDeferredShader> deferredShader() { return m_deferredShader; }\\n\\n\\n\\n\\tbool mustQuit() const { return m_mustQuit; }\\n\\n\\tint frame() const { return m_frameIndex; }\\n\\n\\n\\n\\tstd::shared_ptr<RuntimeObject> findObjectByName(const std::string& name);\\n\\n\\n\\n\\tvoid takeScreenshot() const;\\n\\n\\tvoid play();\\n\\n\\tvoid pause();\\n\\n\\tvoid togglePause();\\n\\n\\tbool isPaused() const;\\n\\n\\n\\npublic:\\n\\n\\tstruct Properties {\\n\\n\\t\\tbool freezeOcclusionCamera = false;\\n\\n\\t\\tbool realTime = false;\\n\\n\\t\\tbool ui = true;\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 75,\n \"score\": 138909.87142259564\n },\n {\n \"content\": \"\\tfloat m_timeOffset = 0.0f;\\n\\n\\tbool m_paused = false;\\n\\n\\tfloat m_fps;\\n\\n\\tint m_quitAfterFrame = -1; // -1 to deactivate this feature, otherwise automatically quit the program after the specified frame (usefull for batch rendering)\\n\\n\\tbool m_mustQuit = false;\\n\\n\\n\\n\\t// Post render stats\\n\\n\\tstd::string m_outputStats; // path to stats file\\n\\n\\tstd::vector<glm::vec3> m_statsCountColors; // colors to count pixels in render\\n\\n\\tstd::ofstream m_outputStatsFile;\\n\\n\\n\\n\\t// Not really related to the scene, save window resolution\\n\\n\\tint m_width;\\n\\n\\tint m_height;\\n\\n};\\n\\n\\n\\nREFL_TYPE(Scene::Properties)\\n\\nREFL_FIELD(freezeOcclusionCamera)\\n\\nREFL_FIELD(realTime)\\n\\nREFL_FIELD(ui)\\n\\nREFL_END\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 76,\n \"score\": 138902.5251753407\n },\n {\n \"content\": \"\\tProperties m_properties;\\n\\n\\tstd::string m_filename;\\n\\n\\tstd::shared_ptr<World> m_world;\\n\\n\\tstd::shared_ptr<GlDeferredShader> m_deferredShader;\\n\\n\\tint m_viewportCameraIndex;\\n\\n\\tint m_occlusionCameraIndex;\\n\\n\\tbool m_wasFreezeOcclusionCamera = false;\\n\\n\\tstd::vector<std::shared_ptr<Camera>> m_cameras;\\n\\n\\tstd::vector<std::shared_ptr<RuntimeObject>> m_objects;\\n\\n\\tstd::shared_ptr<AnimationManager> m_animationManager;\\n\\n\\tbool m_isDeferredShadingEnabled = true;\\n\\n\\n\\n\\t// Framebuffer used before writing image if the output resolution is different from camera resolution\\n\\n\\tmutable std::unique_ptr<Framebuffer> m_outputFramebuffer; // lazyly allocated in recordFrame\\n\\n\\tint m_frameIndex = -1;\\n\\n\\t// TODO: wrap those data into proper logic/class\\n\\n\\tstd::vector<uint8_t> m_pixels;\\n\\n\\tmutable std::vector<GLfloat> m_floatPixels; // for EXR screenshots\\n\\n\\n\\n\\tfloat m_time;\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 77,\n \"score\": 138893.65462241997\n },\n {\n \"content\": \"\\n\\n\\tinline glm::mat4 viewMatrix() const { return m_uniforms.viewMatrix; }\\n\\n\\tinline void setViewMatrix(glm::mat4 matrix) { m_uniforms.viewMatrix = matrix; } // use with caution\\n\\n\\n\\n\\tinline glm::mat4 projectionMatrix() const { return m_uniforms.projectionMatrix; }\\n\\n\\tinline void setProjectionMatrix(glm::mat4 matrix) { m_uniforms.projectionMatrix = matrix; } // use with caution\\n\\n\\tvoid setProjectionType(ProjectionType projectionType);\\n\\n\\n\\n\\tinline glm::vec2 resolution() const { return m_uniforms.resolution; }\\n\\n\\tvoid setResolution(glm::vec2 resolution);\\n\\n\\tinline void setResolution(int w, int h) { setResolution(glm::vec2(static_cast<float>(w), static_cast<float>(h))); }\\n\\n\\tvoid setFreezeResolution(bool freeze);\\n\\n\\n\\n\\tfloat fov() const { return m_fov; }\\n\\n\\tfloat focalLength() const;\\n\\n\\tvoid setFov(float fov);\\n\\n\\n\\n\\tfloat nearDistance() const { return m_uniforms.uNear; }\\n\\n\\tvoid setNearDistance(float distance);\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 78,\n \"score\": 138885.86192721484\n },\n {\n \"content\": \"\\n\\n\\t/**\\n\\n\\t* Called when mouse moves and panning has started\\n\\n\\t* x1, y1: old mouse position\\n\\n\\t* x2, y2: new mouse position\\n\\n\\t*/\\n\\n\\tvirtual void updateDeltaMousePanning(float x1, float y1, float x2, float y2) {}\\n\\n\\n\\n\\tvirtual void tilt(float theta) {}\\n\\n\\n\\nprivate:\\n\\n\\t// Memory layout on GPU, matches shaders/include/uniform/camera.inc.glsl\\n\\n\\tstruct CameraUbo {\\n\\n\\t\\tglm::mat4 viewMatrix;\\n\\n\\t\\tglm::mat4 projectionMatrix;\\n\\n\\t\\tglm::mat4 inverseViewMatrix;\\n\\n\\t\\tglm::vec2 resolution;\\n\\n\\t\\tfloat uNear = 0.001f;\\n\\n\\t\\tfloat uFar = 1000.f;\\n\\n\\t\\tfloat uLeft;\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 79,\n \"score\": 138885.00703478875\n },\n {\n \"content\": \"\\tinline void stopMousePanning() { m_isMousePanningStarted = false; }\\n\\n\\n\\n\\tinline void tiltLeft() { tilt(-0.1f); }\\n\\n\\tinline void tiltRight() { tilt(0.1f); }\\n\\n\\n\\n\\tvoid updateMousePosition(float x, float y);\\n\\n\\n\\n\\tvirtual void deserialize(const rapidjson::Value & json, const EnvironmentVariables & env, std::shared_ptr<AnimationManager> animations);\\n\\n\\tvirtual std::ostream & serialize(std::ostream & out);\\n\\n\\n\\n\\t/**\\n\\n\\t * Get a framebuffer that has the same resolution as the camera, to be used\\n\\n\\t * as intermediate step in render. Once you're done with it, release the\\n\\n\\t * framebuffer with releaseExtraFramebuffer(). It is safe to call this\\n\\n\\t * every frame.\\n\\n\\t * TODO: implement a proper dynamic framebuffer pool mechanism\\n\\n\\t */\\n\\n\\tstd::shared_ptr<Framebuffer> getExtraFramebuffer(ExtraFramebufferOption option = ExtraFramebufferOption::Rgba32fDepth) const;\\n\\n\\tvoid releaseExtraFramebuffer(std::shared_ptr<Framebuffer>) const;\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 80,\n \"score\": 138884.9571983721\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 81,\n \"score\": 138884.41946057582\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 82,\n \"score\": 138884.41946057582\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <OpenGL>\\n\\n\\n\\n#include \\\"Camera.h\\\"\\n\\n#include \\\"TurntableCamera.h\\\"\\n\\n#include \\\"Framebuffer.h\\\"\\n\\n\\n\\n#include <refl.hpp>\\n\\n\\n\\n#include <memory>\\n\\n#include <vector>\\n\\n#include <string>\\n\\n#include <fstream>\\n\\n#include <sstream>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 83,\n \"score\": 138879.13318322078\n },\n {\n \"content\": \"\\tbool m_isMouseRotationStarted, m_isMouseZoomStarted, m_isMousePanningStarted;\\n\\n\\tbool m_isLastMouseUpToDate;\\n\\n\\tfloat m_lastMouseX, m_lastMouseY;\\n\\n\\n\\n\\tbool m_freezeResolution;\\n\\n\\n\\n\\t// When resolution is freezed, this target framebuffer is allocated at the\\n\\n\\t// fixed resolution and can be bound by the render pipeline\\n\\n\\tstd::shared_ptr<Framebuffer> m_targetFramebuffer;\\n\\n\\n\\n\\tmutable std::vector<std::shared_ptr<Framebuffer>> m_extraFramebuffers; // lazy initialized\\n\\n\\n\\n\\tOutputSettings m_outputSettings;\\n\\n\\tProjectionType m_projectionType;\\n\\n};\\n\\n\\n\\n#define _ ReflectionAttributes::\\n\\nREFL_TYPE(Camera::Properties)\\n\\nREFL_FIELD(viewRect)\\n\\nREFL_FIELD(displayInViewport)\\n\\nREFL_FIELD(controlInViewport)\\n\\nREFL_FIELD(viewLayers, _ HideInDialog())\\n\\nREFL_END\\n\\n#undef _\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 84,\n \"score\": 138878.51095595016\n },\n {\n \"content\": \"\\t};\\n\\n\\tProperties& properties() { return m_properties; }\\n\\n\\tconst Properties& properties() const { return m_properties; }\\n\\n\\n\\nprivate:\\n\\n\\tvoid renderCamera(const Camera & camera) const;\\n\\n\\tstd::shared_ptr<Camera> occlusionCamera() const;\\n\\n\\tvoid measureStats();\\n\\n\\t// TODO: This should be in another section of the code\\n\\n\\tenum RecordFormat {\\n\\n\\t\\tRecordExr,\\n\\n\\t\\tRecordPng,\\n\\n\\t};\\n\\n\\t// Return the number of pixels in output images\\n\\n\\tsize_t getOutputPixelCount(const Camera& camera) const;\\n\\n\\tvoid recordFrame(const Camera & camera, const std::string & filename, RecordFormat format) const;\\n\\n\\t// Record frame only if enabled in camera options\\n\\n\\tvoid recordFrame(const Camera & camera) const;\\n\\n\\n\\nprivate:\\n\",\n \"file_path\": \"src/GrainViewer/Scene.h\",\n \"rank\": 85,\n \"score\": 138877.77041112236\n },\n {\n \"content\": \"\\t\\tfloat uRight;\\n\\n\\t\\tfloat uTop;\\n\\n\\t\\tfloat uBottom;\\n\\n\\t};\\n\\n\\n\\nprivate:\\n\\n\\tvoid updateProjectionMatrix();\\n\\n\\n\\nprotected:\\n\\n\\t// Core data\\n\\n\\tProperties m_properties;\\n\\n\\tCameraUbo m_uniforms;\\n\\n\\tGLuint m_ubo;\\n\\n\\n\\n\\t// Other data, used to build matrices but not shared with gpu\\n\\n\\tglm::vec3 m_position;\\n\\n\\tfloat m_fov;\\n\\n\\tfloat m_orthographicScale;\\n\\n\\n\\n\\t// Move related attributes\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 86,\n \"score\": 138877.6779758586\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <OpenGL>\\n\\n\\n\\n#include \\\"EnvironmentVariables.h\\\"\\n\\n#include \\\"ViewLayerMask.h\\\"\\n\\n#include \\\"utils/ReflectionAttributes.h\\\"\\n\\n\\n\\n#include <refl.hpp>\\n\\n#include <rapidjson/document.h>\\n\\n#include <glm/glm.hpp>\\n\\n\\n\\n#include <memory>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 87,\n \"score\": 138873.8040856453\n },\n {\n \"content\": \"\\tfloat farDistance() const { return m_uniforms.uFar; }\\n\\n\\tvoid setFarDistance(float distance);\\n\\n\\n\\n\\tvoid setOrthographicScale(float orthographicScale);\\n\\n\\tfloat orthographicScale() const { return m_orthographicScale; }\\n\\n\\n\\n\\tOutputSettings & outputSettings() { return m_outputSettings; }\\n\\n\\tconst OutputSettings & outputSettings() const { return m_outputSettings; }\\n\\n\\n\\n\\tstd::shared_ptr<Framebuffer> targetFramebuffer() const { return m_targetFramebuffer; }\\n\\n\\n\\n\\tinline void startMouseRotation() { m_isMouseRotationStarted = true; m_isLastMouseUpToDate = false; }\\n\\n\\tinline void stopMouseRotation() { m_isMouseRotationStarted = false; }\\n\\n\\n\\n\\tinline void startMouseZoom() { m_isMouseZoomStarted = true; m_isLastMouseUpToDate = false; }\\n\\n\\tinline void stopMouseZoom() { m_isMouseZoomStarted = false; }\\n\\n\\n\\n\\tinline void zoom(float factor) { updateDeltaMouseZoom(0, 0, 0, factor); }\\n\\n\\t\\n\\n\\tinline void startMousePanning() { m_isMousePanningStarted = true; m_isLastMouseUpToDate = false; }\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 88,\n \"score\": 138870.30256594828\n },\n {\n \"content\": \"\\t/**\\n\\n\\t * Bounding circle of the projected sphere (which is an ellipsis).\\n\\n\\t * xy is the center, z is the radius, all in pixels\\n\\n\\t */\\n\\n\\tglm::vec3 projectSphere(glm::vec3 center, float radius) const;\\n\\n\\n\\n\\t/**\\n\\n\\t * Convert depth value from Z-buffer to a linear depth in camera space units\\n\\n\\t */\\n\\n\\tfloat linearDepth(float zbufferDepth) const;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstruct Properties {\\n\\n\\t\\t\\t// xy: offset, relative to screen size\\n\\n\\t\\t\\t// zw: size, relative to screen size\\n\\n\\t\\t\\t// e.g. for fullscreen: (0, 0, 1, 1)\\n\\n\\t\\t\\tglm::vec4 viewRect = glm::vec4(0, 0, 1, 1);\\n\\n\\n\\n\\t\\t\\tbool displayInViewport = true;\\n\\n\\t\\t\\tbool controlInViewport = true; // receive mouse input\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 89,\n \"score\": 138868.73597677305\n },\n {\n \"content\": \"\\n\\n\\t\\t\\tViewLayerMask viewLayers;\\n\\n\\t\\t};\\n\\n\\t\\tconst Properties& properties() const { return m_properties; }\\n\\n\\t\\tProperties & properties(){ return m_properties; }\\n\\n\\n\\nprotected:\\n\\n\\t/**\\n\\n\\t* Called when mouse moves and rotation has started\\n\\n\\t* x1, y1: old mouse position\\n\\n\\t* x2, y2: new mouse position\\n\\n\\t*/\\n\\n\\tvirtual void updateDeltaMouseRotation(float x1, float y1, float x2, float y2) {}\\n\\n\\n\\n\\t/**\\n\\n\\t* Called when mouse moves and zoom has started\\n\\n\\t* x1, y1: old mouse position\\n\\n\\t* x2, y2: new mouse position\\n\\n\\t*/\\n\\n\\tvirtual void updateDeltaMouseZoom(float x1, float y1, float x2, float y2) {}\\n\",\n \"file_path\": \"src/GrainViewer/Camera.h\",\n \"rank\": 90,\n \"score\": 138861.70679097873\n },\n {\n \"content\": \"/**\\n\\n * This file is part of GrainViewer, the reference implementation of:\\n\\n *\\n\\n * Michel, Élie and Boubekeur, Tamy (2020).\\n\\n * Real Time Multiscale Rendering of Dense Dynamic Stackings,\\n\\n * Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.\\n\\n * https://doi.org/10.1111/cgf.14135\\n\\n *\\n\\n * Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)\\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\\n\\n * deal in the Software without restriction, including without limitation the\\n\\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\\n\\n * sell 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 \"file_path\": \"src/GrainViewer/Shader.h\",\n \"rank\": 91,\n \"score\": 138792.6070980899\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 and non-infringement. 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\\n\\n * from, out of or in connection with the software or the use or other dealings\\n\\n * in the Software.\\n\\n */\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <OpenGL>\\n\\n\\n\\n#ifndef NDEBUG\\n\\n#include \\\"ShaderPreprocessor.h\\\"\\n\\n#endif\\n\\n\\n\\n#include <glm/glm.hpp>\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <set>\\n\\n#include <map>\\n\\n#include <memory>\\n\\n\\n\\n/**\\n\\n * Utility class providing an OO API to OpenGL shaders\\n\\n */\\n\",\n \"file_path\": \"src/GrainViewer/Shader.h\",\n \"rank\": 92,\n \"score\": 138786.57811784322\n },\n {\n \"content\": \" */\\n\\n bool check(const std::string & name = \\\"shader\\\") const;\\n\\n\\n\\n inline GLuint shaderId() const { return m_shaderId; }\\n\\n\\n\\nprivate:\\n\\n GLuint m_shaderId;\\n\\n\\n\\n#ifndef NDEBUG\\n\\n\\t// Keep shader source\\n\\n\\tShaderPreprocessor m_preprocessor;\\n\\n#endif\\n\\n};\\n\",\n \"file_path\": \"src/GrainViewer/Shader.h\",\n \"rank\": 93,\n \"score\": 138776.5338371446\n },\n {\n \"content\": \"struct has_from_json : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename T>\\n\",\n \"file_path\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 94,\n \"score\": 137142.5560099402\n },\n {\n \"content\": \"struct has_to_json : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename T>\\n\",\n \"file_path\": \"src/External/tinygltf/include/json.hpp\",\n \"rank\": 95,\n \"score\": 137142.5560099402\n },\n {\n \"content\": \"struct DialogFactory {\\n\\n\\tstatic std::shared_ptr<Dialog> MakeShared() { return std::make_shared<Dialog>(); }\\n\\n};\\n\\n\\n\\n#define registerDialogForBehavior(DialogType, BehaviorType) \\\\\\n\\ntemplate<> \\\\\\n\",\n \"file_path\": \"src/GrainViewer/Ui/Dialog.h\",\n \"rank\": 96,\n \"score\": 136258.85929862515\n },\n {\n \"content\": \"class ShaderProgram {\\n\\npublic:\\n\\n\\tenum ShaderProgramType {\\n\\n\\t\\tRenderShader,\\n\\n\\t\\tComputeShader,\\n\\n\\t};\\n\\npublic:\\n\\n\\tShaderProgram(const std::string& shaderName = \\\"\\\");\\n\\n\\t~ShaderProgram();\\n\\n\\tShaderProgram(ShaderProgram&) = delete;\\n\\n\\tShaderProgram& operator=(ShaderProgram&) = delete;\\n\\n\\tShaderProgram(ShaderProgram&&) = default;\\n\\n\\tShaderProgram& operator=(ShaderProgram&&) = default;\\n\\n\\n\\n\\t/**\\n\\n\\t * NB: Changing shader name does not reload it. You may want to call load() then.\\n\\n\\t */\\n\\n\\tinline void setShaderName(const std::string& shaderName) { m_shaderName = shaderName; }\\n\\n\\tinline const std::string& shaderName() const { return m_shaderName; }\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/ShaderProgram.h\",\n \"rank\": 97,\n \"score\": 136226.9344083893\n },\n {\n \"content\": \"class ShaderPool {\\n\\npublic:\\n\\n\\tstatic void AddShader(\\n\\n\\t\\tconst std::string& shaderName,\\n\\n\\t\\tconst std::string& baseFile,\\n\\n\\t\\tShaderProgram::ShaderProgramType type = ShaderProgram::RenderShader,\\n\\n\\t\\tconst std::vector<std::string>& defines = {},\\n\\n\\t\\tconst std::map<std::string, std::string> & snippets = {});\\n\\n\\n\\n\\t/**\\n\\n\\t * Copy a base shader and add an extra define. If the define is already\\n\\n\\t * activated in the original shader, this creates an alias pointing to the\\n\\n\\t * previous shader, not a deep copy. This has no effect if there is no\\n\\n\\t * shader called baseShaderName.\\n\\n\\t */\\n\\n\\tstatic void AddShaderVariant(\\n\\n\\t\\tconst std::string & shaderName,\\n\\n\\t\\tconst std::string & baseShaderName,\\n\\n\\t\\tconst std::string & define);\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/ShaderPool.h\",\n \"rank\": 98,\n \"score\": 136226.9344083893\n },\n {\n \"content\": \"class ShaderPreprocessor {\\n\\npublic:\\n\\n\\t/**\\n\\n\\t * Load a shader from a file, and reccursively include #include'd files\\n\\n\\t * You can specity a list of defines to #define where ever\\n\\n\\t * `#include \\\"sys:defines\\\"` is found in the shader.\\n\\n\\t */\\n\\n\\tbool load(const std::string & filename, const std::vector<std::string> & defines = {}, const std::map<std::string, std::string> & snippets = {});\\n\\n\\n\\n\\t/**\\n\\n\\t * Return a buffer to the pure GLSL source, post-preprocessing, to be fed into\\n\\n\\t * glShaderSource.\\n\\n\\t */\\n\\n\\tvoid source(std::vector<GLchar> & buf) const;\\n\\n\\n\\n\\t/**\\n\\n\\t * Log a traceback corresponding to the line `line` in the processed source.\\n\\n\\t */\\n\\n\\tvoid logTraceback(size_t line) const;\\n\\n\\n\\nprivate:\\n\\n\\tstd::vector<std::string> m_lines;\\n\\n\\n\\nprivate:\\n\\n\\tstatic bool loadShaderSourceAux(const std::string & filename, const std::vector<std::string> & defines, const std::map<std::string, std::string> & snippets, std::vector<std::string> & lines_accumulator);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/GrainViewer/ShaderPreprocessor.h\",\n \"rank\": 99,\n \"score\": 136226.9344083893\n }\n]","isConversational":false}}},{"rowIdx":382,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"main/main.cpp"},"repo_name":{"kind":"string","value":"jmautari/playsound"},"commit":{"kind":"string","value":"5885c693d486c5a417a9ec1a96465d83f5492b1c"},"file_code":{"kind":"string","value":"#include \"shared/platform.h\"\n#include <mmdeviceapi.h>\n#include <Endpointvolume.h>\n#include <audioclient.h>\n#include <atlbase.h>\n#include <Mmsystem.h>\n#include <string>\n#include <iostream>\n#include <filesystem>\n\nconstexpr wchar_t kEventName[] = L\"PlaySoundEvent\";\nconstexpr wchar_t kOptRepeat[] = L\"-r\";\nconstexpr wchar_t kOptStop[] = L\"-s\";\nconstexpr wchar_t kOptTime[] = L\"-t\";\nconstexpr wchar_t kOptMuteMic[] = L\"-m\";\nconstexpr int kGetTimeValue = -1;\n\nbool PickDevice(IMMDevice** device_to_use,\n EDataFlow which_end_point = eCapture) {\n HRESULT hr;\n CComPtr<IMMDeviceEnumerator> device_enumerator;\n\n hr = CoCreateInstance(__uuidof(MMDeviceEnumerator), NULL,\n CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&device_enumerator));\n if (FAILED(hr)) {\n return false;\n }\n\n hr = device_enumerator->GetDefaultAudioEndpoint(\n which_end_point, eConsole, device_to_use);\n return SUCCEEDED(hr) ? true : false;\n}\n\nbool SetMicMute(bool mute, bool& muted) {\n if (FAILED(::CoInitializeEx(NULL, COINIT_APARTMENTTHREADED))) {\n return false;\n }\n\n HRESULT hr;\n CComPtr<IMMDevice> endPoint;\n CComPtr<IAudioClient> audioClient;\n CComPtr<IAudioEndpointVolume> volumeControl;\n float current_volume = 0.0f;\n bool res = false;\n\n do {\n if (!PickDevice(&endPoint)) {\n break;\n }\n\n hr = endPoint->Activate(__uuidof(IAudioClient), CLSCTX_ALL, NULL,\n reinterpret_cast<void**>(&audioClient));\n if (FAILED(hr)) {\n break;\n }\n\n hr = endPoint->Activate(__uuidof(IAudioEndpointVolume),\n CLSCTX_INPROC_SERVER, NULL, (LPVOID*)&volumeControl);\n if (FAILED(hr)) {\n break;\n }\n\n BOOL mute_status;\n hr = volumeControl->GetMute(&mute_status);\n if (FAILED(hr)) {\n break;\n }\n\n hr = volumeControl->SetMute(mute, nullptr);\n if (FAILED(hr)) {\n break;\n }\n\n muted = !!mute_status;\n res = true;\n } while (false);\n\n volumeControl.Release();\n endPoint.Release();\n audioClient.Release();\n\n ::CoUninitialize();\n return res;\n}\n\nint wmain(int argc, wchar_t* argv[]) {\n if (argc < 2) {\n std::cout\n << \"Usage:\" << std::endl\n << \"playsound [options] [path-to-file]\" << std::endl\n << \"Where options can be:\" << std::endl\n << \"-r repeat the sound until playsound is called again with -s option\"\n << std::endl\n << std::endl\n << \"-s stop a sound that was previously played with -r option\"\n << std::endl\n << std::endl\n << \"-t X play the sound for up to X seconds. This option has no effect \"\n \"if the sound file duration is shorter than X seconds\"\n << std::endl\n << std::endl\n << \"-m mute default microphone until playsound is called again with -m \"\n \"-s options\"\n << std::endl\n << std::endl\n << \"All options but -m are mutually exclusive\" << std::endl;\n return 1;\n }\n\n HANDLE event_handle = nullptr;\n bool repeat = false;\n bool stop = false;\n bool mute = false;\n int time = 0;\n const auto get_opt = [&] {\n for (int i = 1; i < argc; i++) {\n if (wcsncmp(argv[i], kOptRepeat, _TRUNCATE) == 0) {\n if (!stop)\n repeat = true;\n } else if (wcsncmp(argv[i], kOptStop, _TRUNCATE) == 0) {\n if (!repeat)\n stop = true;\n } else if (wcsncmp(argv[i], kOptTime, _TRUNCATE) == 0) {\n time = kGetTimeValue;\n } else if (time == kGetTimeValue) {\n time = std::stoi(argv[i]);\n } else if (wcsncmp(argv[i], kOptMuteMic, _TRUNCATE) == 0) {\n mute = true;\n }\n }\n };\n const auto get_filename = [&]() -> std::filesystem::path {\n return argv[argc - 1]; \n };\n get_opt();\n if (stop) {\n event_handle = OpenEventW(EVENT_MODIFY_STATE, false, kEventName);\n if (event_handle == nullptr) {\n std::cout << \"Sound event not found. Make sure a sound was being played\"\n << std::endl;\n return 1;\n }\n\n std::cout << \"Stopping sound\" << std::endl;\n SetEvent(event_handle);\n PlaySound(nullptr, 0, 0);\n return 0;\n }\n\n const auto filename = get_filename();\n std::error_code ec;\n if (!std::filesystem::exists(filename, ec)) {\n std::cout << \"File not found\" << std::endl;\n return 1;\n }\n\n if (mute) {\n \n event_handle = OpenEventW(EVENT_MODIFY_STATE, false, kEventName);\n if (event_handle != nullptr) {\n CloseHandle(event_handle);\n return 1;\n }\n }\n\n DWORD flags = SND_FILENAME;\n bool muted = false;\n bool reset_mic = false;\n if (repeat || mute) {\n std::cout << \"Repeating sound \" << (mute ? \"and muting default mic\" : \"\")\n << \" until playsound is started with -s option\" << std::endl;\n flags |= SND_LOOP | SND_ASYNC;\n event_handle = CreateEventW(nullptr, false, false, kEventName);\n if (mute) {\n reset_mic = SetMicMute(true, muted);\n if (!reset_mic) {\n std::cout << \"Couldn't get current mic volume. Not muting mic\"\n << std::endl;\n }\n }\n } else if (time > 0) {\n flags |= SND_ASYNC;\n }\n\n PlaySoundW(filename.native().c_str(), nullptr, flags);\n if (event_handle != nullptr) {\n \n WaitForSingleObject(event_handle, INFINITE);\n CloseHandle(event_handle);\n if (mute && reset_mic)\n SetMicMute(false, muted);\n } else if (time > 0) {\n Sleep(time * 1000);\n }\n\n return 0;\n}\n"},"prefix":{"kind":"string","value":"#include \"shared/platform.h\"\n#include <mmdeviceapi.h>\n#include <Endpointvolume.h>\n#include <audioclient.h>\n#include <atlbase.h>\n#include <Mmsystem.h>\n#include <string>\n#include <iostream>\n#include <filesystem>\n\nconstexpr wchar_t kEventName[] = L\"PlaySoundEvent\";\nconstexpr wchar_t kOptRepeat[] = L\"-r\";\nconstexpr wchar_t kOptStop[] = L\"-s\";\nconstexpr wchar_t kOptTime[] = L\"-t\";\nconstexpr wchar_t kOptMuteMic[] = L\"-m\";\nconstexpr int kGetTimeValue = -1;\n\nbool PickDevice(IMMDevice** device_to_use,\n EDataFlow which_end_point = eCapture) {\n HRESULT hr;\n CComPtr<IMMDeviceEnumerator> device_enumerator;\n\n hr = CoCreateInstance(__uuidof(MMDeviceEnumerator), NULL,\n CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&device_enumerator));\n if (FAILED(hr)) {\n return false;\n }\n\n hr = device_enumerator->GetDefaultAudioEndpoint(\n which_end_point, eConsole, device_to_use);\n return SUCCEEDED(hr) ? true : false;\n}\n\nbool SetMicMute(bool mute, bool& muted) {\n if (FAILED(::CoInitializeEx(NULL, COINIT_APARTMENTTHREADED))) {\n return false;\n }\n\n HRESULT hr;\n CComPtr<IMMDevice> endPoint;\n CComPtr<IAudioClient> audioClient;\n CComPtr<IAudioEndpointVolume> volumeControl;\n float current_volume = 0.0f;\n bool re"},"suffix":{"kind":"string","value":"rue, muted);\n if (!reset_mic) {\n std::cout << \"Couldn't get current mic volume. Not muting mic\"\n << std::endl;\n }\n }\n } else if (time > 0) {\n flags |= SND_ASYNC;\n }\n\n PlaySoundW(filename.native().c_str(), nullptr, flags);\n if (event_handle != nullptr) {\n \n WaitForSingleObject(event_handle, INFINITE);\n CloseHandle(event_handle);\n if (mute && reset_mic)\n SetMicMute(false, muted);\n } else if (time > 0) {\n Sleep(time * 1000);\n }\n\n return 0;\n}\n"},"middle":{"kind":"string","value":"s = false;\n\n do {\n if (!PickDevice(&endPoint)) {\n break;\n }\n\n hr = endPoint->Activate(__uuidof(IAudioClient), CLSCTX_ALL, NULL,\n reinterpret_cast<void**>(&audioClient));\n if (FAILED(hr)) {\n break;\n }\n\n hr = endPoint->Activate(__uuidof(IAudioEndpointVolume),\n CLSCTX_INPROC_SERVER, NULL, (LPVOID*)&volumeControl);\n if (FAILED(hr)) {\n break;\n }\n\n BOOL mute_status;\n hr = volumeControl->GetMute(&mute_status);\n if (FAILED(hr)) {\n break;\n }\n\n hr = volumeControl->SetMute(mute, nullptr);\n if (FAILED(hr)) {\n break;\n }\n\n muted = !!mute_status;\n res = true;\n } while (false);\n\n volumeControl.Release();\n endPoint.Release();\n audioClient.Release();\n\n ::CoUninitialize();\n return res;\n}\n\nint wmain(int argc, wchar_t* argv[]) {\n if (argc < 2) {\n std::cout\n << \"Usage:\" << std::endl\n << \"playsound [options] [path-to-file]\" << std::endl\n << \"Where options can be:\" << std::endl\n << \"-r repeat the sound until playsound is called again with -s option\"\n << std::endl\n << std::endl\n << \"-s stop a sound that was previously played with -r option\"\n << std::endl\n << std::endl\n << \"-t X play the sound for up to X seconds. This option has no effect \"\n \"if the sound file duration is shorter than X seconds\"\n << std::endl\n << std::endl\n << \"-m mute default microphone until playsound is called again with -m \"\n \"-s options\"\n << std::endl\n << std::endl\n << \"All options but -m are mutually exclusive\" << std::endl;\n return 1;\n }\n\n HANDLE event_handle = nullptr;\n bool repeat = false;\n bool stop = false;\n bool mute = false;\n int time = 0;\n const auto get_opt = [&] {\n for (int i = 1; i < argc; i++) {\n if (wcsncmp(argv[i], kOptRepeat, _TRUNCATE) == 0) {\n if (!stop)\n repeat = true;\n } else if (wcsncmp(argv[i], kOptStop, _TRUNCATE) == 0) {\n if (!repeat)\n stop = true;\n } else if (wcsncmp(argv[i], kOptTime, _TRUNCATE) == 0) {\n time = kGetTimeValue;\n } else if (time == kGetTimeValue) {\n time = std::stoi(argv[i]);\n } else if (wcsncmp(argv[i], kOptMuteMic, _TRUNCATE) == 0) {\n mute = true;\n }\n }\n };\n const auto get_filename = [&]() -> std::filesystem::path {\n return argv[argc - 1]; \n };\n get_opt();\n if (stop) {\n event_handle = OpenEventW(EVENT_MODIFY_STATE, false, kEventName);\n if (event_handle == nullptr) {\n std::cout << \"Sound event not found. Make sure a sound was being played\"\n << std::endl;\n return 1;\n }\n\n std::cout << \"Stopping sound\" << std::endl;\n SetEvent(event_handle);\n PlaySound(nullptr, 0, 0);\n return 0;\n }\n\n const auto filename = get_filename();\n std::error_code ec;\n if (!std::filesystem::exists(filename, ec)) {\n std::cout << \"File not found\" << std::endl;\n return 1;\n }\n\n if (mute) {\n \n event_handle = OpenEventW(EVENT_MODIFY_STATE, false, kEventName);\n if (event_handle != nullptr) {\n CloseHandle(event_handle);\n return 1;\n }\n }\n\n DWORD flags = SND_FILENAME;\n bool muted = false;\n bool reset_mic = false;\n if (repeat || mute) {\n std::cout << \"Repeating sound \" << (mute ? \"and muting default mic\" : \"\")\n << \" until playsound is started with -s option\" << std::endl;\n flags |= SND_LOOP | SND_ASYNC;\n event_handle = CreateEventW(nullptr, false, false, kEventName);\n if (mute) {\n reset_mic = SetMicMute(t"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"# Playsound\n\n\n\nSimple utility program to play a wav file.\n\n\n\nPrimarily used by [Widgets][1]\n\n\n\n## Usage\n\n\n\n```\n\nplaysound [options] [path-to-file]\n\n```\n\n\n\nWhere `options` can be:\n\n\n\n`-r` repeat the sound until `playsound` is called again with `-s` option\n\n\n\n`-m` same as `-r` but also mute default microphone until `playsound` is called again with `-s` option\n\n\n\n`-s` stop a sound that was previously played with `-r` option\n\n\n\n`-t X` play the sound for up to `X` seconds. This option has no effect if the sound file duration is shorter than `X` seconds\n\n\n\n**All options are mutually exclusive.**\n\n\n\n## Examples\n\n\n\nPlays `beep.wav` wave file repeatedly until `playsound -s` is called.\n\n\n\n```\n\nplaysound -r beep.wav\n\n```\n\n\n\nStops a sound that was started previously with `-r` option.\n\n\n\n```\n\nplaysound -s\n\n```\n\n\n\nPlays `song.wav` for 5 seconds.\n\n\n\n```\n\nplaysound -t 5 song.wav\n\n```\n\n\n\n[1]: https://github.com/jmautari/widgets\n","file_path":"README.md","rank":10,"score":0.6536595401937257}],"string":"[\n {\n \"content\": \"# Playsound\\n\\n\\n\\nSimple utility program to play a wav file.\\n\\n\\n\\nPrimarily used by [Widgets][1]\\n\\n\\n\\n## Usage\\n\\n\\n\\n```\\n\\nplaysound [options] [path-to-file]\\n\\n```\\n\\n\\n\\nWhere `options` can be:\\n\\n\\n\\n`-r` repeat the sound until `playsound` is called again with `-s` option\\n\\n\\n\\n`-m` same as `-r` but also mute default microphone until `playsound` is called again with `-s` option\\n\\n\\n\\n`-s` stop a sound that was previously played with `-r` option\\n\\n\\n\\n`-t X` play the sound for up to `X` seconds. This option has no effect if the sound file duration is shorter than `X` seconds\\n\\n\\n\\n**All options are mutually exclusive.**\\n\\n\\n\\n## Examples\\n\\n\\n\\nPlays `beep.wav` wave file repeatedly until `playsound -s` is called.\\n\\n\\n\\n```\\n\\nplaysound -r beep.wav\\n\\n```\\n\\n\\n\\nStops a sound that was started previously with `-r` option.\\n\\n\\n\\n```\\n\\nplaysound -s\\n\\n```\\n\\n\\n\\nPlays `song.wav` for 5 seconds.\\n\\n\\n\\n```\\n\\nplaysound -t 5 song.wav\\n\\n```\\n\\n\\n\\n[1]: https://github.com/jmautari/widgets\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 10,\n \"score\": 0.6536595401937257\n }\n]","isConversational":false}}},{"rowIdx":383,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"CODE_S1_Wed_Friday/CODE_S1_Wed_Friday/theMainFunction.cpp"},"repo_name":{"kind":"string","value":"Freethetan/INFO3111-S21"},"commit":{"kind":"string","value":"b0526d641c5e744c38e6a48d1b66a47f0d8dd592"},"file_code":{"kind":"string","value":"#include \"globalStuff.h\"\n\n#include <glm/glm.hpp>\n#include <glm/vec3.hpp> \n#include <glm/vec4.hpp> \n#include <glm/mat4x4.hpp> \n#include <glm/gtc/matrix_transform.hpp> \n\n#include <glm/gtc/type_ptr.hpp> \n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <sstream>\n\n#include \"cShaderManager.h\"\n\n#include \"cVAOManager.h\" \n\n#include \"cMeshObject.h\"\n\nstatic void error_callback(int error, const char* description)\n{\n fprintf(stderr, \"Error: %s\\n\", description);\n}\n\nbool generateQnDHeaderFileFromPLY(std::string plyFileName,\n std::string headerFileName,\n unsigned int& numVertices);\n\nfloat getRandFloat(float LO, float HI)\n{\n float r3 = LO + static_cast <float> (rand()) / (static_cast <float> (RAND_MAX / (HI - LO)));\n return r3;\n}\n\nvoid DrawObject( cMeshObject& curMesh,\n glm::mat4& matModel, glm::mat4& matProjection, glm::mat4& matView,\n float ratio, cVAOManager* pVAOMan, GLuint program);\n\nint main(void)\n{\n \n \n \n \n \n \n \n \n \n \n \n\n GLFWwindow* window = NULL;\t\n\n GLuint vertex_buffer = 0;\n\t\n\t\n\tGLuint program = 0;\n\n \n\tGLint vpos_location = 0;\n\tGLint vcol_location = 0;\n\n glfwSetErrorCallback(error_callback);\n if (!glfwInit())\n {\n exit(EXIT_FAILURE);\n }\n\n glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 2);\n glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 0);\n\n window = glfwCreateWindow(640, 480, \"Simple example\", NULL, NULL);\n if (!window)\n {\n glfwTerminate();\n exit(EXIT_FAILURE);\n }\n\n glfwSetKeyCallback(window, key_callback);\n\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc)glfwGetProcAddress);\n glfwSwapInterval(1);\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\t\t\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\t\t\n\n\t\n\n\tcShaderManager* pShaderManager = new cShaderManager();\n\n\tcShaderManager::cShader myVertexShader;\n\tcShaderManager::cShader myFragmentShader;\n\n\tpShaderManager->setBasePath(\"assets/shaders/\");\n\n\tmyVertexShader.fileName = \"myVertShad.glsl\";\n\tmyFragmentShader.fileName = \"myFragShad.glsl\";\n\n\tif (pShaderManager->createProgramFromFile(\"SimpleShader\",\n\t\t\t\t\t\t\t\t\t\t\t myVertexShader,\n\t\t\t\t\t\t\t\t\t\t\t myFragmentShader))\n\t{\n\t\tstd::cout << \"Compiled the shader program OK\" << std::endl;\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Oh NO!: Here's why: \" << pShaderManager->getLastError() << std::endl;\n\t}\n\n\t\n\tprogram = pShaderManager->getIDFromFriendlyName(\"SimpleShader\");\n\n \n cVAOManager* pVAOMan = new cVAOManager();\n\n sModelDrawInfo mdoBunny;\n if (pVAOMan->LoadModelIntoVAO(\"assets/models/bun_zipper_res2_xyz_rgba.ply\",\n mdoBunny, program))\n {\n std::cout << \"Bunny loaded OK\" << std::endl;\n std::cout << \"Has: \" << mdoBunny.numberOfVertices << \" vertices\" << std::endl;\n }\n\n sModelDrawInfo mdoFish;\n pVAOMan->LoadModelIntoVAO(\"assets/models/PacificCod0_xyz_rgba.ply\",mdoFish, program);\n\n sModelDrawInfo mdoEagleShaceShip;\n pVAOMan->LoadModelIntoVAO(\"assets/models/Eagle_xyz_rgba.ply\", mdoEagleShaceShip, program);\n\n sModelDrawInfo mdoOcto;\n pVAOMan->LoadModelIntoVAO(\"assets/models/Santa_Octopus_xyz_rgba.ply\", mdoOcto, program);\n\n sModelDrawInfo mdoCube;\n pVAOMan->LoadModelIntoVAO(\"assets/models/1x1x1Cube.ply\", mdoCube, program);\n\n \n\n \n \n\n \n \n \n\n \n \n \n\n \n\n \n \n \n\n cMeshObject bunny;\n bunny.meshName = \"assets/models/bun_zipper_res2_xyz_rgba.ply\";\n bunny.scale = 6.43f; \n bunny.position.x = 1.0f;\n bunny.orientation.y = 0.5f;\n bunny.orientation.z = 0.1f;\n\n bunny.wholeObjectColour = glm::vec4(0.0f, 0.5f, 1.0f, 1.0f);\n bunny.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(bunny);\n\n cMeshObject spaceShip;\n spaceShip.meshName = \"assets/models/Eagle_xyz_rgba.ply\";\n spaceShip.scale = 0.03994727f; \n spaceShip.position.y = -0.5f;\n\n spaceShip.wholeObjectColour = glm::vec4(1.0f, 0.0f, 0.0f, 1.0f);\n spaceShip.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(spaceShip);\n\n cMeshObject spaceShip2;\n spaceShip2.meshName = \"assets/models/Eagle_xyz_rgba.ply\";\n spaceShip2.scale = 0.03994727f * 2.0f; \n spaceShip2.position.y = 0.75f;\n\n spaceShip2.wholeObjectColour = glm::vec4(1.0f, 1.0f, 0.0f, 1.0f);\n spaceShip2.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(spaceShip2);\n\n cMeshObject santaOcto;\n santaOcto.meshName = \"assets/models/Santa_Octopus_xyz_rgba.ply\";\n santaOcto.position.x = +2.0f;\n santaOcto.position.z = +2.0f;\n\n santaOcto.wholeObjectColour = glm::vec4(1.0f,0.6f, 0.3f, 1.0f);\n santaOcto.bUseWholeObjectColour = true;\n ::g_vecObjectsToDraw.push_back(santaOcto);\n\n ::g_DebugCube.meshName = \"assets/models/1x1x1Cube.ply\";\n ::g_DebugCube.isWireframe = true;\n ::g_DebugCube.wholeObjectColour = glm::vec4(1.0f,1.0f, 1.0f, 1.0f);\n ::g_DebugCube.bUseWholeObjectColour = true;\n\n \n \n \n \n \n\n itSelectedObject = g_vecObjectsToDraw.begin();\n\n \n\n \n while ( ! glfwWindowShouldClose(window) )\n {\n float ratio;\n int width, height;\n \n \n glm::mat4 matModel;\n glm::mat4 matProjection; \n glm::mat4 matView; \n\n glfwGetFramebufferSize(window, &width, &height);\n ratio = width / (float)height;\n glViewport(0, 0, width, height);\n\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n\n \n \n \n \n \n \n\n \n \n for (unsigned int index = 0; index != ::g_vecObjectsToDraw.size(); index++)\n {\n \n cMeshObject curMesh = ::g_vecObjectsToDraw[index];\n\n DrawObject( curMesh, matModel, matProjection, matView,\n ratio, pVAOMan, program );\n\n }\n\n \n\n \n std::stringstream ssTitle;\n\n switch (::g_CurrentMode)\n {\n case EDIT_VIEW:\n ssTitle << \"(EDIT MODE) \";\n \n ::g_DebugCube.position = itSelectedObject->position;\n\n DrawObject(::g_DebugCube, matModel, matProjection, matView,\n ratio, pVAOMan, program);\n break;\n case CAMERA_VIEW:\n ssTitle << \"(CAMERA MODE) \";\n ssTitle << ::g_cameraEye.x << \", \" << ::g_cameraEye.y << \", \" << ::g_cameraEye.z;\n break;\n }\n\n glfwSetWindowTitle(window, ssTitle.str().c_str());\n\n \n \n glfwSwapBuffers(window);\n\n \n glfwPollEvents();\n\n doKeyboardMouseStuffAsync(window);\n\n }\n\n\t\n\tdelete pShaderManager;\n delete pVAOMan;\n\n glfwDestroyWindow(window);\n glfwTerminate();\n exit(EXIT_SUCCESS);\n}\n\nvoid DrawObject( cMeshObject &curMesh,\n glm::mat4 &matModel, glm::mat4 &matProjection, glm::mat4 &matView, \n float ratio, cVAOManager* pVAOMan,\n GLuint program)\n{\n \n \n \n \n \n \n \n \n\n \n matModel = glm::mat4(1.0f); \n\n glm::mat4 matRotateZ;\n glm::mat4 matRotateY;\n glm::mat4 matRotateX;\n glm::mat4 matScale;\n glm::mat4 matTranslate; \n\n matRotateZ = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.z, \n glm::vec3(0.0f, 0.0f, 1.0f));\n\n matRotateY = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.y, \n glm::vec3(0.0f, 1.0, 0.0f));\n\n matRotateX = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.x, \n glm::vec3(1.0f, 0.0, 0.0f));\n\n float uniformScale = curMesh.scale;\n \n\n matScale = glm::scale(glm::mat4(1.0f), glm::vec3(uniformScale, uniformScale, uniformScale));\n\n matTranslate = glm::translate(glm::mat4(1.0f),\n glm::vec3(curMesh.position.x,\n curMesh.position.y,\n curMesh.position.z));\n\n \n matModel = matModel * matTranslate;\n matModel = matModel * matRotateX;\n matModel = matModel * matRotateY;\n matModel = matModel * matRotateZ;\n matModel = matModel * matScale;\n\n \n matProjection = glm::perspective(0.6f,\n ratio,\n 0.1f,\n 1000.0f);\n\n matView = glm::mat4(1.0f);\n\n glm::vec3 upVector = glm::vec3(0.0f, 1.0f, 0.0f);\n\n matView = glm::lookAt(::g_cameraEye,\n ::g_cameraTarget,\n upVector);\n\n \n\n \n\n GLint mView_UniLocID = glGetUniformLocation(program, \"mView\");\n glUniformMatrix4fv(mView_UniLocID, 1, GL_FALSE, glm::value_ptr(matView));\n\n GLint mModel_UniLocID = glGetUniformLocation(program, \"mModel\");\n glUniformMatrix4fv(mModel_UniLocID, 1, GL_FALSE, glm::value_ptr(matModel));\n\n GLint mProj_UniLocID = glGetUniformLocation(program, \"mProj\");\n glUniformMatrix4fv(mProj_UniLocID, 1, GL_FALSE, glm::value_ptr(matProjection));\n\n \n \n\n GLint wholeObjCol_UniLocID = glGetUniformLocation(program, \"wholeObjCol\");\n glUniform4f(wholeObjCol_UniLocID,\n curMesh.wholeObjectColour.r,\n curMesh.wholeObjectColour.g,\n curMesh.wholeObjectColour.b,\n curMesh.wholeObjectColour.a);\n\n GLint bUseVertColour_UniLocID = glGetUniformLocation(program, \"bUseVertColour\");\n\n if (curMesh.bUseWholeObjectColour)\n {\n glUniform1i(bUseVertColour_UniLocID, GL_FALSE);\n }\n else\n {\n glUniform1i(bUseVertColour_UniLocID, GL_TRUE);\n }\n\n glUseProgram(program);\n\n if (curMesh.isWireframe)\n {\n glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n \n glDisable(GL_DEPTH_TEST);\n \n glDisable(GL_CULL_FACE);\n }\n else\n { \n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n \n glEnable(GL_DEPTH_TEST);\n \n glEnable(GL_CULL_FACE);\n glCullFace(GL_BACK);\n }\n\n \n \n\n sModelDrawInfo mdoMesh;\n if (pVAOMan->FindDrawInfoByModelName(curMesh.meshName,\n mdoMesh))\n {\n glBindVertexArray(mdoMesh.VAO_ID);\n\n glDrawElements(GL_TRIANGLES, mdoMesh.numberOfIndices, GL_UNSIGNED_INT, 0);\n\n glBindVertexArray(0);\n }\n\n return;\n}"},"prefix":{"kind":"string","value":"#include \"globalStuff.h\"\n\n#include <glm/glm.hpp>\n#include <glm/vec3.hpp> \n#include <glm/vec4.hpp> \n#include <glm/mat4x4.hpp> \n#include <glm/gtc/matrix_transform.hpp> \n\n#include <glm/gtc/type_ptr.hpp> \n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <sstream>\n\n#include \"cShaderManager.h\"\n\n#include \"cVAOManager.h\" \n\n#include \"cMeshObject.h\"\n\nstatic void error_callback(int error, const char* description)\n{\n fprintf(stderr, \"Error: %s\\n\", description);\n}\n\nbool generateQnDHeaderFileFromPLY(std::string plyFileName,\n std::string headerFileName,\n unsigned int& numVertices);\n\nfloat getRandFloat(float LO, float HI)\n{\n float r3 = LO + static_cast <float> (rand()) / (static_cast <float> (RAND_MAX / (HI - LO)));\n return r3;\n}\n\nvoid DrawObject( cMeshObject& curMesh,\n glm::mat4& matModel, glm::mat4& matProjection, glm::mat4& matView,\n float ratio, cVAOManager* pVAOMan, GLuint program);\n\nint main(void)\n{\n \n \n \n \n \n \n \n \n \n \n \n\n GLFWwindow* window = NULL;\t\n\n GLuint vertex_buffer = 0;\n\t\n\t\n\tGLuint program = 0;\n\n \n\tGLint vpos_location = 0;\n\tGLint vcol_location = 0;\n\n glfwSetErrorCallback(error_callback);\n if (!glfwInit())\n {\n exit(EXIT_FAILURE);\n }\n\n glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 2);\n glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 0);\n\n window = glfwCreateWindow(640, 480, \"Simple example\", NULL, NULL);\n if (!window)\n {\n glfwTerminate();\n exit(EXIT_FAILURE);\n }\n\n glfwSetKeyCallback(window, key_callback);\n\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc)glfwGetProcAddress);\n glfwSwapInterval(1);\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\t\t\n\n\t\t\n\t\t\n\n\t\t\n\t\t\n\t\t\n\n\t\n\n\tcShaderManager* pShaderManager = new cShaderManager();\n\n\tcShaderManager::cShader myVertexShader;\n\tcShaderManager::cShader myFragmentShader;\n\n\tpShaderManager->setBasePath(\"assets/shaders/\");\n\n\tmyVertexShader.fileName = \"myVertShad.glsl\";\n\tmyFragmentShader.fileName = \"myFragShad.glsl\";\n\n\tif (pShaderManager->createProgramFromFile(\"SimpleShader\",\n\t\t\t\t\t\t\t\t\t\t\t myVertexShader,\n\t\t\t\t\t\t\t\t\t\t\t myFragmentShader))\n\t{\n\t\tstd::cout << \"Compiled the shader program OK\" << std::endl;\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Oh NO!: Here's why: \" << pShaderManager->getLastError() << std::endl;\n\t}\n\n\t\n\tprogram = pShaderManager->getIDFromFriendlyName(\"SimpleShader\");\n\n \n cVAOManager* pVAOMan = new cVAOManager();\n\n sModelDrawInfo mdoBunny;\n if (pVAOMan->LoadModelIntoVAO(\"assets/models/bun_zipper_res2_xyz_rgba.ply\",\n mdoBunny, program))\n {\n std::cout << \"Bunny loaded OK\" << std::endl;\n std::cout << \"Has: \" << mdoBunny.numberOfVertices << \" vertices\" << std::endl;\n }\n\n sModelDrawInfo mdoFish;\n pVAOMan->LoadModelIntoVAO(\"assets/models/PacificCod0_xyz_rgba.ply\",mdoFish, program);\n\n sModelDrawInfo mdoEagleShaceShip;\n pVAOMan->LoadModelIntoVAO(\"assets/models/Eagle_xyz_rgba.ply\", mdoEagleShaceShip, program);\n\n sModelDrawInfo mdoOcto;\n pVAOMan->LoadModelIntoVAO(\"assets/models/Santa_Octopus_xyz_rgba.ply\", mdoOcto, program);\n\n sModelDrawInfo mdoCube;\n pVAOMan->LoadModelIntoVAO(\"assets/models/1x1x1Cube.ply\", mdoCube, program);\n\n \n\n \n \n\n \n \n \n\n \n \n \n\n \n\n \n \n \n\n cMeshObject bunny;\n bunny.meshName = \"assets/models/bun_zipper_res2_xyz_rgba.ply\";\n bunny.scale = 6.43f; \n bunny.position.x = 1.0f;\n bunny.orientation.y = 0.5f;\n bunny.orientation.z = 0.1f;\n\n bunny.wholeObjectColour = glm::vec4(0.0f, 0.5f, 1.0f, 1.0f);\n bunny.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(bunny);\n\n cMeshObject spaceShip;\n spaceShip.meshName = \"assets/models/Eagle_xyz_rgba.ply\";\n spaceShip.scale = 0.03994727f; \n spaceShip.position.y = -0.5f;\n\n spaceShip.wholeObjectColour = glm::vec4(1.0f, 0.0f, 0.0f, 1.0f);\n spaceShip.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(spaceShip);\n\n cMeshObject spaceShip2;\n spaceShip2.meshName = \"assets/models/Eagle_xyz_rgba.ply\";\n spaceShip2.scale = 0.03994727f * 2.0f; \n spaceShip2.position.y = 0.75f;\n\n spaceShip2.wholeObjectColour = glm::vec4(1.0f, 1.0f, 0.0f, 1.0f);\n spaceShip2.bUseWholeObjectColour = true;\n\n ::g_vecObjectsToDraw.push_back(spaceShip2);\n\n cMeshObject santaOcto;\n santaOcto.meshName = \"assets/models/Santa_Octopus_xyz_rgba.ply\";\n santaOcto.position.x = +2.0f;\n santaOcto.position.z = +2.0f;\n\n santaOcto.wholeObjectColour = glm::vec4(1.0f,0.6f, 0.3f, 1.0f);\n santaOcto.bUseWholeObjectColour = true;\n ::g_vecObjectsToDraw.push_back(santaOcto);\n\n ::g_DebugCube.meshName = \"assets/models/1x1x1Cube.ply\";\n ::g_DebugCube.isWireframe = true;\n ::g_DebugCube.wholeObjectColour = glm::vec4(1.0f,1.0f, 1.0f, 1.0f);\n ::g_DebugCube.bUseWholeObjectColour = true;\n\n \n \n \n \n \n\n itSelectedObject = g_vecObjectsToDraw.begin();\n\n \n\n \n while ( ! glfwWindowShouldClose(window) )\n {\n float ratio;\n int width, height;\n \n \n glm::mat4 matModel;\n glm::mat4 matProjection; \n glm::mat4 matView; \n\n glfwGetFramebufferSize(window, &width, &height);\n ratio = width / (float)height;\n glViewport(0, 0, width, height);\n\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n\n \n \n \n \n \n \n\n \n \n for (unsigned int index = 0; index != ::g_vecObjectsToDraw.size(); index++)\n {\n \n cMeshObject curMesh = ::g_vecObjectsToDraw[index];\n\n DrawObject( curMesh, matModel, matProjection, matView,\n ratio, pVAOMan, program );\n\n }\n\n \n\n \n std::stringstream ssTitle;\n\n switch (::g_CurrentMode)\n {\n case EDIT_VIEW:\n ssTitle << \"(EDIT MODE) \";\n \n ::g_DebugCube.position = itSelectedObject->position;\n\n DrawObject(::g_DebugCube, matModel, matProjection, matView,\n ratio, pVAOMan, program);\n break;\n case CAMERA_VIEW:\n ssTitle << \"(CAMERA MODE) \";\n ssTitle << ::g_cameraEye.x << \", \" << ::g_cameraEye.y << \", \" << ::g_cameraEye.z;\n "},"suffix":{"kind":"string","value":"eX = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.x, \n glm::vec3(1.0f, 0.0, 0.0f));\n\n float uniformScale = curMesh.scale;\n \n\n matScale = glm::scale(glm::mat4(1.0f), glm::vec3(uniformScale, uniformScale, uniformScale));\n\n matTranslate = glm::translate(glm::mat4(1.0f),\n glm::vec3(curMesh.position.x,\n curMesh.position.y,\n curMesh.position.z));\n\n \n matModel = matModel * matTranslate;\n matModel = matModel * matRotateX;\n matModel = matModel * matRotateY;\n matModel = matModel * matRotateZ;\n matModel = matModel * matScale;\n\n \n matProjection = glm::perspective(0.6f,\n ratio,\n 0.1f,\n 1000.0f);\n\n matView = glm::mat4(1.0f);\n\n glm::vec3 upVector = glm::vec3(0.0f, 1.0f, 0.0f);\n\n matView = glm::lookAt(::g_cameraEye,\n ::g_cameraTarget,\n upVector);\n\n \n\n \n\n GLint mView_UniLocID = glGetUniformLocation(program, \"mView\");\n glUniformMatrix4fv(mView_UniLocID, 1, GL_FALSE, glm::value_ptr(matView));\n\n GLint mModel_UniLocID = glGetUniformLocation(program, \"mModel\");\n glUniformMatrix4fv(mModel_UniLocID, 1, GL_FALSE, glm::value_ptr(matModel));\n\n GLint mProj_UniLocID = glGetUniformLocation(program, \"mProj\");\n glUniformMatrix4fv(mProj_UniLocID, 1, GL_FALSE, glm::value_ptr(matProjection));\n\n \n \n\n GLint wholeObjCol_UniLocID = glGetUniformLocation(program, \"wholeObjCol\");\n glUniform4f(wholeObjCol_UniLocID,\n curMesh.wholeObjectColour.r,\n curMesh.wholeObjectColour.g,\n curMesh.wholeObjectColour.b,\n curMesh.wholeObjectColour.a);\n\n GLint bUseVertColour_UniLocID = glGetUniformLocation(program, \"bUseVertColour\");\n\n if (curMesh.bUseWholeObjectColour)\n {\n glUniform1i(bUseVertColour_UniLocID, GL_FALSE);\n }\n else\n {\n glUniform1i(bUseVertColour_UniLocID, GL_TRUE);\n }\n\n glUseProgram(program);\n\n if (curMesh.isWireframe)\n {\n glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n \n glDisable(GL_DEPTH_TEST);\n \n glDisable(GL_CULL_FACE);\n }\n else\n { \n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n \n glEnable(GL_DEPTH_TEST);\n \n glEnable(GL_CULL_FACE);\n glCullFace(GL_BACK);\n }\n\n \n \n\n sModelDrawInfo mdoMesh;\n if (pVAOMan->FindDrawInfoByModelName(curMesh.meshName,\n mdoMesh))\n {\n glBindVertexArray(mdoMesh.VAO_ID);\n\n glDrawElements(GL_TRIANGLES, mdoMesh.numberOfIndices, GL_UNSIGNED_INT, 0);\n\n glBindVertexArray(0);\n }\n\n return;\n}"},"middle":{"kind":"string","value":" break;\n }\n\n glfwSetWindowTitle(window, ssTitle.str().c_str());\n\n \n \n glfwSwapBuffers(window);\n\n \n glfwPollEvents();\n\n doKeyboardMouseStuffAsync(window);\n\n }\n\n\t\n\tdelete pShaderManager;\n delete pVAOMan;\n\n glfwDestroyWindow(window);\n glfwTerminate();\n exit(EXIT_SUCCESS);\n}\n\nvoid DrawObject( cMeshObject &curMesh,\n glm::mat4 &matModel, glm::mat4 &matProjection, glm::mat4 &matView, \n float ratio, cVAOManager* pVAOMan,\n GLuint program)\n{\n \n \n \n \n \n \n \n \n\n \n matModel = glm::mat4(1.0f); \n\n glm::mat4 matRotateZ;\n glm::mat4 matRotateY;\n glm::mat4 matRotateX;\n glm::mat4 matScale;\n glm::mat4 matTranslate; \n\n matRotateZ = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.z, \n glm::vec3(0.0f, 0.0f, 1.0f));\n\n matRotateY = glm::rotate(glm::mat4(1.0f),\n curMesh.orientation.y, \n glm::vec3(0.0f, 1.0, 0.0f));\n\n matRotat"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":384,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"tools/trainers/retargetTrainer/src/RetargetArguments.cpp"},"repo_name":{"kind":"string","value":"kernhanda/ELL"},"commit":{"kind":"string","value":"370c0de4e4c190ca0cb43654b4246b3686bca464"},"file_code":{"kind":"string","value":"\n\n#include \"RetargetArguments.h\"\n\nnamespace ell\n{\n void ParsedRetargetArguments::AddArgs(utilities::CommandLineParser& parser)\n {\n using namespace common;\n\n parser.AddOption(inputModelFilename,\n \"inputModelFilename\",\n \"imf\",\n \"Name of the pre-trained ELL model file (e.g. model1.ell) that will be used as a featurizer for a linear predictor\",\n \"\");\n\n parser.AddOption(outputModelFilename,\n \"outputModelFilename\",\n \"omf\",\n \"Name of the output file that will hold the saved retargeted model (e.g. retargetedModel.ell)\",\n \"\");\n\n parser.AddOption(refineIterations,\n \"refineIterations\",\n \"ri\",\n \"If cutting the neural network using a node id, specifies the maximum number of refinement iterations\",\n 1);\n\n parser.AddOption(targetPortElements,\n \"targetPortElements\",\n \"tpe\",\n \"The port elements of the pre-trained model to use as input to the subsequent linear predictor e.g. \\\"1115.output\\\" to use the full output from Node 1115\",\n \"\");\n\n parser.AddOption(removeLastLayers,\n \"removeLastLayers\",\n \"rem\",\n \"Instead of using a node id, a neural network model can be retargeted by removing the last N layers\",\n 0);\n\n parser.AddOption(\n inputDataFilename,\n \"inputDataFilename\",\n \"idf\",\n \"Path to the input dataset file\",\n \"\");\n\n parser.AddOption(\n multiClass,\n \"multiClass\",\n \"mc\",\n \"Indicates whether the input dataset is multi-class or binary.\",\n false);\n\n parser.AddOption(normalize,\n \"normalize\",\n \"n\",\n \"Perform sparsity-preserving normalization\",\n false);\n\n parser.AddOption(regularization,\n \"regularization\",\n \"r\",\n \"The L2 regularization parameter\",\n 0.005);\n\n parser.AddOption(desiredPrecision,\n \"desiredPrecision\",\n \"de\",\n \"The desired duality gap at which to stop optimizing\",\n 1.0e-5);\n\n parser.AddOption(maxEpochs,\n \"maxEpochs\",\n \"me\",\n \"The maximum number of optimization epochs to run\",\n 1000);\n\n parser.AddOption(permute,\n \"permute\",\n \"p\",\n \"Whether or not to randomly permute the training data before each epoch\",\n true);\n\n parser.AddOption(randomSeedString,\n \"randomSeedString\",\n \"seed\",\n \"The random seed string\",\n \"ABCDEFG\");\n\n parser.AddOption(\n verbose,\n \"verbose\",\n \"v\",\n \"Print diagnostic output during the execution of the tool to stdout\",\n false);\n\n parser.AddOption(\n lossFunctionArguments.lossFunction,\n \"lossFunction\",\n \"lf\",\n \"Choice of loss function\",\n { { \"squared\", LossFunctionArguments::LossFunction::squared }, { \"log\", LossFunctionArguments::LossFunction::log }, {\"smoothHinge\", LossFunctionArguments::LossFunction::smoothHinge} },\n \"log\");\n\n parser.AddOption(\n useBlas,\n \"blas\",\n \"\",\n \"Emit code that calls BLAS, used when compiling the input model to create mapped datasets\",\n true);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"RetargetArguments.h\"\n\nnamespace ell\n{\n void ParsedRetargetArguments::AddArgs(utilities::CommandLineParser& parser)\n {\n using namespace common;\n\n parser.AddOption(inputModelFilename,\n \"inputModelFilename\",\n \"imf\",\n \"Name of the pre-trained ELL model file (e.g. model1.ell) that will be used as a featurizer for a linear predictor\",\n \"\");\n\n parser.AddOption(outputModelFilename,\n \"outputModelFilename\",\n \"omf\",\n \"Name of the output file that will hold the saved retargeted model (e.g. retargetedModel.ell)\",\n \"\");\n\n parser.AddOption(refineIterations,\n \"refineIterations\",\n \"ri\",\n \"If cutting the neural network using a node id, specifies the maximum number of refinement iterations\",\n 1);\n\n parser.AddOption(targetPortElements,\n \"targetPortElements\",\n \"tpe\",\n \"The port elements of the pre-trained model to use as input to the subsequent linear predictor e.g. \\\"1115.output\\\" to use the full output from Node 1115\",\n \"\");\n\n parser.AddOption(removeLastLayers,\n \"removeLastLayers\",\n \"rem\",\n \"Instead of using a node id, a neural network model can be retargeted by removing the last N layers\",\n 0);\n\n parser.AddOption(\n inputDataFilename,\n \"inputDataFilename\",\n \"idf\",\n \"Path to the input dataset file\",\n \"\");\n\n parser.AddOption(\n multiClass,\n \"multiClass\",\n \"mc\",\n \"Indicates whether the input dataset is multi-class or binary.\",\n false);\n\n parser.AddOption(normalize,\n \"normalize\",\n \"n\",\n \"Perform sparsity-preserving normalization\",\n false);\n\n parser.AddOption(regularization,\n \"regularization\",\n \"r\",\n \"The L2 regularization parameter\",\n 0.005);\n\n parser.AddOption(desiredPrecision,\n \"desiredP"},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"recision\",\n \"de\",\n \"The desired duality gap at which to stop optimizing\",\n 1.0e-5);\n\n parser.AddOption(maxEpochs,\n \"maxEpochs\",\n \"me\",\n \"The maximum number of optimization epochs to run\",\n 1000);\n\n parser.AddOption(permute,\n \"permute\",\n \"p\",\n \"Whether or not to randomly permute the training data before each epoch\",\n true);\n\n parser.AddOption(randomSeedString,\n \"randomSeedString\",\n \"seed\",\n \"The random seed string\",\n \"ABCDEFG\");\n\n parser.AddOption(\n verbose,\n \"verbose\",\n \"v\",\n \"Print diagnostic output during the execution of the tool to stdout\",\n false);\n\n parser.AddOption(\n lossFunctionArguments.lossFunction,\n \"lossFunction\",\n \"lf\",\n \"Choice of loss function\",\n { { \"squared\", LossFunctionArguments::LossFunction::squared }, { \"log\", LossFunctionArguments::LossFunction::log }, {\"smoothHinge\", LossFunctionArguments::LossFunction::smoothHinge} },\n \"log\");\n\n parser.AddOption(\n useBlas,\n \"blas\",\n \"\",\n \"Emit code that calls BLAS, used when compiling the input model to create mapped datasets\",\n true);\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"class NeuralNetworkPredictorNode : public model::Node\n\n{\n\npublic:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<ValueType>& input = _input;\n\n const model::OutputPort<ValueType>& output = _output;\n\n /// @}\n\n\n\n using PredictorType = typename predictors::NeuralNetworkPredictor<ValueType>;\n\n using Layer = typename predictors::neural::Layer<ValueType>;\n\n\n\n /// <summary> Default Constructor </summary>\n\n NeuralNetworkPredictorNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n\n /// <param name=\"input\"> The signal to predict from </param>\n\n /// <param name=\"predictor\"> The predictor to use when making the prediction. </param>\n\n NeuralNetworkPredictorNode(const model::PortElements<ValueType>& input, const PredictorType& predictor);\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":0,"score":364894.67257152253},{"content":" class NeuralNetworkLayerNodeBase : public model::CompilableNode\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<ValueType>& input = _input;\n\n const model::OutputPort<ValueType>& output = _output;\n\n /// @}\n\n\n\n /// <summary> Gets information about the input memory layout </summary>\n\n virtual model::PortMemoryLayout& GetInputMemoryLayout() = 0;\n\n\n\n /// <summary> Gets information about the input memory layout </summary>\n\n virtual const model::PortMemoryLayout& GetInputMemoryLayout() const = 0;\n\n\n\n /// <summary> Gets information about the output memory layout </summary>\n\n virtual const model::PortMemoryLayout& GetOutputMemoryLayout() const = 0;\n\n\n\n /// <summary> Gets information about the output memory layout </summary>\n\n virtual model::PortMemoryLayout& GetOutputMemoryLayout() = 0;\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":1,"score":326306.6461136015},{"content":" class LinearPredictorNode : public model::Node\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n static constexpr const char* weightedElementsPortName = \"weightedElements\";\n\n const model::InputPort<ElementType>& input = _input;\n\n const model::OutputPort<ElementType>& output = _output;\n\n const model::OutputPort<ElementType>& weightedElements = _weightedElements;\n\n /// @}\n\n\n\n using LinearPredictorType = typename predictors::LinearPredictor<ElementType>;\n\n\n\n /// <summary> Default Constructor </summary>\n\n LinearPredictorNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n\n /// <param name=\"input\"> The signal to predict from </param>\n\n /// <param name=\"predictor\"> The linear predictor to use when making the prediction. </param>\n","file_path":"libraries/nodes/include/LinearPredictorNode.h","rank":2,"score":319689.4142621102},{"content":" class BatchNormalizationLayerNode : public NeuralNetworkLayerNode<BatchNormalizationLayerNode<ValueType>, predictors::neural::BatchNormalizationLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::BatchNormalizationLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<BatchNormalizationLayerNode<ValueType>, predictors::neural::BatchNormalizationLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n BatchNormalizationLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The batch normalization layer to wrap. </param>\n\n BatchNormalizationLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BatchNormalizationLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/BatchNormalizationLayerNode.h","rank":3,"score":319290.28798345575},{"content":" class BinaryConvolutionalLayerNode : public NeuralNetworkLayerNode<BinaryConvolutionalLayerNode<ValueType>, predictors::neural::BinaryConvolutionalLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::BinaryConvolutionalLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<BinaryConvolutionalLayerNode<ValueType>, predictors::neural::BinaryConvolutionalLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n BinaryConvolutionalLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n BinaryConvolutionalLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BinaryConvolutionalLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/BinaryConvolutionalLayerNode.h","rank":4,"score":319189.383427211},{"content":" class InputLayer : public Layer<ElementType>\n\n {\n\n public:\n\n\n\n using Shape = typename Layer<ElementType>::Shape;\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using TensorType = typename Layer<ElementType>::TensorType;\n\n using DataVectorType = typename Layer<ElementType>::DataVectorType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n using Layer<ElementType>::AssignValues;\n\n\n\n /// <summary> Parameters common to all layers. </summary>\n\n struct InputParameters\n\n {\n\n /// <summary> Shape of the input tensor. </summary>\n\n Shape inputShape;\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":5,"score":318387.82625474787},{"content":"struct hash<ell::model::PortElementBase>\n\n{\n\n using argument_type = ell::model::PortElementBase;\n\n using result_type = std::size_t;\n\n\n\n /// <summary> Computes a hash of the input value. </summary>\n\n ///\n\n /// <returns> A hash value for the given input. </returns>\n\n result_type operator()(argument_type const& id) const;\n\n};\n\n\n\ntemplate <>\n","file_path":"libraries/model/include/PortElements.h","rank":6,"score":312938.78851706104},{"content":" class BatchNormalizationLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n using Layer<ElementType>::AssignValues;\n\n\n\n /// <summary> Instantiates an instance of a batch normalization layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"mean\"> The mean values. </param>\n\n /// <param name=\"variance\"> The variance values. </param>\n\n /// <param name=\"epsilon\"> The epsilon added to the denominator to avoid division by zero. </param>\n\n /// <param name=\"EpsilonSummand\"> Which component will the epsilon will be applied to the denominator. </param>\n\n BatchNormalizationLayer(const LayerParameters& layerParameters, const VectorType& mean, const VectorType& variance, ElementType epsilon, EpsilonSummand epsilonSummand);\n\n\n","file_path":"libraries/predictors/neural/include/BatchNormalizationLayer.h","rank":7,"score":305519.856650054},{"content":" class BinaryConvolutionalLayer : public Layer<ElementType>\n\n {\n\n public:\n\n\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using TensorType = typename Layer<ElementType>::TensorType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n \n\n /// <summary> Instantiates an instance of a binarized convolutional layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"convolutionalParameters\"> The hyperparameters for this convolutional layer. </param>\n\n /// <param name=\"weights\"> The set of weights to apply. </param>\n\n BinaryConvolutionalLayer(const LayerParameters& layerParameters, const BinaryConvolutionalParameters& convolutionalParameters, const ConstTensorReferenceType& weights);\n\n\n","file_path":"libraries/predictors/neural/include/BinaryConvolutionalLayer.h","rank":8,"score":305421.892063225},{"content":"struct hash<ell::model::PortRange>\n\n{\n\n using argument_type = ell::model::PortRange;\n\n using result_type = std::size_t ;\n\n\n\n /// <summary> Computes a hash of the input value. </summary>\n\n ///\n\n /// <returns> A hash value for the given input. </returns>\n\n result_type operator()(argument_type const& id) const;\n\n};\n\n}\n\n\n\n#include \"../tcc/PortElements.tcc\"\n","file_path":"libraries/model/include/PortElements.h","rank":9,"score":304438.66845003463},{"content":" class BatchNormalizationLayer : public Layer<ElementType>\n\n {\n\n public:\n\n BatchNormalizationLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& mean, const std::vector<ElementType>& variance, ElementType epsilon, EpsilonSummand epsilonSummand)\n\n : Layer<ElementType>(layerParameters), mean(mean), variance(variance), epsilon(epsilon), epsilonSummand(epsilonSummand)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::batchNormalization; }\n\n\n\n const std::vector<ElementType> mean;\n\n const std::vector<ElementType> variance;\n\n const ElementType epsilon;\n\n const EpsilonSummand epsilonSummand;\n\n };\n\n\n\n // Api projection for BiasLayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":10,"score":296772.21799292916},{"content":" class BinaryConvolutionalLayer : public Layer<ElementType>\n\n {\n\n public:\n\n BinaryConvolutionalLayer(const LayerParameters& layerParameters, const BinaryConvolutionalParameters& convolutionalParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\n\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels), convolutionalParameters(convolutionalParameters)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::binaryConvolution; }\n\n\n\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\n\n const BinaryConvolutionalParameters convolutionalParameters;\n\n };\n\n\n\n // Api projections for ConvolutionalLayer\n\n using ConvolutionMethod = ell::predictors::neural::ConvolutionMethod;\n\n using ConvolutionalParameters = ell::predictors::neural::ConvolutionalParameters;\n\n\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":11,"score":296698.66302006016},{"content":" class Node;\n\n\n","file_path":"libraries/model/include/InputPort.h","rank":12,"score":292921.2693570775},{"content":" class Node;\n\n\n","file_path":"libraries/model/include/OutputPort.h","rank":13,"score":292876.5632452623},{"content":"void TestNeuralNetworkLayerNodes();\n","file_path":"libraries/nodes/test/include/NeuralNetworkLayerNodesTests.h","rank":14,"score":288707.3568119006},{"content":"class InputPortIterator\n\n{\n\npublic:\n\n InputPortIterator() = default;\n\n bool IsValid();\n\n void Next();\n\n InputPort Get();\n\n#ifndef SWIG\n\n InputPortIterator(std::vector<ell::model::InputPortBase*> ports);\n\n#endif\n\nprivate:\n\n size_t _i = 0;\n\n std::vector<ell::model::InputPortBase*> _ports;\n\n};\n\n\n\n//\n\n// OutputPortIterator\n\n//\n\n\n","file_path":"interfaces/common/include/ModelInterface.h","rank":15,"score":285812.08524728415},{"content":"class OutputPortIterator\n\n{\n\npublic:\n\n OutputPortIterator() = default;\n\n bool IsValid();\n\n void Next();\n\n OutputPort Get();\n\n#ifndef SWIG\n\n OutputPortIterator(std::vector<ell::model::OutputPortBase*> ports);\n\n#endif\n\nprivate:\n\n size_t _i = 0;\n\n std::vector<ell::model::OutputPortBase*> _ports;\n\n};\n\n\n","file_path":"interfaces/common/include/ModelInterface.h","rank":16,"score":285770.2165875055},{"content":"namespace ell\n\n{\n\nnamespace common\n\n{\n\n /// <summary> A struct that holds command line parameters for saving models. </summary>\n\n struct ModelSaveArguments\n\n {\n\n /// <summary> The filename to store the output model in. </summary>\n\n std::string outputModelFilename = \"\";\n\n\n\n utilities::OutputStreamImpostor outputModelStream;\n\n };\n\n\n\n /// <summary> A version of ModelSaveArguments that adds its members to the command line parser. </summary>\n\n struct ParsedModelSaveArguments : public ModelSaveArguments, public utilities::ParsedArgSet\n\n {\n\n /// <summary> Adds the arguments to the command line parser. </summary>\n\n ///\n\n /// <param name=\"parser\"> [in,out] The parser. </param>\n\n void AddArgs(utilities::CommandLineParser& parser) override;\n\n\n\n /// <summary> Check arguments. </summary>\n\n ///\n\n /// <param name=\"parser\"> The parser. </param>\n\n ///\n\n /// <returns> An utilities::CommandLineParseResult. </returns>\n\n utilities::CommandLineParseResult PostProcess(const utilities::CommandLineParser& parser) override;\n\n };\n\n}\n","file_path":"libraries/common/include/ModelSaveArguments.h","rank":17,"score":283132.4611327436},{"content":"namespace ell\n\n{\n\nnamespace common\n\n{\n\n /// <summary> Appends a predictor node of the given type to the model in a map. </summary>\n\n ///\n\n /// <typeparam name=\"PredictorNodeType\"> The type of the new predictor node to add </typeparam>\n\n /// <typeparam name=\"PredictorType\"> The type of the predictor to add </typeparam>\n\n /// <param name=\"map\"> The map </param>\n\n /// <param name=\"predictor\"> The predictor to wrap in a node and add to the model </param>\n\n /// <returns> The new model, with the predictor node appended </returns>\n\n template <typename PredictorNodeType, typename PredictorType>\n\n model::Model AppendNodeToModel(model::Map& map, const PredictorType& predictor);\n\n}\n","file_path":"libraries/common/include/AppendNodeToModel.h","rank":18,"score":282011.060945121},{"content":" class ConvolutionalLayerNode : public NeuralNetworkLayerNode<ConvolutionalLayerNode<ValueType>, predictors::neural::ConvolutionalLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::ConvolutionalLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<ConvolutionalLayerNode<ValueType>, predictors::neural::ConvolutionalLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n ConvolutionalLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The convolutional layer to wrap. </param>\n\n ConvolutionalLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::ConvolutionalLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/ConvolutionalLayerNode.h","rank":19,"score":275093.00055515714},{"content":" class BiasLayerNode : public NeuralNetworkLayerNode<BiasLayerNode<ValueType>, predictors::neural::BiasLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::BiasLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<BiasLayerNode<ValueType>, predictors::neural::BiasLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n BiasLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n BiasLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BiasLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/BiasLayerNode.h","rank":20,"score":275093.0005551572},{"content":" class SoftmaxLayerNode : public NeuralNetworkLayerNode<SoftmaxLayerNode<ValueType>, predictors::neural::SoftmaxLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::SoftmaxLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<SoftmaxLayerNode<ValueType>, predictors::neural::SoftmaxLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n SoftmaxLayerNode() = default;\n\n \n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n SoftmaxLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::SoftmaxLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/SoftmaxLayerNode.h","rank":21,"score":275093.0005551572},{"content":" class ScalingLayerNode : public NeuralNetworkLayerNode<ScalingLayerNode<ValueType>, predictors::neural::ScalingLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::ScalingLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<ScalingLayerNode<ValueType>, predictors::neural::ScalingLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n ScalingLayerNode() = default;\n\n \n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The layer to wrap. </param>\n\n ScalingLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::ScalingLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/ScalingLayerNode.h","rank":22,"score":275093.0005551572},{"content":" class NeuralNetworkLayerNode : public NeuralNetworkLayerNodeBase<ValueType>\n\n {\n\n public:\n\n using LayerType = NodeLayerType;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using NeuralNetworkLayerNodeBase<ValueType>::input;\n\n using NeuralNetworkLayerNodeBase<ValueType>::output;\n\n /// @}\n\n\n\n /// <summary> Default constructor. </summary>\n\n NeuralNetworkLayerNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n\n /// <param name=\"input\"> The input to the layer (typically the output of the previous layer). </param>\n\n /// <param name=\"layer\"> The neural network layer to wrap. </param>\n\n NeuralNetworkLayerNode(const model::PortElements<ValueType>& input, const LayerType& layer);\n\n\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":23,"score":273928.30558610376},{"content":"class InputNode : public Node\n\n{\n\npublic:\n\n InputNode(const InputNode& node);\n\n InputNode(Node node);\n\n using Node::GetInputPort;\n\n using Node::GetOutputPort;\n\n#ifndef SWIG\n\n InputNode() = default;\n\n InputNode(const ell::model::InputNodeBase* other);\n\n const ell::model::InputNodeBase* GetInputNode() const;\n\n#endif\n\n};\n\n\n\n//\n\n// OutputNode\n\n//\n\n\n","file_path":"interfaces/common/include/ModelInterface.h","rank":24,"score":273478.9144303244},{"content":"class OutputNode : public Node\n\n{\n\npublic:\n\n OutputNode(const OutputNode& node);\n\n OutputNode(Node node);\n\n using Node::GetInputPort;\n\n using Node::GetOutputPort;\n\n#ifndef SWIG\n\n OutputNode() = default;\n\n OutputNode(const ell::model::OutputNodeBase* other);\n\n const ell::model::OutputNodeBase* GetOutputNode() const;\n\n#endif\n\n};\n\n\n\n//\n\n// PortElement\n\n//\n\n\n","file_path":"interfaces/common/include/ModelInterface.h","rank":25,"score":273438.3335833547},{"content":"void TestNeuralNetworkPredictorNode6();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":26,"score":271145.3198526539},{"content":"void TestNeuralNetworkPredictorNode1();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":27,"score":271145.31985265383},{"content":"void TestNeuralNetworkPredictorNode5();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":28,"score":271145.31985265383},{"content":"void TestNeuralNetworkPredictorNode2();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":29,"score":271145.3198526539},{"content":"void TestNeuralNetworkPredictorNode3();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":30,"score":271145.31985265383},{"content":"void TestNeuralNetworkPredictorNode4();\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":31,"score":271145.31985265383},{"content":" class NeuralNetworkPredictor\n\n {\n\n public:\n\n using Layer = ell::api::predictors::neural::Layer<ElementType>;\n\n using LayerShape = ell::api::math::TensorShape;\n\n using UnderlyingPredictor = ell::predictors::NeuralNetworkPredictor<ElementType>;\n\n using UnderlyingLayer = typename ell::predictors::neural::Layer<ElementType>;\n\n using UnderlyingLayers = typename ell::predictors::NeuralNetworkPredictor<ElementType>::Layers;\n\n using UnderlyingInputParameters = typename ell::predictors::neural::InputLayer<ElementType>::InputParameters;\n\n using UnderlyingInputLayer = typename ell::predictors::neural::InputLayer<ElementType>;\n\n using UnderlyingLayerParameters = typename ell::predictors::neural::Layer<ElementType>::LayerParameters;\n\n\n\n NeuralNetworkPredictor(const std::vector<Layer*>& layers, ElementType scaleFactor=1.0f);\n\n std::vector<ElementType> Predict(const std::vector<ElementType>& input);\n\n void RemoveLastLayers(size_t numLayersToRemove);\n\n LayerShape GetInputShape() const;\n\n LayerShape GetOutputShape() const;\n\n\n\n#ifndef SWIG\n\n const UnderlyingPredictor& GetPredictor() const;\n","file_path":"interfaces/common/include/NeuralNetworkPredictorInterface.h","rank":32,"score":267582.0155233162},{"content":" class BinaryXnorNode : public model::CompilableNode\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n static constexpr const char* inputPaddingMasksPortName = \"inputPaddingMasks\";\n\n static constexpr const char* inputPaddingMaskSumsPortName = \"inputPaddingMaskSums\";\n\n static constexpr const char* filterWeightsPortName = \"filterWeights\";\n\n static constexpr const char* filterMeansPortName = \"filterMeans\";\n\n const model::InputPort<PackedBitsType>& input = _input;\n\n const model::InputPort<PackedBitsType>& inputPaddingMasks = _inputPaddingMasks;\n\n const model::InputPort<int>& inputPaddingMaskSums = _inputPaddingMaskSums;\n\n const model::InputPort<PackedBitsType>& filterWeights = _filterWeights;\n\n const model::InputPort<ValueType>& filterMeans = _filterMeans;\n\n const model::OutputPort<ValueType>& output = _output;\n\n /// @}\n\n\n\n /// <summary> Default contructor. </summary>\n\n BinaryXnorNode();\n\n\n","file_path":"libraries/nodes/include/BinaryConvolutionalLayerNode.h","rank":33,"score":267340.9261927384},{"content":" class FullyConnectedLayerNode : public NeuralNetworkLayerNode<FullyConnectedLayerNode<ValueType>, predictors::neural::FullyConnectedLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::FullyConnectedLayer<ValueType>;\n\n using BaseType = NeuralNetworkLayerNode<FullyConnectedLayerNode<ValueType>, predictors::neural::FullyConnectedLayer<ValueType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n FullyConnectedLayerNode() = default;\n\n \n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n FullyConnectedLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::FullyConnectedLayer<ValueType>& layer);\n\n\n","file_path":"libraries/nodes/include/FullyConnectedLayerNode.h","rank":34,"score":262040.54337780483},{"content":" class RegionDetectionLayerNode : public NeuralNetworkLayerNode<RegionDetectionLayerNode<ValueType>, predictors::neural::RegionDetectionLayer<ValueType>, ValueType>\n\n {\n\n public:\n\n using BaseType = NeuralNetworkLayerNode<RegionDetectionLayerNode<ValueType>, predictors::neural::RegionDetectionLayer<ValueType>, ValueType>;\n\n using typename BaseType::LayerType;\n\n\n\n RegionDetectionLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n RegionDetectionLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::RegionDetectionLayer<ValueType>& layer);\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\"RegionDetectionLayerNode\"); }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n","file_path":"libraries/nodes/include/RegionDetectionLayerNode.h","rank":35,"score":262040.54337780483},{"content":" class ForestPredictorNode : public model::Node\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n static constexpr const char* treeOutputsPortName = \"treeOutputs\";\n\n static constexpr const char* edgeIndicatorVectorPortName = \"edgeIndicatorVector\";\n\n const model::InputPort<double>& input = _input;\n\n const model::OutputPort<double>& output = _output;\n\n const model::OutputPort<double>& treeOutputs = _treeOutputs;\n\n const model::OutputPort<bool>& edgeIndicatorVector = _edgeIndicatorVector;\n\n /// @}\n\n\n\n using ForestPredictor = predictors::ForestPredictor<SplitRuleType, EdgePredictorType>;\n\n\n\n /// <summary> Default Constructor </summary>\n\n ForestPredictorNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n","file_path":"libraries/nodes/include/ForestPredictorNode.h","rank":36,"score":262037.1745479429},{"content":" size_t removeLastLayers;\n","file_path":"tools/trainers/retargetTrainer/include/RetargetArguments.h","rank":37,"score":261364.306652297},{"content":" class ActivationLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using ActivationFunction = ActivationFunctionType<ElementType>;\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n\n\n /// <summary> Instantiates an instance of an activation layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n ActivationLayer(const LayerParameters& layerParameters);\n\n\n\n /// <summary> Instantiates an instance of an activation layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"activationFunction\"> The activation function. </param>\n\n ActivationLayer(const LayerParameters& layerParameters, ActivationFunctionType<ElementType> activation);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n ActivationLayer() {}\n","file_path":"libraries/predictors/neural/include/ActivationLayer.h","rank":38,"score":260742.54951058232},{"content":" class LSTMLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n\n\n /// <summary> Default constructor. </summary>\n\n LSTMLayer();\n\n\n\n /// <summary> Instantiates an instance of a LSTM layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"parameters\"> The weights and biases applicable to an LSTM. Weights should be organised as: [weights, recurrent layer weights] or [W, U].\n","file_path":"libraries/predictors/neural/include/LSTMLayer.h","rank":39,"score":260742.54951058232},{"content":" class ScalingLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::AssignValues;\n\n\n\n /// <summary> Instantiates an instance of a scaling layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"bias\"> The scaling values to apply to input values. </param>\n\n ScalingLayer(const LayerParameters& layerParameters, const VectorType& scales);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n ScalingLayer() {}\n\n\n\n /// <summary> Feeds the input forward through the layer. </summary>\n\n void Compute() override;\n\n\n","file_path":"libraries/predictors/neural/include/ScalingLayer.h","rank":40,"score":260742.54951058232},{"content":" class BiasLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n using Layer<ElementType>::AssignValues;\n\n\n\n /// <summary> Instantiates an instance of a bias layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"bias\"> The bias values to apply to input values. </param>\n\n BiasLayer(const LayerParameters& layerParameters, const VectorType& bias);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n BiasLayer() {}\n\n\n\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\n\n void Compute() override;\n","file_path":"libraries/predictors/neural/include/BiasLayer.h","rank":41,"score":260742.54951058232},{"content":" class ConvolutionalLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using TensorType = typename Layer<ElementType>::TensorType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n\n\n /// <summary> Instantiates an instance of a convolutional layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"convolutionalParameters\"> The hyperparameters for this convolutional layer. </param>\n\n /// <param name=\"weights\"> The set of weights to apply. </param>\n\n ConvolutionalLayer(const LayerParameters& layerParameters, const ConvolutionalParameters& convolutionalParameters, TensorType weights);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n","file_path":"libraries/predictors/neural/include/ConvolutionalLayer.h","rank":42,"score":260742.54951058232},{"content":" class GRULayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n\n\n /// <summary> Default constructor </summary>\n\n GRULayer();\n\n\n\n /// <summary> Instantiates an instance of a GRU layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"parameters\"> The weights and biases applicable to an GRU. Weights should be organised as: [weights, recurrent layer weights] or [W, U].\n","file_path":"libraries/predictors/neural/include/GRULayer.h","rank":43,"score":260742.54951058232},{"content":" class RecurrentLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using MatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n\n\n /// <summary> Default constructor </summary>\n\n RecurrentLayer();\n\n\n\n /// <summary> Instantiates an instance of a recurrent layer </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"weights\"> Weights for the layers should be in the form [Weights, Recurrent weights]. </param>\n","file_path":"libraries/predictors/neural/include/RecurrentLayer.h","rank":44,"score":260742.54951058232},{"content":" class SoftmaxLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::AssignValues;\n\n\n\n /// <summary> Instantiates an instance of a softmax layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n SoftmaxLayer(const LayerParameters& layerParameters);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n SoftmaxLayer() {}\n\n\n\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\n\n void Compute() override;\n\n\n\n /// <summary> Indicates the kind of layer. </summary>\n\n ///\n","file_path":"libraries/predictors/neural/include/SoftmaxLayer.h","rank":45,"score":260742.54951058232},{"content":" class PoolingLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using PoolingFunction = PoolingFunctionType<ElementType>;\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using Layer<ElementType>::GetLayerParameters;\n\n using Layer<ElementType>::GetInput;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::GetInputShapeMinusPadding;\n\n using Layer<ElementType>::GetOutputShapeMinusPadding;\n\n \n\n /// <summary> Instantiates an instance of a pooling layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"poolingParameters\"> Specifies the pooling characteristics of the layer. </param>\n\n PoolingLayer(const LayerParameters& layerParameters, PoolingParameters poolingParameters);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n PoolingLayer() {}\n\n\n","file_path":"libraries/predictors/neural/include/PoolingLayer.h","rank":46,"score":260742.54951058232},{"content":" class ConvolutionalLayer : public Layer<ElementType>\n\n {\n\n public:\n\n ConvolutionalLayer(const LayerParameters& layerParameters, const ConvolutionalParameters& convolutionalParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\n\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels), convolutionalParameters(convolutionalParameters)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::convolution; }\n\n\n\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\n\n const ConvolutionalParameters convolutionalParameters;\n\n };\n\n\n\n // Api projections for FullyConnectedLayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":47,"score":260573.26697308128},{"content":" class PoolingLayer : public Layer<ElementType>\n\n {\n\n public:\n\n PoolingLayer(const LayerParameters& layerParameters, const PoolingParameters& poolingParameters, PoolingType poolingType)\n\n : Layer<ElementType>(layerParameters), poolingType(poolingType), poolingParameters(poolingParameters)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::pooling; }\n\n\n\n const PoolingType poolingType;\n\n const PoolingParameters poolingParameters;\n\n };\n\n\n\n // Api projection for RegionDetectionLayer\n\n using RegionDetectionParameters = ell::predictors::neural::RegionDetectionParameters;\n\n\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":48,"score":260573.26697308128},{"content":" class SoftmaxLayer : public Layer<ElementType>\n\n {\n\n public:\n\n SoftmaxLayer(const LayerParameters& layerParameters)\n\n : Layer<ElementType>(layerParameters)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::softmax; }\n\n };\n\n\n\n // Api projection for ScalingLayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":49,"score":260573.26697308128},{"content":" class BiasLayer : public Layer<ElementType>\n\n {\n\n public:\n\n BiasLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& bias)\n\n : Layer<ElementType>(layerParameters), bias(bias)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::bias; }\n\n\n\n const std::vector<ElementType> bias;\n\n };\n\n\n\n // Api projections for BinaryConvolutionalLayer\n\n using BinaryConvolutionMethod = ell::predictors::neural::BinaryConvolutionMethod;\n\n using BinaryConvolutionalParameters = ell::predictors::neural::BinaryConvolutionalParameters;\n\n\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":50,"score":260573.26697308128},{"content":" class GRULayer : public Layer<ElementType>\n\n {\n\n public:\n\n GRULayer(const LayerParameters& layerParameters,\n\n const ell::api::math::Tensor<ElementType>& updateWeightsTensor,\n\n const ell::api::math::Tensor<ElementType>& resetWeightsTensor,\n\n const ell::api::math::Tensor<ElementType>& hiddenWeightsTensor,\n\n const ell::api::math::Tensor<ElementType>& updateBiasTensor,\n\n const ell::api::math::Tensor<ElementType>& resetBiasTensor,\n\n const ell::api::math::Tensor<ElementType>& hiddenBiasTensor,\n\n ActivationType activation,\n\n ActivationType recurrentActivation)\n\n : Layer<ElementType>(layerParameters),\n\n updateWeights(updateWeightsTensor),\n\n resetWeights(resetWeightsTensor),\n\n hiddenWeights(hiddenWeightsTensor),\n\n updateBias(updateBiasTensor),\n\n resetBias(resetBiasTensor),\n\n hiddenBias(hiddenBiasTensor),\n\n activation(activation), recurrentActivation(recurrentActivation)\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":51,"score":260573.26697308128},{"content":" class LSTMLayer : public Layer<ElementType>\n\n {\n\n public:\n\n LSTMLayer(const LayerParameters& layerParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\n\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::lstm; }\n\n\n\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\n\n };\n\n\n\n // Api projections for PoolingLayer\n\n using PoolingParameters = ell::predictors::neural::PoolingParameters;\n\n\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":52,"score":260573.26697308128},{"content":" class ActivationLayer : public Layer<ElementType>\n\n {\n\n public:\n\n ActivationLayer(const LayerParameters& layerParameters, ActivationType activation)\n\n : Layer<ElementType>(layerParameters), activation(activation)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::activation; }\n\n\n\n const ActivationType activation;\n\n };\n\n\n\n // Api projection for PReLUActivationLayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":53,"score":260573.26697308128},{"content":" class ScalingLayer : public Layer<ElementType>\n\n {\n\n public:\n\n ScalingLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& scales)\n\n : Layer<ElementType>(layerParameters), scales(scales)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::scaling; }\n\n\n\n const std::vector<ElementType> scales;\n\n };\n\n}\n\n}\n\n}\n\n}\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":54,"score":260573.26697308128},{"content":" bool isInterleavedOrder;\n\n };\n\n\n\nprotected:\n\n void Compute() const override;\n\n bool Refine(model::ModelTransformer& transformer) const override;\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n\nprivate:\n\n NeuralNetworkLayerNodeBase<ValueType>* AddLayerNode(model::ModelTransformer& transformer, Layer& layer, const model::PortElements<ValueType>& layerInputs, const NetworkCompileOptions& options, NetworkCompileState& state) const;\n\n\n\n // Input\n\n model::InputPort<ValueType> _input;\n\n\n\n // Output\n\n model::OutputPort<ValueType> _output;\n\n\n\n // Pointer to the predictor\n\n PredictorType _predictor;\n\n};\n\n}\n\n}\n\n\n\n#include \"../tcc/NeuralNetworkPredictorNode.tcc\"\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":55,"score":259017.03643690885},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: NeuralNetworkPredictorNode.h (nodes)\n\n// Authors: Chuck Jacobs, Byron Changuion\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n#pragma once\n\n\n\n// model\n\n#include \"Model.h\"\n\n#include \"ModelTransformer.h\"\n\n#include \"Node.h\"\n\n\n\n// nodes\n\n#include \"ActivationLayerNode.h\"\n\n#include \"BatchNormalizationLayerNode.h\"\n\n#include \"BiasLayerNode.h\"\n\n#include \"BinaryConvolutionalLayerNode.h\"\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":56,"score":259008.0375335537},{"content":"// utilities\n\n#include \"TypeName.h\"\n\n\n\n// stl\n\n#include <functional>\n\n#include <string>\n\n#include <type_traits>\n\n\n\nnamespace ell\n\n{\n\nnamespace nodes\n\n{\n\n/// <summary> A node that represents a neural network. </summary>\n\ntemplate <typename ValueType>\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":57,"score":258991.72538586232},{"content":"\n\n /// <summary> Makes a copy of this node in the model being constructed by the transformer </summary>\n\n void Copy(model::ModelTransformer& transformer) const override;\n\n\n\n /// <summary> Options to control how the network is compiled into nodes </summary>\n\n struct NetworkCompileOptions\n\n {\n\n /// <summary> Use diagonal convolution (vs. im2col-based convolution)\n\n bool useDiagonalConvolution;\n\n\n\n /// <summary> Ensure the output of the nodes implementing a layer is in the canonical row, column, channel order </summary>\n\n bool alwaysConvertToInterleaved;\n\n\n\n /// <summary> When using im2col-based convolution, construct the transpose of the receptive field matrix </summary>\n\n bool transposeReceptiveFieldMatrix;\n\n };\n\n\n\n struct NetworkCompileState\n\n {\n\n /// <summary> Indicates the current order of input data. If `true`, it's in the canonical row, column, channel order. </summary>\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":58,"score":258988.05125744708},{"content":"#include \"ConvolutionalLayerNode.h\"\n\n#include \"FullyConnectedLayerNode.h\"\n\n#include \"GRULayerNode.h\"\n\n#include \"LSTMLayerNode.h\"\n\n#include \"PoolingLayerNode.h\"\n\n#include \"RegionDetectionLayerNode.h\"\n\n#include \"ScalingLayerNode.h\"\n\n#include \"SoftmaxLayerNode.h\"\n\n\n\n// predictors\n\n#include \"NeuralNetworkPredictor.h\"\n\n\n\n// activation and pooling functions\n\n#include \"LeakyReLUActivation.h\"\n\n#include \"MaxPoolingFunction.h\"\n\n#include \"MeanPoolingFunction.h\"\n\n#include \"ParametricReLUActivation.h\"\n\n#include \"ReLUActivation.h\"\n\n#include \"SigmoidActivation.h\"\n\n\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":59,"score":258985.49222832304},{"content":"\n\n /// <summary> Returns the underlying predictor </summary>\n\n ///\n\n /// <returns> The predictor wrapped by this node </returns>\n\n const PredictorType& GetPredictor() const { return _predictor; }\n\n\n\n /// <summary> Returns the underlying predictor </summary>\n\n ///\n\n /// <returns> The predictor wrapped by this node </returns>\n\n PredictorType& GetPredictor() { return _predictor; }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\"NeuralNetworkPredictorNode\"); }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\n","file_path":"libraries/nodes/include/NeuralNetworkPredictorNode.h","rank":60,"score":258978.9020015295},{"content":"\n\n /// <summary> Gets the LayerParameters from the layer wrapped by this node </summary>\n\n virtual typename predictors::neural::Layer<ValueType>::LayerParameters GetLayerParameters() const = 0;\n\n\n\n /// <summary> Get the input padding requested by the layer </summary>\n\n predictors::neural::PaddingParameters GetRequestedInputPadding() const { return GetLayerParameters().inputPaddingParameters; }\n\n\n\n /// <summary> Get the output padding requested by the layer </summary>\n\n predictors::neural::PaddingParameters GetRequestedOutputPadding() const { return GetLayerParameters().inputPaddingParameters; }\n\n\n\n /// <summary> Get the size of the output port </summary>\n\n size_t GetOutputSize() const { return _output.Size(); }\n\n\n\n protected:\n\n NeuralNetworkLayerNodeBase();\n\n NeuralNetworkLayerNodeBase(const model::PortElements<ValueType>& input, const NeuralNetworkLayerNodeParameters& parameters, size_t outputSize);\n\n\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":61,"score":258797.04883073023},{"content":" model::PortMemoryLayout CalculateMemoryLayout(size_t padding, typename predictors::neural::Layer<ValueType>::Shape dataBufferSize);\n\n void Copy(model::ModelTransformer& transformer) const override;\n\n void Compute() const override;\n\n utilities::ArchiveVersion GetArchiveVersion() const override;\n\n bool CanReadArchiveVersion(const utilities::ArchiveVersion& version) const override;\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n\n using NeuralNetworkLayerNodeBase<ValueType>::_input;\n\n using NeuralNetworkLayerNodeBase<ValueType>::_output;\n\n\n\n mutable typename LayerType::TensorType _inputTensor;\n\n mutable LayerType _layer; // mutable to get around Compute being non-const\n\n bool HasState() const override { return true; } // stored state: inputLayout, outputLayout\n\n\n\n private:\n\n model::PortMemoryLayout _inputLayout;\n\n model::PortMemoryLayout _outputLayout;\n\n math::TensorShape _inputShape;\n\n };\n\n\n\n // helper:\n\n template <typename LayerType>\n\n typename LayerType::LayerParameters GetLayerNodeParameters(const typename LayerType::TensorType& inputTensor, const typename LayerType::LayerParameters& layerParameters);\n\n}\n\n}\n\n\n\n#include \"../tcc/NeuralNetworkLayerNode.tcc\"\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":62,"score":258796.93298120855},{"content":" // Input\n\n model::InputPort<ValueType> _input;\n\n\n\n // Output\n\n model::OutputPort<ValueType> _output;\n\n\n\n NeuralNetworkLayerNodeParameters _parameters;\n\n };\n\n\n\n /// <summary> Base class for neural network layer nodes. </summary\n\n template <typename DerivedType, typename NodeLayerType, typename ValueType>\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":63,"score":258794.33529668953},{"content":"\n\n// stl\n\n#include <string>\n\n#include <type_traits>\n\n\n\nnamespace ell\n\n{\n\nnamespace nodes\n\n{\n\n /// <summary> Parameters to influence how neural network layers behave when embedded as nodes in a graph </summary>\n\n struct NeuralNetworkLayerNodeParameters\n\n {\n\n bool includePaddingInInputData;\n\n };\n\n\n\n /// <summary> Base class for neural network layer nodes. </summary\n\n template <typename ValueType>\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":64,"score":258789.98696103969},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: NeuralNetworkLayerNode.h (nodes)\n\n// Authors: Chuck Jacobs\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n#pragma once\n\n\n\n// model\n\n#include \"CompilableNode.h\"\n\n#include \"IRMapCompiler.h\"\n\n#include \"Model.h\"\n\n#include \"ModelTransformer.h\"\n\n#include \"Node.h\"\n\n#include \"PortMemoryLayout.h\"\n\n\n\n// predictors\n\n#include \"Layer.h\"\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":65,"score":258786.72888685885},{"content":" /// <summary> Gets the layer being wrapped </summary>\n\n const LayerType& GetLayer() const { return _layer; }\n\n\n\n /// <summary> Gets information about the input memory layout </summary>\n\n model::PortMemoryLayout& GetInputMemoryLayout() override { return _inputLayout; }\n\n\n\n /// <summary> Gets information about the input memory layout </summary>\n\n const model::PortMemoryLayout& GetInputMemoryLayout() const override { return _inputLayout; }\n\n\n\n /// <summary> Gets information about the output memory layout </summary>\n\n const model::PortMemoryLayout& GetOutputMemoryLayout() const override { return _outputLayout; }\n\n\n\n /// <summary> Gets information about the output memory layout </summary>\n\n model::PortMemoryLayout& GetOutputMemoryLayout() override { return _outputLayout; }\n\n\n\n /// <summary> Gets the LayerParameters from the layer wrapped by this node </summary>\n\n typename predictors::neural::Layer<ValueType>::LayerParameters GetLayerParameters() const override { return _layer.GetLayerParameters(); }\n\n\n\n protected:\n\n size_t NumInputDimensions() const { return _inputLayout.NumDimensions(); }\n","file_path":"libraries/nodes/include/NeuralNetworkLayerNode.h","rank":66,"score":258780.22991951753},{"content":" class BinaryReceptiveFieldMatrixNode : public model::CompilableNode\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<ValueType>& input = _input;\n\n const model::OutputPort<PackedBitsType>& output = _output;\n\n /// @}\n\n\n\n /// <summary></summary>\n\n BinaryReceptiveFieldMatrixNode();\n\n\n\n /// <summary></summary>\n\n BinaryReceptiveFieldMatrixNode(const model::PortElements<ValueType>& input,\n\n const predictors::neural::BinaryConvolutionalParameters& convolutionalParameters,\n\n const model::PortMemoryLayout& inputMemoryLayout,\n\n const model::PortMemoryLayout& outputMemoryLayout);\n\n\n\n /// <summary> Gets information about the input memory layout </summary>\n\n const model::PortMemoryLayout& GetInputMemoryLayout() const { return _inputMemoryLayout; }\n","file_path":"libraries/nodes/include/BinaryConvolutionalLayerNode.h","rank":67,"score":257942.98407392},{"content":" class Model;\n\n\n","file_path":"libraries/model/include/PortElements.h","rank":68,"score":255467.4513407666},{"content":" class RegionDetectionLayer : public Layer<ElementType>\n\n {\n\n public:\n\n RegionDetectionLayer(const LayerParameters& layerParameters, const RegionDetectionParameters& detectionParameters)\n\n : Layer<ElementType>(layerParameters), detectionParameters(detectionParameters)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::region; }\n\n\n\n const RegionDetectionParameters detectionParameters;\n\n };\n\n\n\n // Api projection for SoftmaxLayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":69,"score":255039.67817572076},{"content":" class FullyConnectedLayer : public Layer<ElementType>\n\n {\n\n public:\n\n FullyConnectedLayer(const LayerParameters& layerParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\n\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels)\n\n {\n\n }\n\n\n\n LayerType GetLayerType() const override { return LayerType::fullyConnected; }\n\n\n\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\n\n };\n\n\n\n // Api projections for GRULayer\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":70,"score":255039.67817572076},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: InputLayer.h (neural)\n\n// Authors: Byron Changuion\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n#pragma once\n\n#include \"Layer.h\"\n\n\n\n// stl\n\n#include <vector>\n\n\n\nnamespace ell\n\n{\n\nnamespace predictors\n\n{\n\nnamespace neural\n\n{\n\n \n\n\n\n /// <summary> An input layer in a neural network. This is the only layer type that takes input from an external source, and not from the output of another layer.\n\n /// This must be the first layer in the list of layers that get set on a Neural Predictor.\n\n /// </summary>\n\n template <typename ElementType>\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":71,"score":254735.86130036027},{"content":"\n\n protected:\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n\n private:\n\n using Layer<ElementType>::_layerParameters;\n\n using Layer<ElementType>::_output;\n\n\n\n VectorType _scale;\n\n TensorType _data;\n\n };\n\n\n\n}\n\n}\n\n}\n\n\n\n#include \"../tcc/InputLayer.tcc\"\n\n\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":72,"score":254716.47098053718},{"content":"\n\n /// <summary> The padding requirements for the input. </summary>\n\n PaddingParameters inputPaddingParameters;\n\n\n\n /// <summary> The extents of the tensor in logical order (row, column, channel). This size includes padding. </summary>\n\n Shape outputShape;\n\n\n\n /// <summary> The padding requirements for the output. </summary>\n\n PaddingParameters outputPaddingParameters;\n\n\n\n /// <summary> The scale factor to apply to each input value. Default is undefined. </summary>\n\n ElementType scale;\n\n };\n\n\n\n /// <summary> Instantiates an instance of an input layer. </summary>\n\n ///\n\n /// <param name=\"inputParameters\"> The parameters for the input layer. </param>\n\n /// <param name=\"inputParameters\"> </param>\n\n InputLayer(const InputParameters& inputParameters);\n\n\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":73,"score":254711.70863190823},{"content":" /// <returns> The output tensor. </returns>\n\n const TensorType& GetInput() const { return _data; }\n\n\n\n /// <summary> Feeds the input forward through the layer. </summary>\n\n void Compute() override;\n\n\n\n /// <summary> Indicates the kind of layer. </summary>\n\n ///\n\n /// <returns> An enum indicating the layer type. </returns>\n\n LayerType GetLayerType() const override { return LayerType::input; }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\"InputLayer\"); }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":74,"score":254709.8260373206},{"content":" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n InputLayer() : _data(0, 0, 0) {}\n\n\n\n /// <summary> Sets the input. </summary>\n\n ///\n\n /// <param name=\"input\"> Copies the input vector to the input tensor. </param>\n\n void SetInput(const DataVectorType& input);\n\n\n\n /// <summary> Sets the input. </summary>\n\n ///\n\n /// <param name=\"input\"> Copies the input vector to the input tensor. </param>\n\n void SetInput(const std::vector<ElementType>& input);\n\n\n\n /// <summary> Gets a writeable reference to the input. </summary>\n\n ///\n\n /// <returns> The output tensor. </returns>\n\n TensorType& GetInput() { return _data; }\n\n\n\n /// <summary> Gets a const reference to the input. </summary>\n\n ///\n","file_path":"libraries/predictors/neural/include/InputLayer.h","rank":75,"score":254705.3382576544},{"content":" class L2NormSquaredNode : public model::Node\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<ValueType>& input = _input;\n\n const model::OutputPort<ValueType>& output = _output;\n\n /// @}\n\n\n\n /// <summary> Default Constructor </summary>\n\n L2NormSquaredNode();\n\n\n\n /// <summary> Constructor </summary>\n\n /// <param name=\"input\"> The signal to take the squared magnitude of </param>\n\n L2NormSquaredNode(const model::PortElements<ValueType>& input);\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\"L2NormSquaredNode\"); }\n","file_path":"libraries/nodes/include/L2NormSquaredNode.h","rank":76,"score":254299.1378680695},{"content":" /// <summary> A node that represents a single-element threshold predictor. </summary>\n\n class SingleElementThresholdNode : public model::Node\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<double>& input = _input;\n\n const model::OutputPort<bool>& output = _output;\n\n /// @}\n\n\n\n using SingleElementThresholdPredictor = predictors::SingleElementThresholdPredictor;\n\n\n\n /// <summary> Default Constructor </summary>\n\n SingleElementThresholdNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n\n /// <param name=\"input\"> The signal to predict from </param>\n\n /// <param name=\"predictor\"> The linear predictor to use when making the prediction. </param>\n\n SingleElementThresholdNode(const model::PortElements<double>& input, const SingleElementThresholdPredictor& predictor);\n\n\n","file_path":"libraries/nodes/include/SingleElementThresholdNode.h","rank":77,"score":254186.84043733255},{"content":" class RecurrentLayerNode : public NeuralNetworkLayerNode<RecurrentLayerNode<ValueType, ActivationFunctionType>, predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>;\n\n using BaseType = NeuralNetworkLayerNode<RecurrentLayerNode<ValueType, ActivationFunctionType>, predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n RecurrentLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n RecurrentLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>& layer);\n\n\n","file_path":"libraries/nodes/include/RecurrentLayerNode.h","rank":78,"score":254150.15071432496},{"content":" class PoolingLayerNode : public NeuralNetworkLayerNode<PoolingLayerNode<ValueType, PoolingFunctionType>, predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>, ValueType>\n\n {\n\n public:\n\n using LayerType = predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>;\n\n using BaseType = NeuralNetworkLayerNode<PoolingLayerNode<ValueType, PoolingFunctionType>, LayerType, ValueType>;\n\n\n\n /// @name Input and Output Ports\n\n /// @{\n\n using BaseType::input;\n\n using BaseType::output;\n\n /// @}\n\n\n\n PoolingLayerNode() = default;\n\n\n\n /// <summary> Constructor from a layer. </summary>\n\n ///\n\n /// <param name=\"input\"> The input to the layer. </param>\n\n /// <param name=\"layer\"> The bias layer to wrap. </param>\n\n PoolingLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>& layer);\n\n\n","file_path":"libraries/nodes/include/PoolingLayerNode.h","rank":79,"score":254150.150714325},{"content":" /// <summary> A node that represents a ProtoNN predictor. </summary>\n\n class ProtoNNPredictorNode : public model::Node\n\n {\n\n public:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<double>& input = _input;\n\n const model::OutputPort<double>& output = _output;\n\n\n\n /// @}\n\n\n\n using ProtoNNPredictor = predictors::ProtoNNPredictor;\n\n\n\n /// <summary> Default Constructor </summary>\n\n ProtoNNPredictorNode();\n\n\n\n /// <summary> Constructor </summary>\n\n ///\n\n /// <param name=\"input\"> The signal to predict from </param>\n\n /// <param name=\"outputSize\">The size of the output vector</param>\n\n /// <param name=\"predictor\"> The ProtoNN predictor to use when making the prediction. </param>\n","file_path":"libraries/nodes/include/ProtoNNPredictorNode.h","rank":80,"score":254034.8906439876},{"content":"void TestInputLayerNode(size_t outputPadding = 0);\n","file_path":"libraries/model/test/include/CompilableNodesTest.h","rank":81,"score":252353.92819993934},{"content":" class Layer\n\n {\n\n public:\n\n Layer(const LayerParameters& layerParameters)\n\n : parameters(layerParameters) {}\n\n virtual ~Layer() {}\n\n\n\n virtual LayerType GetLayerType() const = 0;\n\n\n\n template <class LayerType>\n\n LayerType& As()\n\n {\n\n return *(dynamic_cast<LayerType*>(this));\n\n }\n\n\n\n template <class LayerType>\n\n bool Is()\n\n {\n\n return dynamic_cast<LayerType*>(this) != nullptr;\n\n }\n\n\n\n const LayerParameters parameters;\n\n };\n\n\n","file_path":"interfaces/common/include/NeuralLayersInterface.h","rank":82,"score":250020.44971598458},{"content":" class RegionDetectionLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using Base = Layer<ElementType>;\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n\n\n /// <summary> Instantiates an instance of a region detection layer. </summary>\n\n ///\n\n /// <param name=\"regionDetectionParams\"> The parameters desribing the configuration of this layer. </param>\n\n /// <param name=\"anchorScales\"> The values to scale the width and height for each of the anchor regions.\n\n /// The number of elements should equal 2 x numBoxesPerCell. </param>\n\n RegionDetectionLayer(const LayerParameters& layerParameters, RegionDetectionParameters regionDetectionParamss);\n\n\n\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n RegionDetectionLayer() : _regionDetectionParams({}) {}\n\n\n\n /// <summary> Feeds the input forward through the layer </summary>\n\n void Compute() override;\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n","file_path":"libraries/predictors/neural/include/RegionDetectionLayer.h","rank":83,"score":249938.1486966953},{"content":" class FullyConnectedLayer : public Layer<ElementType>\n\n {\n\n public:\n\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\n\n using VectorType = typename Layer<ElementType>::VectorType;\n\n using MatrixType = typename Layer<ElementType>::MatrixType;\n\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\n\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\n\n using Layer<ElementType>::GetOutputMinusPadding;\n\n using Layer<ElementType>::NumOutputRowsMinusPadding;\n\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\n\n using Layer<ElementType>::NumOutputChannels;\n\n\n\n /// <summary> Instantiates an instance of a fully connected layer. </summary>\n\n ///\n\n /// <param name=\"layerParameters\"> The parameters common to every layer. </param>\n\n /// <param name=\"weights\"> The weights to apply as a matrix in rowMajor order, where number of rows equals output neurons\n\n /// and columns represent input (in logical Tensor order: row, column, channel). </param>\n\n FullyConnectedLayer(const LayerParameters& layerParameters, ConstMatrixReferenceType& weights);\n\n\n","file_path":"libraries/predictors/neural/include/FullyConnectedLayer.h","rank":84,"score":249938.1486966953},{"content":" class Port;\n\n\n","file_path":"libraries/model/include/Node.h","rank":85,"score":248437.84052759103},{"content":" class Node;\n\n\n","file_path":"libraries/model/include/Port.h","rank":86,"score":248382.663799053},{"content":" def get_output_port_elements_for_node(self, ell_node: ell.nodes.Node,\n\n output_label: str = \"output\"):\n\n \"\"\"\n\n Returns an ell.nodes.PortElements for the corresponding ELL node's \n\n output port that corresponds to 'output_label'.\n\n \"\"\"\n\n try:\n\n output_link = ell_node.GetOutputPort(output_label)\n\n except BaseException as exception:\n\n raise Exception(\"Cannot get output port {} for {}\".format(output_label, ell_node.GetId()))\n","file_path":"tools/importers/common/converters.py","rank":87,"score":247306.19235321108},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: BatchNormalizationLayer.h (neural)\n\n// Authors: Byron Changuion\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n#pragma once\n\n#include \"Layer.h\"\n\n\n\nnamespace ell\n\n{\n\nnamespace predictors\n\n{\n\n namespace neural\n\n {\n\n /// <summary> Indicates what term the epsilon will be added to in the denominator. </summary>\n","file_path":"libraries/predictors/neural/include/BatchNormalizationLayer.h","rank":88,"score":246411.36310892765},{"content":" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n BatchNormalizationLayer() {}\n\n\n\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\n\n void Compute() override;\n\n\n\n /// <summary> Indicates the kind of layer. </summary>\n\n ///\n\n /// <returns> An enum indicating the layer type. </returns>\n\n LayerType GetLayerType() const override { return LayerType::batchNormalization; }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\"BatchNormalizationLayer\"); }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\n","file_path":"libraries/predictors/neural/include/BatchNormalizationLayer.h","rank":89,"score":246403.32705876481},{"content":"\n\n /// <summary> Returns the value to scale the output by. </summary>\n\n ///\n\n /// <returns> The value to scale the output by. </returns>\n\n const VectorType& GetScale() const { return _multiplicationValues; }\n\n\n\n /// <summary> Returns the value to offset the output by. </summary>\n\n ///\n\n /// <returns> The value to offset the output by. </returns>\n\n const VectorType& GetBias() const { return _additionValues; }\n\n\n\n protected:\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n\n private:\n\n using Layer<ElementType>::_layerParameters;\n\n using Layer<ElementType>::_output;\n\n\n\n VectorType _multiplicationValues;\n","file_path":"libraries/predictors/neural/include/BatchNormalizationLayer.h","rank":90,"score":246394.6067342252},{"content":" VectorType _additionValues;\n\n ElementType _epsilon; // To ensure non-zero division, this is added to denominator\n\n EpsilonSummand _epsilonSummand;\n\n };\n\n }\n\n}\n\n}\n\n\n\n#include \"../tcc/BatchNormalizationLayer.tcc\"\n","file_path":"libraries/predictors/neural/include/BatchNormalizationLayer.h","rank":91,"score":246383.3648508628},{"content":"#include \"NeuralLayersInterface.h\"\n\n#endif\n\n\n\nnamespace ell\n\n{\n\nnamespace api\n\n{\n\nnamespace predictors\n\n{\n\n //\n\n // API classes for the neural predictor\n\n //\n\n template <typename ElementType>\n","file_path":"interfaces/common/include/NeuralNetworkPredictorInterface.h","rank":92,"score":246360.73054694297},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: NeuralNetworkPredictorInterface.h (interfaces)\n\n// Authors: Byron Changuion\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n#pragma once\n\n\n\n#ifndef SWIG\n\n\n\n// neural network predictor\n\n#include \"NeuralNetworkPredictor.h\"\n\n\n\n// stl\n\n#include <string>\n\n#include <vector>\n\n\n\n// apis\n\n#include \"MathInterface.h\"\n","file_path":"interfaces/common/include/NeuralNetworkPredictorInterface.h","rank":93,"score":246350.66987462575},{"content":"#endif\n\n\n\nprivate:\n\n \n\n#ifndef SWIG\n\n template <typename DerivedLayer>\n\n static auto& LayerAs(Layer* layer);\n\n\n\n static void AddLayer(Layer* layer, const std::unique_ptr<UnderlyingInputLayer>& underlyingInputLayer, UnderlyingLayers& underlyingLayers);\n\n\n\n // Specific layer factory functions\n\n static std::unique_ptr<UnderlyingLayer> CreateActivationLayer(neural::ActivationLayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\n\n\n\n template <template <typename> class ActivationFunctionType, template <typename> class RecurrentActivationFunctionType>\n\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\n\n \n\n template <template <typename> class ActivationFunctionType>\n\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\n\n \n\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\n","file_path":"interfaces/common/include/NeuralNetworkPredictorInterface.h","rank":94,"score":246350.60898738066},{"content":"\n\n#endif\n\n\n\n std::shared_ptr<UnderlyingPredictor> _predictor;\n\n };\n\n}\n\n}\n\n}\n\n\n\n#include \"../tcc/NeuralNetworkPredictorInterface.tcc\"\n","file_path":"interfaces/common/include/NeuralNetworkPredictorInterface.h","rank":95,"score":246338.749038451},{"content":"////////////////////////////////////////////////////////////////////////////////////////////////////\n\n//\n\n// Project: Embedded Learning Library (ELL)\n\n// File: BinaryConvolutionalLayer.h (neural)\n\n// Authors: Byron Changuion\n\n//\n\n////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n#pragma once\n\n#include \"Layer.h\"\n\n#include \"ConvolutionalLayer.h\"\n\n\n\n// math\n\n#include \"Matrix.h\"\n\n\n\nnamespace ell\n\n{\n\nnamespace predictors\n\n{\n\nnamespace neural\n\n{\n\n /// <summary> The method for performing binary convolutions. </summary>\n","file_path":"libraries/predictors/neural/include/BinaryConvolutionalLayer.h","rank":96,"score":246325.99409837704},{"content":" // Fills a matrix (backed by the array outputMatrix) where the columns the set of input values corresponding to a filter, stretched into a vector.\n\n // The number of columns is equal to the number of locations that a filter is slide over the input tensor.\n\n void ReceptiveFieldToColumns(ConstTensorReferenceType input, MatrixType& shapedInput);\n\n\n\n // Returns whether input zero padding is enabled\n\n bool HasInputZeroPadding() const;\n\n\n\n // Returns whether the row, column indices correspond to input zero padding\n\n bool IsInputZeroPadding(size_t row, size_t column) const;\n\n\n\n void ComputeWeightsMatrices(const ConstTensorReferenceType& weights);\n\n void ComputeRealValuedWeightsMatrix();\n\n void ComputeShapedInputPaddingMask();\n\n void InitializeIOMatrices();\n\n\n\n using Layer<ElementType>::_layerParameters;\n\n using Layer<ElementType>::_output;\n\n\n\n constexpr static size_t _binaryElementSize = 64;\n\n BinaryConvolutionalParameters _convolutionalParameters;\n","file_path":"libraries/predictors/neural/include/BinaryConvolutionalLayer.h","rank":97,"score":246325.30653484084},{"content":" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\n\n BinaryConvolutionalLayer() : _realValuedShapedInputMatrix(0, 0), _realValuedWeightsMatrix(0, 0), _realValuedOutputMatrix(0, 0) {}\n\n\n\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\n\n void Compute() override;\n\n\n\n /// <summary> Indicates the kind of layer. </summary>\n\n ///\n\n /// <returns> An enum indicating the layer type. </returns>\n\n LayerType GetLayerType() const override { return LayerType::binaryConvolution; }\n\n\n\n /// <summary> Get the parameters used to control convolution. </summary>\n\n ///\n\n /// <returns> A BinaryConvolutionalParameters struct. </returns>\n\n const BinaryConvolutionalParameters& GetConvolutionalParameters() const { return _convolutionalParameters; }\n\n\n\n /// <summary> Get the weights for the convolution filters. </summary>\n\n ///\n\n /// <returns> The weights, packed into a Tensor. </returns>\n\n const MatrixType& GetRealFilterWeights() const { return _realValuedWeightsMatrix; }\n","file_path":"libraries/predictors/neural/include/BinaryConvolutionalLayer.h","rank":98,"score":246314.58751283484},{"content":"\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\"BinaryConvolutionalLayer\"); }\n\n\n\n /// <summary> Gets the name of this type (for serialization). </summary>\n\n ///\n\n /// <returns> The name of this type. </returns>\n\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\n\n\n\n protected:\n\n void WriteToArchive(utilities::Archiver& archiver) const override;\n\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\n\n\n\n private:\n\n // Fills a vector of vectors where each row is the set of input values corresponding to a filter, stretched into a vector.\n\n // The number of vectors is equal to the number of locations that the filter is slid over the input tensor.\n\n void ReceptiveFieldToBinaryRows(ConstTensorReferenceType input, std::vector<std::vector<uint64_t>>& shapedInput);\n\n\n","file_path":"libraries/predictors/neural/include/BinaryConvolutionalLayer.h","rank":99,"score":246307.67780630264}],"string":"[\n {\n \"content\": \"class NeuralNetworkPredictorNode : public model::Node\\n\\n{\\n\\npublic:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<ValueType>& input = _input;\\n\\n const model::OutputPort<ValueType>& output = _output;\\n\\n /// @}\\n\\n\\n\\n using PredictorType = typename predictors::NeuralNetworkPredictor<ValueType>;\\n\\n using Layer = typename predictors::neural::Layer<ValueType>;\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n NeuralNetworkPredictorNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The signal to predict from </param>\\n\\n /// <param name=\\\"predictor\\\"> The predictor to use when making the prediction. </param>\\n\\n NeuralNetworkPredictorNode(const model::PortElements<ValueType>& input, const PredictorType& predictor);\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 0,\n \"score\": 364894.67257152253\n },\n {\n \"content\": \" class NeuralNetworkLayerNodeBase : public model::CompilableNode\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<ValueType>& input = _input;\\n\\n const model::OutputPort<ValueType>& output = _output;\\n\\n /// @}\\n\\n\\n\\n /// <summary> Gets information about the input memory layout </summary>\\n\\n virtual model::PortMemoryLayout& GetInputMemoryLayout() = 0;\\n\\n\\n\\n /// <summary> Gets information about the input memory layout </summary>\\n\\n virtual const model::PortMemoryLayout& GetInputMemoryLayout() const = 0;\\n\\n\\n\\n /// <summary> Gets information about the output memory layout </summary>\\n\\n virtual const model::PortMemoryLayout& GetOutputMemoryLayout() const = 0;\\n\\n\\n\\n /// <summary> Gets information about the output memory layout </summary>\\n\\n virtual model::PortMemoryLayout& GetOutputMemoryLayout() = 0;\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 1,\n \"score\": 326306.6461136015\n },\n {\n \"content\": \" class LinearPredictorNode : public model::Node\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n static constexpr const char* weightedElementsPortName = \\\"weightedElements\\\";\\n\\n const model::InputPort<ElementType>& input = _input;\\n\\n const model::OutputPort<ElementType>& output = _output;\\n\\n const model::OutputPort<ElementType>& weightedElements = _weightedElements;\\n\\n /// @}\\n\\n\\n\\n using LinearPredictorType = typename predictors::LinearPredictor<ElementType>;\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n LinearPredictorNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The signal to predict from </param>\\n\\n /// <param name=\\\"predictor\\\"> The linear predictor to use when making the prediction. </param>\\n\",\n \"file_path\": \"libraries/nodes/include/LinearPredictorNode.h\",\n \"rank\": 2,\n \"score\": 319689.4142621102\n },\n {\n \"content\": \" class BatchNormalizationLayerNode : public NeuralNetworkLayerNode<BatchNormalizationLayerNode<ValueType>, predictors::neural::BatchNormalizationLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::BatchNormalizationLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<BatchNormalizationLayerNode<ValueType>, predictors::neural::BatchNormalizationLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n BatchNormalizationLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The batch normalization layer to wrap. </param>\\n\\n BatchNormalizationLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BatchNormalizationLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/BatchNormalizationLayerNode.h\",\n \"rank\": 3,\n \"score\": 319290.28798345575\n },\n {\n \"content\": \" class BinaryConvolutionalLayerNode : public NeuralNetworkLayerNode<BinaryConvolutionalLayerNode<ValueType>, predictors::neural::BinaryConvolutionalLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::BinaryConvolutionalLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<BinaryConvolutionalLayerNode<ValueType>, predictors::neural::BinaryConvolutionalLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n BinaryConvolutionalLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n BinaryConvolutionalLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BinaryConvolutionalLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/BinaryConvolutionalLayerNode.h\",\n \"rank\": 4,\n \"score\": 319189.383427211\n },\n {\n \"content\": \" class InputLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n\\n\\n using Shape = typename Layer<ElementType>::Shape;\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using TensorType = typename Layer<ElementType>::TensorType;\\n\\n using DataVectorType = typename Layer<ElementType>::DataVectorType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n using Layer<ElementType>::AssignValues;\\n\\n\\n\\n /// <summary> Parameters common to all layers. </summary>\\n\\n struct InputParameters\\n\\n {\\n\\n /// <summary> Shape of the input tensor. </summary>\\n\\n Shape inputShape;\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 5,\n \"score\": 318387.82625474787\n },\n {\n \"content\": \"struct hash<ell::model::PortElementBase>\\n\\n{\\n\\n using argument_type = ell::model::PortElementBase;\\n\\n using result_type = std::size_t;\\n\\n\\n\\n /// <summary> Computes a hash of the input value. </summary>\\n\\n ///\\n\\n /// <returns> A hash value for the given input. </returns>\\n\\n result_type operator()(argument_type const& id) const;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"libraries/model/include/PortElements.h\",\n \"rank\": 6,\n \"score\": 312938.78851706104\n },\n {\n \"content\": \" class BatchNormalizationLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n using Layer<ElementType>::AssignValues;\\n\\n\\n\\n /// <summary> Instantiates an instance of a batch normalization layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"mean\\\"> The mean values. </param>\\n\\n /// <param name=\\\"variance\\\"> The variance values. </param>\\n\\n /// <param name=\\\"epsilon\\\"> The epsilon added to the denominator to avoid division by zero. </param>\\n\\n /// <param name=\\\"EpsilonSummand\\\"> Which component will the epsilon will be applied to the denominator. </param>\\n\\n BatchNormalizationLayer(const LayerParameters& layerParameters, const VectorType& mean, const VectorType& variance, ElementType epsilon, EpsilonSummand epsilonSummand);\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BatchNormalizationLayer.h\",\n \"rank\": 7,\n \"score\": 305519.856650054\n },\n {\n \"content\": \" class BinaryConvolutionalLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using TensorType = typename Layer<ElementType>::TensorType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n \\n\\n /// <summary> Instantiates an instance of a binarized convolutional layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"convolutionalParameters\\\"> The hyperparameters for this convolutional layer. </param>\\n\\n /// <param name=\\\"weights\\\"> The set of weights to apply. </param>\\n\\n BinaryConvolutionalLayer(const LayerParameters& layerParameters, const BinaryConvolutionalParameters& convolutionalParameters, const ConstTensorReferenceType& weights);\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BinaryConvolutionalLayer.h\",\n \"rank\": 8,\n \"score\": 305421.892063225\n },\n {\n \"content\": \"struct hash<ell::model::PortRange>\\n\\n{\\n\\n using argument_type = ell::model::PortRange;\\n\\n using result_type = std::size_t ;\\n\\n\\n\\n /// <summary> Computes a hash of the input value. </summary>\\n\\n ///\\n\\n /// <returns> A hash value for the given input. </returns>\\n\\n result_type operator()(argument_type const& id) const;\\n\\n};\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/PortElements.tcc\\\"\\n\",\n \"file_path\": \"libraries/model/include/PortElements.h\",\n \"rank\": 9,\n \"score\": 304438.66845003463\n },\n {\n \"content\": \" class BatchNormalizationLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n BatchNormalizationLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& mean, const std::vector<ElementType>& variance, ElementType epsilon, EpsilonSummand epsilonSummand)\\n\\n : Layer<ElementType>(layerParameters), mean(mean), variance(variance), epsilon(epsilon), epsilonSummand(epsilonSummand)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::batchNormalization; }\\n\\n\\n\\n const std::vector<ElementType> mean;\\n\\n const std::vector<ElementType> variance;\\n\\n const ElementType epsilon;\\n\\n const EpsilonSummand epsilonSummand;\\n\\n };\\n\\n\\n\\n // Api projection for BiasLayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 10,\n \"score\": 296772.21799292916\n },\n {\n \"content\": \" class BinaryConvolutionalLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n BinaryConvolutionalLayer(const LayerParameters& layerParameters, const BinaryConvolutionalParameters& convolutionalParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\\n\\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels), convolutionalParameters(convolutionalParameters)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::binaryConvolution; }\\n\\n\\n\\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\\n\\n const BinaryConvolutionalParameters convolutionalParameters;\\n\\n };\\n\\n\\n\\n // Api projections for ConvolutionalLayer\\n\\n using ConvolutionMethod = ell::predictors::neural::ConvolutionMethod;\\n\\n using ConvolutionalParameters = ell::predictors::neural::ConvolutionalParameters;\\n\\n\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 11,\n \"score\": 296698.66302006016\n },\n {\n \"content\": \" class Node;\\n\\n\\n\",\n \"file_path\": \"libraries/model/include/InputPort.h\",\n \"rank\": 12,\n \"score\": 292921.2693570775\n },\n {\n \"content\": \" class Node;\\n\\n\\n\",\n \"file_path\": \"libraries/model/include/OutputPort.h\",\n \"rank\": 13,\n \"score\": 292876.5632452623\n },\n {\n \"content\": \"void TestNeuralNetworkLayerNodes();\\n\",\n \"file_path\": \"libraries/nodes/test/include/NeuralNetworkLayerNodesTests.h\",\n \"rank\": 14,\n \"score\": 288707.3568119006\n },\n {\n \"content\": \"class InputPortIterator\\n\\n{\\n\\npublic:\\n\\n InputPortIterator() = default;\\n\\n bool IsValid();\\n\\n void Next();\\n\\n InputPort Get();\\n\\n#ifndef SWIG\\n\\n InputPortIterator(std::vector<ell::model::InputPortBase*> ports);\\n\\n#endif\\n\\nprivate:\\n\\n size_t _i = 0;\\n\\n std::vector<ell::model::InputPortBase*> _ports;\\n\\n};\\n\\n\\n\\n//\\n\\n// OutputPortIterator\\n\\n//\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/ModelInterface.h\",\n \"rank\": 15,\n \"score\": 285812.08524728415\n },\n {\n \"content\": \"class OutputPortIterator\\n\\n{\\n\\npublic:\\n\\n OutputPortIterator() = default;\\n\\n bool IsValid();\\n\\n void Next();\\n\\n OutputPort Get();\\n\\n#ifndef SWIG\\n\\n OutputPortIterator(std::vector<ell::model::OutputPortBase*> ports);\\n\\n#endif\\n\\nprivate:\\n\\n size_t _i = 0;\\n\\n std::vector<ell::model::OutputPortBase*> _ports;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/ModelInterface.h\",\n \"rank\": 16,\n \"score\": 285770.2165875055\n },\n {\n \"content\": \"namespace ell\\n\\n{\\n\\nnamespace common\\n\\n{\\n\\n /// <summary> A struct that holds command line parameters for saving models. </summary>\\n\\n struct ModelSaveArguments\\n\\n {\\n\\n /// <summary> The filename to store the output model in. </summary>\\n\\n std::string outputModelFilename = \\\"\\\";\\n\\n\\n\\n utilities::OutputStreamImpostor outputModelStream;\\n\\n };\\n\\n\\n\\n /// <summary> A version of ModelSaveArguments that adds its members to the command line parser. </summary>\\n\\n struct ParsedModelSaveArguments : public ModelSaveArguments, public utilities::ParsedArgSet\\n\\n {\\n\\n /// <summary> Adds the arguments to the command line parser. </summary>\\n\\n ///\\n\\n /// <param name=\\\"parser\\\"> [in,out] The parser. </param>\\n\\n void AddArgs(utilities::CommandLineParser& parser) override;\\n\\n\\n\\n /// <summary> Check arguments. </summary>\\n\\n ///\\n\\n /// <param name=\\\"parser\\\"> The parser. </param>\\n\\n ///\\n\\n /// <returns> An utilities::CommandLineParseResult. </returns>\\n\\n utilities::CommandLineParseResult PostProcess(const utilities::CommandLineParser& parser) override;\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"libraries/common/include/ModelSaveArguments.h\",\n \"rank\": 17,\n \"score\": 283132.4611327436\n },\n {\n \"content\": \"namespace ell\\n\\n{\\n\\nnamespace common\\n\\n{\\n\\n /// <summary> Appends a predictor node of the given type to the model in a map. </summary>\\n\\n ///\\n\\n /// <typeparam name=\\\"PredictorNodeType\\\"> The type of the new predictor node to add </typeparam>\\n\\n /// <typeparam name=\\\"PredictorType\\\"> The type of the predictor to add </typeparam>\\n\\n /// <param name=\\\"map\\\"> The map </param>\\n\\n /// <param name=\\\"predictor\\\"> The predictor to wrap in a node and add to the model </param>\\n\\n /// <returns> The new model, with the predictor node appended </returns>\\n\\n template <typename PredictorNodeType, typename PredictorType>\\n\\n model::Model AppendNodeToModel(model::Map& map, const PredictorType& predictor);\\n\\n}\\n\",\n \"file_path\": \"libraries/common/include/AppendNodeToModel.h\",\n \"rank\": 18,\n \"score\": 282011.060945121\n },\n {\n \"content\": \" class ConvolutionalLayerNode : public NeuralNetworkLayerNode<ConvolutionalLayerNode<ValueType>, predictors::neural::ConvolutionalLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::ConvolutionalLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<ConvolutionalLayerNode<ValueType>, predictors::neural::ConvolutionalLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n ConvolutionalLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The convolutional layer to wrap. </param>\\n\\n ConvolutionalLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::ConvolutionalLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/ConvolutionalLayerNode.h\",\n \"rank\": 19,\n \"score\": 275093.00055515714\n },\n {\n \"content\": \" class BiasLayerNode : public NeuralNetworkLayerNode<BiasLayerNode<ValueType>, predictors::neural::BiasLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::BiasLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<BiasLayerNode<ValueType>, predictors::neural::BiasLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n BiasLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n BiasLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::BiasLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/BiasLayerNode.h\",\n \"rank\": 20,\n \"score\": 275093.0005551572\n },\n {\n \"content\": \" class SoftmaxLayerNode : public NeuralNetworkLayerNode<SoftmaxLayerNode<ValueType>, predictors::neural::SoftmaxLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::SoftmaxLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<SoftmaxLayerNode<ValueType>, predictors::neural::SoftmaxLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n SoftmaxLayerNode() = default;\\n\\n \\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n SoftmaxLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::SoftmaxLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/SoftmaxLayerNode.h\",\n \"rank\": 21,\n \"score\": 275093.0005551572\n },\n {\n \"content\": \" class ScalingLayerNode : public NeuralNetworkLayerNode<ScalingLayerNode<ValueType>, predictors::neural::ScalingLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::ScalingLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<ScalingLayerNode<ValueType>, predictors::neural::ScalingLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n ScalingLayerNode() = default;\\n\\n \\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The layer to wrap. </param>\\n\\n ScalingLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::ScalingLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/ScalingLayerNode.h\",\n \"rank\": 22,\n \"score\": 275093.0005551572\n },\n {\n \"content\": \" class NeuralNetworkLayerNode : public NeuralNetworkLayerNodeBase<ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = NodeLayerType;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using NeuralNetworkLayerNodeBase<ValueType>::input;\\n\\n using NeuralNetworkLayerNodeBase<ValueType>::output;\\n\\n /// @}\\n\\n\\n\\n /// <summary> Default constructor. </summary>\\n\\n NeuralNetworkLayerNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The input to the layer (typically the output of the previous layer). </param>\\n\\n /// <param name=\\\"layer\\\"> The neural network layer to wrap. </param>\\n\\n NeuralNetworkLayerNode(const model::PortElements<ValueType>& input, const LayerType& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 23,\n \"score\": 273928.30558610376\n },\n {\n \"content\": \"class InputNode : public Node\\n\\n{\\n\\npublic:\\n\\n InputNode(const InputNode& node);\\n\\n InputNode(Node node);\\n\\n using Node::GetInputPort;\\n\\n using Node::GetOutputPort;\\n\\n#ifndef SWIG\\n\\n InputNode() = default;\\n\\n InputNode(const ell::model::InputNodeBase* other);\\n\\n const ell::model::InputNodeBase* GetInputNode() const;\\n\\n#endif\\n\\n};\\n\\n\\n\\n//\\n\\n// OutputNode\\n\\n//\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/ModelInterface.h\",\n \"rank\": 24,\n \"score\": 273478.9144303244\n },\n {\n \"content\": \"class OutputNode : public Node\\n\\n{\\n\\npublic:\\n\\n OutputNode(const OutputNode& node);\\n\\n OutputNode(Node node);\\n\\n using Node::GetInputPort;\\n\\n using Node::GetOutputPort;\\n\\n#ifndef SWIG\\n\\n OutputNode() = default;\\n\\n OutputNode(const ell::model::OutputNodeBase* other);\\n\\n const ell::model::OutputNodeBase* GetOutputNode() const;\\n\\n#endif\\n\\n};\\n\\n\\n\\n//\\n\\n// PortElement\\n\\n//\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/ModelInterface.h\",\n \"rank\": 25,\n \"score\": 273438.3335833547\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode6();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 26,\n \"score\": 271145.3198526539\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode1();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 27,\n \"score\": 271145.31985265383\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode5();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 28,\n \"score\": 271145.31985265383\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode2();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 29,\n \"score\": 271145.3198526539\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode3();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 30,\n \"score\": 271145.31985265383\n },\n {\n \"content\": \"void TestNeuralNetworkPredictorNode4();\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 31,\n \"score\": 271145.31985265383\n },\n {\n \"content\": \" class NeuralNetworkPredictor\\n\\n {\\n\\n public:\\n\\n using Layer = ell::api::predictors::neural::Layer<ElementType>;\\n\\n using LayerShape = ell::api::math::TensorShape;\\n\\n using UnderlyingPredictor = ell::predictors::NeuralNetworkPredictor<ElementType>;\\n\\n using UnderlyingLayer = typename ell::predictors::neural::Layer<ElementType>;\\n\\n using UnderlyingLayers = typename ell::predictors::NeuralNetworkPredictor<ElementType>::Layers;\\n\\n using UnderlyingInputParameters = typename ell::predictors::neural::InputLayer<ElementType>::InputParameters;\\n\\n using UnderlyingInputLayer = typename ell::predictors::neural::InputLayer<ElementType>;\\n\\n using UnderlyingLayerParameters = typename ell::predictors::neural::Layer<ElementType>::LayerParameters;\\n\\n\\n\\n NeuralNetworkPredictor(const std::vector<Layer*>& layers, ElementType scaleFactor=1.0f);\\n\\n std::vector<ElementType> Predict(const std::vector<ElementType>& input);\\n\\n void RemoveLastLayers(size_t numLayersToRemove);\\n\\n LayerShape GetInputShape() const;\\n\\n LayerShape GetOutputShape() const;\\n\\n\\n\\n#ifndef SWIG\\n\\n const UnderlyingPredictor& GetPredictor() const;\\n\",\n \"file_path\": \"interfaces/common/include/NeuralNetworkPredictorInterface.h\",\n \"rank\": 32,\n \"score\": 267582.0155233162\n },\n {\n \"content\": \" class BinaryXnorNode : public model::CompilableNode\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n static constexpr const char* inputPaddingMasksPortName = \\\"inputPaddingMasks\\\";\\n\\n static constexpr const char* inputPaddingMaskSumsPortName = \\\"inputPaddingMaskSums\\\";\\n\\n static constexpr const char* filterWeightsPortName = \\\"filterWeights\\\";\\n\\n static constexpr const char* filterMeansPortName = \\\"filterMeans\\\";\\n\\n const model::InputPort<PackedBitsType>& input = _input;\\n\\n const model::InputPort<PackedBitsType>& inputPaddingMasks = _inputPaddingMasks;\\n\\n const model::InputPort<int>& inputPaddingMaskSums = _inputPaddingMaskSums;\\n\\n const model::InputPort<PackedBitsType>& filterWeights = _filterWeights;\\n\\n const model::InputPort<ValueType>& filterMeans = _filterMeans;\\n\\n const model::OutputPort<ValueType>& output = _output;\\n\\n /// @}\\n\\n\\n\\n /// <summary> Default contructor. </summary>\\n\\n BinaryXnorNode();\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/BinaryConvolutionalLayerNode.h\",\n \"rank\": 33,\n \"score\": 267340.9261927384\n },\n {\n \"content\": \" class FullyConnectedLayerNode : public NeuralNetworkLayerNode<FullyConnectedLayerNode<ValueType>, predictors::neural::FullyConnectedLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::FullyConnectedLayer<ValueType>;\\n\\n using BaseType = NeuralNetworkLayerNode<FullyConnectedLayerNode<ValueType>, predictors::neural::FullyConnectedLayer<ValueType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n FullyConnectedLayerNode() = default;\\n\\n \\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n FullyConnectedLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::FullyConnectedLayer<ValueType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/FullyConnectedLayerNode.h\",\n \"rank\": 34,\n \"score\": 262040.54337780483\n },\n {\n \"content\": \" class RegionDetectionLayerNode : public NeuralNetworkLayerNode<RegionDetectionLayerNode<ValueType>, predictors::neural::RegionDetectionLayer<ValueType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using BaseType = NeuralNetworkLayerNode<RegionDetectionLayerNode<ValueType>, predictors::neural::RegionDetectionLayer<ValueType>, ValueType>;\\n\\n using typename BaseType::LayerType;\\n\\n\\n\\n RegionDetectionLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n RegionDetectionLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::RegionDetectionLayer<ValueType>& layer);\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\\\"RegionDetectionLayerNode\\\"); }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\",\n \"file_path\": \"libraries/nodes/include/RegionDetectionLayerNode.h\",\n \"rank\": 35,\n \"score\": 262040.54337780483\n },\n {\n \"content\": \" class ForestPredictorNode : public model::Node\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n static constexpr const char* treeOutputsPortName = \\\"treeOutputs\\\";\\n\\n static constexpr const char* edgeIndicatorVectorPortName = \\\"edgeIndicatorVector\\\";\\n\\n const model::InputPort<double>& input = _input;\\n\\n const model::OutputPort<double>& output = _output;\\n\\n const model::OutputPort<double>& treeOutputs = _treeOutputs;\\n\\n const model::OutputPort<bool>& edgeIndicatorVector = _edgeIndicatorVector;\\n\\n /// @}\\n\\n\\n\\n using ForestPredictor = predictors::ForestPredictor<SplitRuleType, EdgePredictorType>;\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n ForestPredictorNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\",\n \"file_path\": \"libraries/nodes/include/ForestPredictorNode.h\",\n \"rank\": 36,\n \"score\": 262037.1745479429\n },\n {\n \"content\": \" size_t removeLastLayers;\\n\",\n \"file_path\": \"tools/trainers/retargetTrainer/include/RetargetArguments.h\",\n \"rank\": 37,\n \"score\": 261364.306652297\n },\n {\n \"content\": \" class ActivationLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using ActivationFunction = ActivationFunctionType<ElementType>;\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n\\n\\n /// <summary> Instantiates an instance of an activation layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n ActivationLayer(const LayerParameters& layerParameters);\\n\\n\\n\\n /// <summary> Instantiates an instance of an activation layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"activationFunction\\\"> The activation function. </param>\\n\\n ActivationLayer(const LayerParameters& layerParameters, ActivationFunctionType<ElementType> activation);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n ActivationLayer() {}\\n\",\n \"file_path\": \"libraries/predictors/neural/include/ActivationLayer.h\",\n \"rank\": 38,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class LSTMLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n\\n\\n /// <summary> Default constructor. </summary>\\n\\n LSTMLayer();\\n\\n\\n\\n /// <summary> Instantiates an instance of a LSTM layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"parameters\\\"> The weights and biases applicable to an LSTM. Weights should be organised as: [weights, recurrent layer weights] or [W, U].\\n\",\n \"file_path\": \"libraries/predictors/neural/include/LSTMLayer.h\",\n \"rank\": 39,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class ScalingLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::AssignValues;\\n\\n\\n\\n /// <summary> Instantiates an instance of a scaling layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"bias\\\"> The scaling values to apply to input values. </param>\\n\\n ScalingLayer(const LayerParameters& layerParameters, const VectorType& scales);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n ScalingLayer() {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer. </summary>\\n\\n void Compute() override;\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/ScalingLayer.h\",\n \"rank\": 40,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class BiasLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n using Layer<ElementType>::AssignValues;\\n\\n\\n\\n /// <summary> Instantiates an instance of a bias layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"bias\\\"> The bias values to apply to input values. </param>\\n\\n BiasLayer(const LayerParameters& layerParameters, const VectorType& bias);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n BiasLayer() {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\\n\\n void Compute() override;\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BiasLayer.h\",\n \"rank\": 41,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class ConvolutionalLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using TensorType = typename Layer<ElementType>::TensorType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n\\n\\n /// <summary> Instantiates an instance of a convolutional layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"convolutionalParameters\\\"> The hyperparameters for this convolutional layer. </param>\\n\\n /// <param name=\\\"weights\\\"> The set of weights to apply. </param>\\n\\n ConvolutionalLayer(const LayerParameters& layerParameters, const ConvolutionalParameters& convolutionalParameters, TensorType weights);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/ConvolutionalLayer.h\",\n \"rank\": 42,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class GRULayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n\\n\\n /// <summary> Default constructor </summary>\\n\\n GRULayer();\\n\\n\\n\\n /// <summary> Instantiates an instance of a GRU layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"parameters\\\"> The weights and biases applicable to an GRU. Weights should be organised as: [weights, recurrent layer weights] or [W, U].\\n\",\n \"file_path\": \"libraries/predictors/neural/include/GRULayer.h\",\n \"rank\": 43,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class RecurrentLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using MatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n\\n\\n /// <summary> Default constructor </summary>\\n\\n RecurrentLayer();\\n\\n\\n\\n /// <summary> Instantiates an instance of a recurrent layer </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"weights\\\"> Weights for the layers should be in the form [Weights, Recurrent weights]. </param>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/RecurrentLayer.h\",\n \"rank\": 44,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class SoftmaxLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::AssignValues;\\n\\n\\n\\n /// <summary> Instantiates an instance of a softmax layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n SoftmaxLayer(const LayerParameters& layerParameters);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n SoftmaxLayer() {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\\n\\n void Compute() override;\\n\\n\\n\\n /// <summary> Indicates the kind of layer. </summary>\\n\\n ///\\n\",\n \"file_path\": \"libraries/predictors/neural/include/SoftmaxLayer.h\",\n \"rank\": 45,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class PoolingLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using PoolingFunction = PoolingFunctionType<ElementType>;\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using Layer<ElementType>::GetLayerParameters;\\n\\n using Layer<ElementType>::GetInput;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::GetInputShapeMinusPadding;\\n\\n using Layer<ElementType>::GetOutputShapeMinusPadding;\\n\\n \\n\\n /// <summary> Instantiates an instance of a pooling layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"poolingParameters\\\"> Specifies the pooling characteristics of the layer. </param>\\n\\n PoolingLayer(const LayerParameters& layerParameters, PoolingParameters poolingParameters);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n PoolingLayer() {}\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/PoolingLayer.h\",\n \"rank\": 46,\n \"score\": 260742.54951058232\n },\n {\n \"content\": \" class ConvolutionalLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n ConvolutionalLayer(const LayerParameters& layerParameters, const ConvolutionalParameters& convolutionalParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\\n\\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels), convolutionalParameters(convolutionalParameters)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::convolution; }\\n\\n\\n\\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\\n\\n const ConvolutionalParameters convolutionalParameters;\\n\\n };\\n\\n\\n\\n // Api projections for FullyConnectedLayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 47,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class PoolingLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n PoolingLayer(const LayerParameters& layerParameters, const PoolingParameters& poolingParameters, PoolingType poolingType)\\n\\n : Layer<ElementType>(layerParameters), poolingType(poolingType), poolingParameters(poolingParameters)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::pooling; }\\n\\n\\n\\n const PoolingType poolingType;\\n\\n const PoolingParameters poolingParameters;\\n\\n };\\n\\n\\n\\n // Api projection for RegionDetectionLayer\\n\\n using RegionDetectionParameters = ell::predictors::neural::RegionDetectionParameters;\\n\\n\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 48,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class SoftmaxLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n SoftmaxLayer(const LayerParameters& layerParameters)\\n\\n : Layer<ElementType>(layerParameters)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::softmax; }\\n\\n };\\n\\n\\n\\n // Api projection for ScalingLayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 49,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class BiasLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n BiasLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& bias)\\n\\n : Layer<ElementType>(layerParameters), bias(bias)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::bias; }\\n\\n\\n\\n const std::vector<ElementType> bias;\\n\\n };\\n\\n\\n\\n // Api projections for BinaryConvolutionalLayer\\n\\n using BinaryConvolutionMethod = ell::predictors::neural::BinaryConvolutionMethod;\\n\\n using BinaryConvolutionalParameters = ell::predictors::neural::BinaryConvolutionalParameters;\\n\\n\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 50,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class GRULayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n GRULayer(const LayerParameters& layerParameters,\\n\\n const ell::api::math::Tensor<ElementType>& updateWeightsTensor,\\n\\n const ell::api::math::Tensor<ElementType>& resetWeightsTensor,\\n\\n const ell::api::math::Tensor<ElementType>& hiddenWeightsTensor,\\n\\n const ell::api::math::Tensor<ElementType>& updateBiasTensor,\\n\\n const ell::api::math::Tensor<ElementType>& resetBiasTensor,\\n\\n const ell::api::math::Tensor<ElementType>& hiddenBiasTensor,\\n\\n ActivationType activation,\\n\\n ActivationType recurrentActivation)\\n\\n : Layer<ElementType>(layerParameters),\\n\\n updateWeights(updateWeightsTensor),\\n\\n resetWeights(resetWeightsTensor),\\n\\n hiddenWeights(hiddenWeightsTensor),\\n\\n updateBias(updateBiasTensor),\\n\\n resetBias(resetBiasTensor),\\n\\n hiddenBias(hiddenBiasTensor),\\n\\n activation(activation), recurrentActivation(recurrentActivation)\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 51,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class LSTMLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n LSTMLayer(const LayerParameters& layerParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\\n\\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::lstm; }\\n\\n\\n\\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\\n\\n };\\n\\n\\n\\n // Api projections for PoolingLayer\\n\\n using PoolingParameters = ell::predictors::neural::PoolingParameters;\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 52,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class ActivationLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n ActivationLayer(const LayerParameters& layerParameters, ActivationType activation)\\n\\n : Layer<ElementType>(layerParameters), activation(activation)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::activation; }\\n\\n\\n\\n const ActivationType activation;\\n\\n };\\n\\n\\n\\n // Api projection for PReLUActivationLayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 53,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" class ScalingLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n ScalingLayer(const LayerParameters& layerParameters, const std::vector<ElementType>& scales)\\n\\n : Layer<ElementType>(layerParameters), scales(scales)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::scaling; }\\n\\n\\n\\n const std::vector<ElementType> scales;\\n\\n };\\n\\n}\\n\\n}\\n\\n}\\n\\n}\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 54,\n \"score\": 260573.26697308128\n },\n {\n \"content\": \" bool isInterleavedOrder;\\n\\n };\\n\\n\\n\\nprotected:\\n\\n void Compute() const override;\\n\\n bool Refine(model::ModelTransformer& transformer) const override;\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\\nprivate:\\n\\n NeuralNetworkLayerNodeBase<ValueType>* AddLayerNode(model::ModelTransformer& transformer, Layer& layer, const model::PortElements<ValueType>& layerInputs, const NetworkCompileOptions& options, NetworkCompileState& state) const;\\n\\n\\n\\n // Input\\n\\n model::InputPort<ValueType> _input;\\n\\n\\n\\n // Output\\n\\n model::OutputPort<ValueType> _output;\\n\\n\\n\\n // Pointer to the predictor\\n\\n PredictorType _predictor;\\n\\n};\\n\\n}\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/NeuralNetworkPredictorNode.tcc\\\"\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 55,\n \"score\": 259017.03643690885\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: NeuralNetworkPredictorNode.h (nodes)\\n\\n// Authors: Chuck Jacobs, Byron Changuion\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#pragma once\\n\\n\\n\\n// model\\n\\n#include \\\"Model.h\\\"\\n\\n#include \\\"ModelTransformer.h\\\"\\n\\n#include \\\"Node.h\\\"\\n\\n\\n\\n// nodes\\n\\n#include \\\"ActivationLayerNode.h\\\"\\n\\n#include \\\"BatchNormalizationLayerNode.h\\\"\\n\\n#include \\\"BiasLayerNode.h\\\"\\n\\n#include \\\"BinaryConvolutionalLayerNode.h\\\"\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 56,\n \"score\": 259008.0375335537\n },\n {\n \"content\": \"// utilities\\n\\n#include \\\"TypeName.h\\\"\\n\\n\\n\\n// stl\\n\\n#include <functional>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace nodes\\n\\n{\\n\\n/// <summary> A node that represents a neural network. </summary>\\n\\ntemplate <typename ValueType>\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 57,\n \"score\": 258991.72538586232\n },\n {\n \"content\": \"\\n\\n /// <summary> Makes a copy of this node in the model being constructed by the transformer </summary>\\n\\n void Copy(model::ModelTransformer& transformer) const override;\\n\\n\\n\\n /// <summary> Options to control how the network is compiled into nodes </summary>\\n\\n struct NetworkCompileOptions\\n\\n {\\n\\n /// <summary> Use diagonal convolution (vs. im2col-based convolution)\\n\\n bool useDiagonalConvolution;\\n\\n\\n\\n /// <summary> Ensure the output of the nodes implementing a layer is in the canonical row, column, channel order </summary>\\n\\n bool alwaysConvertToInterleaved;\\n\\n\\n\\n /// <summary> When using im2col-based convolution, construct the transpose of the receptive field matrix </summary>\\n\\n bool transposeReceptiveFieldMatrix;\\n\\n };\\n\\n\\n\\n struct NetworkCompileState\\n\\n {\\n\\n /// <summary> Indicates the current order of input data. If `true`, it's in the canonical row, column, channel order. </summary>\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 58,\n \"score\": 258988.05125744708\n },\n {\n \"content\": \"#include \\\"ConvolutionalLayerNode.h\\\"\\n\\n#include \\\"FullyConnectedLayerNode.h\\\"\\n\\n#include \\\"GRULayerNode.h\\\"\\n\\n#include \\\"LSTMLayerNode.h\\\"\\n\\n#include \\\"PoolingLayerNode.h\\\"\\n\\n#include \\\"RegionDetectionLayerNode.h\\\"\\n\\n#include \\\"ScalingLayerNode.h\\\"\\n\\n#include \\\"SoftmaxLayerNode.h\\\"\\n\\n\\n\\n// predictors\\n\\n#include \\\"NeuralNetworkPredictor.h\\\"\\n\\n\\n\\n// activation and pooling functions\\n\\n#include \\\"LeakyReLUActivation.h\\\"\\n\\n#include \\\"MaxPoolingFunction.h\\\"\\n\\n#include \\\"MeanPoolingFunction.h\\\"\\n\\n#include \\\"ParametricReLUActivation.h\\\"\\n\\n#include \\\"ReLUActivation.h\\\"\\n\\n#include \\\"SigmoidActivation.h\\\"\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 59,\n \"score\": 258985.49222832304\n },\n {\n \"content\": \"\\n\\n /// <summary> Returns the underlying predictor </summary>\\n\\n ///\\n\\n /// <returns> The predictor wrapped by this node </returns>\\n\\n const PredictorType& GetPredictor() const { return _predictor; }\\n\\n\\n\\n /// <summary> Returns the underlying predictor </summary>\\n\\n ///\\n\\n /// <returns> The predictor wrapped by this node </returns>\\n\\n PredictorType& GetPredictor() { return _predictor; }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\\\"NeuralNetworkPredictorNode\\\"); }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkPredictorNode.h\",\n \"rank\": 60,\n \"score\": 258978.9020015295\n },\n {\n \"content\": \"\\n\\n /// <summary> Gets the LayerParameters from the layer wrapped by this node </summary>\\n\\n virtual typename predictors::neural::Layer<ValueType>::LayerParameters GetLayerParameters() const = 0;\\n\\n\\n\\n /// <summary> Get the input padding requested by the layer </summary>\\n\\n predictors::neural::PaddingParameters GetRequestedInputPadding() const { return GetLayerParameters().inputPaddingParameters; }\\n\\n\\n\\n /// <summary> Get the output padding requested by the layer </summary>\\n\\n predictors::neural::PaddingParameters GetRequestedOutputPadding() const { return GetLayerParameters().inputPaddingParameters; }\\n\\n\\n\\n /// <summary> Get the size of the output port </summary>\\n\\n size_t GetOutputSize() const { return _output.Size(); }\\n\\n\\n\\n protected:\\n\\n NeuralNetworkLayerNodeBase();\\n\\n NeuralNetworkLayerNodeBase(const model::PortElements<ValueType>& input, const NeuralNetworkLayerNodeParameters& parameters, size_t outputSize);\\n\\n\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 61,\n \"score\": 258797.04883073023\n },\n {\n \"content\": \" model::PortMemoryLayout CalculateMemoryLayout(size_t padding, typename predictors::neural::Layer<ValueType>::Shape dataBufferSize);\\n\\n void Copy(model::ModelTransformer& transformer) const override;\\n\\n void Compute() const override;\\n\\n utilities::ArchiveVersion GetArchiveVersion() const override;\\n\\n bool CanReadArchiveVersion(const utilities::ArchiveVersion& version) const override;\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\\n using NeuralNetworkLayerNodeBase<ValueType>::_input;\\n\\n using NeuralNetworkLayerNodeBase<ValueType>::_output;\\n\\n\\n\\n mutable typename LayerType::TensorType _inputTensor;\\n\\n mutable LayerType _layer; // mutable to get around Compute being non-const\\n\\n bool HasState() const override { return true; } // stored state: inputLayout, outputLayout\\n\\n\\n\\n private:\\n\\n model::PortMemoryLayout _inputLayout;\\n\\n model::PortMemoryLayout _outputLayout;\\n\\n math::TensorShape _inputShape;\\n\\n };\\n\\n\\n\\n // helper:\\n\\n template <typename LayerType>\\n\\n typename LayerType::LayerParameters GetLayerNodeParameters(const typename LayerType::TensorType& inputTensor, const typename LayerType::LayerParameters& layerParameters);\\n\\n}\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/NeuralNetworkLayerNode.tcc\\\"\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 62,\n \"score\": 258796.93298120855\n },\n {\n \"content\": \" // Input\\n\\n model::InputPort<ValueType> _input;\\n\\n\\n\\n // Output\\n\\n model::OutputPort<ValueType> _output;\\n\\n\\n\\n NeuralNetworkLayerNodeParameters _parameters;\\n\\n };\\n\\n\\n\\n /// <summary> Base class for neural network layer nodes. </summary\\n\\n template <typename DerivedType, typename NodeLayerType, typename ValueType>\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 63,\n \"score\": 258794.33529668953\n },\n {\n \"content\": \"\\n\\n// stl\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace nodes\\n\\n{\\n\\n /// <summary> Parameters to influence how neural network layers behave when embedded as nodes in a graph </summary>\\n\\n struct NeuralNetworkLayerNodeParameters\\n\\n {\\n\\n bool includePaddingInInputData;\\n\\n };\\n\\n\\n\\n /// <summary> Base class for neural network layer nodes. </summary\\n\\n template <typename ValueType>\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 64,\n \"score\": 258789.98696103969\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: NeuralNetworkLayerNode.h (nodes)\\n\\n// Authors: Chuck Jacobs\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#pragma once\\n\\n\\n\\n// model\\n\\n#include \\\"CompilableNode.h\\\"\\n\\n#include \\\"IRMapCompiler.h\\\"\\n\\n#include \\\"Model.h\\\"\\n\\n#include \\\"ModelTransformer.h\\\"\\n\\n#include \\\"Node.h\\\"\\n\\n#include \\\"PortMemoryLayout.h\\\"\\n\\n\\n\\n// predictors\\n\\n#include \\\"Layer.h\\\"\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 65,\n \"score\": 258786.72888685885\n },\n {\n \"content\": \" /// <summary> Gets the layer being wrapped </summary>\\n\\n const LayerType& GetLayer() const { return _layer; }\\n\\n\\n\\n /// <summary> Gets information about the input memory layout </summary>\\n\\n model::PortMemoryLayout& GetInputMemoryLayout() override { return _inputLayout; }\\n\\n\\n\\n /// <summary> Gets information about the input memory layout </summary>\\n\\n const model::PortMemoryLayout& GetInputMemoryLayout() const override { return _inputLayout; }\\n\\n\\n\\n /// <summary> Gets information about the output memory layout </summary>\\n\\n const model::PortMemoryLayout& GetOutputMemoryLayout() const override { return _outputLayout; }\\n\\n\\n\\n /// <summary> Gets information about the output memory layout </summary>\\n\\n model::PortMemoryLayout& GetOutputMemoryLayout() override { return _outputLayout; }\\n\\n\\n\\n /// <summary> Gets the LayerParameters from the layer wrapped by this node </summary>\\n\\n typename predictors::neural::Layer<ValueType>::LayerParameters GetLayerParameters() const override { return _layer.GetLayerParameters(); }\\n\\n\\n\\n protected:\\n\\n size_t NumInputDimensions() const { return _inputLayout.NumDimensions(); }\\n\",\n \"file_path\": \"libraries/nodes/include/NeuralNetworkLayerNode.h\",\n \"rank\": 66,\n \"score\": 258780.22991951753\n },\n {\n \"content\": \" class BinaryReceptiveFieldMatrixNode : public model::CompilableNode\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<ValueType>& input = _input;\\n\\n const model::OutputPort<PackedBitsType>& output = _output;\\n\\n /// @}\\n\\n\\n\\n /// <summary></summary>\\n\\n BinaryReceptiveFieldMatrixNode();\\n\\n\\n\\n /// <summary></summary>\\n\\n BinaryReceptiveFieldMatrixNode(const model::PortElements<ValueType>& input,\\n\\n const predictors::neural::BinaryConvolutionalParameters& convolutionalParameters,\\n\\n const model::PortMemoryLayout& inputMemoryLayout,\\n\\n const model::PortMemoryLayout& outputMemoryLayout);\\n\\n\\n\\n /// <summary> Gets information about the input memory layout </summary>\\n\\n const model::PortMemoryLayout& GetInputMemoryLayout() const { return _inputMemoryLayout; }\\n\",\n \"file_path\": \"libraries/nodes/include/BinaryConvolutionalLayerNode.h\",\n \"rank\": 67,\n \"score\": 257942.98407392\n },\n {\n \"content\": \" class Model;\\n\\n\\n\",\n \"file_path\": \"libraries/model/include/PortElements.h\",\n \"rank\": 68,\n \"score\": 255467.4513407666\n },\n {\n \"content\": \" class RegionDetectionLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n RegionDetectionLayer(const LayerParameters& layerParameters, const RegionDetectionParameters& detectionParameters)\\n\\n : Layer<ElementType>(layerParameters), detectionParameters(detectionParameters)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::region; }\\n\\n\\n\\n const RegionDetectionParameters detectionParameters;\\n\\n };\\n\\n\\n\\n // Api projection for SoftmaxLayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 69,\n \"score\": 255039.67817572076\n },\n {\n \"content\": \" class FullyConnectedLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n FullyConnectedLayer(const LayerParameters& layerParameters, const ell::api::math::Tensor<ElementType>& weightsTensor)\\n\\n : Layer<ElementType>(layerParameters), weights(weightsTensor.data, weightsTensor.shape.rows, weightsTensor.shape.columns, weightsTensor.shape.channels)\\n\\n {\\n\\n }\\n\\n\\n\\n LayerType GetLayerType() const override { return LayerType::fullyConnected; }\\n\\n\\n\\n API_READONLY(ell::api::math::Tensor<ElementType> weights);\\n\\n };\\n\\n\\n\\n // Api projections for GRULayer\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 70,\n \"score\": 255039.67817572076\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: InputLayer.h (neural)\\n\\n// Authors: Byron Changuion\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#pragma once\\n\\n#include \\\"Layer.h\\\"\\n\\n\\n\\n// stl\\n\\n#include <vector>\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace predictors\\n\\n{\\n\\nnamespace neural\\n\\n{\\n\\n \\n\\n\\n\\n /// <summary> An input layer in a neural network. This is the only layer type that takes input from an external source, and not from the output of another layer.\\n\\n /// This must be the first layer in the list of layers that get set on a Neural Predictor.\\n\\n /// </summary>\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 71,\n \"score\": 254735.86130036027\n },\n {\n \"content\": \"\\n\\n protected:\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\\n private:\\n\\n using Layer<ElementType>::_layerParameters;\\n\\n using Layer<ElementType>::_output;\\n\\n\\n\\n VectorType _scale;\\n\\n TensorType _data;\\n\\n };\\n\\n\\n\\n}\\n\\n}\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/InputLayer.tcc\\\"\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 72,\n \"score\": 254716.47098053718\n },\n {\n \"content\": \"\\n\\n /// <summary> The padding requirements for the input. </summary>\\n\\n PaddingParameters inputPaddingParameters;\\n\\n\\n\\n /// <summary> The extents of the tensor in logical order (row, column, channel). This size includes padding. </summary>\\n\\n Shape outputShape;\\n\\n\\n\\n /// <summary> The padding requirements for the output. </summary>\\n\\n PaddingParameters outputPaddingParameters;\\n\\n\\n\\n /// <summary> The scale factor to apply to each input value. Default is undefined. </summary>\\n\\n ElementType scale;\\n\\n };\\n\\n\\n\\n /// <summary> Instantiates an instance of an input layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"inputParameters\\\"> The parameters for the input layer. </param>\\n\\n /// <param name=\\\"inputParameters\\\"> </param>\\n\\n InputLayer(const InputParameters& inputParameters);\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 73,\n \"score\": 254711.70863190823\n },\n {\n \"content\": \" /// <returns> The output tensor. </returns>\\n\\n const TensorType& GetInput() const { return _data; }\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer. </summary>\\n\\n void Compute() override;\\n\\n\\n\\n /// <summary> Indicates the kind of layer. </summary>\\n\\n ///\\n\\n /// <returns> An enum indicating the layer type. </returns>\\n\\n LayerType GetLayerType() const override { return LayerType::input; }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\\\"InputLayer\\\"); }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 74,\n \"score\": 254709.8260373206\n },\n {\n \"content\": \" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n InputLayer() : _data(0, 0, 0) {}\\n\\n\\n\\n /// <summary> Sets the input. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> Copies the input vector to the input tensor. </param>\\n\\n void SetInput(const DataVectorType& input);\\n\\n\\n\\n /// <summary> Sets the input. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> Copies the input vector to the input tensor. </param>\\n\\n void SetInput(const std::vector<ElementType>& input);\\n\\n\\n\\n /// <summary> Gets a writeable reference to the input. </summary>\\n\\n ///\\n\\n /// <returns> The output tensor. </returns>\\n\\n TensorType& GetInput() { return _data; }\\n\\n\\n\\n /// <summary> Gets a const reference to the input. </summary>\\n\\n ///\\n\",\n \"file_path\": \"libraries/predictors/neural/include/InputLayer.h\",\n \"rank\": 75,\n \"score\": 254705.3382576544\n },\n {\n \"content\": \" class L2NormSquaredNode : public model::Node\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<ValueType>& input = _input;\\n\\n const model::OutputPort<ValueType>& output = _output;\\n\\n /// @}\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n L2NormSquaredNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n /// <param name=\\\"input\\\"> The signal to take the squared magnitude of </param>\\n\\n L2NormSquaredNode(const model::PortElements<ValueType>& input);\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ValueType>(\\\"L2NormSquaredNode\\\"); }\\n\",\n \"file_path\": \"libraries/nodes/include/L2NormSquaredNode.h\",\n \"rank\": 76,\n \"score\": 254299.1378680695\n },\n {\n \"content\": \" /// <summary> A node that represents a single-element threshold predictor. </summary>\\n\\n class SingleElementThresholdNode : public model::Node\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<double>& input = _input;\\n\\n const model::OutputPort<bool>& output = _output;\\n\\n /// @}\\n\\n\\n\\n using SingleElementThresholdPredictor = predictors::SingleElementThresholdPredictor;\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n SingleElementThresholdNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The signal to predict from </param>\\n\\n /// <param name=\\\"predictor\\\"> The linear predictor to use when making the prediction. </param>\\n\\n SingleElementThresholdNode(const model::PortElements<double>& input, const SingleElementThresholdPredictor& predictor);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/SingleElementThresholdNode.h\",\n \"rank\": 77,\n \"score\": 254186.84043733255\n },\n {\n \"content\": \" class RecurrentLayerNode : public NeuralNetworkLayerNode<RecurrentLayerNode<ValueType, ActivationFunctionType>, predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>;\\n\\n using BaseType = NeuralNetworkLayerNode<RecurrentLayerNode<ValueType, ActivationFunctionType>, predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n RecurrentLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n RecurrentLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::RecurrentLayer<ValueType, ActivationFunctionType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/RecurrentLayerNode.h\",\n \"rank\": 78,\n \"score\": 254150.15071432496\n },\n {\n \"content\": \" class PoolingLayerNode : public NeuralNetworkLayerNode<PoolingLayerNode<ValueType, PoolingFunctionType>, predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>, ValueType>\\n\\n {\\n\\n public:\\n\\n using LayerType = predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>;\\n\\n using BaseType = NeuralNetworkLayerNode<PoolingLayerNode<ValueType, PoolingFunctionType>, LayerType, ValueType>;\\n\\n\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n using BaseType::input;\\n\\n using BaseType::output;\\n\\n /// @}\\n\\n\\n\\n PoolingLayerNode() = default;\\n\\n\\n\\n /// <summary> Constructor from a layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The input to the layer. </param>\\n\\n /// <param name=\\\"layer\\\"> The bias layer to wrap. </param>\\n\\n PoolingLayerNode(const model::PortElements<ValueType>& input, const predictors::neural::PoolingLayer<ValueType, PoolingFunctionType>& layer);\\n\\n\\n\",\n \"file_path\": \"libraries/nodes/include/PoolingLayerNode.h\",\n \"rank\": 79,\n \"score\": 254150.150714325\n },\n {\n \"content\": \" /// <summary> A node that represents a ProtoNN predictor. </summary>\\n\\n class ProtoNNPredictorNode : public model::Node\\n\\n {\\n\\n public:\\n\\n /// @name Input and Output Ports\\n\\n /// @{\\n\\n const model::InputPort<double>& input = _input;\\n\\n const model::OutputPort<double>& output = _output;\\n\\n\\n\\n /// @}\\n\\n\\n\\n using ProtoNNPredictor = predictors::ProtoNNPredictor;\\n\\n\\n\\n /// <summary> Default Constructor </summary>\\n\\n ProtoNNPredictorNode();\\n\\n\\n\\n /// <summary> Constructor </summary>\\n\\n ///\\n\\n /// <param name=\\\"input\\\"> The signal to predict from </param>\\n\\n /// <param name=\\\"outputSize\\\">The size of the output vector</param>\\n\\n /// <param name=\\\"predictor\\\"> The ProtoNN predictor to use when making the prediction. </param>\\n\",\n \"file_path\": \"libraries/nodes/include/ProtoNNPredictorNode.h\",\n \"rank\": 80,\n \"score\": 254034.8906439876\n },\n {\n \"content\": \"void TestInputLayerNode(size_t outputPadding = 0);\\n\",\n \"file_path\": \"libraries/model/test/include/CompilableNodesTest.h\",\n \"rank\": 81,\n \"score\": 252353.92819993934\n },\n {\n \"content\": \" class Layer\\n\\n {\\n\\n public:\\n\\n Layer(const LayerParameters& layerParameters)\\n\\n : parameters(layerParameters) {}\\n\\n virtual ~Layer() {}\\n\\n\\n\\n virtual LayerType GetLayerType() const = 0;\\n\\n\\n\\n template <class LayerType>\\n\\n LayerType& As()\\n\\n {\\n\\n return *(dynamic_cast<LayerType*>(this));\\n\\n }\\n\\n\\n\\n template <class LayerType>\\n\\n bool Is()\\n\\n {\\n\\n return dynamic_cast<LayerType*>(this) != nullptr;\\n\\n }\\n\\n\\n\\n const LayerParameters parameters;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"interfaces/common/include/NeuralLayersInterface.h\",\n \"rank\": 82,\n \"score\": 250020.44971598458\n },\n {\n \"content\": \" class RegionDetectionLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using Base = Layer<ElementType>;\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n\\n\\n /// <summary> Instantiates an instance of a region detection layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"regionDetectionParams\\\"> The parameters desribing the configuration of this layer. </param>\\n\\n /// <param name=\\\"anchorScales\\\"> The values to scale the width and height for each of the anchor regions.\\n\\n /// The number of elements should equal 2 x numBoxesPerCell. </param>\\n\\n RegionDetectionLayer(const LayerParameters& layerParameters, RegionDetectionParameters regionDetectionParamss);\\n\\n\\n\\n /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n RegionDetectionLayer() : _regionDetectionParams({}) {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer </summary>\\n\\n void Compute() override;\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/RegionDetectionLayer.h\",\n \"rank\": 83,\n \"score\": 249938.1486966953\n },\n {\n \"content\": \" class FullyConnectedLayer : public Layer<ElementType>\\n\\n {\\n\\n public:\\n\\n using LayerParameters = typename Layer<ElementType>::LayerParameters;\\n\\n using VectorType = typename Layer<ElementType>::VectorType;\\n\\n using MatrixType = typename Layer<ElementType>::MatrixType;\\n\\n using ConstMatrixReferenceType = typename Layer<ElementType>::ConstMatrixReferenceType;\\n\\n using ConstTensorReferenceType = typename Layer<ElementType>::ConstTensorReferenceType;\\n\\n using Layer<ElementType>::GetOutputMinusPadding;\\n\\n using Layer<ElementType>::NumOutputRowsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputColumnsMinusPadding;\\n\\n using Layer<ElementType>::NumOutputChannels;\\n\\n\\n\\n /// <summary> Instantiates an instance of a fully connected layer. </summary>\\n\\n ///\\n\\n /// <param name=\\\"layerParameters\\\"> The parameters common to every layer. </param>\\n\\n /// <param name=\\\"weights\\\"> The weights to apply as a matrix in rowMajor order, where number of rows equals output neurons\\n\\n /// and columns represent input (in logical Tensor order: row, column, channel). </param>\\n\\n FullyConnectedLayer(const LayerParameters& layerParameters, ConstMatrixReferenceType& weights);\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/FullyConnectedLayer.h\",\n \"rank\": 84,\n \"score\": 249938.1486966953\n },\n {\n \"content\": \" class Port;\\n\\n\\n\",\n \"file_path\": \"libraries/model/include/Node.h\",\n \"rank\": 85,\n \"score\": 248437.84052759103\n },\n {\n \"content\": \" class Node;\\n\\n\\n\",\n \"file_path\": \"libraries/model/include/Port.h\",\n \"rank\": 86,\n \"score\": 248382.663799053\n },\n {\n \"content\": \" def get_output_port_elements_for_node(self, ell_node: ell.nodes.Node,\\n\\n output_label: str = \\\"output\\\"):\\n\\n \\\"\\\"\\\"\\n\\n Returns an ell.nodes.PortElements for the corresponding ELL node's \\n\\n output port that corresponds to 'output_label'.\\n\\n \\\"\\\"\\\"\\n\\n try:\\n\\n output_link = ell_node.GetOutputPort(output_label)\\n\\n except BaseException as exception:\\n\\n raise Exception(\\\"Cannot get output port {} for {}\\\".format(output_label, ell_node.GetId()))\\n\",\n \"file_path\": \"tools/importers/common/converters.py\",\n \"rank\": 87,\n \"score\": 247306.19235321108\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: BatchNormalizationLayer.h (neural)\\n\\n// Authors: Byron Changuion\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#pragma once\\n\\n#include \\\"Layer.h\\\"\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace predictors\\n\\n{\\n\\n namespace neural\\n\\n {\\n\\n /// <summary> Indicates what term the epsilon will be added to in the denominator. </summary>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BatchNormalizationLayer.h\",\n \"rank\": 88,\n \"score\": 246411.36310892765\n },\n {\n \"content\": \" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n BatchNormalizationLayer() {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\\n\\n void Compute() override;\\n\\n\\n\\n /// <summary> Indicates the kind of layer. </summary>\\n\\n ///\\n\\n /// <returns> An enum indicating the layer type. </returns>\\n\\n LayerType GetLayerType() const override { return LayerType::batchNormalization; }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\\\"BatchNormalizationLayer\\\"); }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BatchNormalizationLayer.h\",\n \"rank\": 89,\n \"score\": 246403.32705876481\n },\n {\n \"content\": \"\\n\\n /// <summary> Returns the value to scale the output by. </summary>\\n\\n ///\\n\\n /// <returns> The value to scale the output by. </returns>\\n\\n const VectorType& GetScale() const { return _multiplicationValues; }\\n\\n\\n\\n /// <summary> Returns the value to offset the output by. </summary>\\n\\n ///\\n\\n /// <returns> The value to offset the output by. </returns>\\n\\n const VectorType& GetBias() const { return _additionValues; }\\n\\n\\n\\n protected:\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\\n private:\\n\\n using Layer<ElementType>::_layerParameters;\\n\\n using Layer<ElementType>::_output;\\n\\n\\n\\n VectorType _multiplicationValues;\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BatchNormalizationLayer.h\",\n \"rank\": 90,\n \"score\": 246394.6067342252\n },\n {\n \"content\": \" VectorType _additionValues;\\n\\n ElementType _epsilon; // To ensure non-zero division, this is added to denominator\\n\\n EpsilonSummand _epsilonSummand;\\n\\n };\\n\\n }\\n\\n}\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/BatchNormalizationLayer.tcc\\\"\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BatchNormalizationLayer.h\",\n \"rank\": 91,\n \"score\": 246383.3648508628\n },\n {\n \"content\": \"#include \\\"NeuralLayersInterface.h\\\"\\n\\n#endif\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace api\\n\\n{\\n\\nnamespace predictors\\n\\n{\\n\\n //\\n\\n // API classes for the neural predictor\\n\\n //\\n\\n template <typename ElementType>\\n\",\n \"file_path\": \"interfaces/common/include/NeuralNetworkPredictorInterface.h\",\n \"rank\": 92,\n \"score\": 246360.73054694297\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: NeuralNetworkPredictorInterface.h (interfaces)\\n\\n// Authors: Byron Changuion\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n#pragma once\\n\\n\\n\\n#ifndef SWIG\\n\\n\\n\\n// neural network predictor\\n\\n#include \\\"NeuralNetworkPredictor.h\\\"\\n\\n\\n\\n// stl\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n// apis\\n\\n#include \\\"MathInterface.h\\\"\\n\",\n \"file_path\": \"interfaces/common/include/NeuralNetworkPredictorInterface.h\",\n \"rank\": 93,\n \"score\": 246350.66987462575\n },\n {\n \"content\": \"#endif\\n\\n\\n\\nprivate:\\n\\n \\n\\n#ifndef SWIG\\n\\n template <typename DerivedLayer>\\n\\n static auto& LayerAs(Layer* layer);\\n\\n\\n\\n static void AddLayer(Layer* layer, const std::unique_ptr<UnderlyingInputLayer>& underlyingInputLayer, UnderlyingLayers& underlyingLayers);\\n\\n\\n\\n // Specific layer factory functions\\n\\n static std::unique_ptr<UnderlyingLayer> CreateActivationLayer(neural::ActivationLayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\\n\\n\\n\\n template <template <typename> class ActivationFunctionType, template <typename> class RecurrentActivationFunctionType>\\n\\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\\n\\n \\n\\n template <template <typename> class ActivationFunctionType>\\n\\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\\n\\n \\n\\n static std::unique_ptr<UnderlyingLayer> CreateGRULayer(neural::GRULayer<ElementType>& layer, const UnderlyingLayerParameters& parameters);\\n\",\n \"file_path\": \"interfaces/common/include/NeuralNetworkPredictorInterface.h\",\n \"rank\": 94,\n \"score\": 246350.60898738066\n },\n {\n \"content\": \"\\n\\n#endif\\n\\n\\n\\n std::shared_ptr<UnderlyingPredictor> _predictor;\\n\\n };\\n\\n}\\n\\n}\\n\\n}\\n\\n\\n\\n#include \\\"../tcc/NeuralNetworkPredictorInterface.tcc\\\"\\n\",\n \"file_path\": \"interfaces/common/include/NeuralNetworkPredictorInterface.h\",\n \"rank\": 95,\n \"score\": 246338.749038451\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n//\\n\\n// Project: Embedded Learning Library (ELL)\\n\\n// File: BinaryConvolutionalLayer.h (neural)\\n\\n// Authors: Byron Changuion\\n\\n//\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#pragma once\\n\\n#include \\\"Layer.h\\\"\\n\\n#include \\\"ConvolutionalLayer.h\\\"\\n\\n\\n\\n// math\\n\\n#include \\\"Matrix.h\\\"\\n\\n\\n\\nnamespace ell\\n\\n{\\n\\nnamespace predictors\\n\\n{\\n\\nnamespace neural\\n\\n{\\n\\n /// <summary> The method for performing binary convolutions. </summary>\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BinaryConvolutionalLayer.h\",\n \"rank\": 96,\n \"score\": 246325.99409837704\n },\n {\n \"content\": \" // Fills a matrix (backed by the array outputMatrix) where the columns the set of input values corresponding to a filter, stretched into a vector.\\n\\n // The number of columns is equal to the number of locations that a filter is slide over the input tensor.\\n\\n void ReceptiveFieldToColumns(ConstTensorReferenceType input, MatrixType& shapedInput);\\n\\n\\n\\n // Returns whether input zero padding is enabled\\n\\n bool HasInputZeroPadding() const;\\n\\n\\n\\n // Returns whether the row, column indices correspond to input zero padding\\n\\n bool IsInputZeroPadding(size_t row, size_t column) const;\\n\\n\\n\\n void ComputeWeightsMatrices(const ConstTensorReferenceType& weights);\\n\\n void ComputeRealValuedWeightsMatrix();\\n\\n void ComputeShapedInputPaddingMask();\\n\\n void InitializeIOMatrices();\\n\\n\\n\\n using Layer<ElementType>::_layerParameters;\\n\\n using Layer<ElementType>::_output;\\n\\n\\n\\n constexpr static size_t _binaryElementSize = 64;\\n\\n BinaryConvolutionalParameters _convolutionalParameters;\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BinaryConvolutionalLayer.h\",\n \"rank\": 97,\n \"score\": 246325.30653484084\n },\n {\n \"content\": \" /// <summary> Instantiates a blank instance. Used for unarchiving purposes only. </summary>\\n\\n BinaryConvolutionalLayer() : _realValuedShapedInputMatrix(0, 0), _realValuedWeightsMatrix(0, 0), _realValuedOutputMatrix(0, 0) {}\\n\\n\\n\\n /// <summary> Feeds the input forward through the layer and returns a reference to the output. </summary>\\n\\n void Compute() override;\\n\\n\\n\\n /// <summary> Indicates the kind of layer. </summary>\\n\\n ///\\n\\n /// <returns> An enum indicating the layer type. </returns>\\n\\n LayerType GetLayerType() const override { return LayerType::binaryConvolution; }\\n\\n\\n\\n /// <summary> Get the parameters used to control convolution. </summary>\\n\\n ///\\n\\n /// <returns> A BinaryConvolutionalParameters struct. </returns>\\n\\n const BinaryConvolutionalParameters& GetConvolutionalParameters() const { return _convolutionalParameters; }\\n\\n\\n\\n /// <summary> Get the weights for the convolution filters. </summary>\\n\\n ///\\n\\n /// <returns> The weights, packed into a Tensor. </returns>\\n\\n const MatrixType& GetRealFilterWeights() const { return _realValuedWeightsMatrix; }\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BinaryConvolutionalLayer.h\",\n \"rank\": 98,\n \"score\": 246314.58751283484\n },\n {\n \"content\": \"\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n static std::string GetTypeName() { return utilities::GetCompositeTypeName<ElementType>(\\\"BinaryConvolutionalLayer\\\"); }\\n\\n\\n\\n /// <summary> Gets the name of this type (for serialization). </summary>\\n\\n ///\\n\\n /// <returns> The name of this type. </returns>\\n\\n std::string GetRuntimeTypeName() const override { return GetTypeName(); }\\n\\n\\n\\n protected:\\n\\n void WriteToArchive(utilities::Archiver& archiver) const override;\\n\\n void ReadFromArchive(utilities::Unarchiver& archiver) override;\\n\\n\\n\\n private:\\n\\n // Fills a vector of vectors where each row is the set of input values corresponding to a filter, stretched into a vector.\\n\\n // The number of vectors is equal to the number of locations that the filter is slid over the input tensor.\\n\\n void ReceptiveFieldToBinaryRows(ConstTensorReferenceType input, std::vector<std::vector<uint64_t>>& shapedInput);\\n\\n\\n\",\n \"file_path\": \"libraries/predictors/neural/include/BinaryConvolutionalLayer.h\",\n \"rank\": 99,\n \"score\": 246307.67780630264\n }\n]","isConversational":false}}},{"rowIdx":385,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/Titon/Io/Node.hh"},"repo_name":{"kind":"string","value":"ciklon-z/framework"},"commit":{"kind":"string","value":"cbf44729173d3a83b91a2b0a217c6b3827512e44"},"file_code":{"kind":"string","value":"<?hh \n\nnamespace Titon\\Io;\n\nuse Titon\\Io\\Exception\\MissingFileException;\nuse Titon\\Io\\Exception\\ExistingFileException;\nuse Titon\\Utility\\Path;\n\nabstract class Node {\n\n const int OVERWRITE = 0;\n const int MERGE = 1;\n const int SKIP = 2;\n\n \n protected ?Folder $parent;\n\n \n protected string $path = '';\n\n \n public function __construct(string $path, bool $create = false, int $mode = 0755) {\n $this->reset($path);\n\n if ($create) {\n $this->create($mode);\n }\n }\n\n \n public function accessTime(): int {\n if ($this->exists()) {\n return fileatime($this->path());\n }\n\n return 0;\n }\n\n \n public function basename(): string {\n return pathinfo($this->path(), PATHINFO_BASENAME);\n }\n\n \n public function changeTime(): int {\n if ($this->exists()) {\n return filectime($this->path());\n }\n\n return 0;\n }\n\n \n public function chgrp(int $group, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $path = $this->path();\n\n $this->reset();\n\n if (is_link($path)) {\n return lchgrp($path, $group);\n }\n\n return chgrp($path, $group);\n }\n\n \n public function chmod(int $mode, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $this->reset();\n\n return chmod($this->path(), $mode);\n }\n\n \n public function chown(int $user, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $path = $this->path();\n\n $this->reset();\n\n if (is_link($path)) {\n return lchown($path, $user);\n }\n\n return chown($path, $user);\n }\n\n \n abstract public function copy(string $target, int $process = self::OVERWRITE, int $mode = 0755): ?Node;\n\n \n abstract public function create(int $mode = 0755): bool;\n\n \n abstract public function delete(): bool;\n\n \n public static function destroy(string $path): bool {\n if (!file_exists($path)) {\n return false;\n }\n\n return static::load($path)->delete();\n }\n\n \n public function dir(): string {\n return dirname($this->path()) . '/';\n }\n\n \n public function executable(): bool {\n return is_executable($this->path());\n }\n\n \n public function exists(): bool {\n return file_exists($this->path());\n }\n\n \n public function group(): int {\n if ($this->exists()) {\n return filegroup($this->path());\n }\n\n return 0;\n }\n\n \n public function isAbsolute(): bool {\n return Path::isAbsolute($this->path());\n }\n\n \n public function isRelative(): bool {\n return Path::isRelative($this->path());\n }\n\n \n public static function load(string $path): Node {\n if (!file_exists($path)) {\n throw new MissingFileException(sprintf('No file or folder found at %s', $path));\n }\n\n if (is_dir($path)) {\n return new Folder($path);\n }\n\n return new File($path);\n }\n\n \n public function modifyTime(): int {\n if ($this->exists()) {\n return filemtime($this->path());\n }\n\n return 0;\n }\n\n \n public function move(string $target, bool $overwrite = true): bool {\n if (!$this->exists()) {\n return false;\n }\n\n \n if (file_exists($target)) {\n if ($overwrite) {\n static::destroy($target);\n } else {\n throw new ExistingFileException('Cannot move file as the target already exists');\n }\n }\n\n \n if (rename($this->path(), $target)) {\n $this->reset($target);\n\n return true;\n }\n\n return false;\n }\n\n \n public function name(): string {\n return pathinfo($this->path(), PATHINFO_FILENAME);\n }\n\n \n public function owner(): int {\n if ($this->exists()) {\n return fileowner($this->path());\n }\n\n return 0;\n }\n\n \n public function path(): string {\n return $this->pwd();\n }\n\n \n public function parent(): ?Folder {\n if ($this->parent) {\n return $this->parent;\n }\n\n $folder = str_replace('\\\\', '/', dirname($this->path()));\n\n if ($folder !== '.' && $folder !== '/') {\n $this->parent = new Folder($folder);\n }\n\n return $this->parent;\n }\n\n \n public function permissions(): string {\n if ($this->exists()) {\n return substr(sprintf('%o', fileperms($this->path())), -4);\n }\n\n return '';\n }\n\n \n public function pwd(): string {\n return $this->path;\n }\n\n \n public function readable(): bool {\n return is_readable($this->path());\n }\n\n \n public function rename(string $name, bool $overwrite = true): bool {\n if (!$this->exists()) {\n return false;\n }\n\n \n $name = preg_replace('/[^_\\-\\p{Ll}\\p{Lm}\\p{Lo}\\p{Lt}\\p{Lu}\\p{Nd}]/imu', '-', basename($name));\n\n \n if ($name === $this->name()) {\n return true;\n }\n\n \n $target = $this->dir() . $name;\n\n \n if (file_exists($target)) {\n if ($overwrite) {\n static::destroy($target);\n } else {\n throw new ExistingFileException('Cannot rename file as the target already exists');\n }\n }\n\n \n if (rename($this->path(), $target)) {\n $this->reset($target);\n\n return true;\n }\n\n return false;\n }\n\n \n public function reset(string $path = ''): this {\n if ($path) {\n \n $this->path = str_replace('\\\\', '/', $path);\n }\n\n clearstatcache();\n\n return $this;\n }\n\n \n abstract public function size(): int;\n\n \n public function writable(): bool {\n return is_writable($this->path());\n }\n\n}\n"},"prefix":{"kind":"string","value":"<?hh \n\nnamespace Titon\\Io;\n\nuse Titon\\Io\\Exception\\MissingFileException;\nuse Titon\\Io\\Exception\\ExistingFileException;\nuse Titon\\Utility\\Path;\n\nabstract class Node {\n\n const int OVERWRITE = 0;\n const int MERGE = 1;\n const int SKIP = 2;\n\n \n protected ?Folder $parent;\n\n \n protected string $path = '';\n\n \n public function __construct(string $path, bool $create = false, int $mode = 0755) {\n $this->reset($path);\n\n if ($create) {\n $this->create($mode);\n }\n }\n\n \n public function accessTime(): int {\n if ($this->exists()) {\n return fileatime($this->path());\n }\n\n return 0;\n }\n\n \n public function basename(): string {\n return pathinfo($this->path(), PATHINFO_BASENAME);\n }\n\n \n public function changeTime(): int {\n if ($this->exists()) {\n return filectime($this->path());\n }\n\n return 0;\n }\n\n \n public function chgrp(int $group, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $path = $this->path();\n\n $this->reset();\n\n if (is_link($path)) {\n return lchgrp($path, $group);\n }\n\n return chgrp($path, $group);\n }\n\n \n public function chmod(int $mode, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $this->reset();\n\n return chmod($this"},"suffix":{"kind":"string","value":" \n public function modifyTime(): int {\n if ($this->exists()) {\n return filemtime($this->path());\n }\n\n return 0;\n }\n\n \n public function move(string $target, bool $overwrite = true): bool {\n if (!$this->exists()) {\n return false;\n }\n\n \n if (file_exists($target)) {\n if ($overwrite) {\n static::destroy($target);\n } else {\n throw new ExistingFileException('Cannot move file as the target already exists');\n }\n }\n\n \n if (rename($this->path(), $target)) {\n $this->reset($target);\n\n return true;\n }\n\n return false;\n }\n\n \n public function name(): string {\n return pathinfo($this->path(), PATHINFO_FILENAME);\n }\n\n \n public function owner(): int {\n if ($this->exists()) {\n return fileowner($this->path());\n }\n\n return 0;\n }\n\n \n public function path(): string {\n return $this->pwd();\n }\n\n \n public function parent(): ?Folder {\n if ($this->parent) {\n return $this->parent;\n }\n\n $folder = str_replace('\\\\', '/', dirname($this->path()));\n\n if ($folder !== '.' && $folder !== '/') {\n $this->parent = new Folder($folder);\n }\n\n return $this->parent;\n }\n\n \n public function permissions(): string {\n if ($this->exists()) {\n return substr(sprintf('%o', fileperms($this->path())), -4);\n }\n\n return '';\n }\n\n \n public function pwd(): string {\n return $this->path;\n }\n\n \n public function readable(): bool {\n return is_readable($this->path());\n }\n\n \n public function rename(string $name, bool $overwrite = true): bool {\n if (!$this->exists()) {\n return false;\n }\n\n \n $name = preg_replace('/[^_\\-\\p{Ll}\\p{Lm}\\p{Lo}\\p{Lt}\\p{Lu}\\p{Nd}]/imu', '-', basename($name));\n\n \n if ($name === $this->name()) {\n return true;\n }\n\n \n $target = $this->dir() . $name;\n\n \n if (file_exists($target)) {\n if ($overwrite) {\n static::destroy($target);\n } else {\n throw new ExistingFileException('Cannot rename file as the target already exists');\n }\n }\n\n \n if (rename($this->path(), $target)) {\n $this->reset($target);\n\n return true;\n }\n\n return false;\n }\n\n \n public function reset(string $path = ''): this {\n if ($path) {\n \n $this->path = str_replace('\\\\', '/', $path);\n }\n\n clearstatcache();\n\n return $this;\n }\n\n \n abstract public function size(): int;\n\n \n public function writable(): bool {\n return is_writable($this->path());\n }\n\n}\n"},"middle":{"kind":"string","value":"->path(), $mode);\n }\n\n \n public function chown(int $user, bool $recursive = false): bool {\n if (!$this->exists()) {\n return false;\n }\n\n $path = $this->path();\n\n $this->reset();\n\n if (is_link($path)) {\n return lchown($path, $user);\n }\n\n return chown($path, $user);\n }\n\n \n abstract public function copy(string $target, int $process = self::OVERWRITE, int $mode = 0755): ?Node;\n\n \n abstract public function create(int $mode = 0755): bool;\n\n \n abstract public function delete(): bool;\n\n \n public static function destroy(string $path): bool {\n if (!file_exists($path)) {\n return false;\n }\n\n return static::load($path)->delete();\n }\n\n \n public function dir(): string {\n return dirname($this->path()) . '/';\n }\n\n \n public function executable(): bool {\n return is_executable($this->path());\n }\n\n \n public function exists(): bool {\n return file_exists($this->path());\n }\n\n \n public function group(): int {\n if ($this->exists()) {\n return filegroup($this->path());\n }\n\n return 0;\n }\n\n \n public function isAbsolute(): bool {\n return Path::isAbsolute($this->path());\n }\n\n \n public function isRelative(): bool {\n return Path::isRelative($this->path());\n }\n\n \n public static function load(string $path): Node {\n if (!file_exists($path)) {\n throw new MissingFileException(sprintf('No file or folder found at %s', $path));\n }\n\n if (is_dir($path)) {\n return new Folder($path);\n }\n\n return new File($path);\n }\n\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" public function copy(string $target, int $process = self::MERGE, int $mode = 0755): ?Node {\n\n if (!$this->exists()) {\n\n return null;\n\n }\n\n\n\n // Delete the target folder if overwrite is true\n\n if ($process === self::OVERWRITE && file_exists($target)) {\n\n static::destroy($target);\n\n }\n\n\n\n // Create the target folder and reset folder path\n\n $destination = new Folder($target, true, $mode);\n\n $target = $destination->path();\n\n\n\n // Recursively copy over contents to new destination\n\n if ($contents = $this->read()) {\n\n foreach ($contents as $file) {\n\n $to = str_replace($this->path(), $target, $file->path());\n\n\n\n // Skip copy if target exists\n","file_path":"src/Titon/Io/Folder.hh","rank":1,"score":657572.9135432713},{"content":" public function create(int $mode = 0755): bool {\n\n if (!$this->exists()) {\n\n return mkdir($this->path(), $mode, true);\n\n }\n\n\n\n return false;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n *\n\n * @return \\Titon\\Io\\Folder\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":2,"score":633753.2711682812},{"content":" public function create(int $mode = 0755): bool {\n\n $folder = $this->parent();\n\n\n\n if (!$folder) {\n\n return false;\n\n }\n\n\n\n if (!$folder->exists()) {\n\n $folder->create();\n\n }\n\n\n\n if (!$this->exists() && $folder->writable()) {\n\n if (touch($this->path())) {\n\n if ($mode) {\n\n $this->chmod($mode);\n\n }\n\n\n\n return true;\n\n }\n\n }\n\n\n\n return false;\n\n }\n\n\n\n /**\n\n * Remove the file if it exists.\n\n *\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":3,"score":582697.5168604227},{"content":" public function matches(string $pattern, bool $return = false, int $flags = 0): mixed {\n\n $matches = [];\n\n $regex = preg_match($pattern, $this->value(), $matches, $flags);\n\n\n\n return $return ? $matches : $regex;\n\n }\n\n\n\n /**\n\n * Pad the string with a defined character for a specific length.\n\n *\n\n * @param int $length\n\n * @param string $value\n\n * @param int $type\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":4,"score":559230.532892925},{"content":" public function chgrp(int $group, bool $recursive = false): bool {\n\n if ($recursive) {\n\n if ($contents = $this->read()) {\n\n foreach ($contents as $file) {\n\n $file->chgrp($group, true);\n\n }\n\n }\n\n }\n\n\n\n return parent::chgrp($group);\n\n }\n\n\n\n /**\n\n * Change the permissions mode of the file.\n\n * If $recursive is true, set the mode on all children.\n\n *\n\n * @param int $mode\n\n * @param bool $recursive\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":7,"score":530309.5617393558},{"content":" public function chmod(int $mode, bool $recursive = false): bool {\n\n if ($recursive) {\n\n if ($contents = $this->read()) {\n\n foreach ($contents as $file) {\n\n $file->chmod($mode, true);\n\n }\n\n }\n\n }\n\n\n\n return parent::chmod($mode);\n\n }\n\n\n\n /**\n\n * Change the owner of the file.\n\n * If $recursive is true, set the owner on all children.\n\n *\n\n * @param int $user\n\n * @param bool $recursive\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":8,"score":530304.6112638105},{"content":" public function copy(string $target, int $process = self::OVERWRITE, int $mode = 0755): ?File {\n\n if (!$this->exists()) {\n\n return null;\n\n }\n\n\n\n if (file_exists($target) && $process !== self::OVERWRITE) {\n\n throw new ExistingFileException('Cannot copy file as the target already exists');\n\n }\n\n\n\n if (copy($this->path(), $target)) {\n\n $file = new File($target);\n\n $file->chmod($mode);\n\n\n\n return $file;\n\n }\n\n\n\n return null;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":9,"score":528213.5038988425},{"content":" public function read(int $length = -1, string $mode = 'rb'): string {\n\n if (!$this->open($mode)) {\n\n return '';\n\n }\n\n\n\n if ($this->lock()) {\n\n if ($length === -1) {\n\n $length = $this->size() ?: 1;\n\n }\n\n\n\n $content = fread($this->handle, $length);\n\n\n\n $this->close();\n\n\n\n return $content;\n\n }\n\n\n\n return '';\n\n }\n\n\n\n /**\n\n * Reset the cache and path.\n\n *\n\n * @param string $path\n\n * @return $this\n\n * @throws \\Titon\\Io\\Exception\\InvalidPathException\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":10,"score":515143.9477853278},{"content":" public function decrement(string $key, int $step = 1, int $initial = 0): int {\n\n $item = $this->getItem($key);\n\n\n\n $value = ((int) $item->get() ?: $initial) - $step;\n\n\n\n $item->set($value);\n\n\n\n $this->save($item);\n\n\n\n return $value;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/AbstractStorage.hh","rank":11,"score":501724.6770829136},{"content":" public function increment(string $key, int $step = 1, int $initial = 0): int {\n\n $item = $this->getItem($key);\n\n\n\n $value = ((int) $item->get() ?: $initial) + $step;\n\n\n\n $item->set($value);\n\n\n\n $this->save($item);\n\n\n\n return $value;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/AbstractStorage.hh","rank":12,"score":501724.6770829136},{"content":" public function indexOf(string $needle, bool $strict = true, int $offset = 0): int {\n\n return Str::indexOf($this->value(), $needle, $strict, $offset);\n\n }\n\n\n\n /**\n\n * Checks to see if the value is empty.\n\n *\n\n * @return bool\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":13,"score":501458.848874884},{"content":" public function contains(string $needle, bool $strict = true, int $offset = 0): bool {\n\n return Str::contains($this->value(), $needle, $strict, $offset);\n\n }\n\n\n\n /**\n\n * Checks to see if the string ends with a specific value.\n\n *\n\n * @uses Titon\\Utility\\Str\n\n *\n\n * @param string $value\n\n * @return bool\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":14,"score":501379.07805661275},{"content":" public function lastIndexOf(string $needle, bool $strict = true, int $offset = 0): int {\n\n return Str::lastIndexOf($this->value(), $needle, $strict, $offset);\n\n }\n\n\n\n /**\n\n * Return the string length.\n\n *\n\n * @return int\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":15,"score":497501.66525776667},{"content":" public function toString(bool $indent = true, int $depth = 0): string {\n\n $xml = '';\n\n\n\n // Set root XML tag\n\n if ($this->isRoot()) {\n\n $xml = sprintf('<?xml%s?>', $this->formatAttributes($this->getDeclaration())) . PHP_EOL;\n\n }\n\n\n\n // Apply indenting for nested elements\n\n if ($indent) {\n\n $xml .= str_repeat(' ', $depth);\n\n }\n\n\n\n // Build the tag, its attributes and namespaces\n\n $xml .= sprintf('<%s%s%s',\n\n $this->getName(),\n\n $this->formatNamespaces($this->getNamespaces()),\n\n $this->formatAttributes($this->getAttributes())\n\n );\n\n\n","file_path":"src/Titon/Type/Xml/Element.hh","rank":16,"score":497149.5390655238},{"content":" public function open(string $mode): bool {\n\n if (!$this->exists()) {\n\n return false;\n\n }\n\n\n\n if (is_resource($this->handle)) {\n\n if ($mode === $this->mode) {\n\n return true;\n\n } else {\n\n $this->close();\n\n }\n\n }\n\n\n\n $this->reset();\n\n\n\n $this->handle = fopen($this->path(), $mode);\n\n $this->mode = $mode;\n\n\n\n return is_resource($this->handle);\n\n }\n\n\n\n /**\n\n * Prepend data to the beginning of a file.\n\n *\n\n * @param string $data\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":17,"score":491216.34999441914},{"content":" public function move(string $target, bool $overwrite = true): bool {\n\n if (Path::ds($target, true) === Path::ds($this->path(), true)) {\n\n return true; // Don't move to the same location\n\n }\n\n\n\n return parent::move($target, $overwrite);\n\n }\n\n\n\n /**\n\n * Scan the folder and return a list of File and Folder objects.\n\n *\n\n * @param bool $sort\n\n * @param bool $recursive\n\n * @param int $filter\n\n * @return Vector<Node>\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":20,"score":485370.45086465625},{"content":" public function provides(string $class): bool;\n\n\n\n /**\n\n * The `register` method is where any necessary retrieving and registering\n\n * with the Depository container will happen that is necessary for the\n\n * Service Provider.\n\n *\n\n * @return void\n\n */\n","file_path":"src/Titon/Context/ServiceProvider.hh","rank":21,"score":484672.25943253795},{"content":" public function find(string $pattern, int $filter = self::ALL): Vector<Node> {\n\n $contents = Vector {};\n\n\n\n if (!$this->exists()) {\n\n return $contents;\n\n }\n\n\n\n try {\n\n $iterator = new GlobIterator($this->path() . $pattern, FilesystemIterator::SKIP_DOTS | FilesystemIterator::UNIX_PATHS);\n\n } catch (Exception $e) {\n\n return $contents;\n\n }\n\n\n\n /** @var \\SPLFileInfo $file */\n\n foreach ($iterator as $file) {\n\n if ($file->isDir() && ($filter === self::ALL || $filter === self::FOLDERS)) {\n\n $contents[] = new Folder($file->getPathname());\n\n\n\n } else if ($file->isFile() && ($filter === self::ALL || $filter === self::FILES)) {\n\n $contents[] = new File($file->getPathname());\n","file_path":"src/Titon/Io/Folder.hh","rank":22,"score":484554.103676194},{"content":" public function write(string $data, string $mode = 'w', bool $close = true): bool {\n\n if (!$this->open($mode)) {\n\n return false;\n\n }\n\n\n\n if ($this->lock(LOCK_EX)) {\n\n $result = fwrite($this->handle, $data);\n\n\n\n $this->unlock();\n\n\n\n if ($close) {\n\n $this->close();\n\n }\n\n\n\n return (bool) $result;\n\n }\n\n\n\n return false;\n\n }\n\n\n\n}\n","file_path":"src/Titon/Io/File.hh","rank":23,"score":479974.3228687397},{"content":" public function __construct(string $path, string $mode = 'r+b') {\n\n if (!file_exists($path)) {\n\n throw new MissingFileException(sprintf('File does not exist at path %s', $path));\n\n }\n\n\n\n $this->setStream(fopen($path, $mode));\n\n }\n\n\n\n}","file_path":"src/Titon/Http/Stream/FileStream.hh","rank":24,"score":479923.02217158605},{"content":" public function lock(int $mode = LOCK_SH): bool {\n\n if (is_resource($this->handle)) {\n\n return flock($this->handle, $mode);\n\n }\n\n\n\n return false;\n\n }\n\n\n\n /**\n\n * Return an MD5 checksum of the file.\n\n *\n\n * @param bool $raw\n\n * @return string\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":25,"score":475143.79627577425},{"content":" public function read(bool $sort = false, bool $recursive = false, int $filter = self::ALL): Vector<Node> {\n\n $contents = Vector {};\n\n\n\n if (!$this->exists()) {\n\n return $contents;\n\n }\n\n\n\n try {\n\n $flags = FilesystemIterator::SKIP_DOTS | FilesystemIterator::UNIX_PATHS;\n\n\n\n if ($recursive) {\n\n $iterator = new RecursiveIteratorIterator(new RecursiveDirectoryIterator($this->path(), $flags), RecursiveIteratorIterator::CHILD_FIRST);\n\n } else {\n\n $iterator = new FilesystemIterator($this->path(), $flags);\n\n }\n\n } catch (Exception $e) {\n\n return $contents;\n\n }\n\n\n\n /** @var \\SPLFileInfo $file */\n","file_path":"src/Titon/Io/Folder.hh","rank":26,"score":472585.59348630364},{"content":" public function __construct(string $name, string $value, mixed $expires = 0, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false) {\n\n $this->setName($name);\n\n $this->setValue($value);\n\n $this->setExpires($expires);\n\n $this->setPath($path);\n\n $this->setDomain($domain);\n\n $this->setHttpOnly($httpOnly);\n\n $this->setSecure($secure);\n\n }\n\n\n\n /**\n\n * Return the cookie as a valid HTTP cookie string.\n\n *\n\n * @return string\n\n */\n","file_path":"src/Titon/Http/Cookie.hh","rank":29,"score":470693.43244014843},{"content":" public function provides(string $className): bool {\n\n return $this->provides->linearSearch($className) >= 0;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Context/ServiceProvider/AbstractServiceProvider.hh","rank":31,"score":464877.70467098895},{"content":" public function __construct(public string $string, public int $int = 0): void {}\n\n}\n","file_path":"tests/Titon/Test/Stub/Annotation/BarAnnotationStub.hh","rank":32,"score":464348.57019086985},{"content":" public function decrement(string $key, int $step = 1, int $initial = 0): int;\n\n\n\n /**\n\n * Delete a single item from the pool.\n\n *\n\n * @param string $key\n\n * @return $this\n\n */\n","file_path":"src/Titon/Cache/Storage.hh","rank":33,"score":462916.3581825262},{"content":" public function increment(string $key, int $step = 1, int $initial = 0): int;\n\n\n\n /**\n\n * Remove the item if it exists and return true, else return false.\n\n *\n\n * @param string $key\n\n * @return bool\n\n */\n","file_path":"src/Titon/Cache/Storage.hh","rank":34,"score":462916.3581825262},{"content":" public function decrement(string $key, int $step = 1, int $initial = 0, string $storage = 'default'): int {\n\n return $this->getStorage($storage)->decrement($key, $step, $initial);\n\n }\n\n\n\n /**\n\n * Empty the cache.\n\n *\n\n * @param string $storage\n\n * @return bool\n\n */\n","file_path":"src/Titon/Cache/Cache.hh","rank":35,"score":462189.8326259864},{"content":" public function increment(string $key, int $step = 1, int $initial = 0, string $storage = 'default'): int {\n\n return $this->getStorage($storage)->increment($key, $step, $initial);\n\n }\n\n\n\n /**\n\n * Remove the item if it exists and return true, else return false.\n\n *\n\n * @param string $key\n\n * @param string $storage\n\n * @return bool\n\n */\n","file_path":"src/Titon/Cache/Cache.hh","rank":36,"score":462189.8326259864},{"content":" public function setCookie(string $name, string $value, mixed $expires = 0, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false): this {\n\n return $this->addHeader('Set-Cookie', (string) new Cookie($name, $value, $expires, $path, $domain, $httpOnly, $secure));\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Http/Server/Response.hh","rank":37,"score":460488.21151778},{"content":" public function removeCookie(string $name, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false): this {\n\n return $this->setCookie($name, '', time(), $path, $domain, $httpOnly, $secure);\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Http/Server/Response.hh","rank":38,"score":452202.0425341915},{"content":" public function addPath(string $domain, string $path): this {\n\n if (!$this->getPaths()->contains($domain)) {\n\n $this->paths[$domain] = Set {};\n\n }\n\n\n\n $this->paths[$domain][] = Path::ds($path, true);\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Io/Bundle/AbstractBundle.hh","rank":39,"score":450481.6169861552},{"content":" public function reset(string $path = ''): this {\n\n if ($path) {\n\n if (file_exists($path) && is_file($path)) {\n\n throw new InvalidPathException(sprintf('Invalid folder path %s, files are not allowed', $path));\n\n }\n\n\n\n if (substr($path, -1) !== '/') {\n\n $path .= '/';\n\n }\n\n }\n\n\n\n return parent::reset($path);\n\n }\n\n\n\n /**\n\n * Return the number of files in the current folder.\n\n *\n\n * @return int\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":41,"score":449093.42119674175},{"content":" public function cd(string $path): this {\n\n return $this->reset($path);\n\n }\n\n\n\n /**\n\n * Change the group of the file.\n\n * If $recursive is true, set the group on all children.\n\n *\n\n * @param int $group\n\n * @param bool $recursive\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":42,"score":449093.42119674175},{"content":" function str_contains(string $string, string $needle, bool $strict = true, int $offset = 0): bool {\n\n return Str::contains($string, $needle, $strict, $offset);\n\n }\n\n\n\n /**\n\n * @see Titon\\Utility\\Str::endsWith()\n\n */\n","file_path":"src/Titon/Utility/bootstrap.hh","rank":43,"score":446384.05456120276},{"content":" public function addPath(string $path): this {\n\n $this->paths[] = Path::ds($path, true);\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/View/Locator/AbstractLocator.hh","rank":44,"score":446077.5942289059},{"content":" public function compare(string $value, int $length = 0): int {\n\n return Str::compare($this->value(), $value, $length);\n\n }\n\n\n\n /**\n\n * Concatenate two strings and return a new string object.\n\n *\n\n * @param string $string\n\n * @param bool $append\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":45,"score":444906.18739608605},{"content":" public function __construct(string $path, int $status = Http::OK) {\n\n parent::__construct(null, $status);\n\n\n\n if (!file_exists($path)) {\n\n throw new MissingFileException(sprintf('File %s does not exist', basename($path)));\n\n\n\n } else if (!is_readable($path)) {\n\n throw new InvalidFileException(sprintf('File %s is not readable', basename($path)));\n\n }\n\n\n\n $this->path = $path;\n\n $this->contentDisposition(basename($path));\n\n }\n\n\n\n /**\n\n * Return the file path.\n\n *\n\n * @return string\n\n */\n","file_path":"src/Titon/Http/Server/DownloadResponse.hh","rank":46,"score":444862.9543540175},{"content":" public function __construct(string $path = '') {\n\n if ($path && !file_exists($path)) {\n\n throw new MissingFileException(sprintf('File %s does not exist', $path));\n\n }\n\n\n\n parent::__construct($path);\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Io/Reader/AbstractReader.hh","rank":47,"score":444832.1226173101},{"content":" public function write($string): ?int {\n\n if (!$this->isWritable()) {\n\n return null;\n\n }\n\n\n\n $write = fwrite($this->getStream(), $string);\n\n\n\n return ($write === false) ? null : $write;\n\n }\n\n\n\n}\n","file_path":"src/Titon/Http/Stream/AbstractStream.hh","rank":48,"score":444710.85052697756},{"content":" public function set(string $key, mixed $value, int $expires): bool;\n\n\n\n /**\n\n * Set the unique cache key prefix.\n\n *\n\n * @param string $prefix\n\n * @return $this\n\n */\n","file_path":"src/Titon/Cache/Storage.hh","rank":49,"score":442599.3402497653},{"content":" public function chown(int $user, bool $recursive = false): bool {\n\n if ($recursive) {\n\n if ($contents = $this->read()) {\n\n foreach ($contents as $file) {\n\n $file->chown($user, true);\n\n }\n\n }\n\n }\n\n\n\n return parent::chown($user);\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Io/Folder.hh","rank":51,"score":439002.6636521898},{"content":" public function hasNamespace(string $key): bool {\n\n return $this->getNamespaces()->contains($key);\n\n }\n\n\n\n /**\n\n * Return true if the element has any namespaces.\n\n *\n\n * @return bool\n\n */\n","file_path":"src/Titon/Type/Xml/Element.hh","rank":52,"score":438141.1368581663},{"content":" public function set(string $key, mixed $value, int $expires): bool {\n\n $this->setCache($this->getPrefix() . $key, $value);\n\n\n\n return true;\n\n }\n\n\n\n}\n","file_path":"src/Titon/Cache/Storage/MemoryStorage.hh","rank":53,"score":433756.3334236911},{"content":" public function set(string $key, mixed $value, int $expires): bool {\n\n return $this->getRedis()->setex($this->getPrefix() . $key, $expires - time(), serialize($value)); // Redis is TTL\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/RedisStorage.hh","rank":54,"score":433756.33342369116},{"content":" public function set(string $key, mixed $value, int $expires): bool {\n\n return $this->getMemcache()->set($this->getPrefix() . $key, $value, $expires);\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/MemcacheStorage.hh","rank":55,"score":433756.3334236911},{"content":" public function set(string $key, mixed $value, int $expires): bool {\n\n return apc_store($this->getPrefix() . $key, $value, $expires - time()); // APC uses TTL\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/ApcStorage.hh","rank":56,"score":433756.3334236911},{"content":" public function isInServiceProvider(string $className): bool {\n\n foreach ($this->providers as $provider) {\n\n if ($provider->provides($className)) {\n\n $provider->initialize();\n\n\n\n return true;\n\n }\n\n }\n\n\n\n return false;\n\n }\n\n\n\n /**\n\n * Return whether or not an alias has been registered in the container.\n\n *\n\n * @param string $alias Registered key or class name\n\n * @return bool\n\n */\n","file_path":"src/Titon/Context/Depository.hh","rank":57,"score":432570.86731232016},{"content":" public function toJson(int $options = 0): string;\n\n\n\n}","file_path":"src/Titon/Common/Jsonable.hh","rank":58,"score":432402.20227716723},{"content":" public function set(string $key, mixed $value, int $expires): bool {\n\n return $this->loadCache($key)->write($expires . \"\\n\" . serialize($value));\n\n }\n\n\n\n /**\n\n * Build an absolute path to the cache on the file system using the defined key.\n\n *\n\n * @param string $key\n\n * @return string\n\n */\n\n <<__Memoize>>\n","file_path":"src/Titon/Cache/Storage/FileSystemStorage.hh","rank":59,"score":429560.8481722774},{"content":" public function toJson(int $options = 0): string {\n\n return json_encode($this, $options);\n\n }\n\n\n\n /**\n\n * Return the list as a map.\n\n *\n\n * @return Map<int, Tv>\n\n */\n","file_path":"src/Titon/Type/ArrayList.hh","rank":60,"score":428152.41661493725},{"content":" public function toJson(int $options = 0): string {\n\n return json_encode($this, $options);\n\n }\n\n\n\n /**\n\n * Return the map as a Map.\n\n *\n\n * @return Map<Tk, Tv>\n\n */\n","file_path":"src/Titon/Type/HashMap.hh","rank":61,"score":428152.41661493725},{"content":" public function split(string $delimiter = '', int $length = 0): Vector<string> {\n\n if ($delimiter !== '') {\n\n if ($length !== 0) {\n\n $chars = explode($delimiter, $this->value(), $length);\n\n } else {\n\n $chars = explode($delimiter, $this->value());\n\n }\n\n } else {\n\n $chars = str_split($this->value(), $length ?: 1);\n\n }\n\n\n\n return new Vector($chars);\n\n }\n\n\n\n /**\n\n * Converts the string to a camel case form.\n\n *\n\n * @uses Titon\\Utility\\Inflector\n\n *\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":62,"score":427726.9020788524},{"content":" public function escape(string $value, ?bool $escape = null): string {\n\n if ($escape === null) {\n\n $escape = $this->getEscaping();\n\n }\n\n\n\n if ($escape) {\n\n $value = Sanitize::escape($value);\n\n }\n\n\n\n return $value;\n\n }\n\n\n\n /**\n\n * Return the automatic escaping setting.\n\n *\n\n * @return bool\n\n */\n","file_path":"src/Titon/View/Helper/AbstractHelper.hh","rank":63,"score":427379.3232415163},{"content":" public function __construct(string $event, int $priority = Emitter::AUTO_PRIORITY, bool $once = false) {\n\n $this->event = $event;\n\n $this->priority = $priority;\n\n $this->once = $once;\n\n }\n\n\n\n /**\n\n * Return the event key.\n\n *\n\n * @return string\n\n */\n","file_path":"src/Titon/Event/Annotation/Observer.hh","rank":64,"score":417950.896958671},{"content":" public function some((function(int, Tv): bool) $callback): bool {\n\n return Col::some($this->value(), $callback);\n\n }\n\n\n\n /**\n\n * Sort the items in the list using a custom callback or the default sorting mechanism.\n\n *\n\n * @param (function(Tv, Tv): int) $callback\n\n * @param int $flags\n\n * @return \\Titon\\Type\\ArrayList<Tv>\n\n */\n","file_path":"src/Titon/Type/ArrayList.hh","rank":66,"score":412422.2323519788},{"content":" public function preparePath(string $path, string $ext): string {\n\n\n\n // Don't modify external assets\n\n if (substr($path, 0, 2) === '//' || preg_match('/^https?:/i', $path)) {\n\n return $path;\n\n }\n\n\n\n // Remove query string\n\n $parts = explode('?', $path);\n\n $path = $parts[0];\n\n $query = array_key_exists(1, $parts) ? $parts[1] : '';\n\n\n\n // Apply extension\n\n if (substr($path, -(strlen($ext) + 1)) !== '.' . $ext) {\n\n $path .= '.' . $ext;\n\n }\n\n\n\n // Apply query\n\n if ($query) {\n\n $path .= '?' . $query;\n","file_path":"src/Titon/View/Helper/AssetHelper.hh","rank":67,"score":412169.34944833536},{"content":" public function addPath(string $domain, string $path): this;\n\n\n\n /**\n\n * Add multiple resource paths.\n\n *\n\n * @param string $domain\n\n * @param \\Titon\\Io\\PathList $paths\n\n * @return $this\n\n */\n","file_path":"src/Titon/Io/Bundle.hh","rank":68,"score":410437.3137149102},{"content":" public function every((function(int, Tv): bool) $callback): bool {\n\n return Col::every($this->value(), $callback);\n\n }\n\n\n\n /**\n\n * Return the first item in the list.\n\n *\n\n * @return ?Tv\n\n */\n","file_path":"src/Titon/Type/ArrayList.hh","rank":69,"score":408913.03246565594},{"content":" public function __construct(string $path, string $action) {\n\n $this->action = Router::parseAction($action);\n\n $this->append($path);\n\n }\n\n\n\n /**\n\n * Append onto the path. This must be done before compilation.\n\n *\n\n * @param string $path\n\n * @return $this\n\n */\n","file_path":"src/Titon/Route/Route.hh","rank":70,"score":406865.00437979423},{"content":" public function addMessagePath(string $domain, string $path): this {\n\n $this->getMessageBundle()->addPath($domain, $path . '/' . $this->getCode());\n\n\n\n // Pass it to the parent also\n\n $this->getParentLocale()?->addMessagePath($domain, $path);\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Add multiple message lookup paths.\n\n *\n\n * @param string $domain\n\n * @param \\Titon\\Io\\PathList $paths\n\n * @return $this\n\n */\n","file_path":"src/Titon/Intl/Locale.hh","rank":71,"score":406845.42530025716},{"content":" public function addResourcePath(string $domain, string $path): this {\n\n $path = rtrim($path, '/');\n\n\n\n $this->addLocalePath(sprintf('%s/locales', $path));\n\n $this->addMessagePath($domain, sprintf('%s/messages', $path));\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Add multiple resource lookup paths.\n\n *\n\n * @param string $domain\n\n * @param \\Titon\\Io\\PathList $paths\n\n * @return $this\n\n */\n","file_path":"src/Titon/Intl/Locale.hh","rank":72,"score":406845.4253002571},{"content":" public function parent(): string {\n\n return $this->get($this->active());\n\n }\n\n\n\n /**\n\n * Prepend a string to a block.\n\n * If a block does not exist, create it.\n\n *\n\n * @param string $key\n\n * @param string $value\n\n * @return $this\n\n */\n","file_path":"src/Titon/View/Helper/BlockHelper.hh","rank":73,"score":406782.18757007853},{"content":" public function getMode(): string {\n\n return $this->mode;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n\n public static function getSupportedMethods(): Vector<string> {\n\n return Vector {\n\n self::AES_128_CBC,\n\n self::AES_128_CFB,\n\n self::AES_128_OFB,\n\n self::AES_192_CBC,\n\n self::AES_192_CFB,\n\n self::AES_192_OFB,\n\n self::AES_256_CBC,\n\n self::AES_256_CFB,\n\n self::AES_256_OFB,\n\n self::BLOWFISH_CBC,\n\n self::BLOWFISH_CFB,\n","file_path":"src/Titon/Crypto/AbstractCipher.hh","rank":74,"score":405722.3609044758},{"content":" public function setPath(string $path): this {\n\n $this->path = $path ?: '/';\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Set the secure HTTPS flag.\n\n *\n\n * @param bool $secure\n\n * @return $this\n\n */\n","file_path":"src/Titon/Http/Cookie.hh","rank":75,"score":405140.435522363},{"content":" public function addPath(string $path): this;\n\n\n\n /**\n\n * Add multiple lookup paths.\n\n *\n\n * @param \\Titon\\View\\PathList $paths\n\n * @return $this\n\n */\n","file_path":"src/Titon/View/Locator.hh","rank":76,"score":405140.435522363},{"content":" public function __construct(string $path) {\n\n $this->lookupPath = rtrim($path, '/') . '/';\n\n }\n\n\n\n /**\n\n * Return the name of the environment.\n\n *\n\n * @return string\n\n */\n","file_path":"src/Titon/Environment/Detector.hh","rank":77,"score":403698.01011840184},{"content":" public function addLocalePath(string $path): this {\n\n $this->getLocaleBundle()->addPath(MessageLoader::DEFAULT_DOMAIN, $path . '/' . $this->getCode());\n\n\n\n // Pass it to the parent also\n\n $this->getParentLocale()?->addLocalePath($path);\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Add multiple locale lookup paths.\n\n *\n\n * @param \\Titon\\Io\\PathList $paths\n\n * @return $this\n\n */\n","file_path":"src/Titon/Intl/Locale.hh","rank":78,"score":401102.59418474184},{"content":" public function charAt(int $index): ?string {\n\n return Str::charAt($this->value(), $index);\n\n }\n\n\n\n /**\n\n * Removes all extraneous whitespace from a string and trims it.\n\n *\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":79,"score":400761.0928409145},{"content":" public function getMode(): string {\n\n return (string) $this->cache['mode'];\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Http/Stream/AbstractStream.hh","rank":80,"score":400506.39790838695},{"content":" public function endsWith(string $value): bool {\n\n return Str::endsWith($this->value(), $value);\n\n }\n\n\n\n /**\n\n * Checks to see if both values are equal.\n\n *\n\n * @param string $value\n\n * @return bool\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":81,"score":400474.60651399137},{"content":" public function equals(string $value): bool {\n\n return ($this->value() === $value);\n\n }\n\n\n\n /**\n\n * Escape the string.\n\n *\n\n * @uses Titon\\Utility\\Sanitize\n\n *\n\n * @param int $flags\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":82,"score":400474.60651399137},{"content":" public function startsWith(string $value): bool {\n\n return Str::startsWith($this->value(), $value);\n\n }\n\n\n\n /**\n\n * Strips the string of its tags and anything in between them.\n\n *\n\n * @return \\Titon\\Type\\StringBuffer\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":83,"score":400474.60651399137},{"content":" public function getPath(): string {\n\n return $this->path();\n\n }\n\n\n\n}\n","file_path":"src/Titon/Io/Reader/AbstractReader.hh","rank":84,"score":400342.37383910466},{"content":" public function getPath(): string {\n\n return $this->path();\n\n }\n\n\n\n}","file_path":"src/Titon/Io/Writer/AbstractWriter.hh","rank":85,"score":400342.37383910466},{"content":" public function __construct(string $key, string $class, string $function, Depository $depository) {\n\n parent::__construct($key, $depository);\n\n\n\n $this->class = $class;\n\n $this->function = $function;\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Context/Definition/CallableDefinition.hh","rank":86,"score":399950.8159078739},{"content":" public function extract(int $offset, int $length = 0): StringBuffer {\n\n return new static(Str::extract($this->value(), $offset, $length));\n\n }\n\n\n\n /**\n\n * Grab the index of the first matched character.\n\n *\n\n * @uses Titon\\Utility\\Str\n\n *\n\n * @param string $needle\n\n * @param bool $strict\n\n * @param int $offset\n\n * @return int\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":87,"score":399780.77589634643},{"content":" public function addScript(string $script, string $location = 'footer', int $order = 0, string $env = ''): this {\n\n $scripts = $this->getScripts();\n\n\n\n if (!$scripts->contains($location)) {\n\n $this->scripts[$location] = Map {};\n\n }\n\n\n\n if ($order === 0) {\n\n $order = count($scripts[$location]);\n\n }\n\n\n\n while ($scripts[$location]->contains($order)) {\n\n $order++;\n\n }\n\n\n\n $this->scripts[$location][$order] = shape(\n\n 'path' => $this->preparePath($script, 'js'),\n\n 'attributes' => Map {},\n\n 'env' => $env\n\n );\n","file_path":"src/Titon/View/Helper/AssetHelper.hh","rank":88,"score":397273.89727538987},{"content":" public function reset(string $path = ''): this;\n\n\n\n /**\n\n * Truncate the resource file and write data to it.\n\n *\n\n * @param \\Titon\\Io\\ResourceMap $data\n\n * @return bool\n\n */\n","file_path":"src/Titon/Io/Writer.hh","rank":89,"score":397030.4077990041},{"content":" public function reset(string $path = ''): this;\n\n\n\n}","file_path":"src/Titon/Io/Reader.hh","rank":90,"score":397030.4077990041},{"content":" public function prepend(string $path): this {\n\n $this->path = '/' . trim($path, '/') . rtrim($this->path, '/');\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Serialize the compiled route for increasing performance when caching mapped routes.\n\n */\n","file_path":"src/Titon/Route/Route.hh","rank":91,"score":397030.4077990041},{"content":" public function reset(string $path = ''): this {\n\n if ($path && file_exists($path) && is_dir($path)) {\n\n throw new InvalidPathException(sprintf('Invalid file path %s, folders are not allowed', $path));\n\n }\n\n\n\n return parent::reset($path);\n\n }\n\n\n\n /**\n\n * Return the current file size.\n\n *\n\n * @return int\n\n */\n","file_path":"src/Titon/Io/File.hh","rank":92,"score":397030.4077990041},{"content":" public function append(string $path): this {\n\n $this->path .= '/' . trim($path, '/');\n\n\n\n return $this;\n\n }\n\n\n\n /**\n\n * Compile the given path into a detectable regex pattern.\n\n *\n\n * @return string\n\n * @throws \\Titon\\Route\\Exception\\MissingPatternException\n\n */\n","file_path":"src/Titon/Route/Route.hh","rank":93,"score":397030.4077990041},{"content":" public function wordCount(string $inherit = ''): int {\n\n return str_word_count($this->value(), 0, $inherit);\n\n }\n\n\n\n /**\n\n * Set or overwrite the value.\n\n *\n\n * @param string $value\n\n * @return $this\n\n */\n","file_path":"src/Titon/Type/StringBuffer.hh","rank":94,"score":396859.4090498277},{"content":" public function is(string $type): bool {\n\n return ($this->getEnvironment() === $type);\n\n }\n\n\n\n}\n","file_path":"src/Titon/Environment/Detector.hh","rank":95,"score":396624.66362884594},{"content":" public function has(string $key): bool;\n\n\n\n /**\n\n * Increment a value within the cache and return the new number.\n\n * If the item does not exist, it will create the item with an initial value.\n\n *\n\n * @param string $key\n\n * @param int $step\n\n * @param int $initial\n\n * @return int\n\n */\n","file_path":"src/Titon/Cache/Storage.hh","rank":96,"score":396624.66362884594},{"content":" public function is(string $code): bool {\n\n $currentCode = $this->current()?->getCode();\n\n\n\n return ($currentCode === $code || Locale::canonicalize($code) === $currentCode);\n\n }\n\n\n\n /**\n\n * Globalization will be enabled if more than 1 locale has been setup.\n\n *\n\n * @return bool\n\n */\n","file_path":"src/Titon/Intl/Translator.hh","rank":97,"score":396624.66362884594},{"content":" public function wire(string $class): this {\n\n $reader = new Reader($class);\n\n\n\n // Map resource routes if the annotation is on the class\n\n foreach ($reader->getClassAnnotations() as $annotation) {\n\n if ($annotation instanceof RouteAnnotation) {\n\n $this->resource($annotation->getKey(), $annotation->toRoute($class));\n\n }\n\n }\n\n\n\n // Map regular routes if the annotation is on a method\n\n foreach ($reader->getAnnotatedMethods() as $method => $annotations) {\n\n foreach ($annotations as $annotation) {\n\n if ($annotation instanceof RouteAnnotation) {\n\n $this->map($annotation->getKey(), $annotation->toRoute($class, $method));\n\n }\n\n }\n\n }\n\n\n\n return $this;\n\n }\n\n\n\n}\n","file_path":"src/Titon/Route/Router.hh","rank":98,"score":395932.6065484842},{"content":" public function __construct(string $path, string $prefix = '') {\n\n if (!$path) {\n\n throw new InvalidPathException('Cache directory is required');\n\n }\n\n\n\n $this->folder = new Folder($path, true);\n\n\n\n parent::__construct($prefix);\n\n }\n\n\n\n /**\n\n * {@inheritdoc}\n\n */\n","file_path":"src/Titon/Cache/Storage/FileSystemStorage.hh","rank":99,"score":395553.5522543218}],"string":"[\n {\n \"content\": \" public function copy(string $target, int $process = self::MERGE, int $mode = 0755): ?Node {\\n\\n if (!$this->exists()) {\\n\\n return null;\\n\\n }\\n\\n\\n\\n // Delete the target folder if overwrite is true\\n\\n if ($process === self::OVERWRITE && file_exists($target)) {\\n\\n static::destroy($target);\\n\\n }\\n\\n\\n\\n // Create the target folder and reset folder path\\n\\n $destination = new Folder($target, true, $mode);\\n\\n $target = $destination->path();\\n\\n\\n\\n // Recursively copy over contents to new destination\\n\\n if ($contents = $this->read()) {\\n\\n foreach ($contents as $file) {\\n\\n $to = str_replace($this->path(), $target, $file->path());\\n\\n\\n\\n // Skip copy if target exists\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 1,\n \"score\": 657572.9135432713\n },\n {\n \"content\": \" public function create(int $mode = 0755): bool {\\n\\n if (!$this->exists()) {\\n\\n return mkdir($this->path(), $mode, true);\\n\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n *\\n\\n * @return \\\\Titon\\\\Io\\\\Folder\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 2,\n \"score\": 633753.2711682812\n },\n {\n \"content\": \" public function create(int $mode = 0755): bool {\\n\\n $folder = $this->parent();\\n\\n\\n\\n if (!$folder) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n if (!$folder->exists()) {\\n\\n $folder->create();\\n\\n }\\n\\n\\n\\n if (!$this->exists() && $folder->writable()) {\\n\\n if (touch($this->path())) {\\n\\n if ($mode) {\\n\\n $this->chmod($mode);\\n\\n }\\n\\n\\n\\n return true;\\n\\n }\\n\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Remove the file if it exists.\\n\\n *\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 3,\n \"score\": 582697.5168604227\n },\n {\n \"content\": \" public function matches(string $pattern, bool $return = false, int $flags = 0): mixed {\\n\\n $matches = [];\\n\\n $regex = preg_match($pattern, $this->value(), $matches, $flags);\\n\\n\\n\\n return $return ? $matches : $regex;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Pad the string with a defined character for a specific length.\\n\\n *\\n\\n * @param int $length\\n\\n * @param string $value\\n\\n * @param int $type\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 4,\n \"score\": 559230.532892925\n },\n {\n \"content\": \" public function chgrp(int $group, bool $recursive = false): bool {\\n\\n if ($recursive) {\\n\\n if ($contents = $this->read()) {\\n\\n foreach ($contents as $file) {\\n\\n $file->chgrp($group, true);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n return parent::chgrp($group);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Change the permissions mode of the file.\\n\\n * If $recursive is true, set the mode on all children.\\n\\n *\\n\\n * @param int $mode\\n\\n * @param bool $recursive\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 7,\n \"score\": 530309.5617393558\n },\n {\n \"content\": \" public function chmod(int $mode, bool $recursive = false): bool {\\n\\n if ($recursive) {\\n\\n if ($contents = $this->read()) {\\n\\n foreach ($contents as $file) {\\n\\n $file->chmod($mode, true);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n return parent::chmod($mode);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Change the owner of the file.\\n\\n * If $recursive is true, set the owner on all children.\\n\\n *\\n\\n * @param int $user\\n\\n * @param bool $recursive\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 8,\n \"score\": 530304.6112638105\n },\n {\n \"content\": \" public function copy(string $target, int $process = self::OVERWRITE, int $mode = 0755): ?File {\\n\\n if (!$this->exists()) {\\n\\n return null;\\n\\n }\\n\\n\\n\\n if (file_exists($target) && $process !== self::OVERWRITE) {\\n\\n throw new ExistingFileException('Cannot copy file as the target already exists');\\n\\n }\\n\\n\\n\\n if (copy($this->path(), $target)) {\\n\\n $file = new File($target);\\n\\n $file->chmod($mode);\\n\\n\\n\\n return $file;\\n\\n }\\n\\n\\n\\n return null;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 9,\n \"score\": 528213.5038988425\n },\n {\n \"content\": \" public function read(int $length = -1, string $mode = 'rb'): string {\\n\\n if (!$this->open($mode)) {\\n\\n return '';\\n\\n }\\n\\n\\n\\n if ($this->lock()) {\\n\\n if ($length === -1) {\\n\\n $length = $this->size() ?: 1;\\n\\n }\\n\\n\\n\\n $content = fread($this->handle, $length);\\n\\n\\n\\n $this->close();\\n\\n\\n\\n return $content;\\n\\n }\\n\\n\\n\\n return '';\\n\\n }\\n\\n\\n\\n /**\\n\\n * Reset the cache and path.\\n\\n *\\n\\n * @param string $path\\n\\n * @return $this\\n\\n * @throws \\\\Titon\\\\Io\\\\Exception\\\\InvalidPathException\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 10,\n \"score\": 515143.9477853278\n },\n {\n \"content\": \" public function decrement(string $key, int $step = 1, int $initial = 0): int {\\n\\n $item = $this->getItem($key);\\n\\n\\n\\n $value = ((int) $item->get() ?: $initial) - $step;\\n\\n\\n\\n $item->set($value);\\n\\n\\n\\n $this->save($item);\\n\\n\\n\\n return $value;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/AbstractStorage.hh\",\n \"rank\": 11,\n \"score\": 501724.6770829136\n },\n {\n \"content\": \" public function increment(string $key, int $step = 1, int $initial = 0): int {\\n\\n $item = $this->getItem($key);\\n\\n\\n\\n $value = ((int) $item->get() ?: $initial) + $step;\\n\\n\\n\\n $item->set($value);\\n\\n\\n\\n $this->save($item);\\n\\n\\n\\n return $value;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/AbstractStorage.hh\",\n \"rank\": 12,\n \"score\": 501724.6770829136\n },\n {\n \"content\": \" public function indexOf(string $needle, bool $strict = true, int $offset = 0): int {\\n\\n return Str::indexOf($this->value(), $needle, $strict, $offset);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Checks to see if the value is empty.\\n\\n *\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 13,\n \"score\": 501458.848874884\n },\n {\n \"content\": \" public function contains(string $needle, bool $strict = true, int $offset = 0): bool {\\n\\n return Str::contains($this->value(), $needle, $strict, $offset);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Checks to see if the string ends with a specific value.\\n\\n *\\n\\n * @uses Titon\\\\Utility\\\\Str\\n\\n *\\n\\n * @param string $value\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 14,\n \"score\": 501379.07805661275\n },\n {\n \"content\": \" public function lastIndexOf(string $needle, bool $strict = true, int $offset = 0): int {\\n\\n return Str::lastIndexOf($this->value(), $needle, $strict, $offset);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the string length.\\n\\n *\\n\\n * @return int\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 15,\n \"score\": 497501.66525776667\n },\n {\n \"content\": \" public function toString(bool $indent = true, int $depth = 0): string {\\n\\n $xml = '';\\n\\n\\n\\n // Set root XML tag\\n\\n if ($this->isRoot()) {\\n\\n $xml = sprintf('<?xml%s?>', $this->formatAttributes($this->getDeclaration())) . PHP_EOL;\\n\\n }\\n\\n\\n\\n // Apply indenting for nested elements\\n\\n if ($indent) {\\n\\n $xml .= str_repeat(' ', $depth);\\n\\n }\\n\\n\\n\\n // Build the tag, its attributes and namespaces\\n\\n $xml .= sprintf('<%s%s%s',\\n\\n $this->getName(),\\n\\n $this->formatNamespaces($this->getNamespaces()),\\n\\n $this->formatAttributes($this->getAttributes())\\n\\n );\\n\\n\\n\",\n \"file_path\": \"src/Titon/Type/Xml/Element.hh\",\n \"rank\": 16,\n \"score\": 497149.5390655238\n },\n {\n \"content\": \" public function open(string $mode): bool {\\n\\n if (!$this->exists()) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n if (is_resource($this->handle)) {\\n\\n if ($mode === $this->mode) {\\n\\n return true;\\n\\n } else {\\n\\n $this->close();\\n\\n }\\n\\n }\\n\\n\\n\\n $this->reset();\\n\\n\\n\\n $this->handle = fopen($this->path(), $mode);\\n\\n $this->mode = $mode;\\n\\n\\n\\n return is_resource($this->handle);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Prepend data to the beginning of a file.\\n\\n *\\n\\n * @param string $data\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 17,\n \"score\": 491216.34999441914\n },\n {\n \"content\": \" public function move(string $target, bool $overwrite = true): bool {\\n\\n if (Path::ds($target, true) === Path::ds($this->path(), true)) {\\n\\n return true; // Don't move to the same location\\n\\n }\\n\\n\\n\\n return parent::move($target, $overwrite);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Scan the folder and return a list of File and Folder objects.\\n\\n *\\n\\n * @param bool $sort\\n\\n * @param bool $recursive\\n\\n * @param int $filter\\n\\n * @return Vector<Node>\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 20,\n \"score\": 485370.45086465625\n },\n {\n \"content\": \" public function provides(string $class): bool;\\n\\n\\n\\n /**\\n\\n * The `register` method is where any necessary retrieving and registering\\n\\n * with the Depository container will happen that is necessary for the\\n\\n * Service Provider.\\n\\n *\\n\\n * @return void\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Context/ServiceProvider.hh\",\n \"rank\": 21,\n \"score\": 484672.25943253795\n },\n {\n \"content\": \" public function find(string $pattern, int $filter = self::ALL): Vector<Node> {\\n\\n $contents = Vector {};\\n\\n\\n\\n if (!$this->exists()) {\\n\\n return $contents;\\n\\n }\\n\\n\\n\\n try {\\n\\n $iterator = new GlobIterator($this->path() . $pattern, FilesystemIterator::SKIP_DOTS | FilesystemIterator::UNIX_PATHS);\\n\\n } catch (Exception $e) {\\n\\n return $contents;\\n\\n }\\n\\n\\n\\n /** @var \\\\SPLFileInfo $file */\\n\\n foreach ($iterator as $file) {\\n\\n if ($file->isDir() && ($filter === self::ALL || $filter === self::FOLDERS)) {\\n\\n $contents[] = new Folder($file->getPathname());\\n\\n\\n\\n } else if ($file->isFile() && ($filter === self::ALL || $filter === self::FILES)) {\\n\\n $contents[] = new File($file->getPathname());\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 22,\n \"score\": 484554.103676194\n },\n {\n \"content\": \" public function write(string $data, string $mode = 'w', bool $close = true): bool {\\n\\n if (!$this->open($mode)) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n if ($this->lock(LOCK_EX)) {\\n\\n $result = fwrite($this->handle, $data);\\n\\n\\n\\n $this->unlock();\\n\\n\\n\\n if ($close) {\\n\\n $this->close();\\n\\n }\\n\\n\\n\\n return (bool) $result;\\n\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 23,\n \"score\": 479974.3228687397\n },\n {\n \"content\": \" public function __construct(string $path, string $mode = 'r+b') {\\n\\n if (!file_exists($path)) {\\n\\n throw new MissingFileException(sprintf('File does not exist at path %s', $path));\\n\\n }\\n\\n\\n\\n $this->setStream(fopen($path, $mode));\\n\\n }\\n\\n\\n\\n}\",\n \"file_path\": \"src/Titon/Http/Stream/FileStream.hh\",\n \"rank\": 24,\n \"score\": 479923.02217158605\n },\n {\n \"content\": \" public function lock(int $mode = LOCK_SH): bool {\\n\\n if (is_resource($this->handle)) {\\n\\n return flock($this->handle, $mode);\\n\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return an MD5 checksum of the file.\\n\\n *\\n\\n * @param bool $raw\\n\\n * @return string\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 25,\n \"score\": 475143.79627577425\n },\n {\n \"content\": \" public function read(bool $sort = false, bool $recursive = false, int $filter = self::ALL): Vector<Node> {\\n\\n $contents = Vector {};\\n\\n\\n\\n if (!$this->exists()) {\\n\\n return $contents;\\n\\n }\\n\\n\\n\\n try {\\n\\n $flags = FilesystemIterator::SKIP_DOTS | FilesystemIterator::UNIX_PATHS;\\n\\n\\n\\n if ($recursive) {\\n\\n $iterator = new RecursiveIteratorIterator(new RecursiveDirectoryIterator($this->path(), $flags), RecursiveIteratorIterator::CHILD_FIRST);\\n\\n } else {\\n\\n $iterator = new FilesystemIterator($this->path(), $flags);\\n\\n }\\n\\n } catch (Exception $e) {\\n\\n return $contents;\\n\\n }\\n\\n\\n\\n /** @var \\\\SPLFileInfo $file */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 26,\n \"score\": 472585.59348630364\n },\n {\n \"content\": \" public function __construct(string $name, string $value, mixed $expires = 0, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false) {\\n\\n $this->setName($name);\\n\\n $this->setValue($value);\\n\\n $this->setExpires($expires);\\n\\n $this->setPath($path);\\n\\n $this->setDomain($domain);\\n\\n $this->setHttpOnly($httpOnly);\\n\\n $this->setSecure($secure);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the cookie as a valid HTTP cookie string.\\n\\n *\\n\\n * @return string\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Cookie.hh\",\n \"rank\": 29,\n \"score\": 470693.43244014843\n },\n {\n \"content\": \" public function provides(string $className): bool {\\n\\n return $this->provides->linearSearch($className) >= 0;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Context/ServiceProvider/AbstractServiceProvider.hh\",\n \"rank\": 31,\n \"score\": 464877.70467098895\n },\n {\n \"content\": \" public function __construct(public string $string, public int $int = 0): void {}\\n\\n}\\n\",\n \"file_path\": \"tests/Titon/Test/Stub/Annotation/BarAnnotationStub.hh\",\n \"rank\": 32,\n \"score\": 464348.57019086985\n },\n {\n \"content\": \" public function decrement(string $key, int $step = 1, int $initial = 0): int;\\n\\n\\n\\n /**\\n\\n * Delete a single item from the pool.\\n\\n *\\n\\n * @param string $key\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage.hh\",\n \"rank\": 33,\n \"score\": 462916.3581825262\n },\n {\n \"content\": \" public function increment(string $key, int $step = 1, int $initial = 0): int;\\n\\n\\n\\n /**\\n\\n * Remove the item if it exists and return true, else return false.\\n\\n *\\n\\n * @param string $key\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage.hh\",\n \"rank\": 34,\n \"score\": 462916.3581825262\n },\n {\n \"content\": \" public function decrement(string $key, int $step = 1, int $initial = 0, string $storage = 'default'): int {\\n\\n return $this->getStorage($storage)->decrement($key, $step, $initial);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Empty the cache.\\n\\n *\\n\\n * @param string $storage\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Cache.hh\",\n \"rank\": 35,\n \"score\": 462189.8326259864\n },\n {\n \"content\": \" public function increment(string $key, int $step = 1, int $initial = 0, string $storage = 'default'): int {\\n\\n return $this->getStorage($storage)->increment($key, $step, $initial);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Remove the item if it exists and return true, else return false.\\n\\n *\\n\\n * @param string $key\\n\\n * @param string $storage\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Cache.hh\",\n \"rank\": 36,\n \"score\": 462189.8326259864\n },\n {\n \"content\": \" public function setCookie(string $name, string $value, mixed $expires = 0, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false): this {\\n\\n return $this->addHeader('Set-Cookie', (string) new Cookie($name, $value, $expires, $path, $domain, $httpOnly, $secure));\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Server/Response.hh\",\n \"rank\": 37,\n \"score\": 460488.21151778\n },\n {\n \"content\": \" public function removeCookie(string $name, string $path = '/', string $domain = '', bool $httpOnly = true, bool $secure = false): this {\\n\\n return $this->setCookie($name, '', time(), $path, $domain, $httpOnly, $secure);\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Server/Response.hh\",\n \"rank\": 38,\n \"score\": 452202.0425341915\n },\n {\n \"content\": \" public function addPath(string $domain, string $path): this {\\n\\n if (!$this->getPaths()->contains($domain)) {\\n\\n $this->paths[$domain] = Set {};\\n\\n }\\n\\n\\n\\n $this->paths[$domain][] = Path::ds($path, true);\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Bundle/AbstractBundle.hh\",\n \"rank\": 39,\n \"score\": 450481.6169861552\n },\n {\n \"content\": \" public function reset(string $path = ''): this {\\n\\n if ($path) {\\n\\n if (file_exists($path) && is_file($path)) {\\n\\n throw new InvalidPathException(sprintf('Invalid folder path %s, files are not allowed', $path));\\n\\n }\\n\\n\\n\\n if (substr($path, -1) !== '/') {\\n\\n $path .= '/';\\n\\n }\\n\\n }\\n\\n\\n\\n return parent::reset($path);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the number of files in the current folder.\\n\\n *\\n\\n * @return int\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 41,\n \"score\": 449093.42119674175\n },\n {\n \"content\": \" public function cd(string $path): this {\\n\\n return $this->reset($path);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Change the group of the file.\\n\\n * If $recursive is true, set the group on all children.\\n\\n *\\n\\n * @param int $group\\n\\n * @param bool $recursive\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 42,\n \"score\": 449093.42119674175\n },\n {\n \"content\": \" function str_contains(string $string, string $needle, bool $strict = true, int $offset = 0): bool {\\n\\n return Str::contains($string, $needle, $strict, $offset);\\n\\n }\\n\\n\\n\\n /**\\n\\n * @see Titon\\\\Utility\\\\Str::endsWith()\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Utility/bootstrap.hh\",\n \"rank\": 43,\n \"score\": 446384.05456120276\n },\n {\n \"content\": \" public function addPath(string $path): this {\\n\\n $this->paths[] = Path::ds($path, true);\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/View/Locator/AbstractLocator.hh\",\n \"rank\": 44,\n \"score\": 446077.5942289059\n },\n {\n \"content\": \" public function compare(string $value, int $length = 0): int {\\n\\n return Str::compare($this->value(), $value, $length);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Concatenate two strings and return a new string object.\\n\\n *\\n\\n * @param string $string\\n\\n * @param bool $append\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 45,\n \"score\": 444906.18739608605\n },\n {\n \"content\": \" public function __construct(string $path, int $status = Http::OK) {\\n\\n parent::__construct(null, $status);\\n\\n\\n\\n if (!file_exists($path)) {\\n\\n throw new MissingFileException(sprintf('File %s does not exist', basename($path)));\\n\\n\\n\\n } else if (!is_readable($path)) {\\n\\n throw new InvalidFileException(sprintf('File %s is not readable', basename($path)));\\n\\n }\\n\\n\\n\\n $this->path = $path;\\n\\n $this->contentDisposition(basename($path));\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the file path.\\n\\n *\\n\\n * @return string\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Server/DownloadResponse.hh\",\n \"rank\": 46,\n \"score\": 444862.9543540175\n },\n {\n \"content\": \" public function __construct(string $path = '') {\\n\\n if ($path && !file_exists($path)) {\\n\\n throw new MissingFileException(sprintf('File %s does not exist', $path));\\n\\n }\\n\\n\\n\\n parent::__construct($path);\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Reader/AbstractReader.hh\",\n \"rank\": 47,\n \"score\": 444832.1226173101\n },\n {\n \"content\": \" public function write($string): ?int {\\n\\n if (!$this->isWritable()) {\\n\\n return null;\\n\\n }\\n\\n\\n\\n $write = fwrite($this->getStream(), $string);\\n\\n\\n\\n return ($write === false) ? null : $write;\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Http/Stream/AbstractStream.hh\",\n \"rank\": 48,\n \"score\": 444710.85052697756\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool;\\n\\n\\n\\n /**\\n\\n * Set the unique cache key prefix.\\n\\n *\\n\\n * @param string $prefix\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage.hh\",\n \"rank\": 49,\n \"score\": 442599.3402497653\n },\n {\n \"content\": \" public function chown(int $user, bool $recursive = false): bool {\\n\\n if ($recursive) {\\n\\n if ($contents = $this->read()) {\\n\\n foreach ($contents as $file) {\\n\\n $file->chown($user, true);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n return parent::chown($user);\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Folder.hh\",\n \"rank\": 51,\n \"score\": 439002.6636521898\n },\n {\n \"content\": \" public function hasNamespace(string $key): bool {\\n\\n return $this->getNamespaces()->contains($key);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return true if the element has any namespaces.\\n\\n *\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/Xml/Element.hh\",\n \"rank\": 52,\n \"score\": 438141.1368581663\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool {\\n\\n $this->setCache($this->getPrefix() . $key, $value);\\n\\n\\n\\n return true;\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/MemoryStorage.hh\",\n \"rank\": 53,\n \"score\": 433756.3334236911\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool {\\n\\n return $this->getRedis()->setex($this->getPrefix() . $key, $expires - time(), serialize($value)); // Redis is TTL\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/RedisStorage.hh\",\n \"rank\": 54,\n \"score\": 433756.33342369116\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool {\\n\\n return $this->getMemcache()->set($this->getPrefix() . $key, $value, $expires);\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/MemcacheStorage.hh\",\n \"rank\": 55,\n \"score\": 433756.3334236911\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool {\\n\\n return apc_store($this->getPrefix() . $key, $value, $expires - time()); // APC uses TTL\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/ApcStorage.hh\",\n \"rank\": 56,\n \"score\": 433756.3334236911\n },\n {\n \"content\": \" public function isInServiceProvider(string $className): bool {\\n\\n foreach ($this->providers as $provider) {\\n\\n if ($provider->provides($className)) {\\n\\n $provider->initialize();\\n\\n\\n\\n return true;\\n\\n }\\n\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return whether or not an alias has been registered in the container.\\n\\n *\\n\\n * @param string $alias Registered key or class name\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Context/Depository.hh\",\n \"rank\": 57,\n \"score\": 432570.86731232016\n },\n {\n \"content\": \" public function toJson(int $options = 0): string;\\n\\n\\n\\n}\",\n \"file_path\": \"src/Titon/Common/Jsonable.hh\",\n \"rank\": 58,\n \"score\": 432402.20227716723\n },\n {\n \"content\": \" public function set(string $key, mixed $value, int $expires): bool {\\n\\n return $this->loadCache($key)->write($expires . \\\"\\\\n\\\" . serialize($value));\\n\\n }\\n\\n\\n\\n /**\\n\\n * Build an absolute path to the cache on the file system using the defined key.\\n\\n *\\n\\n * @param string $key\\n\\n * @return string\\n\\n */\\n\\n <<__Memoize>>\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/FileSystemStorage.hh\",\n \"rank\": 59,\n \"score\": 429560.8481722774\n },\n {\n \"content\": \" public function toJson(int $options = 0): string {\\n\\n return json_encode($this, $options);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the list as a map.\\n\\n *\\n\\n * @return Map<int, Tv>\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/ArrayList.hh\",\n \"rank\": 60,\n \"score\": 428152.41661493725\n },\n {\n \"content\": \" public function toJson(int $options = 0): string {\\n\\n return json_encode($this, $options);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the map as a Map.\\n\\n *\\n\\n * @return Map<Tk, Tv>\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/HashMap.hh\",\n \"rank\": 61,\n \"score\": 428152.41661493725\n },\n {\n \"content\": \" public function split(string $delimiter = '', int $length = 0): Vector<string> {\\n\\n if ($delimiter !== '') {\\n\\n if ($length !== 0) {\\n\\n $chars = explode($delimiter, $this->value(), $length);\\n\\n } else {\\n\\n $chars = explode($delimiter, $this->value());\\n\\n }\\n\\n } else {\\n\\n $chars = str_split($this->value(), $length ?: 1);\\n\\n }\\n\\n\\n\\n return new Vector($chars);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Converts the string to a camel case form.\\n\\n *\\n\\n * @uses Titon\\\\Utility\\\\Inflector\\n\\n *\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 62,\n \"score\": 427726.9020788524\n },\n {\n \"content\": \" public function escape(string $value, ?bool $escape = null): string {\\n\\n if ($escape === null) {\\n\\n $escape = $this->getEscaping();\\n\\n }\\n\\n\\n\\n if ($escape) {\\n\\n $value = Sanitize::escape($value);\\n\\n }\\n\\n\\n\\n return $value;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the automatic escaping setting.\\n\\n *\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/View/Helper/AbstractHelper.hh\",\n \"rank\": 63,\n \"score\": 427379.3232415163\n },\n {\n \"content\": \" public function __construct(string $event, int $priority = Emitter::AUTO_PRIORITY, bool $once = false) {\\n\\n $this->event = $event;\\n\\n $this->priority = $priority;\\n\\n $this->once = $once;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the event key.\\n\\n *\\n\\n * @return string\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Event/Annotation/Observer.hh\",\n \"rank\": 64,\n \"score\": 417950.896958671\n },\n {\n \"content\": \" public function some((function(int, Tv): bool) $callback): bool {\\n\\n return Col::some($this->value(), $callback);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Sort the items in the list using a custom callback or the default sorting mechanism.\\n\\n *\\n\\n * @param (function(Tv, Tv): int) $callback\\n\\n * @param int $flags\\n\\n * @return \\\\Titon\\\\Type\\\\ArrayList<Tv>\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/ArrayList.hh\",\n \"rank\": 66,\n \"score\": 412422.2323519788\n },\n {\n \"content\": \" public function preparePath(string $path, string $ext): string {\\n\\n\\n\\n // Don't modify external assets\\n\\n if (substr($path, 0, 2) === '//' || preg_match('/^https?:/i', $path)) {\\n\\n return $path;\\n\\n }\\n\\n\\n\\n // Remove query string\\n\\n $parts = explode('?', $path);\\n\\n $path = $parts[0];\\n\\n $query = array_key_exists(1, $parts) ? $parts[1] : '';\\n\\n\\n\\n // Apply extension\\n\\n if (substr($path, -(strlen($ext) + 1)) !== '.' . $ext) {\\n\\n $path .= '.' . $ext;\\n\\n }\\n\\n\\n\\n // Apply query\\n\\n if ($query) {\\n\\n $path .= '?' . $query;\\n\",\n \"file_path\": \"src/Titon/View/Helper/AssetHelper.hh\",\n \"rank\": 67,\n \"score\": 412169.34944833536\n },\n {\n \"content\": \" public function addPath(string $domain, string $path): this;\\n\\n\\n\\n /**\\n\\n * Add multiple resource paths.\\n\\n *\\n\\n * @param string $domain\\n\\n * @param \\\\Titon\\\\Io\\\\PathList $paths\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Bundle.hh\",\n \"rank\": 68,\n \"score\": 410437.3137149102\n },\n {\n \"content\": \" public function every((function(int, Tv): bool) $callback): bool {\\n\\n return Col::every($this->value(), $callback);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the first item in the list.\\n\\n *\\n\\n * @return ?Tv\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/ArrayList.hh\",\n \"rank\": 69,\n \"score\": 408913.03246565594\n },\n {\n \"content\": \" public function __construct(string $path, string $action) {\\n\\n $this->action = Router::parseAction($action);\\n\\n $this->append($path);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Append onto the path. This must be done before compilation.\\n\\n *\\n\\n * @param string $path\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Route/Route.hh\",\n \"rank\": 70,\n \"score\": 406865.00437979423\n },\n {\n \"content\": \" public function addMessagePath(string $domain, string $path): this {\\n\\n $this->getMessageBundle()->addPath($domain, $path . '/' . $this->getCode());\\n\\n\\n\\n // Pass it to the parent also\\n\\n $this->getParentLocale()?->addMessagePath($domain, $path);\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Add multiple message lookup paths.\\n\\n *\\n\\n * @param string $domain\\n\\n * @param \\\\Titon\\\\Io\\\\PathList $paths\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Intl/Locale.hh\",\n \"rank\": 71,\n \"score\": 406845.42530025716\n },\n {\n \"content\": \" public function addResourcePath(string $domain, string $path): this {\\n\\n $path = rtrim($path, '/');\\n\\n\\n\\n $this->addLocalePath(sprintf('%s/locales', $path));\\n\\n $this->addMessagePath($domain, sprintf('%s/messages', $path));\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Add multiple resource lookup paths.\\n\\n *\\n\\n * @param string $domain\\n\\n * @param \\\\Titon\\\\Io\\\\PathList $paths\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Intl/Locale.hh\",\n \"rank\": 72,\n \"score\": 406845.4253002571\n },\n {\n \"content\": \" public function parent(): string {\\n\\n return $this->get($this->active());\\n\\n }\\n\\n\\n\\n /**\\n\\n * Prepend a string to a block.\\n\\n * If a block does not exist, create it.\\n\\n *\\n\\n * @param string $key\\n\\n * @param string $value\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/View/Helper/BlockHelper.hh\",\n \"rank\": 73,\n \"score\": 406782.18757007853\n },\n {\n \"content\": \" public function getMode(): string {\\n\\n return $this->mode;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\\n public static function getSupportedMethods(): Vector<string> {\\n\\n return Vector {\\n\\n self::AES_128_CBC,\\n\\n self::AES_128_CFB,\\n\\n self::AES_128_OFB,\\n\\n self::AES_192_CBC,\\n\\n self::AES_192_CFB,\\n\\n self::AES_192_OFB,\\n\\n self::AES_256_CBC,\\n\\n self::AES_256_CFB,\\n\\n self::AES_256_OFB,\\n\\n self::BLOWFISH_CBC,\\n\\n self::BLOWFISH_CFB,\\n\",\n \"file_path\": \"src/Titon/Crypto/AbstractCipher.hh\",\n \"rank\": 74,\n \"score\": 405722.3609044758\n },\n {\n \"content\": \" public function setPath(string $path): this {\\n\\n $this->path = $path ?: '/';\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Set the secure HTTPS flag.\\n\\n *\\n\\n * @param bool $secure\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Cookie.hh\",\n \"rank\": 75,\n \"score\": 405140.435522363\n },\n {\n \"content\": \" public function addPath(string $path): this;\\n\\n\\n\\n /**\\n\\n * Add multiple lookup paths.\\n\\n *\\n\\n * @param \\\\Titon\\\\View\\\\PathList $paths\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/View/Locator.hh\",\n \"rank\": 76,\n \"score\": 405140.435522363\n },\n {\n \"content\": \" public function __construct(string $path) {\\n\\n $this->lookupPath = rtrim($path, '/') . '/';\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the name of the environment.\\n\\n *\\n\\n * @return string\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Environment/Detector.hh\",\n \"rank\": 77,\n \"score\": 403698.01011840184\n },\n {\n \"content\": \" public function addLocalePath(string $path): this {\\n\\n $this->getLocaleBundle()->addPath(MessageLoader::DEFAULT_DOMAIN, $path . '/' . $this->getCode());\\n\\n\\n\\n // Pass it to the parent also\\n\\n $this->getParentLocale()?->addLocalePath($path);\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Add multiple locale lookup paths.\\n\\n *\\n\\n * @param \\\\Titon\\\\Io\\\\PathList $paths\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Intl/Locale.hh\",\n \"rank\": 78,\n \"score\": 401102.59418474184\n },\n {\n \"content\": \" public function charAt(int $index): ?string {\\n\\n return Str::charAt($this->value(), $index);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Removes all extraneous whitespace from a string and trims it.\\n\\n *\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 79,\n \"score\": 400761.0928409145\n },\n {\n \"content\": \" public function getMode(): string {\\n\\n return (string) $this->cache['mode'];\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Http/Stream/AbstractStream.hh\",\n \"rank\": 80,\n \"score\": 400506.39790838695\n },\n {\n \"content\": \" public function endsWith(string $value): bool {\\n\\n return Str::endsWith($this->value(), $value);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Checks to see if both values are equal.\\n\\n *\\n\\n * @param string $value\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 81,\n \"score\": 400474.60651399137\n },\n {\n \"content\": \" public function equals(string $value): bool {\\n\\n return ($this->value() === $value);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Escape the string.\\n\\n *\\n\\n * @uses Titon\\\\Utility\\\\Sanitize\\n\\n *\\n\\n * @param int $flags\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 82,\n \"score\": 400474.60651399137\n },\n {\n \"content\": \" public function startsWith(string $value): bool {\\n\\n return Str::startsWith($this->value(), $value);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Strips the string of its tags and anything in between them.\\n\\n *\\n\\n * @return \\\\Titon\\\\Type\\\\StringBuffer\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 83,\n \"score\": 400474.60651399137\n },\n {\n \"content\": \" public function getPath(): string {\\n\\n return $this->path();\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Io/Reader/AbstractReader.hh\",\n \"rank\": 84,\n \"score\": 400342.37383910466\n },\n {\n \"content\": \" public function getPath(): string {\\n\\n return $this->path();\\n\\n }\\n\\n\\n\\n}\",\n \"file_path\": \"src/Titon/Io/Writer/AbstractWriter.hh\",\n \"rank\": 85,\n \"score\": 400342.37383910466\n },\n {\n \"content\": \" public function __construct(string $key, string $class, string $function, Depository $depository) {\\n\\n parent::__construct($key, $depository);\\n\\n\\n\\n $this->class = $class;\\n\\n $this->function = $function;\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Context/Definition/CallableDefinition.hh\",\n \"rank\": 86,\n \"score\": 399950.8159078739\n },\n {\n \"content\": \" public function extract(int $offset, int $length = 0): StringBuffer {\\n\\n return new static(Str::extract($this->value(), $offset, $length));\\n\\n }\\n\\n\\n\\n /**\\n\\n * Grab the index of the first matched character.\\n\\n *\\n\\n * @uses Titon\\\\Utility\\\\Str\\n\\n *\\n\\n * @param string $needle\\n\\n * @param bool $strict\\n\\n * @param int $offset\\n\\n * @return int\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 87,\n \"score\": 399780.77589634643\n },\n {\n \"content\": \" public function addScript(string $script, string $location = 'footer', int $order = 0, string $env = ''): this {\\n\\n $scripts = $this->getScripts();\\n\\n\\n\\n if (!$scripts->contains($location)) {\\n\\n $this->scripts[$location] = Map {};\\n\\n }\\n\\n\\n\\n if ($order === 0) {\\n\\n $order = count($scripts[$location]);\\n\\n }\\n\\n\\n\\n while ($scripts[$location]->contains($order)) {\\n\\n $order++;\\n\\n }\\n\\n\\n\\n $this->scripts[$location][$order] = shape(\\n\\n 'path' => $this->preparePath($script, 'js'),\\n\\n 'attributes' => Map {},\\n\\n 'env' => $env\\n\\n );\\n\",\n \"file_path\": \"src/Titon/View/Helper/AssetHelper.hh\",\n \"rank\": 88,\n \"score\": 397273.89727538987\n },\n {\n \"content\": \" public function reset(string $path = ''): this;\\n\\n\\n\\n /**\\n\\n * Truncate the resource file and write data to it.\\n\\n *\\n\\n * @param \\\\Titon\\\\Io\\\\ResourceMap $data\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/Writer.hh\",\n \"rank\": 89,\n \"score\": 397030.4077990041\n },\n {\n \"content\": \" public function reset(string $path = ''): this;\\n\\n\\n\\n}\",\n \"file_path\": \"src/Titon/Io/Reader.hh\",\n \"rank\": 90,\n \"score\": 397030.4077990041\n },\n {\n \"content\": \" public function prepend(string $path): this {\\n\\n $this->path = '/' . trim($path, '/') . rtrim($this->path, '/');\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Serialize the compiled route for increasing performance when caching mapped routes.\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Route/Route.hh\",\n \"rank\": 91,\n \"score\": 397030.4077990041\n },\n {\n \"content\": \" public function reset(string $path = ''): this {\\n\\n if ($path && file_exists($path) && is_dir($path)) {\\n\\n throw new InvalidPathException(sprintf('Invalid file path %s, folders are not allowed', $path));\\n\\n }\\n\\n\\n\\n return parent::reset($path);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Return the current file size.\\n\\n *\\n\\n * @return int\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Io/File.hh\",\n \"rank\": 92,\n \"score\": 397030.4077990041\n },\n {\n \"content\": \" public function append(string $path): this {\\n\\n $this->path .= '/' . trim($path, '/');\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Compile the given path into a detectable regex pattern.\\n\\n *\\n\\n * @return string\\n\\n * @throws \\\\Titon\\\\Route\\\\Exception\\\\MissingPatternException\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Route/Route.hh\",\n \"rank\": 93,\n \"score\": 397030.4077990041\n },\n {\n \"content\": \" public function wordCount(string $inherit = ''): int {\\n\\n return str_word_count($this->value(), 0, $inherit);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Set or overwrite the value.\\n\\n *\\n\\n * @param string $value\\n\\n * @return $this\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Type/StringBuffer.hh\",\n \"rank\": 94,\n \"score\": 396859.4090498277\n },\n {\n \"content\": \" public function is(string $type): bool {\\n\\n return ($this->getEnvironment() === $type);\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Environment/Detector.hh\",\n \"rank\": 95,\n \"score\": 396624.66362884594\n },\n {\n \"content\": \" public function has(string $key): bool;\\n\\n\\n\\n /**\\n\\n * Increment a value within the cache and return the new number.\\n\\n * If the item does not exist, it will create the item with an initial value.\\n\\n *\\n\\n * @param string $key\\n\\n * @param int $step\\n\\n * @param int $initial\\n\\n * @return int\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage.hh\",\n \"rank\": 96,\n \"score\": 396624.66362884594\n },\n {\n \"content\": \" public function is(string $code): bool {\\n\\n $currentCode = $this->current()?->getCode();\\n\\n\\n\\n return ($currentCode === $code || Locale::canonicalize($code) === $currentCode);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Globalization will be enabled if more than 1 locale has been setup.\\n\\n *\\n\\n * @return bool\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Intl/Translator.hh\",\n \"rank\": 97,\n \"score\": 396624.66362884594\n },\n {\n \"content\": \" public function wire(string $class): this {\\n\\n $reader = new Reader($class);\\n\\n\\n\\n // Map resource routes if the annotation is on the class\\n\\n foreach ($reader->getClassAnnotations() as $annotation) {\\n\\n if ($annotation instanceof RouteAnnotation) {\\n\\n $this->resource($annotation->getKey(), $annotation->toRoute($class));\\n\\n }\\n\\n }\\n\\n\\n\\n // Map regular routes if the annotation is on a method\\n\\n foreach ($reader->getAnnotatedMethods() as $method => $annotations) {\\n\\n foreach ($annotations as $annotation) {\\n\\n if ($annotation instanceof RouteAnnotation) {\\n\\n $this->map($annotation->getKey(), $annotation->toRoute($class, $method));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n return $this;\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/Titon/Route/Router.hh\",\n \"rank\": 98,\n \"score\": 395932.6065484842\n },\n {\n \"content\": \" public function __construct(string $path, string $prefix = '') {\\n\\n if (!$path) {\\n\\n throw new InvalidPathException('Cache directory is required');\\n\\n }\\n\\n\\n\\n $this->folder = new Folder($path, true);\\n\\n\\n\\n parent::__construct($prefix);\\n\\n }\\n\\n\\n\\n /**\\n\\n * {@inheritdoc}\\n\\n */\\n\",\n \"file_path\": \"src/Titon/Cache/Storage/FileSystemStorage.hh\",\n \"rank\": 99,\n \"score\": 395553.5522543218\n }\n]","isConversational":false}}},{"rowIdx":386,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"net/instaweb/rewriter/webp_optimizer.cc"},"repo_name":{"kind":"string","value":"dimitrilongo/mod_pagespeed"},"commit":{"kind":"string","value":"d0d3bc51aa4feddf010b7085872c64cc46b5aae0"},"file_code":{"kind":"string","value":"\n\n#include \"net/instaweb/rewriter/public/webp_optimizer.h\"\n\n#include <csetjmp>\n#include <cstddef>\n\n#include \"base/logging.h\"\n#include \"pagespeed/kernel/base/basictypes.h\"\n#include \"pagespeed/kernel/base/string.h\"\n#include \"pagespeed/kernel/image/jpeg_reader.h\"\n#include \"pagespeed/kernel/image/jpeg_utils.h\"\n\nextern \"C\" {\n#ifdef USE_SYSTEM_LIBWEBP\n#include \"webp/encode.h\"\n#include \"webp/decode.h\"\n#else\n#include \"third_party/libwebp/src/webp/encode.h\"\n#include \"third_party/libwebp/src/webp/decode.h\"\n#endif\n\n}\n\nextern \"C\" {\n#ifdef USE_SYSTEM_LIBJPEG\n#include \"jpeglib.h\" \n#else\n#include \"third_party/libjpeg_turbo/src/jpeglib.h\"\n#endif\n}\n\nusing pagespeed::image_compression::JpegUtils;\n\nnamespace net_instaweb {\n\nclass MessageHandler;\n\nnamespace {\n\nconst bool kUseYUV = false;\n\nconst int kYPlane = 0;\nconst int kUPlane = 1;\nconst int kVPlane = 2;\nconst int kPlanes = 3;\n\n#ifdef DCT_IFAST_SUPPORTED\nconst J_DCT_METHOD fastest_dct_method = JDCT_IFAST;\n#else\n#ifdef DCT_FLOAT_SUPPORTED\n\n#else\n\n#endif\n#endif\n\nint GoogleStringWebpWriter(const uint8_t* data, size_t data_size,\n const WebPPicture* const picture) {\n GoogleString* compressed_webp =\n static_cast<GoogleString*>(picture->custom_ptr);\n \n compressed_webp->append(reinterpret_cast<const char*>(data), data_size);\n return 1;\n}\n\nclass WebpOptimizer {\n public:\n explicit WebpOptimizer(MessageHandler* handler);\n ~WebpOptimizer();\n\n \n \n bool CreateOptimizedWebp(const GoogleString& original_jpeg,\n int configured_quality,\n WebpProgressHook progress_hook,\n void* progress_hook_data,\n GoogleString* compressed_webp);\n\n private:\n \n size_t PixelOffset(size_t x, size_t y) const {\n return (kPlanes * x + y * row_stride_);\n }\n \n \n \n int SampleAt(int plane, int source_offset, int x_offset, int y_offset) const {\n return static_cast<int>(pixels_[plane + source_offset +\n PixelOffset(x_offset, y_offset)]);\n }\n bool DoReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg);\n bool ReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg);\n bool WebPImportYUV(WebPPicture* const picture);\n\n \n \n \n static int ProgressHook(int percent, const WebPPicture* picture);\n\n \n MessageHandler* message_handler_;\n pagespeed::image_compression::JpegReader reader_;\n uint8* pixels_;\n uint8** rows_; \n unsigned int width_, height_; \n size_t row_stride_;\n\n \n WebpProgressHook progress_hook_;\n void* progress_hook_data_;\n\n DISALLOW_COPY_AND_ASSIGN(WebpOptimizer);\n}; \n\nWebpOptimizer::WebpOptimizer(MessageHandler* handler)\n : message_handler_(handler),\n reader_(handler),\n pixels_(NULL),\n rows_(NULL),\n width_(0),\n height_(0),\n row_stride_(0),\n progress_hook_(NULL),\n progress_hook_data_(NULL) {\n}\n\nWebpOptimizer::~WebpOptimizer() {\n delete[] pixels_;\n DCHECK(rows_ == NULL);\n}\n\nbool WebpOptimizer::DoReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg) {\n \n jmp_buf env;\n if (setjmp(env)) {\n \n return false;\n }\n \n jpeg_decompress_struct* jpeg_decompress = reader_.decompress_struct();\n jpeg_decompress->client_data = static_cast<void*>(&env);\n\n reader_.PrepareForRead(original_jpeg.data(), original_jpeg.size());\n\n if (jpeg_read_header(jpeg_decompress, TRUE) != JPEG_HEADER_OK) {\n return false;\n }\n\n \n \n \n \n jpeg_decompress->out_color_space = color_space;\n \n \n \n \n \n jpeg_decompress->do_fancy_upsampling = TRUE;\n\n if (!jpeg_start_decompress(jpeg_decompress) ||\n jpeg_decompress->output_components != kPlanes) {\n return false;\n }\n\n \n width_ = jpeg_decompress->output_width;\n height_ = jpeg_decompress->output_height;\n row_stride_ = width_ * jpeg_decompress->output_components * sizeof(*pixels_);\n\n pixels_ = new uint8[row_stride_ * height_];\n \n \n rows_ = new uint8*[height_];\n for (unsigned int i = 0; i < height_; ++i) {\n rows_[i] = pixels_ + PixelOffset(0, i);\n }\n while (jpeg_decompress->output_scanline < height_) {\n \n \n int rows_read =\n jpeg_read_scanlines(jpeg_decompress,\n rows_ + jpeg_decompress->output_scanline,\n height_ - jpeg_decompress->output_scanline);\n if (rows_read == 0) {\n return false;\n }\n }\n return jpeg_finish_decompress(jpeg_decompress);\n}\n\nbool WebpOptimizer::ReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg) {\n bool read_ok = DoReadJpegPixels(color_space, original_jpeg);\n delete[] rows_;\n rows_ = NULL;\n jpeg_decompress_struct* jpeg_decompress = reader_.decompress_struct();\n \n \n \n jpeg_decompress->client_data = NULL;\n jpeg_destroy_decompress(jpeg_decompress);\n return read_ok;\n}\n\nbool WebpOptimizer::WebPImportYUV(WebPPicture* const picture) {\n if (!WebPPictureAlloc(picture)) {\n return false;\n }\n \n for (size_t y = 0; y < height_; ++y) {\n for (size_t x = 0; x < width_; ++x) {\n picture->y[x + y * picture->y_stride] =\n pixels_[kYPlane + PixelOffset(x, y)];\n }\n }\n \n \n unsigned int half_height = height_ >> 1;\n unsigned int half_width = width_ >> 1;\n unsigned int extra_height = height_ & 1;\n unsigned int extra_width = width_ & 1;\n size_t x, y;\n \n \n \n for (y = 0; y < half_height; ++y) {\n for (x = 0; x < half_width; ++x) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 1, 0) +\n SampleAt(kUPlane, source_offset, 0, 1) +\n SampleAt(kUPlane, source_offset, 1, 1);\n picture->u[picture_offset] = (2 + pixel_sum_u) >> 2;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 1, 0) +\n SampleAt(kVPlane, source_offset, 0, 1) +\n SampleAt(kVPlane, source_offset, 1, 1);\n picture->v[picture_offset] = (2 + pixel_sum_v) >> 2;\n }\n \n if (extra_width != 0) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 0, 1);\n picture->u[picture_offset] = (1 + pixel_sum_u) >> 1;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 0, 1);\n picture->v[picture_offset] = (1 + pixel_sum_v) >> 1;\n }\n }\n if (extra_height != 0) {\n \n for (x = 0; x < half_width; ++x) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 1, 0);\n picture->u[picture_offset] = (1 + pixel_sum_u) >> 1;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 1, 0);\n picture->v[picture_offset] = (1 + pixel_sum_v) >> 1;\n }\n \n if (extra_width != 0) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0);\n picture->u[picture_offset] = pixel_sum_u;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0);\n picture->v[picture_offset] = pixel_sum_v;\n }\n }\n return true;\n}\n\nint WebpOptimizer::ProgressHook(int percent, const WebPPicture* picture) {\n const WebpOptimizer* webp_optimizer =\n static_cast<WebpOptimizer*>(picture->user_data);\n return webp_optimizer->progress_hook_(percent,\n webp_optimizer->progress_hook_data_);\n}\n\nbool WebpOptimizer::CreateOptimizedWebp(\n const GoogleString& original_jpeg,\n int configured_quality,\n WebpProgressHook progress_hook,\n void* progress_hook_data,\n GoogleString* compressed_webp) {\n \n WebPPicture picture;\n WebPConfig config;\n int input_quality = JpegUtils::GetImageQualityFromImage(original_jpeg.data(),\n original_jpeg.size(),\n message_handler_);\n\n if (!WebPPictureInit(&picture) || !WebPConfigInit(&config)) {\n \n return false;\n }\n\n if (configured_quality == kNoQualityGiven) {\n \n \n configured_quality = config.quality;\n }\n\n int output_quality = configured_quality;\n\n if (input_quality != kNoQualityGiven && input_quality < configured_quality) {\n output_quality = input_quality;\n } else {\n \n \n \n output_quality = configured_quality;\n }\n\n if (!WebPConfigPreset(&config, WEBP_PRESET_DEFAULT, output_quality)) {\n \n return false;\n } else {\n \n \n \n \n \n \n \n config.method = 3;\n if (!WebPValidateConfig(&config)) {\n return false;\n }\n }\n\n J_COLOR_SPACE color_space = kUseYUV ? JCS_YCbCr : JCS_RGB;\n\n if (!ReadJpegPixels(color_space, original_jpeg)) {\n return false;\n }\n\n \n \n \n \n picture.writer = &GoogleStringWebpWriter;\n picture.custom_ptr = static_cast<void*>(compressed_webp);\n picture.width = width_;\n picture.height = height_;\n if (progress_hook != NULL) {\n picture.progress_hook = ProgressHook;\n picture.user_data = this;\n progress_hook_ = progress_hook;\n progress_hook_data_ = progress_hook_data;\n }\n\n if (kUseYUV) {\n \n \n if (!WebPImportYUV(&picture)) {\n return false;\n }\n } else if (!WebPPictureImportRGB(&picture, pixels_, row_stride_)) {\n return false;\n }\n\n \n \n delete[] pixels_;\n pixels_ = NULL;\n\n \n bool result = WebPEncode(&config, &picture);\n\n \n WebPPictureFree(&picture);\n\n return result;\n}\n\n} \n\nbool OptimizeWebp(const GoogleString& original_jpeg, int configured_quality,\n WebpProgressHook progress_hook, void* progress_hook_data,\n GoogleString* compressed_webp,\n MessageHandler* message_handler) {\n WebpOptimizer optimizer(message_handler);\n return optimizer.CreateOptimizedWebp(original_jpeg, configured_quality,\n progress_hook, progress_hook_data,\n compressed_webp);\n}\n\nstatic bool WebPDecBufferToPicture(const WebPDecBuffer* const buf,\n WebPPicture* const picture) {\n const WebPYUVABuffer* const yuva = &buf->u.YUVA;\n if ((yuva->u_stride != yuva->v_stride) || (buf->colorspace != MODE_YUVA)) {\n return false;\n }\n picture->width = buf->width;\n picture->height = buf->height;\n picture->y = yuva->y;\n picture->u = yuva->u;\n picture->v = yuva->v;\n picture->a = yuva->a;\n picture->y_stride = yuva->y_stride;\n picture->uv_stride = yuva->u_stride;\n picture->a_stride = yuva->a_stride;\n picture->colorspace = WEBP_YUV420A;\n return true;\n}\n\nbool ReduceWebpImageQuality(const GoogleString& original_webp,\n int quality, GoogleString* compressed_webp) {\n if (quality < 1) {\n \n *compressed_webp = original_webp;\n return true;\n } else if (quality > 100) {\n quality = 100;\n }\n\n const uint8* webp = reinterpret_cast<const uint8*>(original_webp.data());\n const int webp_size = original_webp.size();\n \n \n \n \n \n \n \n \n WebPConfig config;\n if (WebPConfigPreset(&config, WEBP_PRESET_DEFAULT, quality) == 0) {\n \n return false;\n }\n WebPPicture picture;\n if (WebPPictureInit(&picture) == 0) {\n \n return false;\n }\n\n WebPDecoderConfig dec_config;\n WebPInitDecoderConfig(&dec_config);\n WebPDecBuffer* const output_buffer = &dec_config.output;\n output_buffer->colorspace = MODE_YUVA;\n bool success = ((WebPDecode(webp, webp_size, &dec_config) == VP8_STATUS_OK) &&\n WebPDecBufferToPicture(output_buffer, &picture));\n if (success) {\n picture.writer = &GoogleStringWebpWriter;\n picture.custom_ptr = reinterpret_cast<void*>(compressed_webp);\n\n success = WebPEncode(&config, &picture);\n }\n\n WebPFreeDecBuffer(output_buffer);\n\n return success;\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"net/instaweb/rewriter/public/webp_optimizer.h\"\n\n#include <csetjmp>\n#include <cstddef>\n\n#include \"base/logging.h\"\n#include \"pagespeed/kernel/base/basictypes.h\"\n#include \"pagespeed/kernel/base/string.h\"\n#include \"pagespeed/kernel/image/jpeg_reader.h\"\n#include \"pagespeed/kernel/image/jpeg_utils.h\"\n\nextern \"C\" {\n#ifdef USE_SYSTEM_LIBWEBP\n#include \"webp/encode.h\"\n#include \"webp/decode.h\"\n#else\n#include \"third_party/libwebp/src/webp/encode.h\"\n#include \"third_party/libwebp/src/webp/decode.h\"\n#endif\n\n}\n\nextern \"C\" {\n#ifdef USE_SYSTEM_LIBJPEG\n#include \"jpeglib.h\" \n#else\n#include \"third_party/libjpeg_turbo/src/jpeglib.h\"\n#endif\n}\n\nusing pagespeed::image_compression::JpegUtils;\n\nnamespace net_instaweb {\n\nclass MessageHandler;\n\nnamespace {\n\nconst bool kUseYUV = false;\n\nconst int kYPlane = 0;\nconst int kUPlane = 1;\nconst int kVPlane = 2;\nconst int kPlanes = 3;\n\n#ifdef DCT_IFAST_SUPPORTED\nconst J_DCT_METHOD fastest_dct_method = JDCT_IFAST;\n#else\n#ifdef DCT_FLOAT_SUPPORTED\n\n#else\n\n#endif\n#endif\n\n"},"suffix":{"kind":"string","value":"\n\nclass WebpOptimizer {\n public:\n explicit WebpOptimizer(MessageHandler* handler);\n ~WebpOptimizer();\n\n \n \n bool CreateOptimizedWebp(const GoogleString& original_jpeg,\n int configured_quality,\n WebpProgressHook progress_hook,\n void* progress_hook_data,\n GoogleString* compressed_webp);\n\n private:\n \n size_t PixelOffset(size_t x, size_t y) const {\n return (kPlanes * x + y * row_stride_);\n }\n \n \n \n int SampleAt(int plane, int source_offset, int x_offset, int y_offset) const {\n return static_cast<int>(pixels_[plane + source_offset +\n PixelOffset(x_offset, y_offset)]);\n }\n bool DoReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg);\n bool ReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg);\n bool WebPImportYUV(WebPPicture* const picture);\n\n \n \n \n static int ProgressHook(int percent, const WebPPicture* picture);\n\n \n MessageHandler* message_handler_;\n pagespeed::image_compression::JpegReader reader_;\n uint8* pixels_;\n uint8** rows_; \n unsigned int width_, height_; \n size_t row_stride_;\n\n \n WebpProgressHook progress_hook_;\n void* progress_hook_data_;\n\n DISALLOW_COPY_AND_ASSIGN(WebpOptimizer);\n}; \n\nWebpOptimizer::WebpOptimizer(MessageHandler* handler)\n : message_handler_(handler),\n reader_(handler),\n pixels_(NULL),\n rows_(NULL),\n width_(0),\n height_(0),\n row_stride_(0),\n progress_hook_(NULL),\n progress_hook_data_(NULL) {\n}\n\nWebpOptimizer::~WebpOptimizer() {\n delete[] pixels_;\n DCHECK(rows_ == NULL);\n}\n\nbool WebpOptimizer::DoReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg) {\n \n jmp_buf env;\n if (setjmp(env)) {\n \n return false;\n }\n \n jpeg_decompress_struct* jpeg_decompress = reader_.decompress_struct();\n jpeg_decompress->client_data = static_cast<void*>(&env);\n\n reader_.PrepareForRead(original_jpeg.data(), original_jpeg.size());\n\n if (jpeg_read_header(jpeg_decompress, TRUE) != JPEG_HEADER_OK) {\n return false;\n }\n\n \n \n \n \n jpeg_decompress->out_color_space = color_space;\n \n \n \n \n \n jpeg_decompress->do_fancy_upsampling = TRUE;\n\n if (!jpeg_start_decompress(jpeg_decompress) ||\n jpeg_decompress->output_components != kPlanes) {\n return false;\n }\n\n \n width_ = jpeg_decompress->output_width;\n height_ = jpeg_decompress->output_height;\n row_stride_ = width_ * jpeg_decompress->output_components * sizeof(*pixels_);\n\n pixels_ = new uint8[row_stride_ * height_];\n \n \n rows_ = new uint8*[height_];\n for (unsigned int i = 0; i < height_; ++i) {\n rows_[i] = pixels_ + PixelOffset(0, i);\n }\n while (jpeg_decompress->output_scanline < height_) {\n \n \n int rows_read =\n jpeg_read_scanlines(jpeg_decompress,\n rows_ + jpeg_decompress->output_scanline,\n height_ - jpeg_decompress->output_scanline);\n if (rows_read == 0) {\n return false;\n }\n }\n return jpeg_finish_decompress(jpeg_decompress);\n}\n\nbool WebpOptimizer::ReadJpegPixels(J_COLOR_SPACE color_space,\n const GoogleString& original_jpeg) {\n bool read_ok = DoReadJpegPixels(color_space, original_jpeg);\n delete[] rows_;\n rows_ = NULL;\n jpeg_decompress_struct* jpeg_decompress = reader_.decompress_struct();\n \n \n \n jpeg_decompress->client_data = NULL;\n jpeg_destroy_decompress(jpeg_decompress);\n return read_ok;\n}\n\nbool WebpOptimizer::WebPImportYUV(WebPPicture* const picture) {\n if (!WebPPictureAlloc(picture)) {\n return false;\n }\n \n for (size_t y = 0; y < height_; ++y) {\n for (size_t x = 0; x < width_; ++x) {\n picture->y[x + y * picture->y_stride] =\n pixels_[kYPlane + PixelOffset(x, y)];\n }\n }\n \n \n unsigned int half_height = height_ >> 1;\n unsigned int half_width = width_ >> 1;\n unsigned int extra_height = height_ & 1;\n unsigned int extra_width = width_ & 1;\n size_t x, y;\n \n \n \n for (y = 0; y < half_height; ++y) {\n for (x = 0; x < half_width; ++x) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 1, 0) +\n SampleAt(kUPlane, source_offset, 0, 1) +\n SampleAt(kUPlane, source_offset, 1, 1);\n picture->u[picture_offset] = (2 + pixel_sum_u) >> 2;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 1, 0) +\n SampleAt(kVPlane, source_offset, 0, 1) +\n SampleAt(kVPlane, source_offset, 1, 1);\n picture->v[picture_offset] = (2 + pixel_sum_v) >> 2;\n }\n \n if (extra_width != 0) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 0, 1);\n picture->u[picture_offset] = (1 + pixel_sum_u) >> 1;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 0, 1);\n picture->v[picture_offset] = (1 + pixel_sum_v) >> 1;\n }\n }\n if (extra_height != 0) {\n \n for (x = 0; x < half_width; ++x) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0) +\n SampleAt(kUPlane, source_offset, 1, 0);\n picture->u[picture_offset] = (1 + pixel_sum_u) >> 1;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0) +\n SampleAt(kVPlane, source_offset, 1, 0);\n picture->v[picture_offset] = (1 + pixel_sum_v) >> 1;\n }\n \n if (extra_width != 0) {\n int source_offset = PixelOffset(2 * x, 2 * y);\n int picture_offset = x + y * picture->uv_stride;\n int pixel_sum_u =\n SampleAt(kUPlane, source_offset, 0, 0);\n picture->u[picture_offset] = pixel_sum_u;\n int pixel_sum_v =\n SampleAt(kVPlane, source_offset, 0, 0);\n picture->v[picture_offset] = pixel_sum_v;\n }\n }\n return true;\n}\n\nint WebpOptimizer::ProgressHook(int percent, const WebPPicture* picture) {\n const WebpOptimizer* webp_optimizer =\n static_cast<WebpOptimizer*>(picture->user_data);\n return webp_optimizer->progress_hook_(percent,\n webp_optimizer->progress_hook_data_);\n}\n\nbool WebpOptimizer::CreateOptimizedWebp(\n const GoogleString& original_jpeg,\n int configured_quality,\n WebpProgressHook progress_hook,\n void* progress_hook_data,\n GoogleString* compressed_webp) {\n \n WebPPicture picture;\n WebPConfig config;\n int input_quality = JpegUtils::GetImageQualityFromImage(original_jpeg.data(),\n original_jpeg.size(),\n message_handler_);\n\n if (!WebPPictureInit(&picture) || !WebPConfigInit(&config)) {\n \n return false;\n }\n\n if (configured_quality == kNoQualityGiven) {\n \n \n configured_quality = config.quality;\n }\n\n int output_quality = configured_quality;\n\n if (input_quality != kNoQualityGiven && input_quality < configured_quality) {\n output_quality = input_quality;\n } else {\n \n \n \n output_quality = configured_quality;\n }\n\n if (!WebPConfigPreset(&config, WEBP_PRESET_DEFAULT, output_quality)) {\n \n return false;\n } else {\n \n \n \n \n \n \n \n config.method = 3;\n if (!WebPValidateConfig(&config)) {\n return false;\n }\n }\n\n J_COLOR_SPACE color_space = kUseYUV ? JCS_YCbCr : JCS_RGB;\n\n if (!ReadJpegPixels(color_space, original_jpeg)) {\n return false;\n }\n\n \n \n \n \n picture.writer = &GoogleStringWebpWriter;\n picture.custom_ptr = static_cast<void*>(compressed_webp);\n picture.width = width_;\n picture.height = height_;\n if (progress_hook != NULL) {\n picture.progress_hook = ProgressHook;\n picture.user_data = this;\n progress_hook_ = progress_hook;\n progress_hook_data_ = progress_hook_data;\n }\n\n if (kUseYUV) {\n \n \n if (!WebPImportYUV(&picture)) {\n return false;\n }\n } else if (!WebPPictureImportRGB(&picture, pixels_, row_stride_)) {\n return false;\n }\n\n \n \n delete[] pixels_;\n pixels_ = NULL;\n\n \n bool result = WebPEncode(&config, &picture);\n\n \n WebPPictureFree(&picture);\n\n return result;\n}\n\n} \n\nbool OptimizeWebp(const GoogleString& original_jpeg, int configured_quality,\n WebpProgressHook progress_hook, void* progress_hook_data,\n GoogleString* compressed_webp,\n MessageHandler* message_handler) {\n WebpOptimizer optimizer(message_handler);\n return optimizer.CreateOptimizedWebp(original_jpeg, configured_quality,\n progress_hook, progress_hook_data,\n compressed_webp);\n}\n\nstatic bool WebPDecBufferToPicture(const WebPDecBuffer* const buf,\n WebPPicture* const picture) {\n const WebPYUVABuffer* const yuva = &buf->u.YUVA;\n if ((yuva->u_stride != yuva->v_stride) || (buf->colorspace != MODE_YUVA)) {\n return false;\n }\n picture->width = buf->width;\n picture->height = buf->height;\n picture->y = yuva->y;\n picture->u = yuva->u;\n picture->v = yuva->v;\n picture->a = yuva->a;\n picture->y_stride = yuva->y_stride;\n picture->uv_stride = yuva->u_stride;\n picture->a_stride = yuva->a_stride;\n picture->colorspace = WEBP_YUV420A;\n return true;\n}\n\nbool ReduceWebpImageQuality(const GoogleString& original_webp,\n int quality, GoogleString* compressed_webp) {\n if (quality < 1) {\n \n *compressed_webp = original_webp;\n return true;\n } else if (quality > 100) {\n quality = 100;\n }\n\n const uint8* webp = reinterpret_cast<const uint8*>(original_webp.data());\n const int webp_size = original_webp.size();\n \n \n \n \n \n \n \n \n WebPConfig config;\n if (WebPConfigPreset(&config, WEBP_PRESET_DEFAULT, quality) == 0) {\n \n return false;\n }\n WebPPicture picture;\n if (WebPPictureInit(&picture) == 0) {\n \n return false;\n }\n\n WebPDecoderConfig dec_config;\n WebPInitDecoderConfig(&dec_config);\n WebPDecBuffer* const output_buffer = &dec_config.output;\n output_buffer->colorspace = MODE_YUVA;\n bool success = ((WebPDecode(webp, webp_size, &dec_config) == VP8_STATUS_OK) &&\n WebPDecBufferToPicture(output_buffer, &picture));\n if (success) {\n picture.writer = &GoogleStringWebpWriter;\n picture.custom_ptr = reinterpret_cast<void*>(compressed_webp);\n\n success = WebPEncode(&config, &picture);\n }\n\n WebPFreeDecBuffer(output_buffer);\n\n return success;\n}\n\n} \n"},"middle":{"kind":"string","value":"int GoogleStringWebpWriter(const uint8_t* data, size_t data_size,\n const WebPPicture* const picture) {\n GoogleString* compressed_webp =\n static_cast<GoogleString*>(picture->custom_ptr);\n \n compressed_webp->append(reinterpret_cast<const char*>(data), data_size);\n return 1;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"// Bool that is auto-initialized to false\n\nclass Bool {\n\n public:\n\n Bool() : value_(false) {}\n\n Bool(bool value) : value_(value) {} // Copy constructor // NOLINT\n\n const bool Test() const { return value_; }\n\n\n\n private:\n\n bool value_;\n\n};\n\n\n","file_path":"pagespeed/kernel/html/html_parse_test.cc","rank":0,"score":215474.80556840266},{"content":"class IntVector : public std::vector<int> {\n\n public:\n\n void Merge(const IntVector& src) {\n\n for (int i = 0, n = src.size(); i < n; ++i) {\n\n push_back(src[i]);\n\n }\n\n }\n\n\n\n // Copy and assign OK.\n\n};\n\n\n","file_path":"pagespeed/kernel/util/copy_on_write_test.cc","rank":1,"score":190563.19677330507},{"content":"class MemberFunction2 : public MemberFunctionBase<C> {\n\n public:\n\n typedef void (C::*Func)(T1, T2);\n\n\n\n // Constructor supplying a Run method, but no Cancel method.\n\n MemberFunction2(Func f, C* c, T1 v1, T2 v2)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2) {}\n\n\n\n // Constructor supplying a Run method and a Cancel method.\n\n MemberFunction2(Func f, Func cancel,\n\n C* c, T1 v1, T2 v2)\n\n : MemberFunctionBase<C>(c),\n\n run_(f), cancel_(cancel),\n\n v1_(v1), v2_(v2) {}\n\n\n\n protected:\n\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_); }\n\n virtual void Cancel() {\n\n if (cancel_ != NULL) {\n\n CALL_MEMBER_FN(object_, cancel_)(v1_, v2_);\n","file_path":"pagespeed/kernel/base/function.h","rank":2,"score":184722.84189115115},{"content":"class MemberFunction0 : public MemberFunctionBase<C> {\n\n public:\n\n typedef void (C::*Func)();\n\n\n\n // Constructor supplying a Run method, but no Cancel method.\n\n MemberFunction0(Func f, C* c) : MemberFunctionBase<C>(c), run_(f),\n\n cancel_(NULL) {\n\n }\n\n\n\n // Constructor supplying a Run method and a Cancel method.\n\n MemberFunction0(Func f, Func cancel, C* c)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(cancel) {}\n\n\n\n protected:\n\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(); }\n\n virtual void Cancel() {\n\n if (cancel_ != NULL) {\n\n CALL_MEMBER_FN(object_, cancel_)();\n\n }\n\n }\n\n\n\n private:\n\n Func run_;\n\n Func cancel_;\n\n};\n\n\n\n// Captures a delayed call to a 1-arg member function as a closure.\n\ntemplate<class C, typename T1>\n","file_path":"pagespeed/kernel/base/function.h","rank":3,"score":184722.84189115115},{"content":"class MemberFunction1 : public MemberFunctionBase<C> {\n\n public:\n\n typedef void (C::*Func)(T1);\n\n\n\n // Constructor supplying a Run method, but no Cancel method.\n\n MemberFunction1(Func f, C* c, T1 v1)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1) {}\n\n\n\n // Constructor supplying a Run method and a Cancel method.\n\n MemberFunction1(Func f, Func cancel,\n\n C* c, T1 v1)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(cancel), v1_(v1) {}\n\n\n\n protected:\n\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_); }\n\n virtual void Cancel() {\n\n if (cancel_ != NULL) {\n\n CALL_MEMBER_FN(object_, cancel_)(v1_);\n\n }\n\n }\n\n\n\n private:\n\n Func run_;\n\n Func cancel_;\n\n T1 v1_;\n\n};\n\n\n\n// Captures a delayed call to a 2-arg member function as a closure.\n\ntemplate<class C, typename T1, typename T2>\n","file_path":"pagespeed/kernel/base/function.h","rank":4,"score":184722.84189115115},{"content":"class MemberFunction4 : public MemberFunctionBase<C> {\n\n public:\n\n typedef void (C::*Func)(T1, T2, T3, T4);\n\n\n\n // Constructor supplying a Run method, but no Cancel method.\n\n MemberFunction4(Func f, C* c, T1 v1, T2 v2, T3 v3, T4 v4)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2),\n\n v3_(v3), v4_(v4) {\n\n }\n\n\n\n // Constructor supplying a Run method and a Cancel method.\n\n MemberFunction4(Func f, Func cancel,\n\n C* c, T1 v1, T2 v2, T3 v3, T4 v4)\n\n : MemberFunctionBase<C>(c),\n\n run_(f), cancel_(cancel),\n\n v1_(v1), v2_(v2), v3_(v3), v4_(v4) {}\n\n\n\n protected:\n\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_, v3_, v4_); }\n\n virtual void Cancel() {\n","file_path":"pagespeed/kernel/base/function.h","rank":5,"score":184722.84189115115},{"content":"class MemberFunction3 : public MemberFunctionBase<C> {\n\n public:\n\n typedef void (C::*Func)(T1, T2, T3);\n\n\n\n // Constructor supplying a Run method, but no Cancel method.\n\n MemberFunction3(Func f, C* c, T1 v1, T2 v2, T3 v3)\n\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2),\n\n v3_(v3) {\n\n }\n\n\n\n // Constructor supplying a Run method and a Cancel method.\n\n MemberFunction3(Func f, Func cancel,\n\n C* c, T1 v1, T2 v2, T3 v3)\n\n : MemberFunctionBase<C>(c),\n\n run_(f), cancel_(cancel),\n\n v1_(v1), v2_(v2), v3_(v3) {}\n\n\n\n protected:\n\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_, v3_); }\n\n virtual void Cancel() {\n","file_path":"pagespeed/kernel/base/function.h","rank":6,"score":184722.84189115115},{"content":"// A boolean flag that can be set atomically and be visible to other\n\n// threads. Please be extra careful with this --- it can go wrong in\n\n// incomprehensible ways; most of the time, you probably want to use a mutex\n\n// instead.\n\nclass AtomicBool {\n\n public:\n\n // Guaranteed to be initialized to false.\n\n AtomicBool() {\n\n set_value(false);\n\n }\n\n\n\n ~AtomicBool() {}\n\n\n\n bool value() const {\n\n return base::subtle::Acquire_Load(&value_);\n\n }\n\n\n\n void set_value(bool v) {\n\n base::subtle::Release_Store(&value_, v);\n\n }\n\n\n\n private:\n\n base::subtle::AtomicWord value_;\n\n DISALLOW_COPY_AND_ASSIGN(AtomicBool);\n\n};\n\n\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_KERNEL_BASE_ATOMIC_BOOL_H_\n","file_path":"pagespeed/kernel/base/atomic_bool.h","rank":7,"score":181459.79622440366},{"content":"// Three-way return type for distinguishing Errors from boolean answer.\n\n//\n\n// This is physically just an enum, but is wrapped in a class to prevent\n\n// accidental usage in an if- or ternary-condition without explicitly indicating\n\n// whether you are looking for true, false, or error.\n\nclass BoolOrError {\n\n enum Choice {\n\n kIsFalse,\n\n kIsTrue,\n\n kIsError\n\n };\n\n\n\n public:\n\n BoolOrError() : choice_(kIsError) { }\n\n explicit BoolOrError(bool t_or_f) : choice_(t_or_f ? kIsTrue : kIsFalse) { }\n\n\n\n // Intended to be passed by value; explicitly support copy & assign\n\n BoolOrError(const BoolOrError& src) : choice_(src.choice_) { }\n\n BoolOrError& operator=(const BoolOrError& src) {\n\n if (&src != this) {\n\n choice_ = src.choice_;\n\n }\n\n return *this;\n\n }\n\n\n\n bool is_false() const { return choice_ == kIsFalse; }\n\n bool is_true() const { return choice_ == kIsTrue; }\n\n bool is_error() const { return choice_ == kIsError; }\n\n void set_error() { choice_ = kIsError; }\n\n void set(bool t_or_f) { choice_ = t_or_f ? kIsTrue : kIsFalse; }\n\n\n\n private:\n\n Choice choice_;\n\n};\n\n\n","file_path":"pagespeed/kernel/base/file_system.h","rank":8,"score":167059.56092995856},{"content":"class MessageHandler;\n","file_path":"net/instaweb/http/public/external_url_fetcher.h","rank":9,"score":161381.44374063134},{"content":"class RequestHeaders;\n\n\n\n// Runs an external command ('wget' by default, or 'curl') via popen\n\n// for blocking URL fetches.\n\n\n","file_path":"net/instaweb/http/public/external_url_fetcher.h","rank":10,"score":161381.44374063134},{"content":"class AsyncFetch;\n","file_path":"net/instaweb/http/public/external_url_fetcher.h","rank":11,"score":161381.44374063134},{"content":"// TODO(vchudnov): Incorporate NetcatUrlFetcher functionality into\n\n// this class.\n\nclass ExternalUrlFetcher : public UrlAsyncFetcher {\n\n public:\n\n ExternalUrlFetcher() {}\n\n virtual ~ExternalUrlFetcher() {}\n\n\n\n // TODO(sligocki): Allow protocol version number (e.g. HTTP/1.1)\n\n // and request type (e.g. GET, POST, etc.) to be specified.\n\n virtual void Fetch(const GoogleString& url,\n\n MessageHandler* message_handler,\n\n AsyncFetch* fetch);\n\n\n\n // Default user agent to use.\n\n static const char kDefaultUserAgent[];\n\n\n\n // Sets the path to \"binary\" when fetching using \"how\".\n\n void set_binary(const GoogleString& binary);\n\n\n\n\n\n protected:\n\n // Appends to escaped_headers one header line for each Name, Value\n","file_path":"net/instaweb/http/public/external_url_fetcher.h","rank":12,"score":157641.08858691936},{"content":"// Pool element containing an int, for test purposes.\n\nclass IntElement : public PoolElement<IntElement> {\n\n public:\n\n IntElement() { }\n\n\n\n const int num() const { return num_; }\n\n void set_num(int num) { num_ = num; }\n\n\n\n private:\n\n int num_;\n\n\n\n DISALLOW_COPY_AND_ASSIGN(IntElement);\n\n};\n\n\n\ntypedef Pool<IntElement> IntPool;\n\ntypedef PoolElement<IntElement>::Position PoolPosition;\n\n\n","file_path":"pagespeed/kernel/base/pool_test.cc","rank":13,"score":156725.46802342575},{"content":" class const_iterator;\n\n\n\n typedef char32 value_type;\n\n\n\n // Constructors. These always produce owners.\n\n UnicodeText(); // Create an empty text.\n\n UnicodeText(const UnicodeText& src); // copy constructor\n\n // Construct a substring (copies the data).\n\n UnicodeText(const const_iterator& first, const const_iterator& last);\n\n\n\n // Assignment operator. This copies the data and produces an owner\n\n // unless this == &src, e.g., \"x = x;\", which is a no-op.\n\n UnicodeText& operator=(const UnicodeText& src);\n\n\n\n // x.Copy(y) copies the data from y into x.\n\n UnicodeText& Copy(const UnicodeText& src);\n\n inline UnicodeText& assign(const UnicodeText& src) { return Copy(src); }\n\n\n\n // x.PointTo(y) changes x so that it points to y's data.\n\n // It does not copy y or take ownership of y's data.\n","file_path":"third_party/css_parser/src/util/utf8/public/unicodetext.h","rank":14,"score":156237.4690349783},{"content":" class const_iterator {\n\n typedef const_iterator CI;\n\n public:\n\n typedef std::bidirectional_iterator_tag iterator_category;\n\n typedef char32 value_type;\n\n typedef ptrdiff_t difference_type;\n\n typedef void pointer; // (Not needed.)\n\n typedef const char32 reference; // (Needed for const_reverse_iterator)\n\n\n\n // Iterators are default-constructible.\n\n const_iterator();\n\n\n\n char32 operator*() const; // Dereference\n\n\n\n const_iterator& operator++(); // Advance (++iter)\n\n const_iterator operator++(int) { // (iter++)\n\n const_iterator result(*this);\n\n ++*this;\n\n return result;\n\n }\n","file_path":"third_party/css_parser/src/util/utf8/public/unicodetext.h","rank":15,"score":156237.4690349783},{"content":"class ExternalServerSpecTestInvalid : public ::testing::Test {\n\n protected:\n\n void TestInvalidSpec(const GoogleString &value) {\n\n GoogleString msg;\n\n ExternalServerSpec spec(\"old.com\", 4321);\n\n EXPECT_FALSE(spec.SetFromString(value, kDefaultPortForTesting, &msg));\n\n EXPECT_NE(\"\", msg);\n\n EXPECT_EQ(\"old.com\", spec.host);\n\n EXPECT_EQ(4321, spec.port);\n\n }\n\n};\n\n\n\nTEST_F(ExternalServerSpecTestInvalid, NonNumericPort) {\n\n TestInvalidSpec(\"host:1port\");\n\n}\n\n\n\nTEST_F(ExternalServerSpecTestInvalid, InvalidPortNumber1) {\n\n TestInvalidSpec(\"host:0\");\n\n}\n\n\n","file_path":"pagespeed/system/external_server_spec_test.cc","rank":16,"score":152688.19921436472},{"content":" // Read-only iterator type; cannot be used for deletion or to modify\n\n // the contained items.\n\n class ConstIterator : public IterBase {\n\n public:\n\n ConstIterator& operator++() {\n\n this->Advance();\n\n return *this;\n\n }\n\n\n\n const T* Get() { return this->Data(); }\n\n const T* operator->() { return this->Data(); }\n\n const T& operator*() { return *this->Data(); }\n\n bool operator==(const ConstIterator& other) const {\n\n return this->Equals(other);\n\n }\n\n bool operator!=(const ConstIterator& other) const {\n\n return !this->Equals(other);\n\n }\n\n // default copy op, dtor are OK.\n\n\n\n private:\n\n friend class InlineSList<T>;\n","file_path":"pagespeed/kernel/base/inline_slist.h","rank":17,"score":150987.95657517356},{"content":" class HistC = CountHistogram, // Histogram\n","file_path":"pagespeed/kernel/base/statistics_template.h","rank":18,"score":150980.39909271104},{"content":"class IntElement : public InlineSListElement<IntElement> {\n\n public:\n\n explicit IntElement(int n) : num_(n) { }\n\n\n\n const int num() const { return num_; }\n\n void set_num(int num) { num_ = num; }\n\n\n\n private:\n\n int num_;\n\n\n\n DISALLOW_COPY_AND_ASSIGN(IntElement);\n\n};\n\n\n\ntypedef InlineSList<IntElement> IntList;\n\n\n","file_path":"pagespeed/kernel/base/inline_slist_test.cc","rank":19,"score":150795.9760467823},{"content":" class const_reverse_iterator : public std::reverse_iterator<const_iterator> {\n\n public:\n\n explicit const_reverse_iterator(const_iterator it) :\n\n std::reverse_iterator<const_iterator>(it) {}\n\n const char* utf8_data() const {\n\n const_iterator tmp_it = base();\n\n return (--tmp_it).utf8_data();\n\n }\n\n int get_utf8(char* buf) const {\n\n const_iterator tmp_it = base();\n\n return (--tmp_it).get_utf8(buf);\n\n }\n\n string get_utf8_string() const {\n\n const_iterator tmp_it = base();\n\n return (--tmp_it).get_utf8_string();\n\n }\n\n int utf8_length() const {\n\n const_iterator tmp_it = base();\n\n return (--tmp_it).utf8_length();\n\n }\n","file_path":"third_party/css_parser/src/util/utf8/public/unicodetext.h","rank":20,"score":144629.03804211903},{"content":"// Creates an AsyncFetch object using an existing Writer* object,\n\n// which is used to delegate Write and Flush operations. This\n\n// class is still abstract, and requires inheritors to implement Done().\n\nclass AsyncFetchUsingWriter : public AsyncFetch {\n\n public:\n\n AsyncFetchUsingWriter(const RequestContextPtr& request_context,\n\n Writer* writer)\n\n : AsyncFetch(request_context),\n\n writer_(writer) {}\n\n virtual ~AsyncFetchUsingWriter();\n\n\n\n protected:\n\n virtual bool HandleWrite(const StringPiece& sp, MessageHandler* handler);\n\n virtual bool HandleFlush(MessageHandler* handler);\n\n\n\n private:\n\n Writer* writer_;\n\n DISALLOW_COPY_AND_ASSIGN(AsyncFetchUsingWriter);\n\n};\n\n\n","file_path":"net/instaweb/http/public/async_fetch.h","rank":21,"score":143758.39228944064},{"content":" class HTTPValueFetch : public AsyncFetchUsingWriter {\n\n public:\n\n HTTPValueFetch(const RequestContextPtr& request_context, HTTPValue* value)\n\n : AsyncFetchUsingWriter(request_context, value) {}\n\n virtual void HandleDone(bool /*ok*/) {}\n\n virtual void HandleHeadersComplete() {}\n\n };\n\n\n\n bool IsIproContentType(ResponseHeaders* response_headers);\n\n\n\n void DroppedDueToSize();\n\n void DroppedAsUncacheable();\n\n\n\n const GoogleString url_;\n\n const GoogleString fragment_;\n\n const RequestHeaders::Properties request_properties_;\n\n const HttpOptions http_options_;\n\n\n\n int64 max_response_bytes_;\n\n const int max_concurrent_recordings_;\n","file_path":"pagespeed/system/in_place_resource_recorder.h","rank":22,"score":143743.99753642658},{"content":" class TVarC = FakeTimedVariable> // TimeDVariable\n","file_path":"pagespeed/kernel/base/statistics_template.h","rank":23,"score":141535.16432343514},{"content":"class WgetUrlFetcher : public ExternalUrlFetcher {\n\n public:\n\n WgetUrlFetcher();\n\n virtual ~WgetUrlFetcher() {}\n\n\n\n private:\n\n virtual GoogleString ConstructFetchCommand(\n\n const GoogleString& escaped_url,\n\n const char* user_agent,\n\n const StringVector& escaped_headers);\n\n virtual const char* GetFetchLabel();\n\n\n\n DISALLOW_COPY_AND_ASSIGN(WgetUrlFetcher);\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // NET_INSTAWEB_HTTP_PUBLIC_WGET_URL_FETCHER_H_\n","file_path":"net/instaweb/http/public/wget_url_fetcher.h","rank":24,"score":141525.14600070452},{"content":" class ExternalServersOption : public OptionTemplateBase<Spec> {\n\n public:\n\n bool SetFromString(StringPiece value_string,\n\n GoogleString* error_detail) override {\n\n return this->mutable_value().SetFromString(value_string, default_port,\n\n error_detail);\n\n }\n\n GoogleString ToString() const override {\n\n return this->value().ToString();\n\n }\n\n GoogleString Signature(const Hasher* hasher) const override {\n\n return hasher->Hash(ToString());\n\n }\n\n };\n\n\n","file_path":"pagespeed/system/system_rewrite_options.h","rank":25,"score":140762.09030382178},{"content":"class IntegerToStringToIntTest : public testing::Test {\n\n protected:\n\n void ValidateIntegerToString(int i, GoogleString s) {\n\n EXPECT_EQ(s, IntegerToString(i));\n\n ValidateInteger64ToString(static_cast<int64>(i), s);\n\n }\n\n\n\n void ValidateStringToInt(GoogleString s, int i) {\n\n int i2;\n\n EXPECT_TRUE(StringToInt(s, &i2));\n\n EXPECT_EQ(i, i2);\n\n ValidateStringToInt64(s, static_cast<int64>(i));\n\n }\n\n\n\n void InvalidStringToInt(GoogleString s, int expected) {\n\n int i = -50;\n\n EXPECT_FALSE(StringToInt(s, &i));\n\n EXPECT_EQ(expected, i);\n\n InvalidStringToInt64(s);\n\n }\n","file_path":"pagespeed/kernel/base/string_util_test.cc","rank":26,"score":138562.922375203},{"content":"// This class is not template for several reasons:\n\n// 1. There is currently no need in having different types depending on what\n\n// external cache are we testing.\n\n// 2. Templates add complexity and boilerplate when defining functions outside\n\n// of the class.\n\n// 3. When you have a class derived from template class, you cannot access\n\n// member functions and fields without explicitly writing `this->` or\n\n// something similar. It's explained in Google Test documentation and here:\n\n// http://stackoverflow.com/questions/1120833/derived-template-class-access-to-base-class-member-data\n\nclass SystemCachesExternalCacheTestBase : public SystemCachesTest {\n\n protected:\n\n virtual bool SkipExternalCacheTests() = 0;\n\n\n\n virtual GoogleString AssembledAsyncCacheWithStats() = 0;\n\n\n\n virtual GoogleString AssembledBlockingCacheWithStats() = 0;\n\n\n\n virtual void SetUpExternalCache(SystemRewriteOptions* options) = 0;\n\n\n\n // Test helpers\n\n void TestBasicCacheAndLru();\n\n\n\n void TestBasicCacheLruShm();\n\n\n\n void TestBasicCacheShmNoLru();\n\n\n\n void StressTestHelper(bool do_deletes) {\n\n if (SkipExternalCacheTests()) {\n\n return;\n","file_path":"pagespeed/system/system_caches_test.cc","rank":27,"score":137385.4316443914},{"content":"class DequeUsingStdVector : public std::vector<T> {\n\n public:\n\n void push_front(const T& value) { this->insert(this->begin(), value); }\n\n void pop_front() { this->erase(this->begin()); }\n\n};\n\n\n\ntemplate<class Deque> static void FourElementWorkout(int iters,\n\n int num_elements) {\n\n for (int iter = 0; iter < iters; ++iter) {\n\n Deque deque;\n\n\n\n // Simple usage as pure stack or queue, but not at the same time.\n\n for (int i = 0; i < num_elements; ++i) { deque.push_back(i); }\n\n for (int i = 0; i < num_elements; ++i) {\n\n CHECK_EQ(i, deque.front());\n\n deque.pop_front();\n\n }\n\n for (int i = 0; i < num_elements; ++i) { deque.push_front(i); }\n\n for (int i = num_elements - 1; i >= 0; --i) {\n\n CHECK_EQ(i, deque.front());\n","file_path":"pagespeed/kernel/util/deque_speed_test.cc","rank":28,"score":133900.35030399702},{"content":"class SystemCachesRedisCacheTest : public SystemCachesExternalCacheTestBase {\n\n protected:\n\n // TODO(yeputons): share this code with SystemCachesMemCacheTest or move it to\n\n // the base class.\n\n bool SkipExternalCacheTests() override {\n\n return ServerSpec().empty();\n\n }\n\n\n\n // TODO(yeputons): share this code with SystemCachesMemCacheTest or move it to\n\n // the base class.\n\n ExternalServerSpec ServerSpec() {\n\n if (server_spec_.empty()) {\n\n // This matches the logic in apr_mem_cache_test.\n\n const char* port_string = getenv(\"REDIS_PORT\");\n\n int port;\n\n if (port_string == NULL || !StringToInt(port_string, &port)) {\n\n LOG(ERROR) << \"SystemCachesRedisCacheTest is skipped because env var \"\n\n << \"$REDIS_PORT is not set to a valid integer. Set that to \"\n\n << \"the port number where redis is running to enable the \"\n\n << \"tests. See install/run_program_with_redis.sh\";\n","file_path":"pagespeed/system/system_caches_test.cc","rank":29,"score":133537.00130616734},{"content":"class SystemCachesMemCacheTest : public SystemCachesExternalCacheTestBase {\n\n protected:\n\n bool SkipExternalCacheTests() override {\n\n return ServerSpec().empty();\n\n }\n\n\n\n ExternalClusterSpec ServerSpec() {\n\n if (cluster_spec_.empty()) {\n\n // This matches the logic in apr_mem_cache_test.\n\n const char* port_string = getenv(\"MEMCACHED_PORT\");\n\n int port;\n\n if (port_string == nullptr || !StringToInt(port_string, &port)) {\n\n LOG(ERROR) << \"SystemCachesMemCacheTest is skipped because env var \"\n\n << \"$MEMCACHED_PORT is not set to a valid integer. Set that \"\n\n << \"to the port number where memcached is running to enable \"\n\n << \"the tests. See install/run_program_with_memcached.sh\";\n\n return cluster_spec_;\n\n }\n\n cluster_spec_.servers.push_back(ExternalServerSpec(\"localhost\", port));\n\n }\n","file_path":"pagespeed/system/system_caches_test.cc","rank":30,"score":133537.00130616734},{"content":" // Functions added to a Sequence will be run sequentially, though not\n\n // necessarily always from the same worker thread. The scheduler will\n\n // continue to schedule new work added to the sequence until\n\n // FreeSequence is called.\n\n //\n\n // TODO(jmarantz): Make this subclass private (or just move it to the .cc\n\n // file) and change NewSequence to return a net_instaweb::Sequence*.\n\n class Sequence : public net_instaweb::Sequence {\n\n public:\n","file_path":"pagespeed/kernel/thread/queued_worker_pool.h","rank":31,"score":128989.95549028544},{"content":"class TestMessageHandler : public net_instaweb::MessageHandler {\n\n public:\n\n const StringVector& messages() { return messages_; }\n\n\n\n protected:\n\n virtual void MessageVImpl(MessageType type, const char* msg, va_list args);\n\n virtual void MessageSImpl(MessageType type, const GoogleString& message);\n\n\n\n virtual void FileMessageVImpl(MessageType type, const char* filename,\n\n int line, const char* msg, va_list args);\n\n virtual void FileMessageSImpl(MessageType type, const char* filename,\n\n int line, const GoogleString& message);\n\n\n\n private:\n\n StringVector messages_;\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_KERNEL_BASE_MESSAGE_HANDLER_TEST_BASE_H_\n","file_path":"pagespeed/kernel/base/message_handler_test_base.h","rank":32,"score":124500.57099137842},{"content":"// Implements a sequence which is run directly from RunTasksUntil,\n\n// rather than running in a background thread.\n\nclass Scheduler::Sequence : public net_instaweb::Sequence {\n\n public:\n\n // The scheduler is used for doing timed-waits so that any pending\n\n // scheduler alarms fire before the wait-period ends.\n\n explicit Sequence(Scheduler* scheduler);\n\n virtual ~Sequence();\n\n\n\n void Add(Function* function) override LOCKS_EXCLUDED(scheduler_->mutex());\n\n\n\n // Runs functions for this sequence directly, until *done is true or\n\n // the timeout expires. Returns 'false' if the timeout expired prior\n\n // to 'done' getting set to true. 'done' must be protected\n\n // by scheduler_->mutex(), and is expected to be set by one of the sequence\n\n // tasks.\n\n bool RunTasksUntil(int64 timeout_ms, bool* done)\n\n EXCLUSIVE_LOCKS_REQUIRED(scheduler_->mutex());\n\n\n\n // Atomically forwards all activity to an alternative Sequence.\n\n // Any pending functions in the work_queue_ are transferred into\n\n // the sequence, and new functions passed to Add are added to\n","file_path":"pagespeed/kernel/thread/scheduler_sequence.h","rank":33,"score":123599.32645941089},{"content":" class TimedVar> class StatisticsTemplate\n\n : public Statistics {\n\n public:\n\n StatisticsTemplate() {}\n\n virtual ~StatisticsTemplate() {\n\n STLDeleteContainerPointers(variables_.begin(), variables_.end());\n\n STLDeleteContainerPointers(up_downs_.begin(), up_downs_.end());\n\n STLDeleteContainerPointers(histograms_.begin(), histograms_.end());\n\n STLDeleteContainerPointers(timed_vars_.begin(), timed_vars_.end());\n\n }\n\n\n\n // Implementations of Statistics API --- see base class docs for\n\n // description.\n\n virtual Var* AddVariable(const StringPiece& name) {\n\n Var* var = FindVariable(name);\n\n if (var == NULL) {\n\n var = NewVariable(name);\n\n variables_.push_back(var);\n\n variable_names_.push_back(name.as_string());\n\n variable_map_[name.as_string()] = var;\n","file_path":"pagespeed/kernel/base/statistics_template.h","rank":34,"score":121491.54189442613},{"content":"class TestClass {\n\n public:\n\n TestClass()\n\n : x_(0),\n\n runs_(0) {\n\n }\n\n\n\n void Method1(int x) {\n\n x_ = x;\n\n ++runs_;\n\n }\n\n\n\n void Method1ConstRefArg(const int& x) {\n\n x_ = 2 * x;\n\n ++runs_;\n\n }\n\n\n\n void Method2(int a, int b) {\n\n x_ = a + b;\n\n ++runs_;\n","file_path":"pagespeed/kernel/base/callback_test.cc","rank":35,"score":118997.96761353404},{"content":"class EmptyCallback : public net_instaweb::CacheInterface::Callback {\n\n public:\n\n EmptyCallback() {}\n\n virtual ~EmptyCallback() {}\n\n virtual void Done(net_instaweb::CacheInterface::KeyState state) {}\n\n\n\n private:\n\n DISALLOW_COPY_AND_ASSIGN(EmptyCallback);\n\n};\n\n\n\nvoid TestCachePayload(int payload_size, int chunk_size, int iters) {\n\n GoogleString value;\n\n net_instaweb::SimpleRandom random(new net_instaweb::NullMutex);\n\n GoogleString chunk = random.GenerateHighEntropyString(chunk_size);\n\n while (static_cast<int>(value.size()) < payload_size) {\n\n value += chunk;\n\n }\n\n net_instaweb::scoped_ptr<net_instaweb::ThreadSystem> thread_system(\n\n net_instaweb::Platform::CreateThreadSystem());\n\n net_instaweb::SimpleStats stats(thread_system.get());\n","file_path":"pagespeed/kernel/cache/compressed_cache_speed_test.cc","rank":36,"score":118100.08789390538},{"content":"class EmptyCallback : public net_instaweb::CacheInterface::Callback {\n\n public:\n\n EmptyCallback() {}\n\n virtual ~EmptyCallback() {}\n\n virtual void Done(net_instaweb::CacheInterface::KeyState state) {}\n\n\n\n private:\n\n DISALLOW_COPY_AND_ASSIGN(EmptyCallback);\n\n};\n\n\n","file_path":"pagespeed/kernel/cache/lru_cache_speed_test.cc","rank":37,"score":118100.08789390538},{"content":"class SimpleClass {\n\n public:\n\n SimpleClass() : index_(counter++) {}\n\n int index() const { return index_; }\n\n\n\n private:\n\n int index_;\n\n DISALLOW_COPY_AND_ASSIGN(SimpleClass);\n\n};\n\n\n","file_path":"pagespeed/kernel/base/ref_counted_ptr_test.cc","rank":38,"score":116878.50327090279},{"content":"namespace net_instaweb {\n\n\n\nstruct ExternalServerSpec {\n\n ExternalServerSpec() : host(), port(0) {}\n\n ExternalServerSpec(GoogleString host_, int port_)\n\n : host(host_), port(port_) {}\n\n bool SetFromString(StringPiece value_string, int default_port,\n\n GoogleString* error_detail);\n\n\n\n bool empty() const { return host.empty() && port == 0; }\n\n GoogleString ToString() const {\n\n // Should be 1:1 representation of value held, used to generate signature.\n\n return empty() ? \"\" : StrCat(host, \":\", IntegerToString(port));\n\n }\n\n\n\n GoogleString host;\n\n int port;\n","file_path":"pagespeed/system/external_server_spec.h","rank":39,"score":112778.93965911199},{"content":"class BaseClass : public RefCounted<BaseClass> {\n\n public:\n\n BaseClass() {}\n\n int index() const { return simple_.index(); }\n\n\n\n protected:\n\n virtual ~BaseClass() {}\n\n REFCOUNT_FRIEND_DECLARATION(BaseClass);\n\n\n\n private:\n\n SimpleClass simple_;\n\n DISALLOW_COPY_AND_ASSIGN(BaseClass);\n\n};\n\n\n","file_path":"pagespeed/kernel/base/ref_counted_ptr_test.cc","rank":40,"score":109203.3094428851},{"content":"// This class is a base for various mechanisms of running things in background.\n\n//\n\n// If you just want to run something in background, you want to use a subclass\n\n// of this, such as a SlowWorker or QueuedWorker instance.\n\n//\n\n// Subclasses should implement bool PermitQueue() and provide an appropriate\n\n// wrapper around QueueIfPermitted().\n\nclass Worker {\n\n public:\n\n // Tries to start the work thread (if it hasn't been started already).\n\n void Start();\n\n\n\n // Returns true if there was a job running or any jobs queued at the time\n\n // this function was called.\n\n bool IsBusy();\n\n\n\n // Finishes the currently running jobs, and deletes any queued jobs.\n\n // No further jobs will be accepted after this call either; they will\n\n // just be canceled. It is safe to call this method multiple times.\n\n void ShutDown();\n\n\n\n // Sets up a timed-variable statistic indicating the current queue depth.\n\n //\n\n // This must be called prior to starting the thread.\n\n void set_queue_size_stat(Waveform* x) { queue_size_ = x; }\n\n\n\n protected:\n","file_path":"pagespeed/kernel/thread/worker.h","rank":41,"score":109034.40973974376},{"content":"// Encapsulates a task to be run in response to some event, such as\n\n// a Timer callback, an fetch, or a cache lookup.\n\n//\n\n// Users of interfaces requiring a Function* can either derive a new\n\n// class from Function, or use one of the helper template-classes or\n\n// MakeFunction variants below, which create delayed calls to class\n\n// methods.\n\n//\n\n// Note that Functions by default are self-deleting after call, but\n\n// you can override that with set_delete_after_callback(false).\n\n//\n\n// A Function will always have its Run method or its Cancel method\n\n// called, never both. A Function should never be deleted without its\n\n// Run/Cancel method being called (except if\n\n// set_delete_after_callback(false)).\n\n//\n\n// Note that classes calling Functions use the CallRun or CallCancel methods,\n\n// rather than calling Run or Cancel directly. This allows the Function class\n\n// to enforce policy on making run & cancel mutually exclusive and implement\n\n// delete-after-run.\n\nclass Function {\n\n public:\n\n Function();\n\n virtual ~Function();\n\n\n\n // Functions used as Worker tasks can help the system shut down cleanly\n\n // by calling quit_requested() periodically. To support this, Worker\n\n // calls set_quit_requested_pointer so the Function object can access\n\n // the atomic bool.\n\n //\n\n // Note that a strategy of allocating the AtomicBool inside the Function\n\n // object exposes a shutdown race when the function completes and deletes\n\n // itself.\n\n void set_quit_requested_pointer(AtomicBool* x) { quit_requested_ = x; }\n\n\n\n // Allows an infrastructure (e.g. Worker or Alarm) to request that\n\n // a running Function stop soon, as it is being shut down.\n\n //\n\n // This can should only be called during the Run() method.\n\n bool quit_requested() const {\n","file_path":"pagespeed/kernel/base/function.h","rank":42,"score":109030.05000108486},{"content":"// Base class for implementations of monitoring statistics.\n\nclass Statistics {\n\n public:\n\n // Default group for use with AddTimedVariable.\n\n static const char kDefaultGroup[];\n\n\n\n Statistics() {}\n\n virtual ~Statistics();\n\n\n\n // Add a new variable, or returns an existing one of that name.\n\n // The UpDownCounter* is owned by the Statistics class -- it should\n\n // not be deleted by the caller.\n\n virtual UpDownCounter* AddUpDownCounter(const StringPiece& name) = 0;\n\n\n\n // Like AddVariable, but asks the implementation to scope the variable to the\n\n // entire process, even if statistics are generally partitioned by domains or\n\n // the like. Default implementation simply forwards to AddVariable.\n\n virtual UpDownCounter* AddGlobalUpDownCounter(const StringPiece& name);\n\n\n\n // Find a variable from a name, returning NULL if not found.\n\n virtual UpDownCounter* FindUpDownCounter(const StringPiece& name) const = 0;\n","file_path":"pagespeed/kernel/base/statistics.h","rank":43,"score":109023.0330942476},{"content":"// Displays a waveform of values over time. This can run\n\n// continuously, in which case it will only display waveforms for a\n\n// bounded number of samples. Or it can be run as a trigger.\n\n//\n\n// However the average, min, and max values will account for all the\n\n// values seen by the waveform since it was cleared.\n\n//\n\n// This class is threadsafe.\n\nclass Waveform {\n\n public:\n\n Waveform(ThreadSystem* thread_system, Timer* timer, int capacity,\n\n UpDownCounter* metric);\n\n\n\n void Clear();\n\n double Average();\n\n double Maximum();\n\n double Minimum();\n\n int Size();\n\n\n\n // Records a value at the current time using the Timer.\n\n void Add(double value);\n\n\n\n // Records a delta relative to the previous value using the Timer.\n\n // This is equivalent to calling Add(previous_value + delta).\n\n void AddDelta(double delta);\n\n\n\n // Write script and function to web page. Note that this function\n\n // should be called only once for each HTML page, and should not be\n","file_path":"pagespeed/kernel/base/waveform.h","rank":44,"score":109022.07581341194},{"content":"// Implements a simple scheduler that allows a thread to block until either time\n\n// expires, or a condition variable is signaled. Also permits various alarms to\n\n// be scheduled; these are lightweight short-lived callbacks that must be safely\n\n// runnable from any thread in any lock state in which scheduler invocations\n\n// occur. Finally, implements a hybrid between these: a callback that can be\n\n// run when the condition variable is signaled.\n\n//\n\n// This class is designed to be overridden, but only to re-implement its\n\n// internal notion of blocking to permit time to be mocked by MockScheduler.\n\nclass Scheduler {\n\n public:\n","file_path":"pagespeed/kernel/thread/scheduler.h","rank":45,"score":109021.46927399689},{"content":"class Function;\n\n\n","file_path":"pagespeed/kernel/thread/sequence.h","rank":46,"score":109015.77755732345},{"content":"class Writer;\n\n\n","file_path":"pagespeed/kernel/base/statistics.h","rank":47,"score":109015.77755732345},{"content":"class Hasher {\n\n public:\n\n // The passed in max_chars will be used to limit the length of\n\n // Hash() and HashSizeInChars()\n\n explicit Hasher(int max_chars);\n\n virtual ~Hasher();\n\n\n\n // Computes a web64-encoded hash of a single string. This\n\n // operation is thread-safe.\n\n //\n\n // This is implemented in terms of RawHash, and honors the length limit\n\n // passed in to the constructor.\n\n GoogleString Hash(const StringPiece& content) const;\n\n\n\n // Return string length of hashes produced by this hasher's Hash\n\n // method.\n\n //\n\n // This is implemented in terms of RawHashSizeInBytes() and the length limit\n\n // passed in to the constructor.\n\n int HashSizeInChars() const;\n","file_path":"pagespeed/kernel/base/hasher.h","rank":48,"score":109015.77755732345},{"content":"// UpDownCounters are variables that can also be decreased (e.g. Add\n\n// of a negative number) or Set to an arbitrary value.\n\n//\n\n// TODO(jmarantz): Make this not inherit from Variable, which will simplify the\n\n// 'CheckNotNegative' and its ifndefs, but will require us to do more accurate\n\n// type bookkeeping in tests, etc.\n\n//\n\n// TODO(jmarantz): consider renaming Variable->Counter, UpDownCounter->Variable.\n\nclass UpDownCounter {\n\n public:\n\n virtual ~UpDownCounter();\n\n\n\n virtual int64 Get() const = 0;\n\n // Return some name representing the variable, provided that the specific\n\n // implementation has some sensible way of doing so.\n\n virtual StringPiece GetName() const = 0;\n\n\n\n // Sets the specified value, returning the previous value. This can be\n\n // used to by two competing threads/processes to determine which thread\n\n // modified the value first. The default implementation is non-atomic,\n\n // but implementations can override to provide an atomic version.\n\n //\n\n // Non-atomic implementations may result in multiple concurrent updates\n\n // each returning the old value. In an atomic implementation, only one\n\n // concurrent update will return the old value.\n\n virtual int64 SetReturningPreviousValue(int64 value);\n\n\n\n virtual void Set(int64 value) = 0;\n\n void Clear() { Set(0); }\n\n int64 Add(int64 delta) { return AddHelper(delta); }\n\n\n\n protected:\n\n // This is virtual so that subclasses can add platform-specific atomicity.\n\n virtual int64 AddHelper(int64 delta) = 0;\n\n};\n\n\n","file_path":"pagespeed/kernel/base/statistics.h","rank":49,"score":109015.77755732345},{"content":"class Callback1 {\n\n public:\n\n Callback1() {}\n\n virtual ~Callback1() {}\n\n virtual void Run(A1) = 0;\n\n};\n\n\n\n// Naming convention is:\n\n// (Member)?Callback_<num-pre-bound-args>_<num-runtime-args>\n\n\n\n// TODO(gee): Fill out other useful specializations.\n\ntemplate<class C, class A1, bool DeleteAfterRun>\n","file_path":"pagespeed/kernel/base/callback.h","rank":50,"score":109015.77755732345},{"content":"class Timer;\n","file_path":"pagespeed/system/admin_site.h","rank":51,"score":109015.77755732345},{"content":"class Waveform;\n\n\n","file_path":"pagespeed/kernel/thread/worker.h","rank":52,"score":109015.77755732345},{"content":"class Statistics;\n","file_path":"pagespeed/system/system_caches.h","rank":53,"score":109015.77755732345},{"content":"// Atoms are idempotent representations of strings, created\n\n// via a symbol table.\n\nclass Atom {\n\n public:\n\n Atom(const Atom& src) : str_(src.str_) {}\n\n Atom();\n\n ~Atom() {} // atoms are memory-managed by SymbolTables.\n\n\n\n Atom& operator=(const Atom& src) {\n\n if (&src != this) {\n\n str_ = src.str_;\n\n }\n\n return *this;\n\n }\n\n\n\n // Returns the address of the canonical StringPiece representing this Atom.\n\n // The underlying StringPiece object (and its data) are owned by the\n\n // SymbolTable.\n\n const StringPiece* Rep() const { return str_; }\n\n\n\n // This is comparing the underlying StringPiece pointers. It is invalid\n\n // to compare Atoms from different symbol tables.\n","file_path":"pagespeed/kernel/base/atom.h","rank":54,"score":109015.77755732345},{"content":" // An implementation of net_instaweb::Sequence that's controlled by the\n\n // scheduler.\n\n class Sequence;\n\n\n\n // Sorting comparator for Alarms, so that they can be retrieved in time\n\n // order. For use by std::set, thus public.\n\n struct CompareAlarms {\n\n bool operator()(const Alarm* a, const Alarm* b) const;\n\n };\n\n\n\n Scheduler(ThreadSystem* thread_system, Timer* timer);\n\n virtual ~Scheduler();\n\n\n\n ThreadSystem::CondvarCapableMutex* mutex() LOCK_RETURNED(mutex_) {\n\n return mutex_.get();\n\n }\n\n\n\n // Optionally check that mutex is locked for debugging purposes.\n\n void DCheckLocked() EXCLUSIVE_LOCKS_REQUIRED(mutex()) {\n\n mutex_->DCheckLocked();\n\n }\n\n\n","file_path":"pagespeed/kernel/thread/scheduler.h","rank":55,"score":109015.77755732345},{"content":"class Statistics;\n","file_path":"pagespeed/kernel/base/statistics.h","rank":56,"score":109015.77755732345},{"content":"class Signature {\n\n public:\n\n // The passed in max_chars will be used to limit the length of Sign() and\n\n // SignatureSizeInChars().\n\n explicit Signature();\n\n virtual ~Signature();\n\n\n\n // Computes a web64-encoded signature of data under a given key. Takes a\n\n // StringPiece for signing key, which is used for a pointer to the key and the\n\n // length of the signing key, and a StringPiece for the data, which is used\n\n // for a pointer to the data to sign, and the length of the data.\n\n GoogleString Sign(StringPiece key, StringPiece data) const;\n\n\n\n // Returns the string length of the signatures produced by the Sign() method.\n\n virtual int SignatureSizeInChars() const = 0;\n\n\n\n protected:\n\n // Computes a binary signature of a given data under key.\n\n virtual GoogleString RawSign(StringPiece key, StringPiece data) const = 0;\n\n // The number of bytes RawSign will produce.\n","file_path":"pagespeed/kernel/base/signature.h","rank":57,"score":109015.77755732345},{"content":"class Function;\n","file_path":"pagespeed/kernel/thread/worker.h","rank":58,"score":109015.77755732345},{"content":"class Callback2 {\n\n public:\n\n Callback2() {}\n\n virtual ~Callback2() {}\n\n virtual void Run(A1, A2) = 0;\n\n};\n\n\n\n// Naming convention is:\n\n// (Member)?Callback_<num-pre-bound-args>_<num-runtime-args>\n\n\n\n// TODO(gee): Fill out other useful specializations.\n\ntemplate<class C, class A1, class A2, bool DeleteAfterRun>\n","file_path":"pagespeed/kernel/base/callback.h","rank":59,"score":109015.77755732345},{"content":"class Histogram {\n\n public:\n\n virtual ~Histogram();\n\n // Record a value in its bucket.\n\n virtual void Add(double value) = 0;\n\n // Throw away all data.\n\n virtual void Clear() = 0;\n\n // True if the histogram is empty.\n\n bool Empty() {\n\n ScopedMutex hold(lock());\n\n return CountInternal() == 0;\n\n }\n\n // Write Histogram Data to the writer.\n\n // Default implementation does not include histogram graph, but only raw\n\n // histogram data table. It looks like:\n\n // ________________________________________\n\n // | TITLE String |\n\n // | Avg: StdDev: Median: 90%: 95%: 99% |\n\n // | Raw Histogram Data: |\n\n // | [0,1] 1 25% 25% ||||| |\n","file_path":"pagespeed/kernel/base/statistics.h","rank":60,"score":109015.77755732345},{"content":"class Timer;\n","file_path":"pagespeed/kernel/base/waveform.h","rank":61,"score":109015.77755732345},{"content":"// Interface for writing bytes to an output stream.\n\nclass Writer {\n\n public:\n\n Writer() {}\n\n virtual ~Writer();\n\n\n\n virtual bool Write(const StringPiece& str, MessageHandler* handler) = 0;\n\n virtual bool Flush(MessageHandler* message_handler) = 0;\n\n\n\n // Dumps the contents of what's been written to the Writer. Many\n\n // Writer implementations will not be able to do this, and the default\n\n // implementation will return false. But StringWriter and\n\n // SharedCircularBuffer can dump their contents, and override\n\n // this with implementations that return true.\n\n virtual bool Dump(Writer* writer, MessageHandler* message_handler);\n\n\n\n private:\n\n DISALLOW_COPY_AND_ASSIGN(Writer);\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_KERNEL_BASE_WRITER_H_\n","file_path":"pagespeed/kernel/base/writer.h","rank":62,"score":109015.77755732345},{"content":"class UpDownCounter;\n","file_path":"pagespeed/kernel/base/waveform.h","rank":63,"score":109015.77755732345},{"content":"class Pool {\n\n public:\n\n // We can iterate over a pool using this iterator type.\n\n typedef typename PoolElement<T>::Position iterator;\n\n typedef typename std::list<T*>::const_iterator const_iterator;\n\n\n\n Pool() { }\n\n\n\n ~Pool() {\n\n DeleteAll();\n\n }\n\n\n\n // Is pool empty?\n\n bool empty() const {\n\n return contents_.empty();\n\n }\n\n\n\n // Size of pool\n\n size_t size() const {\n\n return contents_.size();\n","file_path":"pagespeed/kernel/base/pool.h","rank":64,"score":109015.77755732345},{"content":"class Writer;\n\n\n","file_path":"pagespeed/kernel/base/waveform.h","rank":65,"score":109015.77755732345},{"content":"class Statistics;\n","file_path":"pagespeed/system/admin_site.h","rank":66,"score":109015.77755732345},{"content":"class Statistics;\n","file_path":"pagespeed/automatic/proxy_interface.h","rank":67,"score":109015.77755732345},{"content":"// Interface for a holding and adding to a sequence of tasks.\n\n// The mechanism for executing the tasks must be defined by\n\n// implementations of this interface.\n\nclass Sequence {\n\n public:\n\n Sequence();\n\n virtual ~Sequence();\n\n\n\n // Adds 'function' to a sequence. Note that this can occur at any time\n\n // the sequence is live -- you can add functions to a sequence that has\n\n // already started processing. The caller is expected to ensure Function\n\n // will be cleaned up after Run or Cancel.\n\n //\n\n // 'function' can be called any time after Add(), and may in fact be\n\n // called before Add() returns. It's OK for the function to call Add\n\n // again.\n\n //\n\n // If the sequence is destructed after Add, but before the function has\n\n // been run, function->Cancel() will be called when the Sequence is destroyed.\n\n virtual void Add(Function* function) = 0;\n\n\n\n private:\n\n DISALLOW_COPY_AND_ASSIGN(Sequence);\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_KERNEL_THREAD_SEQUENCE_H_\n","file_path":"pagespeed/kernel/thread/sequence.h","rank":68,"score":109015.77755732345},{"content":"// CONCEPT!\n\nclass allocator\n\n{\n\npublic:\n\n\texplicit allocator(const char* name = \"DEFAULT\"):\tm_name(name) {}\n\n\t// Copy ctor generated by compiler.\n\n\t// allocator(const allocator&)\n\n\t~allocator() {}\n\n\n\n\t// Generated by compiler.\n\n\t//allocator& operator=(const allocator&)\n\n\n\n\tvoid* allocate(unsigned int bytes, int flags = 0);\n\n\t// Not supported for standard allocator for the time being.\n\n\tvoid* allocate_aligned(unsigned int bytes, unsigned int alignment, int flags = 0);\n\n\tvoid deallocate(void* ptr, unsigned int bytes);\n\n\n\n\tconst char* get_name() const;\n\n\n\nprivate:\n\n\tconst char*\tm_name;\n","file_path":"third_party/rdestl/allocator.h","rank":69,"score":109015.77755732345},{"content":"class Arena {\n\n public:\n\n // All allocations we make will be aligned to this. We will also reserve\n\n // this much room for our work area, as it keeps things simple.\n\n static const size_t kAlign = 8;\n\n\n\n Arena() {\n\n InitEmpty();\n\n }\n\n\n\n ~Arena() {\n\n CHECK(chunks_.empty());\n\n }\n\n\n\n void* Allocate(size_t size) {\n\n size += kAlign; // Need room to link the next object.\n\n size = ExpandToAlign(size);\n\n\n\n DCHECK(sizeof(void*) <= kAlign);\n\n DCHECK(size < Chunk::kSize);\n","file_path":"pagespeed/kernel/base/arena.h","rank":70,"score":109015.77755732345},{"content":"class Writer;\n\n\n\n// Read/write API for HTTP headers (shared base class)\n\ntemplate<class Proto> class Headers {\n\n public:\n\n // typedef's for manipulating the cookie multimap.\n\n typedef std::pair<StringPiece, StringPiece> ValueAndAttributes;\n\n typedef std::multimap<StringPiece, ValueAndAttributes> CookieMultimap;\n\n typedef std::multimap<StringPiece, ValueAndAttributes>::const_iterator\n\n CookieMultimapConstIter;\n\n\n\n Headers();\n\n virtual ~Headers();\n\n\n\n virtual void Clear();\n\n\n\n int major_version() const;\n\n bool has_major_version() const;\n\n int minor_version() const;\n\n void set_major_version(int major_version);\n","file_path":"pagespeed/kernel/http/headers.h","rank":71,"score":109015.77755732345},{"content":"class Writer;\n\n\n","file_path":"pagespeed/system/admin_site.h","rank":72,"score":109015.77755732345},{"content":"class Wildcard {\n\n public:\n\n static const char kMatchAny; // *\n\n static const char kMatchOne; // ?\n\n\n\n // Create a wildcard object with the specification using * and ?\n\n // as wildcards. There is currently no way to quote * or ?.\n\n explicit Wildcard(const StringPiece& wildcard_spec);\n\n\n\n // Determines whether a string matches the wildcard.\n\n bool Match(const StringPiece& str) const;\n\n\n\n // Determines whether this wildcard is just a simple name, lacking\n\n // any wildcard characters.\n\n bool IsSimple() const { return is_simple_; }\n\n\n\n // Returns the original wildcard specification.\n\n const StringPiece spec() const {\n\n return StringPiece(storage_.data(), storage_.size() - 1);\n\n }\n","file_path":"pagespeed/kernel/base/wildcard.h","rank":73,"score":109015.77755732345},{"content":"class Hasher;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":74,"score":109015.77755732345},{"content":" class Connection {\n\n public:\n\n Connection(RedisCache* redis_cache, StringPiece host, int port);\n\n\n\n void StartUp(bool connect_now = true)\n\n LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\n\n bool IsHealthy() const LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\n\n void ShutDown() LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\n\n\n\n GoogleString ToString() {\n\n return StrCat(host_, \":\", IntegerToString(port_));\n\n }\n\n\n\n AbstractMutex* GetOperationMutex() const LOCK_RETURNED(redis_mutex_) {\n\n return redis_mutex_.get();\n\n }\n\n\n\n // Must be followed by ValidateRedisReply() under the same lock.\n\n RedisReply RedisCommand(const char* format, va_list args)\n\n EXCLUSIVE_LOCKS_REQUIRED(redis_mutex_) LOCKS_EXCLUDED(state_mutex_);\n","file_path":"pagespeed/system/redis_cache.h","rank":75,"score":109015.77755732345},{"content":"// Encapsulates the creation of objects that may have different applications\n\n// across platforms.\n\nclass Platform {\n\n public:\n\n // Creates an appropriate ThreadSystem for the platform.\n\n static ThreadSystem* CreateThreadSystem();\n\n\n\n // Creates an appropriate Timer for the platform.\n\n static Timer* CreateTimer();\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_KERNEL_UTIL_PLATFORM_H_\n","file_path":"pagespeed/kernel/util/platform.h","rank":76,"score":109015.77755732345},{"content":"class Timer;\n\n\n","file_path":"pagespeed/kernel/util/platform.h","rank":77,"score":109015.77755732345},{"content":" // A callback for a scheduler alarm, with an associated wakeup time (absolute\n\n // time after which the callback will be invoked with Run() by the scheduler).\n\n // Alarm should be treated as an opaque type.\n\n class Alarm;\n\n\n","file_path":"pagespeed/kernel/thread/scheduler.h","rank":78,"score":109015.77755732345},{"content":"// Timer interface, made virtual so it can be mocked for tests.\n\nclass Timer {\n\n public:\n\n // Note: it's important that these stay compile-time constants, to\n\n // avoid weird init order surprises. (Noticed in the wild on Mac).\n\n // If you get a link error due to one of these missing, you're trying\n\n // to pass it in by a const reference. You can do something like * 1 to\n\n // sidestep the issue.\n\n static const int64 kSecondMs = 1000;\n\n static const int64 kMsUs = 1000;\n\n static const int64 kSecondUs = kMsUs * kSecondMs;\n\n static const int64 kSecondNs = 1000 * kSecondUs;\n\n static const int64 kMinuteMs = 60 * kSecondMs;\n\n static const int64 kMinuteUs = 60 * kSecondUs;\n\n static const int64 kHourMs = 60 * kMinuteMs;\n\n static const int64 kDayMs = 24 * kHourMs;\n\n static const int64 kWeekMs = 7 * kDayMs;\n\n static const int64 kMonthMs = 31 * kDayMs;\n\n static const int64 kYearMs = 365 * kDayMs;\n\n\n\n virtual ~Timer();\n","file_path":"pagespeed/kernel/base/timer.h","rank":79,"score":109015.77755732345},{"content":"class Timer;\n\n\n","file_path":"pagespeed/automatic/proxy_fetch.h","rank":80,"score":109015.77755732345},{"content":"// Variables can normally only be increased, not decreased. However, for\n\n// testing, They can also be Cleared.\n\n//\n\n// TODO(jmarantz): consider renaming this to Counter or maybe UpCounter.\n\nclass Variable {\n\n public:\n\n virtual ~Variable();\n\n\n\n virtual int64 Get() const = 0;\n\n // Return some name representing the variable, provided that the specific\n\n // implementation has some sensible way of doing so.\n\n virtual StringPiece GetName() const = 0;\n\n\n\n // Adds 'delta' to the variable's value, returning the result.\n\n int64 Add(int64 non_negative_delta) {\n\n DCHECK_LE(0, non_negative_delta);\n\n return AddHelper(non_negative_delta);\n\n }\n\n\n\n virtual void Clear() = 0;\n\n\n\n protected:\n\n // This is virtual so that subclasses can add platform-specific atomicity.\n\n virtual int64 AddHelper(int64 delta) = 0;\n\n};\n\n\n","file_path":"pagespeed/kernel/base/statistics.h","rank":81,"score":109015.77755732345},{"content":"#line 22 \"htmlparse/html_name.gperf\"\n\nstruct KeywordMap {const char* name; net_instaweb::HtmlName::Keyword keyword;};\n\n#include <string.h>\n\n\n\n#define TOTAL_KEYWORDS 137\n\n#define MIN_WORD_LENGTH 1\n\n#define MAX_WORD_LENGTH 22\n\n#define MIN_HASH_VALUE 7\n\n#define MAX_HASH_VALUE 209\n\n/* maximum key range = 203, duplicates = 0 */\n\n\n\n#ifndef GPERF_DOWNCASE\n\n#define GPERF_DOWNCASE 1\n\nstatic unsigned char gperf_downcase[256] =\n\n {\n\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,\n\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\n\n 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,\n\n 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,\n\n 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106,\n\n 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,\n","file_path":"net/instaweb/genfiles/htmlparse/html_name.cc","rank":82,"score":107873.87598034886},{"content":"// Context for handling a request, computing options and request headers in\n\n// the constructor.\n\n//\n\n// TODO(jmarantz): There are many static methods in this class. Some\n\n// of them need to stay that way as they are used as C entry points.\n\n// Some are helper methods, and we could adopt a policy of requiring\n\n// the static methods to instantiate the class (possibly making its\n\n// constructor lighter weight) and then calling them explicitly. For\n\n// the time being, we'll leave these static methods with the\n\n// non-compliant lower_case_names_with_underscores naming convention\n\n// and fix their naming when we update whether they should be static\n\n// or not.\n\nclass InstawebHandler {\n\n public:\n\n explicit InstawebHandler(request_rec* request);\n\n ~InstawebHandler();\n\n\n\n // Any PageSpeed query params are removed.\n\n const GoogleUrl& stripped_gurl() const { return stripped_gurl_; }\n\n const RequestContextPtr request_context() const { return request_context_; }\n\n bool use_custom_options() const { return custom_options_.get() != NULL; }\n\n const QueryParams& query_params() { return rewrite_query_.query_params(); }\n\n const QueryParams& pagespeed_query_params() {\n\n return rewrite_query_.pagespeed_query_params();\n\n }\n\n const QueryParams& pagespeed_option_cookies() {\n\n return rewrite_query_.pagespeed_option_cookies();\n\n }\n\n\n\n void RemoveStrippedResponseHeadersFromApacheRequest();\n\n\n\n // Makes a driver from the request_context and options. Note that\n","file_path":"pagespeed/apache/instaweb_handler.h","rank":83,"score":107446.14045519012},{"content":"// Scalar value protected by a mutex. Mutex must fully protect access\n\n// to underlying scalar. For example, in mod_pagespeed and\n\n// ngx_pagespeed, variables are stored in shared memory and accessible\n\n// from any process on a machine, so the mutex must provide protection\n\n// across separate processes.\n\n//\n\n// StatisticsLogger depends upon these mutexes being cross-process so that\n\n// several processes using the same file system don't clobber each others logs.\n\n//\n\n// TODO(jmarantz): this could be done using templates rather than using virtual\n\n// methods, as MutexedScalar does not implement an abstract interface.\n\nclass MutexedScalar {\n\n public:\n\n virtual ~MutexedScalar();\n\n\n\n // Subclasses should not define these methods, instead define the *LockHeld()\n\n // methods below.\n\n int64 Get() const;\n\n void Set(int64 value);\n\n int64 SetReturningPreviousValue(int64 value);\n\n int64 AddHelper(int64 delta);\n\n\n\n protected:\n\n friend class StatisticsLogger;\n\n\n\n virtual AbstractMutex* mutex() const = 0;\n\n\n\n // Get/Setters that may only be called if you already hold the mutex.\n\n virtual int64 GetLockHeld() const = 0;\n\n virtual int64 SetReturningPreviousValueLockHeld(int64 value) = 0;\n\n\n\n // These are implemented based on GetLockHeld() and\n\n // SetReturningPreviousLockHeld().\n\n void SetLockHeld(int64 value);\n\n int64 AddLockHeld(int64 delta);\n\n};\n\n\n","file_path":"pagespeed/kernel/base/statistics.h","rank":84,"score":107435.4760557193},{"content":"// TimedVariable is a statistic class returns the amount added in the\n\n// last interval, which could be last 10 seconds, last minute\n\n// last one hour and total.\n\nclass TimedVariable {\n\n public:\n\n // The intervals for which we keep stats.\n\n enum Levels { TENSEC, MINUTE, HOUR, START };\n\n virtual ~TimedVariable();\n\n // Update the stat value. delta is in milliseconds.\n\n virtual void IncBy(int64 delta) = 0;\n\n // Get the amount added over the last time interval\n\n // specified by \"level\".\n\n virtual int64 Get(int level) = 0;\n\n // Throw away all data.\n\n virtual void Clear() = 0;\n\n};\n\n\n","file_path":"pagespeed/kernel/base/statistics.h","rank":85,"score":107434.70569898686},{"content":" // Limited iterator (not an STL iterator). Example usage:\n\n // for (HtmlName::Iterator iter; !iter.AtEnd(); iter.Next()) {\n\n // use(iter.keyword(), iter.name());\n\n // }\n\n class Iterator {\n\n public:\n\n Iterator() : index_(-1) { Next(); }\n\n bool AtEnd() const;\n\n void Next();\n\n Keyword keyword() const;\n\n const char* name() const;\n\n\n\n private:\n\n int index_;\n\n\n\n // Implicit copy and assign ok. The members can be safely copied by bits.\n\n };\n\n\n\n static int num_keywords();\n\n static Keyword Lookup(const StringPiece& name);\n\n\n\n private:\n\n // Constructs an HTML name given a keyword, which can be\n\n // HtmlName::kNotAKeyword, and 'StringPiece* str'. 'str'\n","file_path":"pagespeed/kernel/html/html_name.h","rank":86,"score":107434.47452981994},{"content":" // Limited iterator (not an STL iterator). Example usage:\n\n // for (JsKeywords::Iterator iter; !iter.AtEnd(); iter.Next()) {\n\n // use(iter.keyword(), iter.name());\n\n // }\n\n class Iterator {\n\n public:\n\n Iterator() : index_(-1) { Next(); }\n\n bool AtEnd() const;\n\n void Next();\n\n Type keyword() const;\n\n const char* name() const;\n\n\n\n private:\n\n int index_;\n\n\n\n // Implicit copy and assign ok. The members can be safely copied by bits.\n\n };\n\n\n\n private:\n\n // TODO(jkarlin): Get rid of the net_instaweb namespace once JsLexer is\n\n // moved into kernel/js.\n\n friend class net_instaweb::JsLexer;\n\n\n\n // Returns the number of keywords recognized by the Lookup function. This is\n\n // used by the Lexer to size the keyword-sring array prior to iterating over\n\n // the keywords to populate it.\n\n static int num_keywords();\n\n};\n\n\n\n} // namespace pagespeed\n\n\n\n#endif // PAGESPEED_KERNEL_JS_JS_KEYWORDS_H_\n","file_path":"pagespeed/kernel/js/js_keywords.h","rank":87,"score":107434.47452981994},{"content":"// This class tries to heuristically detect whether something that claims to\n\n// HTML is likely to be. For now, it merely looks at whether the first\n\n// non-whitespace/non-BOM character is <.\n\n//\n\n// Typical usage:\n\n// HtmlDetector detect_html_;\n\n//\n\n// if (!detect_html_.already_decided() &&\n\n// detect_html_.ConsiderInput(data)) {\n\n// GoogleString buffered;\n\n// detect_html_.ReleaseBuffered(&buffered);\n\n// if (detect_html_.probable_html()) {\n\n// do html-specific bits with buffered\n\n// } else {\n\n// do non-html things with buffered\n\n// }\n\n// }\n\n//\n\n// if (detect_html_.already_decided()) {\n\n// do appropriate things with data based on detect_html_.probable_html()\n\n// }\n\nclass HtmlDetector {\n\n public:\n\n HtmlDetector();\n\n ~HtmlDetector();\n\n\n\n // Processes the data, trying to determine if it's HTML or not. If there is\n\n // enough evidence to make a decision, returns true.\n\n //\n\n // If true is returned, already_decided() will be true as well, and hence\n\n // probable_html() will be accessible. buffered() will not be changed.\n\n //\n\n // If false is returned, data will be accumulated inside buffered().\n\n //\n\n // Precondition: !already_decided()\n\n bool ConsiderInput(const StringPiece& data);\n\n\n\n // Returns true if we have seen enough input to make a guess as to whether\n\n // it's HTML or not.\n\n bool already_decided() const { return already_decided_; }\n\n\n","file_path":"pagespeed/automatic/html_detector.h","rank":88,"score":107433.25116815642},{"content":"// Helps manage setup of cache backends provided by the PSOL library\n\n// (LRU, File, Memcached, and shared memory metadata), as well as named lock\n\n// managers. The expectation is that the RewriteDriverFactory for the server\n\n// will invoke this class's methods in appropriate spots.\n\n//\n\n// It is also expected that the RootInit() method will be called during server\n\n// setup before the server launches any additional processes, and ChildInit()\n\n// will be called on any child process handling requests. If the server\n\n// is single-process, both methods should be called.\n\n//\n\n// Keep in mind, however, that when fork() is involved a process may\n\n// effectively see both calls, in which case the 'ChildInit' call would\n\n// come second and override the previous root status.\n\nclass SystemCaches {\n\n public:\n\n // CacheStats prefixes.\n\n static const char kMemcachedAsync[];\n\n static const char kMemcachedBlocking[];\n\n static const char kRedisAsync[];\n\n static const char kRedisBlocking[];\n\n static const char kShmCache[];\n\n\n\n static const char kDefaultSharedMemoryPath[];\n\n\n\n enum StatFlags {\n\n kDefaultStatFlags = 0,\n\n kGlobalView = 1,\n\n kIncludeMemcached = 2,\n\n kIncludeRedis = 4\n\n };\n\n\n\n // Registers all statistics the cache backends may use.\n\n static void InitStats(Statistics* statistics);\n","file_path":"pagespeed/system/system_caches.h","rank":89,"score":107433.0744372396},{"content":"// Handles forking off a controller process, restarting it if it dies, and\n\n// shutting down the process if the host reloads config or shuts down.\n\n//\n\n// We fork a babysitter process, which forks a controller process. If the\n\n// controller process dies without calling exit(0) the babysitter will fork off\n\n// another controller.\n\n//\n\n// The controller runs a thread that watches for the root process to die, or to\n\n// ask it to quit. We use pipes for communication between the master process\n\n// and the controller. If the master process goes away, the controller reading\n\n// will get EOF. If the master process wants the controller to shut down so it\n\n// can be replaced, it writes a byte.\n\n//\n\n// (All methods in the ControllerManager are static. When you call\n\n// ForkControllerProcess() it keeps running until process exit.)\n\nclass ControllerManager {\n\n public:\n\n // Called on system startup, before forking off any workers. Starts up a\n\n // babysitter process that starts a controller process and restarts the\n\n // controller if it dies. Also called (again) on configuration reloading.\n\n static void ForkControllerProcess(\n\n std::unique_ptr<ControllerProcess>&& process,\n\n SystemRewriteDriverFactory* factory, ThreadSystem* thread_system,\n\n MessageHandler* handler);\n\n\n\n // Relinquishes the reference from us to the controller process. This may be\n\n // needed if our current process is going to go on and do something unrelated.\n\n static void DetachFromControllerProcess();\n\n\n\n private:\n\n // Set us up as a proper daemon, with no stdin/out/err and not process group.\n\n static void Daemonize(MessageHandler* handler);\n\n\n\n // Actually start the ControllerProcess. Returns an exit status.\n\n static int RunController(int controller_read_fd, ControllerProcess* process,\n\n ThreadSystem* thread_system,\n\n MessageHandler* handler);\n\n\n","file_path":"pagespeed/system/controller_manager.h","rank":90,"score":107432.97416251394},{"content":"// Encapsulates the instantiation of a FileRewriter & a simple one-shot\n\n// interface to rewrite some HTML text.\n\nclass StaticRewriter {\n\n public:\n\n StaticRewriter(const ProcessContext& process_context,\n\n int* argc, char*** argv);\n\n explicit StaticRewriter(const ProcessContext& process_context);\n\n ~StaticRewriter();\n\n\n\n bool ParseText(const StringPiece& text,\n\n const StringPiece& url,\n\n const StringPiece& id,\n\n const StringPiece& output_dir,\n\n Writer* writer);\n\n\n\n FileSystem* file_system();\n\n MessageHandler* message_handler();\n\n\n\n private:\n\n RewriteGflags gflags_;\n\n FileRewriter file_rewriter_;\n\n ServerContext* server_context_;\n\n\n\n DISALLOW_COPY_AND_ASSIGN(StaticRewriter);\n\n};\n\n\n\n} // namespace net_instaweb\n\n\n\n#endif // PAGESPEED_AUTOMATIC_STATIC_REWRITER_H_\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":91,"score":107427.92577306878},{"content":"class Timer;\n\n\n","file_path":"pagespeed/kernel/base/countdown_timer.h","rank":92,"score":107427.92577306878},{"content":"class ProcessContext;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":93,"score":107427.92577306878},{"content":"class ServerContext;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":94,"score":107427.92577306878},{"content":"class Writer;\n\n\n","file_path":"pagespeed/kernel/base/message_handler.h","rank":95,"score":107427.92577306878},{"content":"class FileSystem;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":96,"score":107427.92577306878},{"content":"class Timer;\n\n\n","file_path":"pagespeed/apache/apache_message_handler.h","rank":97,"score":107427.92577306878},{"content":"class MessageHandler;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":98,"score":107427.92577306878},{"content":"class RewriteOptions;\n","file_path":"pagespeed/automatic/static_rewriter.h","rank":99,"score":107427.92577306878}],"string":"[\n {\n \"content\": \"// Bool that is auto-initialized to false\\n\\nclass Bool {\\n\\n public:\\n\\n Bool() : value_(false) {}\\n\\n Bool(bool value) : value_(value) {} // Copy constructor // NOLINT\\n\\n const bool Test() const { return value_; }\\n\\n\\n\\n private:\\n\\n bool value_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/html/html_parse_test.cc\",\n \"rank\": 0,\n \"score\": 215474.80556840266\n },\n {\n \"content\": \"class IntVector : public std::vector<int> {\\n\\n public:\\n\\n void Merge(const IntVector& src) {\\n\\n for (int i = 0, n = src.size(); i < n; ++i) {\\n\\n push_back(src[i]);\\n\\n }\\n\\n }\\n\\n\\n\\n // Copy and assign OK.\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/util/copy_on_write_test.cc\",\n \"rank\": 1,\n \"score\": 190563.19677330507\n },\n {\n \"content\": \"class MemberFunction2 : public MemberFunctionBase<C> {\\n\\n public:\\n\\n typedef void (C::*Func)(T1, T2);\\n\\n\\n\\n // Constructor supplying a Run method, but no Cancel method.\\n\\n MemberFunction2(Func f, C* c, T1 v1, T2 v2)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2) {}\\n\\n\\n\\n // Constructor supplying a Run method and a Cancel method.\\n\\n MemberFunction2(Func f, Func cancel,\\n\\n C* c, T1 v1, T2 v2)\\n\\n : MemberFunctionBase<C>(c),\\n\\n run_(f), cancel_(cancel),\\n\\n v1_(v1), v2_(v2) {}\\n\\n\\n\\n protected:\\n\\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_); }\\n\\n virtual void Cancel() {\\n\\n if (cancel_ != NULL) {\\n\\n CALL_MEMBER_FN(object_, cancel_)(v1_, v2_);\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 2,\n \"score\": 184722.84189115115\n },\n {\n \"content\": \"class MemberFunction0 : public MemberFunctionBase<C> {\\n\\n public:\\n\\n typedef void (C::*Func)();\\n\\n\\n\\n // Constructor supplying a Run method, but no Cancel method.\\n\\n MemberFunction0(Func f, C* c) : MemberFunctionBase<C>(c), run_(f),\\n\\n cancel_(NULL) {\\n\\n }\\n\\n\\n\\n // Constructor supplying a Run method and a Cancel method.\\n\\n MemberFunction0(Func f, Func cancel, C* c)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(cancel) {}\\n\\n\\n\\n protected:\\n\\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(); }\\n\\n virtual void Cancel() {\\n\\n if (cancel_ != NULL) {\\n\\n CALL_MEMBER_FN(object_, cancel_)();\\n\\n }\\n\\n }\\n\\n\\n\\n private:\\n\\n Func run_;\\n\\n Func cancel_;\\n\\n};\\n\\n\\n\\n// Captures a delayed call to a 1-arg member function as a closure.\\n\\ntemplate<class C, typename T1>\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 3,\n \"score\": 184722.84189115115\n },\n {\n \"content\": \"class MemberFunction1 : public MemberFunctionBase<C> {\\n\\n public:\\n\\n typedef void (C::*Func)(T1);\\n\\n\\n\\n // Constructor supplying a Run method, but no Cancel method.\\n\\n MemberFunction1(Func f, C* c, T1 v1)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1) {}\\n\\n\\n\\n // Constructor supplying a Run method and a Cancel method.\\n\\n MemberFunction1(Func f, Func cancel,\\n\\n C* c, T1 v1)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(cancel), v1_(v1) {}\\n\\n\\n\\n protected:\\n\\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_); }\\n\\n virtual void Cancel() {\\n\\n if (cancel_ != NULL) {\\n\\n CALL_MEMBER_FN(object_, cancel_)(v1_);\\n\\n }\\n\\n }\\n\\n\\n\\n private:\\n\\n Func run_;\\n\\n Func cancel_;\\n\\n T1 v1_;\\n\\n};\\n\\n\\n\\n// Captures a delayed call to a 2-arg member function as a closure.\\n\\ntemplate<class C, typename T1, typename T2>\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 4,\n \"score\": 184722.84189115115\n },\n {\n \"content\": \"class MemberFunction4 : public MemberFunctionBase<C> {\\n\\n public:\\n\\n typedef void (C::*Func)(T1, T2, T3, T4);\\n\\n\\n\\n // Constructor supplying a Run method, but no Cancel method.\\n\\n MemberFunction4(Func f, C* c, T1 v1, T2 v2, T3 v3, T4 v4)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2),\\n\\n v3_(v3), v4_(v4) {\\n\\n }\\n\\n\\n\\n // Constructor supplying a Run method and a Cancel method.\\n\\n MemberFunction4(Func f, Func cancel,\\n\\n C* c, T1 v1, T2 v2, T3 v3, T4 v4)\\n\\n : MemberFunctionBase<C>(c),\\n\\n run_(f), cancel_(cancel),\\n\\n v1_(v1), v2_(v2), v3_(v3), v4_(v4) {}\\n\\n\\n\\n protected:\\n\\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_, v3_, v4_); }\\n\\n virtual void Cancel() {\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 5,\n \"score\": 184722.84189115115\n },\n {\n \"content\": \"class MemberFunction3 : public MemberFunctionBase<C> {\\n\\n public:\\n\\n typedef void (C::*Func)(T1, T2, T3);\\n\\n\\n\\n // Constructor supplying a Run method, but no Cancel method.\\n\\n MemberFunction3(Func f, C* c, T1 v1, T2 v2, T3 v3)\\n\\n : MemberFunctionBase<C>(c), run_(f), cancel_(NULL), v1_(v1), v2_(v2),\\n\\n v3_(v3) {\\n\\n }\\n\\n\\n\\n // Constructor supplying a Run method and a Cancel method.\\n\\n MemberFunction3(Func f, Func cancel,\\n\\n C* c, T1 v1, T2 v2, T3 v3)\\n\\n : MemberFunctionBase<C>(c),\\n\\n run_(f), cancel_(cancel),\\n\\n v1_(v1), v2_(v2), v3_(v3) {}\\n\\n\\n\\n protected:\\n\\n virtual void Run() { CALL_MEMBER_FN(object_, run_)(v1_, v2_, v3_); }\\n\\n virtual void Cancel() {\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 6,\n \"score\": 184722.84189115115\n },\n {\n \"content\": \"// A boolean flag that can be set atomically and be visible to other\\n\\n// threads. Please be extra careful with this --- it can go wrong in\\n\\n// incomprehensible ways; most of the time, you probably want to use a mutex\\n\\n// instead.\\n\\nclass AtomicBool {\\n\\n public:\\n\\n // Guaranteed to be initialized to false.\\n\\n AtomicBool() {\\n\\n set_value(false);\\n\\n }\\n\\n\\n\\n ~AtomicBool() {}\\n\\n\\n\\n bool value() const {\\n\\n return base::subtle::Acquire_Load(&value_);\\n\\n }\\n\\n\\n\\n void set_value(bool v) {\\n\\n base::subtle::Release_Store(&value_, v);\\n\\n }\\n\\n\\n\\n private:\\n\\n base::subtle::AtomicWord value_;\\n\\n DISALLOW_COPY_AND_ASSIGN(AtomicBool);\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_BASE_ATOMIC_BOOL_H_\\n\",\n \"file_path\": \"pagespeed/kernel/base/atomic_bool.h\",\n \"rank\": 7,\n \"score\": 181459.79622440366\n },\n {\n \"content\": \"// Three-way return type for distinguishing Errors from boolean answer.\\n\\n//\\n\\n// This is physically just an enum, but is wrapped in a class to prevent\\n\\n// accidental usage in an if- or ternary-condition without explicitly indicating\\n\\n// whether you are looking for true, false, or error.\\n\\nclass BoolOrError {\\n\\n enum Choice {\\n\\n kIsFalse,\\n\\n kIsTrue,\\n\\n kIsError\\n\\n };\\n\\n\\n\\n public:\\n\\n BoolOrError() : choice_(kIsError) { }\\n\\n explicit BoolOrError(bool t_or_f) : choice_(t_or_f ? kIsTrue : kIsFalse) { }\\n\\n\\n\\n // Intended to be passed by value; explicitly support copy & assign\\n\\n BoolOrError(const BoolOrError& src) : choice_(src.choice_) { }\\n\\n BoolOrError& operator=(const BoolOrError& src) {\\n\\n if (&src != this) {\\n\\n choice_ = src.choice_;\\n\\n }\\n\\n return *this;\\n\\n }\\n\\n\\n\\n bool is_false() const { return choice_ == kIsFalse; }\\n\\n bool is_true() const { return choice_ == kIsTrue; }\\n\\n bool is_error() const { return choice_ == kIsError; }\\n\\n void set_error() { choice_ = kIsError; }\\n\\n void set(bool t_or_f) { choice_ = t_or_f ? kIsTrue : kIsFalse; }\\n\\n\\n\\n private:\\n\\n Choice choice_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/file_system.h\",\n \"rank\": 8,\n \"score\": 167059.56092995856\n },\n {\n \"content\": \"class MessageHandler;\\n\",\n \"file_path\": \"net/instaweb/http/public/external_url_fetcher.h\",\n \"rank\": 9,\n \"score\": 161381.44374063134\n },\n {\n \"content\": \"class RequestHeaders;\\n\\n\\n\\n// Runs an external command ('wget' by default, or 'curl') via popen\\n\\n// for blocking URL fetches.\\n\\n\\n\",\n \"file_path\": \"net/instaweb/http/public/external_url_fetcher.h\",\n \"rank\": 10,\n \"score\": 161381.44374063134\n },\n {\n \"content\": \"class AsyncFetch;\\n\",\n \"file_path\": \"net/instaweb/http/public/external_url_fetcher.h\",\n \"rank\": 11,\n \"score\": 161381.44374063134\n },\n {\n \"content\": \"// TODO(vchudnov): Incorporate NetcatUrlFetcher functionality into\\n\\n// this class.\\n\\nclass ExternalUrlFetcher : public UrlAsyncFetcher {\\n\\n public:\\n\\n ExternalUrlFetcher() {}\\n\\n virtual ~ExternalUrlFetcher() {}\\n\\n\\n\\n // TODO(sligocki): Allow protocol version number (e.g. HTTP/1.1)\\n\\n // and request type (e.g. GET, POST, etc.) to be specified.\\n\\n virtual void Fetch(const GoogleString& url,\\n\\n MessageHandler* message_handler,\\n\\n AsyncFetch* fetch);\\n\\n\\n\\n // Default user agent to use.\\n\\n static const char kDefaultUserAgent[];\\n\\n\\n\\n // Sets the path to \\\"binary\\\" when fetching using \\\"how\\\".\\n\\n void set_binary(const GoogleString& binary);\\n\\n\\n\\n\\n\\n protected:\\n\\n // Appends to escaped_headers one header line for each Name, Value\\n\",\n \"file_path\": \"net/instaweb/http/public/external_url_fetcher.h\",\n \"rank\": 12,\n \"score\": 157641.08858691936\n },\n {\n \"content\": \"// Pool element containing an int, for test purposes.\\n\\nclass IntElement : public PoolElement<IntElement> {\\n\\n public:\\n\\n IntElement() { }\\n\\n\\n\\n const int num() const { return num_; }\\n\\n void set_num(int num) { num_ = num; }\\n\\n\\n\\n private:\\n\\n int num_;\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(IntElement);\\n\\n};\\n\\n\\n\\ntypedef Pool<IntElement> IntPool;\\n\\ntypedef PoolElement<IntElement>::Position PoolPosition;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/pool_test.cc\",\n \"rank\": 13,\n \"score\": 156725.46802342575\n },\n {\n \"content\": \" class const_iterator;\\n\\n\\n\\n typedef char32 value_type;\\n\\n\\n\\n // Constructors. These always produce owners.\\n\\n UnicodeText(); // Create an empty text.\\n\\n UnicodeText(const UnicodeText& src); // copy constructor\\n\\n // Construct a substring (copies the data).\\n\\n UnicodeText(const const_iterator& first, const const_iterator& last);\\n\\n\\n\\n // Assignment operator. This copies the data and produces an owner\\n\\n // unless this == &src, e.g., \\\"x = x;\\\", which is a no-op.\\n\\n UnicodeText& operator=(const UnicodeText& src);\\n\\n\\n\\n // x.Copy(y) copies the data from y into x.\\n\\n UnicodeText& Copy(const UnicodeText& src);\\n\\n inline UnicodeText& assign(const UnicodeText& src) { return Copy(src); }\\n\\n\\n\\n // x.PointTo(y) changes x so that it points to y's data.\\n\\n // It does not copy y or take ownership of y's data.\\n\",\n \"file_path\": \"third_party/css_parser/src/util/utf8/public/unicodetext.h\",\n \"rank\": 14,\n \"score\": 156237.4690349783\n },\n {\n \"content\": \" class const_iterator {\\n\\n typedef const_iterator CI;\\n\\n public:\\n\\n typedef std::bidirectional_iterator_tag iterator_category;\\n\\n typedef char32 value_type;\\n\\n typedef ptrdiff_t difference_type;\\n\\n typedef void pointer; // (Not needed.)\\n\\n typedef const char32 reference; // (Needed for const_reverse_iterator)\\n\\n\\n\\n // Iterators are default-constructible.\\n\\n const_iterator();\\n\\n\\n\\n char32 operator*() const; // Dereference\\n\\n\\n\\n const_iterator& operator++(); // Advance (++iter)\\n\\n const_iterator operator++(int) { // (iter++)\\n\\n const_iterator result(*this);\\n\\n ++*this;\\n\\n return result;\\n\\n }\\n\",\n \"file_path\": \"third_party/css_parser/src/util/utf8/public/unicodetext.h\",\n \"rank\": 15,\n \"score\": 156237.4690349783\n },\n {\n \"content\": \"class ExternalServerSpecTestInvalid : public ::testing::Test {\\n\\n protected:\\n\\n void TestInvalidSpec(const GoogleString &value) {\\n\\n GoogleString msg;\\n\\n ExternalServerSpec spec(\\\"old.com\\\", 4321);\\n\\n EXPECT_FALSE(spec.SetFromString(value, kDefaultPortForTesting, &msg));\\n\\n EXPECT_NE(\\\"\\\", msg);\\n\\n EXPECT_EQ(\\\"old.com\\\", spec.host);\\n\\n EXPECT_EQ(4321, spec.port);\\n\\n }\\n\\n};\\n\\n\\n\\nTEST_F(ExternalServerSpecTestInvalid, NonNumericPort) {\\n\\n TestInvalidSpec(\\\"host:1port\\\");\\n\\n}\\n\\n\\n\\nTEST_F(ExternalServerSpecTestInvalid, InvalidPortNumber1) {\\n\\n TestInvalidSpec(\\\"host:0\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pagespeed/system/external_server_spec_test.cc\",\n \"rank\": 16,\n \"score\": 152688.19921436472\n },\n {\n \"content\": \" // Read-only iterator type; cannot be used for deletion or to modify\\n\\n // the contained items.\\n\\n class ConstIterator : public IterBase {\\n\\n public:\\n\\n ConstIterator& operator++() {\\n\\n this->Advance();\\n\\n return *this;\\n\\n }\\n\\n\\n\\n const T* Get() { return this->Data(); }\\n\\n const T* operator->() { return this->Data(); }\\n\\n const T& operator*() { return *this->Data(); }\\n\\n bool operator==(const ConstIterator& other) const {\\n\\n return this->Equals(other);\\n\\n }\\n\\n bool operator!=(const ConstIterator& other) const {\\n\\n return !this->Equals(other);\\n\\n }\\n\\n // default copy op, dtor are OK.\\n\\n\\n\\n private:\\n\\n friend class InlineSList<T>;\\n\",\n \"file_path\": \"pagespeed/kernel/base/inline_slist.h\",\n \"rank\": 17,\n \"score\": 150987.95657517356\n },\n {\n \"content\": \" class HistC = CountHistogram, // Histogram\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics_template.h\",\n \"rank\": 18,\n \"score\": 150980.39909271104\n },\n {\n \"content\": \"class IntElement : public InlineSListElement<IntElement> {\\n\\n public:\\n\\n explicit IntElement(int n) : num_(n) { }\\n\\n\\n\\n const int num() const { return num_; }\\n\\n void set_num(int num) { num_ = num; }\\n\\n\\n\\n private:\\n\\n int num_;\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(IntElement);\\n\\n};\\n\\n\\n\\ntypedef InlineSList<IntElement> IntList;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/inline_slist_test.cc\",\n \"rank\": 19,\n \"score\": 150795.9760467823\n },\n {\n \"content\": \" class const_reverse_iterator : public std::reverse_iterator<const_iterator> {\\n\\n public:\\n\\n explicit const_reverse_iterator(const_iterator it) :\\n\\n std::reverse_iterator<const_iterator>(it) {}\\n\\n const char* utf8_data() const {\\n\\n const_iterator tmp_it = base();\\n\\n return (--tmp_it).utf8_data();\\n\\n }\\n\\n int get_utf8(char* buf) const {\\n\\n const_iterator tmp_it = base();\\n\\n return (--tmp_it).get_utf8(buf);\\n\\n }\\n\\n string get_utf8_string() const {\\n\\n const_iterator tmp_it = base();\\n\\n return (--tmp_it).get_utf8_string();\\n\\n }\\n\\n int utf8_length() const {\\n\\n const_iterator tmp_it = base();\\n\\n return (--tmp_it).utf8_length();\\n\\n }\\n\",\n \"file_path\": \"third_party/css_parser/src/util/utf8/public/unicodetext.h\",\n \"rank\": 20,\n \"score\": 144629.03804211903\n },\n {\n \"content\": \"// Creates an AsyncFetch object using an existing Writer* object,\\n\\n// which is used to delegate Write and Flush operations. This\\n\\n// class is still abstract, and requires inheritors to implement Done().\\n\\nclass AsyncFetchUsingWriter : public AsyncFetch {\\n\\n public:\\n\\n AsyncFetchUsingWriter(const RequestContextPtr& request_context,\\n\\n Writer* writer)\\n\\n : AsyncFetch(request_context),\\n\\n writer_(writer) {}\\n\\n virtual ~AsyncFetchUsingWriter();\\n\\n\\n\\n protected:\\n\\n virtual bool HandleWrite(const StringPiece& sp, MessageHandler* handler);\\n\\n virtual bool HandleFlush(MessageHandler* handler);\\n\\n\\n\\n private:\\n\\n Writer* writer_;\\n\\n DISALLOW_COPY_AND_ASSIGN(AsyncFetchUsingWriter);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"net/instaweb/http/public/async_fetch.h\",\n \"rank\": 21,\n \"score\": 143758.39228944064\n },\n {\n \"content\": \" class HTTPValueFetch : public AsyncFetchUsingWriter {\\n\\n public:\\n\\n HTTPValueFetch(const RequestContextPtr& request_context, HTTPValue* value)\\n\\n : AsyncFetchUsingWriter(request_context, value) {}\\n\\n virtual void HandleDone(bool /*ok*/) {}\\n\\n virtual void HandleHeadersComplete() {}\\n\\n };\\n\\n\\n\\n bool IsIproContentType(ResponseHeaders* response_headers);\\n\\n\\n\\n void DroppedDueToSize();\\n\\n void DroppedAsUncacheable();\\n\\n\\n\\n const GoogleString url_;\\n\\n const GoogleString fragment_;\\n\\n const RequestHeaders::Properties request_properties_;\\n\\n const HttpOptions http_options_;\\n\\n\\n\\n int64 max_response_bytes_;\\n\\n const int max_concurrent_recordings_;\\n\",\n \"file_path\": \"pagespeed/system/in_place_resource_recorder.h\",\n \"rank\": 22,\n \"score\": 143743.99753642658\n },\n {\n \"content\": \" class TVarC = FakeTimedVariable> // TimeDVariable\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics_template.h\",\n \"rank\": 23,\n \"score\": 141535.16432343514\n },\n {\n \"content\": \"class WgetUrlFetcher : public ExternalUrlFetcher {\\n\\n public:\\n\\n WgetUrlFetcher();\\n\\n virtual ~WgetUrlFetcher() {}\\n\\n\\n\\n private:\\n\\n virtual GoogleString ConstructFetchCommand(\\n\\n const GoogleString& escaped_url,\\n\\n const char* user_agent,\\n\\n const StringVector& escaped_headers);\\n\\n virtual const char* GetFetchLabel();\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(WgetUrlFetcher);\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // NET_INSTAWEB_HTTP_PUBLIC_WGET_URL_FETCHER_H_\\n\",\n \"file_path\": \"net/instaweb/http/public/wget_url_fetcher.h\",\n \"rank\": 24,\n \"score\": 141525.14600070452\n },\n {\n \"content\": \" class ExternalServersOption : public OptionTemplateBase<Spec> {\\n\\n public:\\n\\n bool SetFromString(StringPiece value_string,\\n\\n GoogleString* error_detail) override {\\n\\n return this->mutable_value().SetFromString(value_string, default_port,\\n\\n error_detail);\\n\\n }\\n\\n GoogleString ToString() const override {\\n\\n return this->value().ToString();\\n\\n }\\n\\n GoogleString Signature(const Hasher* hasher) const override {\\n\\n return hasher->Hash(ToString());\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"pagespeed/system/system_rewrite_options.h\",\n \"rank\": 25,\n \"score\": 140762.09030382178\n },\n {\n \"content\": \"class IntegerToStringToIntTest : public testing::Test {\\n\\n protected:\\n\\n void ValidateIntegerToString(int i, GoogleString s) {\\n\\n EXPECT_EQ(s, IntegerToString(i));\\n\\n ValidateInteger64ToString(static_cast<int64>(i), s);\\n\\n }\\n\\n\\n\\n void ValidateStringToInt(GoogleString s, int i) {\\n\\n int i2;\\n\\n EXPECT_TRUE(StringToInt(s, &i2));\\n\\n EXPECT_EQ(i, i2);\\n\\n ValidateStringToInt64(s, static_cast<int64>(i));\\n\\n }\\n\\n\\n\\n void InvalidStringToInt(GoogleString s, int expected) {\\n\\n int i = -50;\\n\\n EXPECT_FALSE(StringToInt(s, &i));\\n\\n EXPECT_EQ(expected, i);\\n\\n InvalidStringToInt64(s);\\n\\n }\\n\",\n \"file_path\": \"pagespeed/kernel/base/string_util_test.cc\",\n \"rank\": 26,\n \"score\": 138562.922375203\n },\n {\n \"content\": \"// This class is not template for several reasons:\\n\\n// 1. There is currently no need in having different types depending on what\\n\\n// external cache are we testing.\\n\\n// 2. Templates add complexity and boilerplate when defining functions outside\\n\\n// of the class.\\n\\n// 3. When you have a class derived from template class, you cannot access\\n\\n// member functions and fields without explicitly writing `this->` or\\n\\n// something similar. It's explained in Google Test documentation and here:\\n\\n// http://stackoverflow.com/questions/1120833/derived-template-class-access-to-base-class-member-data\\n\\nclass SystemCachesExternalCacheTestBase : public SystemCachesTest {\\n\\n protected:\\n\\n virtual bool SkipExternalCacheTests() = 0;\\n\\n\\n\\n virtual GoogleString AssembledAsyncCacheWithStats() = 0;\\n\\n\\n\\n virtual GoogleString AssembledBlockingCacheWithStats() = 0;\\n\\n\\n\\n virtual void SetUpExternalCache(SystemRewriteOptions* options) = 0;\\n\\n\\n\\n // Test helpers\\n\\n void TestBasicCacheAndLru();\\n\\n\\n\\n void TestBasicCacheLruShm();\\n\\n\\n\\n void TestBasicCacheShmNoLru();\\n\\n\\n\\n void StressTestHelper(bool do_deletes) {\\n\\n if (SkipExternalCacheTests()) {\\n\\n return;\\n\",\n \"file_path\": \"pagespeed/system/system_caches_test.cc\",\n \"rank\": 27,\n \"score\": 137385.4316443914\n },\n {\n \"content\": \"class DequeUsingStdVector : public std::vector<T> {\\n\\n public:\\n\\n void push_front(const T& value) { this->insert(this->begin(), value); }\\n\\n void pop_front() { this->erase(this->begin()); }\\n\\n};\\n\\n\\n\\ntemplate<class Deque> static void FourElementWorkout(int iters,\\n\\n int num_elements) {\\n\\n for (int iter = 0; iter < iters; ++iter) {\\n\\n Deque deque;\\n\\n\\n\\n // Simple usage as pure stack or queue, but not at the same time.\\n\\n for (int i = 0; i < num_elements; ++i) { deque.push_back(i); }\\n\\n for (int i = 0; i < num_elements; ++i) {\\n\\n CHECK_EQ(i, deque.front());\\n\\n deque.pop_front();\\n\\n }\\n\\n for (int i = 0; i < num_elements; ++i) { deque.push_front(i); }\\n\\n for (int i = num_elements - 1; i >= 0; --i) {\\n\\n CHECK_EQ(i, deque.front());\\n\",\n \"file_path\": \"pagespeed/kernel/util/deque_speed_test.cc\",\n \"rank\": 28,\n \"score\": 133900.35030399702\n },\n {\n \"content\": \"class SystemCachesRedisCacheTest : public SystemCachesExternalCacheTestBase {\\n\\n protected:\\n\\n // TODO(yeputons): share this code with SystemCachesMemCacheTest or move it to\\n\\n // the base class.\\n\\n bool SkipExternalCacheTests() override {\\n\\n return ServerSpec().empty();\\n\\n }\\n\\n\\n\\n // TODO(yeputons): share this code with SystemCachesMemCacheTest or move it to\\n\\n // the base class.\\n\\n ExternalServerSpec ServerSpec() {\\n\\n if (server_spec_.empty()) {\\n\\n // This matches the logic in apr_mem_cache_test.\\n\\n const char* port_string = getenv(\\\"REDIS_PORT\\\");\\n\\n int port;\\n\\n if (port_string == NULL || !StringToInt(port_string, &port)) {\\n\\n LOG(ERROR) << \\\"SystemCachesRedisCacheTest is skipped because env var \\\"\\n\\n << \\\"$REDIS_PORT is not set to a valid integer. Set that to \\\"\\n\\n << \\\"the port number where redis is running to enable the \\\"\\n\\n << \\\"tests. See install/run_program_with_redis.sh\\\";\\n\",\n \"file_path\": \"pagespeed/system/system_caches_test.cc\",\n \"rank\": 29,\n \"score\": 133537.00130616734\n },\n {\n \"content\": \"class SystemCachesMemCacheTest : public SystemCachesExternalCacheTestBase {\\n\\n protected:\\n\\n bool SkipExternalCacheTests() override {\\n\\n return ServerSpec().empty();\\n\\n }\\n\\n\\n\\n ExternalClusterSpec ServerSpec() {\\n\\n if (cluster_spec_.empty()) {\\n\\n // This matches the logic in apr_mem_cache_test.\\n\\n const char* port_string = getenv(\\\"MEMCACHED_PORT\\\");\\n\\n int port;\\n\\n if (port_string == nullptr || !StringToInt(port_string, &port)) {\\n\\n LOG(ERROR) << \\\"SystemCachesMemCacheTest is skipped because env var \\\"\\n\\n << \\\"$MEMCACHED_PORT is not set to a valid integer. Set that \\\"\\n\\n << \\\"to the port number where memcached is running to enable \\\"\\n\\n << \\\"the tests. See install/run_program_with_memcached.sh\\\";\\n\\n return cluster_spec_;\\n\\n }\\n\\n cluster_spec_.servers.push_back(ExternalServerSpec(\\\"localhost\\\", port));\\n\\n }\\n\",\n \"file_path\": \"pagespeed/system/system_caches_test.cc\",\n \"rank\": 30,\n \"score\": 133537.00130616734\n },\n {\n \"content\": \" // Functions added to a Sequence will be run sequentially, though not\\n\\n // necessarily always from the same worker thread. The scheduler will\\n\\n // continue to schedule new work added to the sequence until\\n\\n // FreeSequence is called.\\n\\n //\\n\\n // TODO(jmarantz): Make this subclass private (or just move it to the .cc\\n\\n // file) and change NewSequence to return a net_instaweb::Sequence*.\\n\\n class Sequence : public net_instaweb::Sequence {\\n\\n public:\\n\",\n \"file_path\": \"pagespeed/kernel/thread/queued_worker_pool.h\",\n \"rank\": 31,\n \"score\": 128989.95549028544\n },\n {\n \"content\": \"class TestMessageHandler : public net_instaweb::MessageHandler {\\n\\n public:\\n\\n const StringVector& messages() { return messages_; }\\n\\n\\n\\n protected:\\n\\n virtual void MessageVImpl(MessageType type, const char* msg, va_list args);\\n\\n virtual void MessageSImpl(MessageType type, const GoogleString& message);\\n\\n\\n\\n virtual void FileMessageVImpl(MessageType type, const char* filename,\\n\\n int line, const char* msg, va_list args);\\n\\n virtual void FileMessageSImpl(MessageType type, const char* filename,\\n\\n int line, const GoogleString& message);\\n\\n\\n\\n private:\\n\\n StringVector messages_;\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_BASE_MESSAGE_HANDLER_TEST_BASE_H_\\n\",\n \"file_path\": \"pagespeed/kernel/base/message_handler_test_base.h\",\n \"rank\": 32,\n \"score\": 124500.57099137842\n },\n {\n \"content\": \"// Implements a sequence which is run directly from RunTasksUntil,\\n\\n// rather than running in a background thread.\\n\\nclass Scheduler::Sequence : public net_instaweb::Sequence {\\n\\n public:\\n\\n // The scheduler is used for doing timed-waits so that any pending\\n\\n // scheduler alarms fire before the wait-period ends.\\n\\n explicit Sequence(Scheduler* scheduler);\\n\\n virtual ~Sequence();\\n\\n\\n\\n void Add(Function* function) override LOCKS_EXCLUDED(scheduler_->mutex());\\n\\n\\n\\n // Runs functions for this sequence directly, until *done is true or\\n\\n // the timeout expires. Returns 'false' if the timeout expired prior\\n\\n // to 'done' getting set to true. 'done' must be protected\\n\\n // by scheduler_->mutex(), and is expected to be set by one of the sequence\\n\\n // tasks.\\n\\n bool RunTasksUntil(int64 timeout_ms, bool* done)\\n\\n EXCLUSIVE_LOCKS_REQUIRED(scheduler_->mutex());\\n\\n\\n\\n // Atomically forwards all activity to an alternative Sequence.\\n\\n // Any pending functions in the work_queue_ are transferred into\\n\\n // the sequence, and new functions passed to Add are added to\\n\",\n \"file_path\": \"pagespeed/kernel/thread/scheduler_sequence.h\",\n \"rank\": 33,\n \"score\": 123599.32645941089\n },\n {\n \"content\": \" class TimedVar> class StatisticsTemplate\\n\\n : public Statistics {\\n\\n public:\\n\\n StatisticsTemplate() {}\\n\\n virtual ~StatisticsTemplate() {\\n\\n STLDeleteContainerPointers(variables_.begin(), variables_.end());\\n\\n STLDeleteContainerPointers(up_downs_.begin(), up_downs_.end());\\n\\n STLDeleteContainerPointers(histograms_.begin(), histograms_.end());\\n\\n STLDeleteContainerPointers(timed_vars_.begin(), timed_vars_.end());\\n\\n }\\n\\n\\n\\n // Implementations of Statistics API --- see base class docs for\\n\\n // description.\\n\\n virtual Var* AddVariable(const StringPiece& name) {\\n\\n Var* var = FindVariable(name);\\n\\n if (var == NULL) {\\n\\n var = NewVariable(name);\\n\\n variables_.push_back(var);\\n\\n variable_names_.push_back(name.as_string());\\n\\n variable_map_[name.as_string()] = var;\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics_template.h\",\n \"rank\": 34,\n \"score\": 121491.54189442613\n },\n {\n \"content\": \"class TestClass {\\n\\n public:\\n\\n TestClass()\\n\\n : x_(0),\\n\\n runs_(0) {\\n\\n }\\n\\n\\n\\n void Method1(int x) {\\n\\n x_ = x;\\n\\n ++runs_;\\n\\n }\\n\\n\\n\\n void Method1ConstRefArg(const int& x) {\\n\\n x_ = 2 * x;\\n\\n ++runs_;\\n\\n }\\n\\n\\n\\n void Method2(int a, int b) {\\n\\n x_ = a + b;\\n\\n ++runs_;\\n\",\n \"file_path\": \"pagespeed/kernel/base/callback_test.cc\",\n \"rank\": 35,\n \"score\": 118997.96761353404\n },\n {\n \"content\": \"class EmptyCallback : public net_instaweb::CacheInterface::Callback {\\n\\n public:\\n\\n EmptyCallback() {}\\n\\n virtual ~EmptyCallback() {}\\n\\n virtual void Done(net_instaweb::CacheInterface::KeyState state) {}\\n\\n\\n\\n private:\\n\\n DISALLOW_COPY_AND_ASSIGN(EmptyCallback);\\n\\n};\\n\\n\\n\\nvoid TestCachePayload(int payload_size, int chunk_size, int iters) {\\n\\n GoogleString value;\\n\\n net_instaweb::SimpleRandom random(new net_instaweb::NullMutex);\\n\\n GoogleString chunk = random.GenerateHighEntropyString(chunk_size);\\n\\n while (static_cast<int>(value.size()) < payload_size) {\\n\\n value += chunk;\\n\\n }\\n\\n net_instaweb::scoped_ptr<net_instaweb::ThreadSystem> thread_system(\\n\\n net_instaweb::Platform::CreateThreadSystem());\\n\\n net_instaweb::SimpleStats stats(thread_system.get());\\n\",\n \"file_path\": \"pagespeed/kernel/cache/compressed_cache_speed_test.cc\",\n \"rank\": 36,\n \"score\": 118100.08789390538\n },\n {\n \"content\": \"class EmptyCallback : public net_instaweb::CacheInterface::Callback {\\n\\n public:\\n\\n EmptyCallback() {}\\n\\n virtual ~EmptyCallback() {}\\n\\n virtual void Done(net_instaweb::CacheInterface::KeyState state) {}\\n\\n\\n\\n private:\\n\\n DISALLOW_COPY_AND_ASSIGN(EmptyCallback);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/cache/lru_cache_speed_test.cc\",\n \"rank\": 37,\n \"score\": 118100.08789390538\n },\n {\n \"content\": \"class SimpleClass {\\n\\n public:\\n\\n SimpleClass() : index_(counter++) {}\\n\\n int index() const { return index_; }\\n\\n\\n\\n private:\\n\\n int index_;\\n\\n DISALLOW_COPY_AND_ASSIGN(SimpleClass);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/ref_counted_ptr_test.cc\",\n \"rank\": 38,\n \"score\": 116878.50327090279\n },\n {\n \"content\": \"namespace net_instaweb {\\n\\n\\n\\nstruct ExternalServerSpec {\\n\\n ExternalServerSpec() : host(), port(0) {}\\n\\n ExternalServerSpec(GoogleString host_, int port_)\\n\\n : host(host_), port(port_) {}\\n\\n bool SetFromString(StringPiece value_string, int default_port,\\n\\n GoogleString* error_detail);\\n\\n\\n\\n bool empty() const { return host.empty() && port == 0; }\\n\\n GoogleString ToString() const {\\n\\n // Should be 1:1 representation of value held, used to generate signature.\\n\\n return empty() ? \\\"\\\" : StrCat(host, \\\":\\\", IntegerToString(port));\\n\\n }\\n\\n\\n\\n GoogleString host;\\n\\n int port;\\n\",\n \"file_path\": \"pagespeed/system/external_server_spec.h\",\n \"rank\": 39,\n \"score\": 112778.93965911199\n },\n {\n \"content\": \"class BaseClass : public RefCounted<BaseClass> {\\n\\n public:\\n\\n BaseClass() {}\\n\\n int index() const { return simple_.index(); }\\n\\n\\n\\n protected:\\n\\n virtual ~BaseClass() {}\\n\\n REFCOUNT_FRIEND_DECLARATION(BaseClass);\\n\\n\\n\\n private:\\n\\n SimpleClass simple_;\\n\\n DISALLOW_COPY_AND_ASSIGN(BaseClass);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/ref_counted_ptr_test.cc\",\n \"rank\": 40,\n \"score\": 109203.3094428851\n },\n {\n \"content\": \"// This class is a base for various mechanisms of running things in background.\\n\\n//\\n\\n// If you just want to run something in background, you want to use a subclass\\n\\n// of this, such as a SlowWorker or QueuedWorker instance.\\n\\n//\\n\\n// Subclasses should implement bool PermitQueue() and provide an appropriate\\n\\n// wrapper around QueueIfPermitted().\\n\\nclass Worker {\\n\\n public:\\n\\n // Tries to start the work thread (if it hasn't been started already).\\n\\n void Start();\\n\\n\\n\\n // Returns true if there was a job running or any jobs queued at the time\\n\\n // this function was called.\\n\\n bool IsBusy();\\n\\n\\n\\n // Finishes the currently running jobs, and deletes any queued jobs.\\n\\n // No further jobs will be accepted after this call either; they will\\n\\n // just be canceled. It is safe to call this method multiple times.\\n\\n void ShutDown();\\n\\n\\n\\n // Sets up a timed-variable statistic indicating the current queue depth.\\n\\n //\\n\\n // This must be called prior to starting the thread.\\n\\n void set_queue_size_stat(Waveform* x) { queue_size_ = x; }\\n\\n\\n\\n protected:\\n\",\n \"file_path\": \"pagespeed/kernel/thread/worker.h\",\n \"rank\": 41,\n \"score\": 109034.40973974376\n },\n {\n \"content\": \"// Encapsulates a task to be run in response to some event, such as\\n\\n// a Timer callback, an fetch, or a cache lookup.\\n\\n//\\n\\n// Users of interfaces requiring a Function* can either derive a new\\n\\n// class from Function, or use one of the helper template-classes or\\n\\n// MakeFunction variants below, which create delayed calls to class\\n\\n// methods.\\n\\n//\\n\\n// Note that Functions by default are self-deleting after call, but\\n\\n// you can override that with set_delete_after_callback(false).\\n\\n//\\n\\n// A Function will always have its Run method or its Cancel method\\n\\n// called, never both. A Function should never be deleted without its\\n\\n// Run/Cancel method being called (except if\\n\\n// set_delete_after_callback(false)).\\n\\n//\\n\\n// Note that classes calling Functions use the CallRun or CallCancel methods,\\n\\n// rather than calling Run or Cancel directly. This allows the Function class\\n\\n// to enforce policy on making run & cancel mutually exclusive and implement\\n\\n// delete-after-run.\\n\\nclass Function {\\n\\n public:\\n\\n Function();\\n\\n virtual ~Function();\\n\\n\\n\\n // Functions used as Worker tasks can help the system shut down cleanly\\n\\n // by calling quit_requested() periodically. To support this, Worker\\n\\n // calls set_quit_requested_pointer so the Function object can access\\n\\n // the atomic bool.\\n\\n //\\n\\n // Note that a strategy of allocating the AtomicBool inside the Function\\n\\n // object exposes a shutdown race when the function completes and deletes\\n\\n // itself.\\n\\n void set_quit_requested_pointer(AtomicBool* x) { quit_requested_ = x; }\\n\\n\\n\\n // Allows an infrastructure (e.g. Worker or Alarm) to request that\\n\\n // a running Function stop soon, as it is being shut down.\\n\\n //\\n\\n // This can should only be called during the Run() method.\\n\\n bool quit_requested() const {\\n\",\n \"file_path\": \"pagespeed/kernel/base/function.h\",\n \"rank\": 42,\n \"score\": 109030.05000108486\n },\n {\n \"content\": \"// Base class for implementations of monitoring statistics.\\n\\nclass Statistics {\\n\\n public:\\n\\n // Default group for use with AddTimedVariable.\\n\\n static const char kDefaultGroup[];\\n\\n\\n\\n Statistics() {}\\n\\n virtual ~Statistics();\\n\\n\\n\\n // Add a new variable, or returns an existing one of that name.\\n\\n // The UpDownCounter* is owned by the Statistics class -- it should\\n\\n // not be deleted by the caller.\\n\\n virtual UpDownCounter* AddUpDownCounter(const StringPiece& name) = 0;\\n\\n\\n\\n // Like AddVariable, but asks the implementation to scope the variable to the\\n\\n // entire process, even if statistics are generally partitioned by domains or\\n\\n // the like. Default implementation simply forwards to AddVariable.\\n\\n virtual UpDownCounter* AddGlobalUpDownCounter(const StringPiece& name);\\n\\n\\n\\n // Find a variable from a name, returning NULL if not found.\\n\\n virtual UpDownCounter* FindUpDownCounter(const StringPiece& name) const = 0;\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 43,\n \"score\": 109023.0330942476\n },\n {\n \"content\": \"// Displays a waveform of values over time. This can run\\n\\n// continuously, in which case it will only display waveforms for a\\n\\n// bounded number of samples. Or it can be run as a trigger.\\n\\n//\\n\\n// However the average, min, and max values will account for all the\\n\\n// values seen by the waveform since it was cleared.\\n\\n//\\n\\n// This class is threadsafe.\\n\\nclass Waveform {\\n\\n public:\\n\\n Waveform(ThreadSystem* thread_system, Timer* timer, int capacity,\\n\\n UpDownCounter* metric);\\n\\n\\n\\n void Clear();\\n\\n double Average();\\n\\n double Maximum();\\n\\n double Minimum();\\n\\n int Size();\\n\\n\\n\\n // Records a value at the current time using the Timer.\\n\\n void Add(double value);\\n\\n\\n\\n // Records a delta relative to the previous value using the Timer.\\n\\n // This is equivalent to calling Add(previous_value + delta).\\n\\n void AddDelta(double delta);\\n\\n\\n\\n // Write script and function to web page. Note that this function\\n\\n // should be called only once for each HTML page, and should not be\\n\",\n \"file_path\": \"pagespeed/kernel/base/waveform.h\",\n \"rank\": 44,\n \"score\": 109022.07581341194\n },\n {\n \"content\": \"// Implements a simple scheduler that allows a thread to block until either time\\n\\n// expires, or a condition variable is signaled. Also permits various alarms to\\n\\n// be scheduled; these are lightweight short-lived callbacks that must be safely\\n\\n// runnable from any thread in any lock state in which scheduler invocations\\n\\n// occur. Finally, implements a hybrid between these: a callback that can be\\n\\n// run when the condition variable is signaled.\\n\\n//\\n\\n// This class is designed to be overridden, but only to re-implement its\\n\\n// internal notion of blocking to permit time to be mocked by MockScheduler.\\n\\nclass Scheduler {\\n\\n public:\\n\",\n \"file_path\": \"pagespeed/kernel/thread/scheduler.h\",\n \"rank\": 45,\n \"score\": 109021.46927399689\n },\n {\n \"content\": \"class Function;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/thread/sequence.h\",\n \"rank\": 46,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Writer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 47,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Hasher {\\n\\n public:\\n\\n // The passed in max_chars will be used to limit the length of\\n\\n // Hash() and HashSizeInChars()\\n\\n explicit Hasher(int max_chars);\\n\\n virtual ~Hasher();\\n\\n\\n\\n // Computes a web64-encoded hash of a single string. This\\n\\n // operation is thread-safe.\\n\\n //\\n\\n // This is implemented in terms of RawHash, and honors the length limit\\n\\n // passed in to the constructor.\\n\\n GoogleString Hash(const StringPiece& content) const;\\n\\n\\n\\n // Return string length of hashes produced by this hasher's Hash\\n\\n // method.\\n\\n //\\n\\n // This is implemented in terms of RawHashSizeInBytes() and the length limit\\n\\n // passed in to the constructor.\\n\\n int HashSizeInChars() const;\\n\",\n \"file_path\": \"pagespeed/kernel/base/hasher.h\",\n \"rank\": 48,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// UpDownCounters are variables that can also be decreased (e.g. Add\\n\\n// of a negative number) or Set to an arbitrary value.\\n\\n//\\n\\n// TODO(jmarantz): Make this not inherit from Variable, which will simplify the\\n\\n// 'CheckNotNegative' and its ifndefs, but will require us to do more accurate\\n\\n// type bookkeeping in tests, etc.\\n\\n//\\n\\n// TODO(jmarantz): consider renaming Variable->Counter, UpDownCounter->Variable.\\n\\nclass UpDownCounter {\\n\\n public:\\n\\n virtual ~UpDownCounter();\\n\\n\\n\\n virtual int64 Get() const = 0;\\n\\n // Return some name representing the variable, provided that the specific\\n\\n // implementation has some sensible way of doing so.\\n\\n virtual StringPiece GetName() const = 0;\\n\\n\\n\\n // Sets the specified value, returning the previous value. This can be\\n\\n // used to by two competing threads/processes to determine which thread\\n\\n // modified the value first. The default implementation is non-atomic,\\n\\n // but implementations can override to provide an atomic version.\\n\\n //\\n\\n // Non-atomic implementations may result in multiple concurrent updates\\n\\n // each returning the old value. In an atomic implementation, only one\\n\\n // concurrent update will return the old value.\\n\\n virtual int64 SetReturningPreviousValue(int64 value);\\n\\n\\n\\n virtual void Set(int64 value) = 0;\\n\\n void Clear() { Set(0); }\\n\\n int64 Add(int64 delta) { return AddHelper(delta); }\\n\\n\\n\\n protected:\\n\\n // This is virtual so that subclasses can add platform-specific atomicity.\\n\\n virtual int64 AddHelper(int64 delta) = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 49,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Callback1 {\\n\\n public:\\n\\n Callback1() {}\\n\\n virtual ~Callback1() {}\\n\\n virtual void Run(A1) = 0;\\n\\n};\\n\\n\\n\\n// Naming convention is:\\n\\n// (Member)?Callback_<num-pre-bound-args>_<num-runtime-args>\\n\\n\\n\\n// TODO(gee): Fill out other useful specializations.\\n\\ntemplate<class C, class A1, bool DeleteAfterRun>\\n\",\n \"file_path\": \"pagespeed/kernel/base/callback.h\",\n \"rank\": 50,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Timer;\\n\",\n \"file_path\": \"pagespeed/system/admin_site.h\",\n \"rank\": 51,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Waveform;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/thread/worker.h\",\n \"rank\": 52,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Statistics;\\n\",\n \"file_path\": \"pagespeed/system/system_caches.h\",\n \"rank\": 53,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Atoms are idempotent representations of strings, created\\n\\n// via a symbol table.\\n\\nclass Atom {\\n\\n public:\\n\\n Atom(const Atom& src) : str_(src.str_) {}\\n\\n Atom();\\n\\n ~Atom() {} // atoms are memory-managed by SymbolTables.\\n\\n\\n\\n Atom& operator=(const Atom& src) {\\n\\n if (&src != this) {\\n\\n str_ = src.str_;\\n\\n }\\n\\n return *this;\\n\\n }\\n\\n\\n\\n // Returns the address of the canonical StringPiece representing this Atom.\\n\\n // The underlying StringPiece object (and its data) are owned by the\\n\\n // SymbolTable.\\n\\n const StringPiece* Rep() const { return str_; }\\n\\n\\n\\n // This is comparing the underlying StringPiece pointers. It is invalid\\n\\n // to compare Atoms from different symbol tables.\\n\",\n \"file_path\": \"pagespeed/kernel/base/atom.h\",\n \"rank\": 54,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \" // An implementation of net_instaweb::Sequence that's controlled by the\\n\\n // scheduler.\\n\\n class Sequence;\\n\\n\\n\\n // Sorting comparator for Alarms, so that they can be retrieved in time\\n\\n // order. For use by std::set, thus public.\\n\\n struct CompareAlarms {\\n\\n bool operator()(const Alarm* a, const Alarm* b) const;\\n\\n };\\n\\n\\n\\n Scheduler(ThreadSystem* thread_system, Timer* timer);\\n\\n virtual ~Scheduler();\\n\\n\\n\\n ThreadSystem::CondvarCapableMutex* mutex() LOCK_RETURNED(mutex_) {\\n\\n return mutex_.get();\\n\\n }\\n\\n\\n\\n // Optionally check that mutex is locked for debugging purposes.\\n\\n void DCheckLocked() EXCLUSIVE_LOCKS_REQUIRED(mutex()) {\\n\\n mutex_->DCheckLocked();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/thread/scheduler.h\",\n \"rank\": 55,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Statistics;\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 56,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Signature {\\n\\n public:\\n\\n // The passed in max_chars will be used to limit the length of Sign() and\\n\\n // SignatureSizeInChars().\\n\\n explicit Signature();\\n\\n virtual ~Signature();\\n\\n\\n\\n // Computes a web64-encoded signature of data under a given key. Takes a\\n\\n // StringPiece for signing key, which is used for a pointer to the key and the\\n\\n // length of the signing key, and a StringPiece for the data, which is used\\n\\n // for a pointer to the data to sign, and the length of the data.\\n\\n GoogleString Sign(StringPiece key, StringPiece data) const;\\n\\n\\n\\n // Returns the string length of the signatures produced by the Sign() method.\\n\\n virtual int SignatureSizeInChars() const = 0;\\n\\n\\n\\n protected:\\n\\n // Computes a binary signature of a given data under key.\\n\\n virtual GoogleString RawSign(StringPiece key, StringPiece data) const = 0;\\n\\n // The number of bytes RawSign will produce.\\n\",\n \"file_path\": \"pagespeed/kernel/base/signature.h\",\n \"rank\": 57,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Function;\\n\",\n \"file_path\": \"pagespeed/kernel/thread/worker.h\",\n \"rank\": 58,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Callback2 {\\n\\n public:\\n\\n Callback2() {}\\n\\n virtual ~Callback2() {}\\n\\n virtual void Run(A1, A2) = 0;\\n\\n};\\n\\n\\n\\n// Naming convention is:\\n\\n// (Member)?Callback_<num-pre-bound-args>_<num-runtime-args>\\n\\n\\n\\n// TODO(gee): Fill out other useful specializations.\\n\\ntemplate<class C, class A1, class A2, bool DeleteAfterRun>\\n\",\n \"file_path\": \"pagespeed/kernel/base/callback.h\",\n \"rank\": 59,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Histogram {\\n\\n public:\\n\\n virtual ~Histogram();\\n\\n // Record a value in its bucket.\\n\\n virtual void Add(double value) = 0;\\n\\n // Throw away all data.\\n\\n virtual void Clear() = 0;\\n\\n // True if the histogram is empty.\\n\\n bool Empty() {\\n\\n ScopedMutex hold(lock());\\n\\n return CountInternal() == 0;\\n\\n }\\n\\n // Write Histogram Data to the writer.\\n\\n // Default implementation does not include histogram graph, but only raw\\n\\n // histogram data table. It looks like:\\n\\n // ________________________________________\\n\\n // | TITLE String |\\n\\n // | Avg: StdDev: Median: 90%: 95%: 99% |\\n\\n // | Raw Histogram Data: |\\n\\n // | [0,1] 1 25% 25% ||||| |\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 60,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Timer;\\n\",\n \"file_path\": \"pagespeed/kernel/base/waveform.h\",\n \"rank\": 61,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Interface for writing bytes to an output stream.\\n\\nclass Writer {\\n\\n public:\\n\\n Writer() {}\\n\\n virtual ~Writer();\\n\\n\\n\\n virtual bool Write(const StringPiece& str, MessageHandler* handler) = 0;\\n\\n virtual bool Flush(MessageHandler* message_handler) = 0;\\n\\n\\n\\n // Dumps the contents of what's been written to the Writer. Many\\n\\n // Writer implementations will not be able to do this, and the default\\n\\n // implementation will return false. But StringWriter and\\n\\n // SharedCircularBuffer can dump their contents, and override\\n\\n // this with implementations that return true.\\n\\n virtual bool Dump(Writer* writer, MessageHandler* message_handler);\\n\\n\\n\\n private:\\n\\n DISALLOW_COPY_AND_ASSIGN(Writer);\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_BASE_WRITER_H_\\n\",\n \"file_path\": \"pagespeed/kernel/base/writer.h\",\n \"rank\": 62,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class UpDownCounter;\\n\",\n \"file_path\": \"pagespeed/kernel/base/waveform.h\",\n \"rank\": 63,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Pool {\\n\\n public:\\n\\n // We can iterate over a pool using this iterator type.\\n\\n typedef typename PoolElement<T>::Position iterator;\\n\\n typedef typename std::list<T*>::const_iterator const_iterator;\\n\\n\\n\\n Pool() { }\\n\\n\\n\\n ~Pool() {\\n\\n DeleteAll();\\n\\n }\\n\\n\\n\\n // Is pool empty?\\n\\n bool empty() const {\\n\\n return contents_.empty();\\n\\n }\\n\\n\\n\\n // Size of pool\\n\\n size_t size() const {\\n\\n return contents_.size();\\n\",\n \"file_path\": \"pagespeed/kernel/base/pool.h\",\n \"rank\": 64,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Writer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/waveform.h\",\n \"rank\": 65,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Statistics;\\n\",\n \"file_path\": \"pagespeed/system/admin_site.h\",\n \"rank\": 66,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Statistics;\\n\",\n \"file_path\": \"pagespeed/automatic/proxy_interface.h\",\n \"rank\": 67,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Interface for a holding and adding to a sequence of tasks.\\n\\n// The mechanism for executing the tasks must be defined by\\n\\n// implementations of this interface.\\n\\nclass Sequence {\\n\\n public:\\n\\n Sequence();\\n\\n virtual ~Sequence();\\n\\n\\n\\n // Adds 'function' to a sequence. Note that this can occur at any time\\n\\n // the sequence is live -- you can add functions to a sequence that has\\n\\n // already started processing. The caller is expected to ensure Function\\n\\n // will be cleaned up after Run or Cancel.\\n\\n //\\n\\n // 'function' can be called any time after Add(), and may in fact be\\n\\n // called before Add() returns. It's OK for the function to call Add\\n\\n // again.\\n\\n //\\n\\n // If the sequence is destructed after Add, but before the function has\\n\\n // been run, function->Cancel() will be called when the Sequence is destroyed.\\n\\n virtual void Add(Function* function) = 0;\\n\\n\\n\\n private:\\n\\n DISALLOW_COPY_AND_ASSIGN(Sequence);\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_THREAD_SEQUENCE_H_\\n\",\n \"file_path\": \"pagespeed/kernel/thread/sequence.h\",\n \"rank\": 68,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// CONCEPT!\\n\\nclass allocator\\n\\n{\\n\\npublic:\\n\\n\\texplicit allocator(const char* name = \\\"DEFAULT\\\"):\\tm_name(name) {}\\n\\n\\t// Copy ctor generated by compiler.\\n\\n\\t// allocator(const allocator&)\\n\\n\\t~allocator() {}\\n\\n\\n\\n\\t// Generated by compiler.\\n\\n\\t//allocator& operator=(const allocator&)\\n\\n\\n\\n\\tvoid* allocate(unsigned int bytes, int flags = 0);\\n\\n\\t// Not supported for standard allocator for the time being.\\n\\n\\tvoid* allocate_aligned(unsigned int bytes, unsigned int alignment, int flags = 0);\\n\\n\\tvoid deallocate(void* ptr, unsigned int bytes);\\n\\n\\n\\n\\tconst char* get_name() const;\\n\\n\\n\\nprivate:\\n\\n\\tconst char*\\tm_name;\\n\",\n \"file_path\": \"third_party/rdestl/allocator.h\",\n \"rank\": 69,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Arena {\\n\\n public:\\n\\n // All allocations we make will be aligned to this. We will also reserve\\n\\n // this much room for our work area, as it keeps things simple.\\n\\n static const size_t kAlign = 8;\\n\\n\\n\\n Arena() {\\n\\n InitEmpty();\\n\\n }\\n\\n\\n\\n ~Arena() {\\n\\n CHECK(chunks_.empty());\\n\\n }\\n\\n\\n\\n void* Allocate(size_t size) {\\n\\n size += kAlign; // Need room to link the next object.\\n\\n size = ExpandToAlign(size);\\n\\n\\n\\n DCHECK(sizeof(void*) <= kAlign);\\n\\n DCHECK(size < Chunk::kSize);\\n\",\n \"file_path\": \"pagespeed/kernel/base/arena.h\",\n \"rank\": 70,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Writer;\\n\\n\\n\\n// Read/write API for HTTP headers (shared base class)\\n\\ntemplate<class Proto> class Headers {\\n\\n public:\\n\\n // typedef's for manipulating the cookie multimap.\\n\\n typedef std::pair<StringPiece, StringPiece> ValueAndAttributes;\\n\\n typedef std::multimap<StringPiece, ValueAndAttributes> CookieMultimap;\\n\\n typedef std::multimap<StringPiece, ValueAndAttributes>::const_iterator\\n\\n CookieMultimapConstIter;\\n\\n\\n\\n Headers();\\n\\n virtual ~Headers();\\n\\n\\n\\n virtual void Clear();\\n\\n\\n\\n int major_version() const;\\n\\n bool has_major_version() const;\\n\\n int minor_version() const;\\n\\n void set_major_version(int major_version);\\n\",\n \"file_path\": \"pagespeed/kernel/http/headers.h\",\n \"rank\": 71,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Writer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/system/admin_site.h\",\n \"rank\": 72,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Wildcard {\\n\\n public:\\n\\n static const char kMatchAny; // *\\n\\n static const char kMatchOne; // ?\\n\\n\\n\\n // Create a wildcard object with the specification using * and ?\\n\\n // as wildcards. There is currently no way to quote * or ?.\\n\\n explicit Wildcard(const StringPiece& wildcard_spec);\\n\\n\\n\\n // Determines whether a string matches the wildcard.\\n\\n bool Match(const StringPiece& str) const;\\n\\n\\n\\n // Determines whether this wildcard is just a simple name, lacking\\n\\n // any wildcard characters.\\n\\n bool IsSimple() const { return is_simple_; }\\n\\n\\n\\n // Returns the original wildcard specification.\\n\\n const StringPiece spec() const {\\n\\n return StringPiece(storage_.data(), storage_.size() - 1);\\n\\n }\\n\",\n \"file_path\": \"pagespeed/kernel/base/wildcard.h\",\n \"rank\": 73,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Hasher;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 74,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \" class Connection {\\n\\n public:\\n\\n Connection(RedisCache* redis_cache, StringPiece host, int port);\\n\\n\\n\\n void StartUp(bool connect_now = true)\\n\\n LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\\n\\n bool IsHealthy() const LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\\n\\n void ShutDown() LOCKS_EXCLUDED(redis_mutex_, state_mutex_);\\n\\n\\n\\n GoogleString ToString() {\\n\\n return StrCat(host_, \\\":\\\", IntegerToString(port_));\\n\\n }\\n\\n\\n\\n AbstractMutex* GetOperationMutex() const LOCK_RETURNED(redis_mutex_) {\\n\\n return redis_mutex_.get();\\n\\n }\\n\\n\\n\\n // Must be followed by ValidateRedisReply() under the same lock.\\n\\n RedisReply RedisCommand(const char* format, va_list args)\\n\\n EXCLUSIVE_LOCKS_REQUIRED(redis_mutex_) LOCKS_EXCLUDED(state_mutex_);\\n\",\n \"file_path\": \"pagespeed/system/redis_cache.h\",\n \"rank\": 75,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Encapsulates the creation of objects that may have different applications\\n\\n// across platforms.\\n\\nclass Platform {\\n\\n public:\\n\\n // Creates an appropriate ThreadSystem for the platform.\\n\\n static ThreadSystem* CreateThreadSystem();\\n\\n\\n\\n // Creates an appropriate Timer for the platform.\\n\\n static Timer* CreateTimer();\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_UTIL_PLATFORM_H_\\n\",\n \"file_path\": \"pagespeed/kernel/util/platform.h\",\n \"rank\": 76,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Timer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/util/platform.h\",\n \"rank\": 77,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \" // A callback for a scheduler alarm, with an associated wakeup time (absolute\\n\\n // time after which the callback will be invoked with Run() by the scheduler).\\n\\n // Alarm should be treated as an opaque type.\\n\\n class Alarm;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/thread/scheduler.h\",\n \"rank\": 78,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Timer interface, made virtual so it can be mocked for tests.\\n\\nclass Timer {\\n\\n public:\\n\\n // Note: it's important that these stay compile-time constants, to\\n\\n // avoid weird init order surprises. (Noticed in the wild on Mac).\\n\\n // If you get a link error due to one of these missing, you're trying\\n\\n // to pass it in by a const reference. You can do something like * 1 to\\n\\n // sidestep the issue.\\n\\n static const int64 kSecondMs = 1000;\\n\\n static const int64 kMsUs = 1000;\\n\\n static const int64 kSecondUs = kMsUs * kSecondMs;\\n\\n static const int64 kSecondNs = 1000 * kSecondUs;\\n\\n static const int64 kMinuteMs = 60 * kSecondMs;\\n\\n static const int64 kMinuteUs = 60 * kSecondUs;\\n\\n static const int64 kHourMs = 60 * kMinuteMs;\\n\\n static const int64 kDayMs = 24 * kHourMs;\\n\\n static const int64 kWeekMs = 7 * kDayMs;\\n\\n static const int64 kMonthMs = 31 * kDayMs;\\n\\n static const int64 kYearMs = 365 * kDayMs;\\n\\n\\n\\n virtual ~Timer();\\n\",\n \"file_path\": \"pagespeed/kernel/base/timer.h\",\n \"rank\": 79,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"class Timer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/automatic/proxy_fetch.h\",\n \"rank\": 80,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"// Variables can normally only be increased, not decreased. However, for\\n\\n// testing, They can also be Cleared.\\n\\n//\\n\\n// TODO(jmarantz): consider renaming this to Counter or maybe UpCounter.\\n\\nclass Variable {\\n\\n public:\\n\\n virtual ~Variable();\\n\\n\\n\\n virtual int64 Get() const = 0;\\n\\n // Return some name representing the variable, provided that the specific\\n\\n // implementation has some sensible way of doing so.\\n\\n virtual StringPiece GetName() const = 0;\\n\\n\\n\\n // Adds 'delta' to the variable's value, returning the result.\\n\\n int64 Add(int64 non_negative_delta) {\\n\\n DCHECK_LE(0, non_negative_delta);\\n\\n return AddHelper(non_negative_delta);\\n\\n }\\n\\n\\n\\n virtual void Clear() = 0;\\n\\n\\n\\n protected:\\n\\n // This is virtual so that subclasses can add platform-specific atomicity.\\n\\n virtual int64 AddHelper(int64 delta) = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 81,\n \"score\": 109015.77755732345\n },\n {\n \"content\": \"#line 22 \\\"htmlparse/html_name.gperf\\\"\\n\\nstruct KeywordMap {const char* name; net_instaweb::HtmlName::Keyword keyword;};\\n\\n#include <string.h>\\n\\n\\n\\n#define TOTAL_KEYWORDS 137\\n\\n#define MIN_WORD_LENGTH 1\\n\\n#define MAX_WORD_LENGTH 22\\n\\n#define MIN_HASH_VALUE 7\\n\\n#define MAX_HASH_VALUE 209\\n\\n/* maximum key range = 203, duplicates = 0 */\\n\\n\\n\\n#ifndef GPERF_DOWNCASE\\n\\n#define GPERF_DOWNCASE 1\\n\\nstatic unsigned char gperf_downcase[256] =\\n\\n {\\n\\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,\\n\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\\n\\n 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,\\n\\n 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,\\n\\n 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106,\\n\\n 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,\\n\",\n \"file_path\": \"net/instaweb/genfiles/htmlparse/html_name.cc\",\n \"rank\": 82,\n \"score\": 107873.87598034886\n },\n {\n \"content\": \"// Context for handling a request, computing options and request headers in\\n\\n// the constructor.\\n\\n//\\n\\n// TODO(jmarantz): There are many static methods in this class. Some\\n\\n// of them need to stay that way as they are used as C entry points.\\n\\n// Some are helper methods, and we could adopt a policy of requiring\\n\\n// the static methods to instantiate the class (possibly making its\\n\\n// constructor lighter weight) and then calling them explicitly. For\\n\\n// the time being, we'll leave these static methods with the\\n\\n// non-compliant lower_case_names_with_underscores naming convention\\n\\n// and fix their naming when we update whether they should be static\\n\\n// or not.\\n\\nclass InstawebHandler {\\n\\n public:\\n\\n explicit InstawebHandler(request_rec* request);\\n\\n ~InstawebHandler();\\n\\n\\n\\n // Any PageSpeed query params are removed.\\n\\n const GoogleUrl& stripped_gurl() const { return stripped_gurl_; }\\n\\n const RequestContextPtr request_context() const { return request_context_; }\\n\\n bool use_custom_options() const { return custom_options_.get() != NULL; }\\n\\n const QueryParams& query_params() { return rewrite_query_.query_params(); }\\n\\n const QueryParams& pagespeed_query_params() {\\n\\n return rewrite_query_.pagespeed_query_params();\\n\\n }\\n\\n const QueryParams& pagespeed_option_cookies() {\\n\\n return rewrite_query_.pagespeed_option_cookies();\\n\\n }\\n\\n\\n\\n void RemoveStrippedResponseHeadersFromApacheRequest();\\n\\n\\n\\n // Makes a driver from the request_context and options. Note that\\n\",\n \"file_path\": \"pagespeed/apache/instaweb_handler.h\",\n \"rank\": 83,\n \"score\": 107446.14045519012\n },\n {\n \"content\": \"// Scalar value protected by a mutex. Mutex must fully protect access\\n\\n// to underlying scalar. For example, in mod_pagespeed and\\n\\n// ngx_pagespeed, variables are stored in shared memory and accessible\\n\\n// from any process on a machine, so the mutex must provide protection\\n\\n// across separate processes.\\n\\n//\\n\\n// StatisticsLogger depends upon these mutexes being cross-process so that\\n\\n// several processes using the same file system don't clobber each others logs.\\n\\n//\\n\\n// TODO(jmarantz): this could be done using templates rather than using virtual\\n\\n// methods, as MutexedScalar does not implement an abstract interface.\\n\\nclass MutexedScalar {\\n\\n public:\\n\\n virtual ~MutexedScalar();\\n\\n\\n\\n // Subclasses should not define these methods, instead define the *LockHeld()\\n\\n // methods below.\\n\\n int64 Get() const;\\n\\n void Set(int64 value);\\n\\n int64 SetReturningPreviousValue(int64 value);\\n\\n int64 AddHelper(int64 delta);\\n\\n\\n\\n protected:\\n\\n friend class StatisticsLogger;\\n\\n\\n\\n virtual AbstractMutex* mutex() const = 0;\\n\\n\\n\\n // Get/Setters that may only be called if you already hold the mutex.\\n\\n virtual int64 GetLockHeld() const = 0;\\n\\n virtual int64 SetReturningPreviousValueLockHeld(int64 value) = 0;\\n\\n\\n\\n // These are implemented based on GetLockHeld() and\\n\\n // SetReturningPreviousLockHeld().\\n\\n void SetLockHeld(int64 value);\\n\\n int64 AddLockHeld(int64 delta);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 84,\n \"score\": 107435.4760557193\n },\n {\n \"content\": \"// TimedVariable is a statistic class returns the amount added in the\\n\\n// last interval, which could be last 10 seconds, last minute\\n\\n// last one hour and total.\\n\\nclass TimedVariable {\\n\\n public:\\n\\n // The intervals for which we keep stats.\\n\\n enum Levels { TENSEC, MINUTE, HOUR, START };\\n\\n virtual ~TimedVariable();\\n\\n // Update the stat value. delta is in milliseconds.\\n\\n virtual void IncBy(int64 delta) = 0;\\n\\n // Get the amount added over the last time interval\\n\\n // specified by \\\"level\\\".\\n\\n virtual int64 Get(int level) = 0;\\n\\n // Throw away all data.\\n\\n virtual void Clear() = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/statistics.h\",\n \"rank\": 85,\n \"score\": 107434.70569898686\n },\n {\n \"content\": \" // Limited iterator (not an STL iterator). Example usage:\\n\\n // for (HtmlName::Iterator iter; !iter.AtEnd(); iter.Next()) {\\n\\n // use(iter.keyword(), iter.name());\\n\\n // }\\n\\n class Iterator {\\n\\n public:\\n\\n Iterator() : index_(-1) { Next(); }\\n\\n bool AtEnd() const;\\n\\n void Next();\\n\\n Keyword keyword() const;\\n\\n const char* name() const;\\n\\n\\n\\n private:\\n\\n int index_;\\n\\n\\n\\n // Implicit copy and assign ok. The members can be safely copied by bits.\\n\\n };\\n\\n\\n\\n static int num_keywords();\\n\\n static Keyword Lookup(const StringPiece& name);\\n\\n\\n\\n private:\\n\\n // Constructs an HTML name given a keyword, which can be\\n\\n // HtmlName::kNotAKeyword, and 'StringPiece* str'. 'str'\\n\",\n \"file_path\": \"pagespeed/kernel/html/html_name.h\",\n \"rank\": 86,\n \"score\": 107434.47452981994\n },\n {\n \"content\": \" // Limited iterator (not an STL iterator). Example usage:\\n\\n // for (JsKeywords::Iterator iter; !iter.AtEnd(); iter.Next()) {\\n\\n // use(iter.keyword(), iter.name());\\n\\n // }\\n\\n class Iterator {\\n\\n public:\\n\\n Iterator() : index_(-1) { Next(); }\\n\\n bool AtEnd() const;\\n\\n void Next();\\n\\n Type keyword() const;\\n\\n const char* name() const;\\n\\n\\n\\n private:\\n\\n int index_;\\n\\n\\n\\n // Implicit copy and assign ok. The members can be safely copied by bits.\\n\\n };\\n\\n\\n\\n private:\\n\\n // TODO(jkarlin): Get rid of the net_instaweb namespace once JsLexer is\\n\\n // moved into kernel/js.\\n\\n friend class net_instaweb::JsLexer;\\n\\n\\n\\n // Returns the number of keywords recognized by the Lookup function. This is\\n\\n // used by the Lexer to size the keyword-sring array prior to iterating over\\n\\n // the keywords to populate it.\\n\\n static int num_keywords();\\n\\n};\\n\\n\\n\\n} // namespace pagespeed\\n\\n\\n\\n#endif // PAGESPEED_KERNEL_JS_JS_KEYWORDS_H_\\n\",\n \"file_path\": \"pagespeed/kernel/js/js_keywords.h\",\n \"rank\": 87,\n \"score\": 107434.47452981994\n },\n {\n \"content\": \"// This class tries to heuristically detect whether something that claims to\\n\\n// HTML is likely to be. For now, it merely looks at whether the first\\n\\n// non-whitespace/non-BOM character is <.\\n\\n//\\n\\n// Typical usage:\\n\\n// HtmlDetector detect_html_;\\n\\n//\\n\\n// if (!detect_html_.already_decided() &&\\n\\n// detect_html_.ConsiderInput(data)) {\\n\\n// GoogleString buffered;\\n\\n// detect_html_.ReleaseBuffered(&buffered);\\n\\n// if (detect_html_.probable_html()) {\\n\\n// do html-specific bits with buffered\\n\\n// } else {\\n\\n// do non-html things with buffered\\n\\n// }\\n\\n// }\\n\\n//\\n\\n// if (detect_html_.already_decided()) {\\n\\n// do appropriate things with data based on detect_html_.probable_html()\\n\\n// }\\n\\nclass HtmlDetector {\\n\\n public:\\n\\n HtmlDetector();\\n\\n ~HtmlDetector();\\n\\n\\n\\n // Processes the data, trying to determine if it's HTML or not. If there is\\n\\n // enough evidence to make a decision, returns true.\\n\\n //\\n\\n // If true is returned, already_decided() will be true as well, and hence\\n\\n // probable_html() will be accessible. buffered() will not be changed.\\n\\n //\\n\\n // If false is returned, data will be accumulated inside buffered().\\n\\n //\\n\\n // Precondition: !already_decided()\\n\\n bool ConsiderInput(const StringPiece& data);\\n\\n\\n\\n // Returns true if we have seen enough input to make a guess as to whether\\n\\n // it's HTML or not.\\n\\n bool already_decided() const { return already_decided_; }\\n\\n\\n\",\n \"file_path\": \"pagespeed/automatic/html_detector.h\",\n \"rank\": 88,\n \"score\": 107433.25116815642\n },\n {\n \"content\": \"// Helps manage setup of cache backends provided by the PSOL library\\n\\n// (LRU, File, Memcached, and shared memory metadata), as well as named lock\\n\\n// managers. The expectation is that the RewriteDriverFactory for the server\\n\\n// will invoke this class's methods in appropriate spots.\\n\\n//\\n\\n// It is also expected that the RootInit() method will be called during server\\n\\n// setup before the server launches any additional processes, and ChildInit()\\n\\n// will be called on any child process handling requests. If the server\\n\\n// is single-process, both methods should be called.\\n\\n//\\n\\n// Keep in mind, however, that when fork() is involved a process may\\n\\n// effectively see both calls, in which case the 'ChildInit' call would\\n\\n// come second and override the previous root status.\\n\\nclass SystemCaches {\\n\\n public:\\n\\n // CacheStats prefixes.\\n\\n static const char kMemcachedAsync[];\\n\\n static const char kMemcachedBlocking[];\\n\\n static const char kRedisAsync[];\\n\\n static const char kRedisBlocking[];\\n\\n static const char kShmCache[];\\n\\n\\n\\n static const char kDefaultSharedMemoryPath[];\\n\\n\\n\\n enum StatFlags {\\n\\n kDefaultStatFlags = 0,\\n\\n kGlobalView = 1,\\n\\n kIncludeMemcached = 2,\\n\\n kIncludeRedis = 4\\n\\n };\\n\\n\\n\\n // Registers all statistics the cache backends may use.\\n\\n static void InitStats(Statistics* statistics);\\n\",\n \"file_path\": \"pagespeed/system/system_caches.h\",\n \"rank\": 89,\n \"score\": 107433.0744372396\n },\n {\n \"content\": \"// Handles forking off a controller process, restarting it if it dies, and\\n\\n// shutting down the process if the host reloads config or shuts down.\\n\\n//\\n\\n// We fork a babysitter process, which forks a controller process. If the\\n\\n// controller process dies without calling exit(0) the babysitter will fork off\\n\\n// another controller.\\n\\n//\\n\\n// The controller runs a thread that watches for the root process to die, or to\\n\\n// ask it to quit. We use pipes for communication between the master process\\n\\n// and the controller. If the master process goes away, the controller reading\\n\\n// will get EOF. If the master process wants the controller to shut down so it\\n\\n// can be replaced, it writes a byte.\\n\\n//\\n\\n// (All methods in the ControllerManager are static. When you call\\n\\n// ForkControllerProcess() it keeps running until process exit.)\\n\\nclass ControllerManager {\\n\\n public:\\n\\n // Called on system startup, before forking off any workers. Starts up a\\n\\n // babysitter process that starts a controller process and restarts the\\n\\n // controller if it dies. Also called (again) on configuration reloading.\\n\\n static void ForkControllerProcess(\\n\\n std::unique_ptr<ControllerProcess>&& process,\\n\\n SystemRewriteDriverFactory* factory, ThreadSystem* thread_system,\\n\\n MessageHandler* handler);\\n\\n\\n\\n // Relinquishes the reference from us to the controller process. This may be\\n\\n // needed if our current process is going to go on and do something unrelated.\\n\\n static void DetachFromControllerProcess();\\n\\n\\n\\n private:\\n\\n // Set us up as a proper daemon, with no stdin/out/err and not process group.\\n\\n static void Daemonize(MessageHandler* handler);\\n\\n\\n\\n // Actually start the ControllerProcess. Returns an exit status.\\n\\n static int RunController(int controller_read_fd, ControllerProcess* process,\\n\\n ThreadSystem* thread_system,\\n\\n MessageHandler* handler);\\n\\n\\n\",\n \"file_path\": \"pagespeed/system/controller_manager.h\",\n \"rank\": 90,\n \"score\": 107432.97416251394\n },\n {\n \"content\": \"// Encapsulates the instantiation of a FileRewriter & a simple one-shot\\n\\n// interface to rewrite some HTML text.\\n\\nclass StaticRewriter {\\n\\n public:\\n\\n StaticRewriter(const ProcessContext& process_context,\\n\\n int* argc, char*** argv);\\n\\n explicit StaticRewriter(const ProcessContext& process_context);\\n\\n ~StaticRewriter();\\n\\n\\n\\n bool ParseText(const StringPiece& text,\\n\\n const StringPiece& url,\\n\\n const StringPiece& id,\\n\\n const StringPiece& output_dir,\\n\\n Writer* writer);\\n\\n\\n\\n FileSystem* file_system();\\n\\n MessageHandler* message_handler();\\n\\n\\n\\n private:\\n\\n RewriteGflags gflags_;\\n\\n FileRewriter file_rewriter_;\\n\\n ServerContext* server_context_;\\n\\n\\n\\n DISALLOW_COPY_AND_ASSIGN(StaticRewriter);\\n\\n};\\n\\n\\n\\n} // namespace net_instaweb\\n\\n\\n\\n#endif // PAGESPEED_AUTOMATIC_STATIC_REWRITER_H_\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 91,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class Timer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/countdown_timer.h\",\n \"rank\": 92,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class ProcessContext;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 93,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class ServerContext;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 94,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class Writer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/kernel/base/message_handler.h\",\n \"rank\": 95,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class FileSystem;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 96,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class Timer;\\n\\n\\n\",\n \"file_path\": \"pagespeed/apache/apache_message_handler.h\",\n \"rank\": 97,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class MessageHandler;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 98,\n \"score\": 107427.92577306878\n },\n {\n \"content\": \"class RewriteOptions;\\n\",\n \"file_path\": \"pagespeed/automatic/static_rewriter.h\",\n \"rank\": 99,\n \"score\": 107427.92577306878\n }\n]","isConversational":false}}},{"rowIdx":387,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"lite/tnn/cv/tnn_rvm.cpp"},"repo_name":{"kind":"string","value":"azuredsky/lite.ai"},"commit":{"kind":"string","value":"2751a7f0cf0970c1ab94b865b96c2f53ee28d545"},"file_code":{"kind":"string","value":"\n\n#include \"tnn_rvm.h\"\n\nusing tnncv::TNNRobustVideoMatting;\n\nTNNRobustVideoMatting::TNNRobustVideoMatting(\n const std::string &_proto_path,\n const std::string &_model_path,\n unsigned int _num_threads\n) : proto_path(_proto_path.data()),\n model_path(_model_path.data()),\n log_id(_proto_path.data()),\n num_threads(_num_threads)\n{\n initialize_instance();\n initialize_context();\n}\n\nTNNRobustVideoMatting::~TNNRobustVideoMatting()\n{\n net = nullptr;\n src_mat = nullptr;\n r1i_mat = nullptr;\n r2i_mat = nullptr;\n r3i_mat = nullptr;\n r4i_mat = nullptr;\n instance = nullptr;\n}\n\nvoid TNNRobustVideoMatting::initialize_instance()\n{\n std::string proto_content_buffer, model_content_buffer;\n proto_content_buffer = BasicTNNHandler::content_buffer_from(proto_path);\n model_content_buffer = BasicTNNHandler::content_buffer_from(model_path);\n\n tnn::ModelConfig model_config;\n model_config.model_type = tnn::MODEL_TYPE_TNN;\n model_config.params = {proto_content_buffer, model_content_buffer};\n\n \n tnn::Status status;\n net = std::make_shared<tnn::TNN>();\n status = net->Init(model_config);\n if (status != tnn::TNN_OK || !net)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"net->Init failed!\\n\";\n#endif\n return;\n }\n \n \n#ifdef __ANDROID__\n network_device_type = tnn::DEVICE_ARM; \n input_device_type = tnn::DEVICE_ARM; \n output_device_type = tnn::DEVICE_ARM;\n#else\n network_device_type = tnn::DEVICE_X86; \n input_device_type = tnn::DEVICE_X86; \n output_device_type = tnn::DEVICE_X86;\n#endif\n \n tnn::NetworkConfig network_config;\n network_config.library_path = {\"\"};\n network_config.device_type = network_device_type;\n\n instance = net->CreateInst(network_config, status);\n if (status != tnn::TNN_OK || !instance)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"CreateInst failed!\" << status.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n instance->SetCpuNumThreads((int) num_threads);\n \n for (auto &name: input_names)\n input_shapes[name] = BasicTNNHandler::get_input_shape(instance, name);\n auto src_shape = input_shapes.at(\"src\");\n if (src_shape.size() != 4)\n {\n#ifdef LITETNN_DEBUG\n throw std::runtime_error(\"Found src_shape.size()!=4, but \"\n \"src input only support 4 dims.\"\n \"Such as NCHW, NHWC ...\");\n#else\n return;\n#endif\n }\n input_mat_type = BasicTNNHandler::get_input_mat_type(instance, \"src\");\n input_data_format = BasicTNNHandler::get_input_data_format(instance, \"src\");\n if (input_data_format == tnn::DATA_FORMAT_NCHW)\n {\n input_height = src_shape.at(2);\n input_width = src_shape.at(3);\n } \n else if (input_data_format == tnn::DATA_FORMAT_NHWC)\n {\n input_height = src_shape.at(1);\n input_width = src_shape.at(2);\n } \n else\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"src input only support NCHW and NHWC \"\n \"input_data_format, but found others.\\n\";\n#endif\n return;\n }\n src_size = 1 * 3 * input_height * input_width;\n \n for (auto &name: output_names)\n output_shapes[name] = BasicTNNHandler::get_output_shape(instance, name);\n#ifdef LITETNN_DEBUG\n this->print_debug_string();\n#endif\n}\n\nint TNNRobustVideoMatting::value_size_of(tnn::DimsVector &shape)\n{\n if (shape.empty()) return 0;\n int _size = 1;\n for (auto &s: shape) _size *= s;\n return _size;\n}\n\nvoid TNNRobustVideoMatting::print_debug_string()\n{\n std::cout << \"LITETNN_DEBUG LogId: \" << log_id << \"\\n\";\n std::cout << \"=============== Input-Dims ==============\\n\";\n for (auto &in: input_shapes)\n BasicTNNHandler::print_name_shape(in.first, in.second);\n std::string data_format_string =\n (input_data_format == tnn::DATA_FORMAT_NCHW) ? \"NCHW\" : \"NHWC\";\n std::cout << \"Input Data Format: \" << data_format_string << \"\\n\";\n std::cout << \"=============== Output-Dims ==============\\n\";\n for (auto &out: output_shapes)\n BasicTNNHandler::print_name_shape(out.first, out.second);\n std::cout << \"========================================\\n\";\n}\n\nvoid TNNRobustVideoMatting::initialize_context()\n{\n r1i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r1i\")\n );\n r2i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r2i\")\n );\n r3i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r3i\")\n );\n r4i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r4i\")\n );\n r1i_size = this->value_size_of(input_shapes.at(\"r1i\"));\n r2i_size = this->value_size_of(input_shapes.at(\"r2i\"));\n r3i_size = this->value_size_of(input_shapes.at(\"r3i\"));\n r4i_size = this->value_size_of(input_shapes.at(\"r4i\"));\n \n std::fill_n((float *) r1i_mat->GetData(), r1i_size, 0.f);\n std::fill_n((float *) r2i_mat->GetData(), r2i_size, 0.f);\n std::fill_n((float *) r3i_mat->GetData(), r3i_size, 0.f);\n std::fill_n((float *) r4i_mat->GetData(), r4i_size, 0.f);\n\n context_is_initialized = true;\n}\n\nvoid TNNRobustVideoMatting::transform(const cv::Mat &mat)\n{\n cv::Mat canvas;\n cv::resize(mat, canvas, cv::Size(input_width, input_height));\n cv::cvtColor(canvas, canvas, cv::COLOR_BGR2RGB);\n \n src_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::N8UC3,\n input_shapes.at(\"src\"),\n (void *) canvas.data\n );\n if (!src_mat->GetData())\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"input_mat == nullptr! transform failed\\n\";\n#endif\n }\n}\n\nvoid TNNRobustVideoMatting::detect(const cv::Mat &mat, types::MattingContent &content, bool video_mode)\n{\n if (mat.empty()) return;\n int img_h = mat.rows;\n int img_w = mat.cols;\n if (!context_is_initialized) return;\n\n \n this->transform(mat);\n \n tnn::MatConvertParam src_cvt_param, ctx_cvt_param;\n src_cvt_param.scale = scale_vals;\n src_cvt_param.bias = bias_vals;\n\n tnn::Status status_src, status_r1i, status_r2i, status_r3i, status_r4i;\n status_src = instance->SetInputMat(src_mat, src_cvt_param, \"src\");\n status_r1i = instance->SetInputMat(r1i_mat, ctx_cvt_param, \"r1i\");\n status_r2i = instance->SetInputMat(r2i_mat, ctx_cvt_param, \"r2i\");\n status_r3i = instance->SetInputMat(r3i_mat, ctx_cvt_param, \"r3i\");\n status_r4i = instance->SetInputMat(r4i_mat, ctx_cvt_param, \"r4i\");\n if (status_src != tnn::TNN_OK || status_r1i != tnn::TNN_OK ||\n status_r2i != tnn::TNN_OK || status_r3i != tnn::TNN_OK ||\n status_r4i != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->SetInputMat failed!:\"\n << status_src.description().c_str() << \": \"\n << status_r1i.description().c_str() << \": \"\n << status_r2i.description().c_str() << \": \"\n << status_r3i.description().c_str() << \": \"\n << status_r4i.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n auto status = instance->Forward();\n if (status != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->Forward failed!:\"\n << status.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n this->generate_matting(instance, content, img_h, img_w);\n \n if (video_mode)\n {\n context_is_update = false; \n this->update_context(instance);\n }\n\n}\n\nvoid TNNRobustVideoMatting::detect_video(\n const std::string &video_path, const std::string &output_path,\n std::vector<types::MattingContent> &contents, bool save_contents,\n unsigned int writer_fps)\n{\n\n cv::VideoCapture video_capture(video_path);\n const unsigned int width = video_capture.get(cv::CAP_PROP_FRAME_WIDTH);\n const unsigned int height = video_capture.get(cv::CAP_PROP_FRAME_HEIGHT);\n const unsigned int frame_count = video_capture.get(cv::CAP_PROP_FRAME_COUNT);\n if (!video_capture.isOpened())\n {\n std::cout << \"Can not open video: \" << video_path << \"\\n\";\n return;\n }\n \n cv::VideoWriter video_writer(output_path, cv::VideoWriter::fourcc('m', 'p', '4', 'v'),\n writer_fps, cv::Size(width, height));\n if (!video_writer.isOpened())\n {\n std::cout << \"Can not open writer: \" << output_path << \"\\n\";\n return;\n }\n\n \n cv::Mat mat;\n unsigned int i = 0;\n while (video_capture.read(mat))\n {\n i += 1;\n types::MattingContent content;\n this->detect(mat, content, true); \n \n if (content.flag)\n {\n if (save_contents) contents.push_back(content);\n if (!content.merge_mat.empty()) video_writer.write(content.merge_mat);\n }\n \n if (!context_is_update) break;\n#ifdef LITETNN_DEBUG\n std::cout << i << \"/\" << frame_count << \" done!\" << \"\\n\";\n#endif\n }\n\n \n video_capture.release();\n video_writer.release();\n}\n\nvoid TNNRobustVideoMatting::generate_matting(std::shared_ptr<tnn::Instance> &_instance,\n types::MattingContent &content,\n int img_h, int img_w)\n{\n std::shared_ptr<tnn::Mat> fgr_mat;\n std::shared_ptr<tnn::Mat> pha_mat;\n tnn::MatConvertParam cvt_param;\n tnn::Status status_fgr, status_pha;\n\n status_fgr = _instance->GetOutputMat(fgr_mat, cvt_param, \"fgr\", output_device_type);\n status_pha = _instance->GetOutputMat(pha_mat, cvt_param, \"pha\", output_device_type);\n\n if (status_fgr != tnn::TNN_OK || status_pha != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetOutputMat failed!:\"\n << status_fgr.description().c_str() << \": \"\n << status_pha.description().c_str() << \"\\n\";\n#endif\n return;\n }\n\n float *fgr_ptr = (float *) fgr_mat->GetData();\n float *pha_ptr = (float *) pha_mat->GetData();\n const unsigned int channel_step = input_height * input_width;\n\n \n cv::Mat rmat(input_height, input_width, CV_32FC1, fgr_ptr);\n cv::Mat gmat(input_height, input_width, CV_32FC1, fgr_ptr + channel_step);\n cv::Mat bmat(input_height, input_width, CV_32FC1, fgr_ptr + 2 * channel_step);\n cv::Mat pmat(input_height, input_width, CV_32FC1, pha_ptr); \n rmat *= 255.f;\n bmat *= 255.f;\n gmat *= 255.f;\n cv::Mat rest = 1.f - pmat;\n cv::Mat mbmat = bmat.mul(pmat) + rest * 153.f;\n cv::Mat mgmat = gmat.mul(pmat) + rest * 255.f;\n cv::Mat mrmat = rmat.mul(pmat) + rest * 120.f;\n std::vector<cv::Mat> fgr_channel_mats, merge_channel_mats;\n fgr_channel_mats.push_back(bmat);\n fgr_channel_mats.push_back(gmat);\n fgr_channel_mats.push_back(rmat);\n merge_channel_mats.push_back(mbmat);\n merge_channel_mats.push_back(mgmat);\n merge_channel_mats.push_back(mrmat);\n\n content.pha_mat = pmat;\n cv::merge(fgr_channel_mats, content.fgr_mat);\n cv::merge(merge_channel_mats, content.merge_mat);\n content.fgr_mat.convertTo(content.fgr_mat, CV_8UC3);\n content.merge_mat.convertTo(content.merge_mat, CV_8UC3);\n\n if (img_w != input_width || img_h != input_height)\n {\n cv::resize(content.pha_mat, content.pha_mat, cv::Size(img_w, img_h));\n cv::resize(content.fgr_mat, content.fgr_mat, cv::Size(img_w, img_h));\n cv::resize(content.merge_mat, content.merge_mat, cv::Size(img_w, img_h));\n }\n\n content.flag = true;\n}\n\nvoid TNNRobustVideoMatting::update_context(std::shared_ptr<tnn::Instance> &_instance)\n{\n std::shared_ptr<tnn::Mat> r1o_mat;\n std::shared_ptr<tnn::Mat> r2o_mat;\n std::shared_ptr<tnn::Mat> r3o_mat;\n std::shared_ptr<tnn::Mat> r4o_mat;\n tnn::MatConvertParam cvt_param;\n tnn::Status status_r1o;\n tnn::Status status_r2o;\n tnn::Status status_r3o;\n tnn::Status status_r4o;\n\n status_r1o = _instance->GetOutputMat(r1o_mat, cvt_param, \"r1o\", output_device_type);\n status_r2o = _instance->GetOutputMat(r2o_mat, cvt_param, \"r2o\", output_device_type);\n status_r3o = _instance->GetOutputMat(r3o_mat, cvt_param, \"r3o\", output_device_type);\n status_r4o = _instance->GetOutputMat(r4o_mat, cvt_param, \"r4o\", output_device_type);\n\n if (status_r1o != tnn::TNN_OK || status_r2o != tnn::TNN_OK ||\n status_r3o != tnn::TNN_OK || status_r4o != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetOutputMat context failed!:\"\n << status_r1o.description().c_str() << \": \"\n << status_r2o.description().c_str() << \": \"\n << status_r3o.description().c_str() << \": \"\n << status_r4o.description().c_str() << \"\\n\";\n#endif\n return;\n }\n void *command_queue = nullptr;\n auto status_cmd = _instance->GetCommandQueue(&command_queue);\n if (status_cmd != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetCommandQueue failed!:\"\n << status_cmd.description().c_str() << \"\\n\";\n#endif\n return;\n }\n\n tnn::MatUtils::Copy(*r1o_mat, *r1i_mat, command_queue);\n tnn::MatUtils::Copy(*r2o_mat, *r2i_mat, command_queue);\n tnn::MatUtils::Copy(*r3o_mat, *r3i_mat, command_queue);\n tnn::MatUtils::Copy(*r4o_mat, *r4i_mat, command_queue);\n\n context_is_update = true;\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#include \"tnn_rvm.h\"\n\nusing tnncv::TNNRobustVideoMatting;\n\nTNNRobustVideoMatting::TNNRobustVideoMatting(\n const std::string &_proto_path,\n const std::string &_model_path,\n unsigned int _num_threads\n) : proto_path(_proto_path.data()),\n model_path(_model_path.data()),\n log_id(_proto_path.data()),\n num_threads(_num_threads)\n{\n initialize_instance();\n initialize_context();\n}\n\nTNNRobustVideoMatting::~TNNRobustVideoMatting()\n{\n net = nullptr;\n src_mat = nullptr;\n r1i_mat = nullptr;\n r2i_mat = nullptr;\n r3i_mat = nullptr;\n r4i_mat = nullptr;\n instance = nullptr;\n}\n\nvoid TNNRobustVideoMatting::initialize_instance()\n{\n std::string proto_content_buffer, model_content_buffer;\n proto_content_buffer = BasicTNNHandler::content_buffer_from(proto_path);\n model_content_buffer = BasicTNNHandler::content_buffer_from(model_path);\n\n tnn::ModelConfig model_config;\n model_config.model_type = tnn::MODEL_TYPE_TNN;\n model_config.params = {proto_content_buffer, model_content_buffer};\n\n \n tnn::Status status;\n net = std::make_shared<tnn::TNN>();\n status = net->Init(model_config);\n if (status != tnn::TNN_OK || !net)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"net->Init failed!\\n\";\n#endif\n return;\n }\n \n \n#ifdef __ANDROID__\n network_device_type = tnn::DEVICE_ARM; \n input_device_type = tnn::DEVICE_ARM; \n output_device_type = tnn::DEVICE_ARM;\n#else\n network_device_type = tnn::DEVICE_X86; \n input_device_type = tnn::DEVICE_X86; \n output_device_type = tnn::DEVICE_X86;\n#endif\n \n tnn::NetworkConfig network_config;\n network_config.library_path = {\"\"};\n network_config.device_type = network_device_type;\n\n instance = net->CreateInst(network_config, status);\n if (status != tnn::TNN_OK || !instance)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"CreateInst failed!\" << status.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n instance->SetCpuNumThreads((int) num_threads);\n \n for (auto &name: input_names)\n input_shapes[name] = BasicTNNHandler::get_input_shape(instance, name);\n auto src_shape = input_shapes.at(\"src\");\n if (src_shape.size() != 4)\n {\n#ifdef LITETNN_DEBUG\n throw std::runtime_error(\"Found src_shape.size()!=4, but \"\n \"src input only support 4 dims.\"\n \"Such as NCHW, NHWC ...\");\n#else\n return;\n#endif\n }\n input_mat_type = BasicTNNHandler::get_input_mat_type(instance, \"src\");\n input_data_format = BasicTNNHandler::get_input_data_format(instance, \"src\");\n if (input_data_format == tnn::DATA_FORMAT_NCHW)\n {\n input_height = src_shape.at(2);\n input_width = src_shape.at(3);\n } \n else if (input_data_format == tnn::DATA_FORMAT_NHWC)\n {\n input_height = src_shape.at(1);\n input_width = src_shape.at(2);\n } \n "},"suffix":{"kind":"string","value":"\n\nint TNNRobustVideoMatting::value_size_of(tnn::DimsVector &shape)\n{\n if (shape.empty()) return 0;\n int _size = 1;\n for (auto &s: shape) _size *= s;\n return _size;\n}\n\nvoid TNNRobustVideoMatting::print_debug_string()\n{\n std::cout << \"LITETNN_DEBUG LogId: \" << log_id << \"\\n\";\n std::cout << \"=============== Input-Dims ==============\\n\";\n for (auto &in: input_shapes)\n BasicTNNHandler::print_name_shape(in.first, in.second);\n std::string data_format_string =\n (input_data_format == tnn::DATA_FORMAT_NCHW) ? \"NCHW\" : \"NHWC\";\n std::cout << \"Input Data Format: \" << data_format_string << \"\\n\";\n std::cout << \"=============== Output-Dims ==============\\n\";\n for (auto &out: output_shapes)\n BasicTNNHandler::print_name_shape(out.first, out.second);\n std::cout << \"========================================\\n\";\n}\n\nvoid TNNRobustVideoMatting::initialize_context()\n{\n r1i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r1i\")\n );\n r2i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r2i\")\n );\n r3i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r3i\")\n );\n r4i_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::NCHW_FLOAT,\n input_shapes.at(\"r4i\")\n );\n r1i_size = this->value_size_of(input_shapes.at(\"r1i\"));\n r2i_size = this->value_size_of(input_shapes.at(\"r2i\"));\n r3i_size = this->value_size_of(input_shapes.at(\"r3i\"));\n r4i_size = this->value_size_of(input_shapes.at(\"r4i\"));\n \n std::fill_n((float *) r1i_mat->GetData(), r1i_size, 0.f);\n std::fill_n((float *) r2i_mat->GetData(), r2i_size, 0.f);\n std::fill_n((float *) r3i_mat->GetData(), r3i_size, 0.f);\n std::fill_n((float *) r4i_mat->GetData(), r4i_size, 0.f);\n\n context_is_initialized = true;\n}\n\nvoid TNNRobustVideoMatting::transform(const cv::Mat &mat)\n{\n cv::Mat canvas;\n cv::resize(mat, canvas, cv::Size(input_width, input_height));\n cv::cvtColor(canvas, canvas, cv::COLOR_BGR2RGB);\n \n src_mat = std::make_shared<tnn::Mat>(\n input_device_type,\n tnn::N8UC3,\n input_shapes.at(\"src\"),\n (void *) canvas.data\n );\n if (!src_mat->GetData())\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"input_mat == nullptr! transform failed\\n\";\n#endif\n }\n}\n\nvoid TNNRobustVideoMatting::detect(const cv::Mat &mat, types::MattingContent &content, bool video_mode)\n{\n if (mat.empty()) return;\n int img_h = mat.rows;\n int img_w = mat.cols;\n if (!context_is_initialized) return;\n\n \n this->transform(mat);\n \n tnn::MatConvertParam src_cvt_param, ctx_cvt_param;\n src_cvt_param.scale = scale_vals;\n src_cvt_param.bias = bias_vals;\n\n tnn::Status status_src, status_r1i, status_r2i, status_r3i, status_r4i;\n status_src = instance->SetInputMat(src_mat, src_cvt_param, \"src\");\n status_r1i = instance->SetInputMat(r1i_mat, ctx_cvt_param, \"r1i\");\n status_r2i = instance->SetInputMat(r2i_mat, ctx_cvt_param, \"r2i\");\n status_r3i = instance->SetInputMat(r3i_mat, ctx_cvt_param, \"r3i\");\n status_r4i = instance->SetInputMat(r4i_mat, ctx_cvt_param, \"r4i\");\n if (status_src != tnn::TNN_OK || status_r1i != tnn::TNN_OK ||\n status_r2i != tnn::TNN_OK || status_r3i != tnn::TNN_OK ||\n status_r4i != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->SetInputMat failed!:\"\n << status_src.description().c_str() << \": \"\n << status_r1i.description().c_str() << \": \"\n << status_r2i.description().c_str() << \": \"\n << status_r3i.description().c_str() << \": \"\n << status_r4i.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n auto status = instance->Forward();\n if (status != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->Forward failed!:\"\n << status.description().c_str() << \"\\n\";\n#endif\n return;\n }\n \n this->generate_matting(instance, content, img_h, img_w);\n \n if (video_mode)\n {\n context_is_update = false; \n this->update_context(instance);\n }\n\n}\n\nvoid TNNRobustVideoMatting::detect_video(\n const std::string &video_path, const std::string &output_path,\n std::vector<types::MattingContent> &contents, bool save_contents,\n unsigned int writer_fps)\n{\n\n cv::VideoCapture video_capture(video_path);\n const unsigned int width = video_capture.get(cv::CAP_PROP_FRAME_WIDTH);\n const unsigned int height = video_capture.get(cv::CAP_PROP_FRAME_HEIGHT);\n const unsigned int frame_count = video_capture.get(cv::CAP_PROP_FRAME_COUNT);\n if (!video_capture.isOpened())\n {\n std::cout << \"Can not open video: \" << video_path << \"\\n\";\n return;\n }\n \n cv::VideoWriter video_writer(output_path, cv::VideoWriter::fourcc('m', 'p', '4', 'v'),\n writer_fps, cv::Size(width, height));\n if (!video_writer.isOpened())\n {\n std::cout << \"Can not open writer: \" << output_path << \"\\n\";\n return;\n }\n\n \n cv::Mat mat;\n unsigned int i = 0;\n while (video_capture.read(mat))\n {\n i += 1;\n types::MattingContent content;\n this->detect(mat, content, true); \n \n if (content.flag)\n {\n if (save_contents) contents.push_back(content);\n if (!content.merge_mat.empty()) video_writer.write(content.merge_mat);\n }\n \n if (!context_is_update) break;\n#ifdef LITETNN_DEBUG\n std::cout << i << \"/\" << frame_count << \" done!\" << \"\\n\";\n#endif\n }\n\n \n video_capture.release();\n video_writer.release();\n}\n\nvoid TNNRobustVideoMatting::generate_matting(std::shared_ptr<tnn::Instance> &_instance,\n types::MattingContent &content,\n int img_h, int img_w)\n{\n std::shared_ptr<tnn::Mat> fgr_mat;\n std::shared_ptr<tnn::Mat> pha_mat;\n tnn::MatConvertParam cvt_param;\n tnn::Status status_fgr, status_pha;\n\n status_fgr = _instance->GetOutputMat(fgr_mat, cvt_param, \"fgr\", output_device_type);\n status_pha = _instance->GetOutputMat(pha_mat, cvt_param, \"pha\", output_device_type);\n\n if (status_fgr != tnn::TNN_OK || status_pha != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetOutputMat failed!:\"\n << status_fgr.description().c_str() << \": \"\n << status_pha.description().c_str() << \"\\n\";\n#endif\n return;\n }\n\n float *fgr_ptr = (float *) fgr_mat->GetData();\n float *pha_ptr = (float *) pha_mat->GetData();\n const unsigned int channel_step = input_height * input_width;\n\n \n cv::Mat rmat(input_height, input_width, CV_32FC1, fgr_ptr);\n cv::Mat gmat(input_height, input_width, CV_32FC1, fgr_ptr + channel_step);\n cv::Mat bmat(input_height, input_width, CV_32FC1, fgr_ptr + 2 * channel_step);\n cv::Mat pmat(input_height, input_width, CV_32FC1, pha_ptr); \n rmat *= 255.f;\n bmat *= 255.f;\n gmat *= 255.f;\n cv::Mat rest = 1.f - pmat;\n cv::Mat mbmat = bmat.mul(pmat) + rest * 153.f;\n cv::Mat mgmat = gmat.mul(pmat) + rest * 255.f;\n cv::Mat mrmat = rmat.mul(pmat) + rest * 120.f;\n std::vector<cv::Mat> fgr_channel_mats, merge_channel_mats;\n fgr_channel_mats.push_back(bmat);\n fgr_channel_mats.push_back(gmat);\n fgr_channel_mats.push_back(rmat);\n merge_channel_mats.push_back(mbmat);\n merge_channel_mats.push_back(mgmat);\n merge_channel_mats.push_back(mrmat);\n\n content.pha_mat = pmat;\n cv::merge(fgr_channel_mats, content.fgr_mat);\n cv::merge(merge_channel_mats, content.merge_mat);\n content.fgr_mat.convertTo(content.fgr_mat, CV_8UC3);\n content.merge_mat.convertTo(content.merge_mat, CV_8UC3);\n\n if (img_w != input_width || img_h != input_height)\n {\n cv::resize(content.pha_mat, content.pha_mat, cv::Size(img_w, img_h));\n cv::resize(content.fgr_mat, content.fgr_mat, cv::Size(img_w, img_h));\n cv::resize(content.merge_mat, content.merge_mat, cv::Size(img_w, img_h));\n }\n\n content.flag = true;\n}\n\nvoid TNNRobustVideoMatting::update_context(std::shared_ptr<tnn::Instance> &_instance)\n{\n std::shared_ptr<tnn::Mat> r1o_mat;\n std::shared_ptr<tnn::Mat> r2o_mat;\n std::shared_ptr<tnn::Mat> r3o_mat;\n std::shared_ptr<tnn::Mat> r4o_mat;\n tnn::MatConvertParam cvt_param;\n tnn::Status status_r1o;\n tnn::Status status_r2o;\n tnn::Status status_r3o;\n tnn::Status status_r4o;\n\n status_r1o = _instance->GetOutputMat(r1o_mat, cvt_param, \"r1o\", output_device_type);\n status_r2o = _instance->GetOutputMat(r2o_mat, cvt_param, \"r2o\", output_device_type);\n status_r3o = _instance->GetOutputMat(r3o_mat, cvt_param, \"r3o\", output_device_type);\n status_r4o = _instance->GetOutputMat(r4o_mat, cvt_param, \"r4o\", output_device_type);\n\n if (status_r1o != tnn::TNN_OK || status_r2o != tnn::TNN_OK ||\n status_r3o != tnn::TNN_OK || status_r4o != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetOutputMat context failed!:\"\n << status_r1o.description().c_str() << \": \"\n << status_r2o.description().c_str() << \": \"\n << status_r3o.description().c_str() << \": \"\n << status_r4o.description().c_str() << \"\\n\";\n#endif\n return;\n }\n void *command_queue = nullptr;\n auto status_cmd = _instance->GetCommandQueue(&command_queue);\n if (status_cmd != tnn::TNN_OK)\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"instance->GetCommandQueue failed!:\"\n << status_cmd.description().c_str() << \"\\n\";\n#endif\n return;\n }\n\n tnn::MatUtils::Copy(*r1o_mat, *r1i_mat, command_queue);\n tnn::MatUtils::Copy(*r2o_mat, *r2i_mat, command_queue);\n tnn::MatUtils::Copy(*r3o_mat, *r3i_mat, command_queue);\n tnn::MatUtils::Copy(*r4o_mat, *r4i_mat, command_queue);\n\n context_is_update = true;\n}\n\n"},"middle":{"kind":"string","value":"else\n {\n#ifdef LITETNN_DEBUG\n std::cout << \"src input only support NCHW and NHWC \"\n \"input_data_format, but found others.\\n\";\n#endif\n return;\n }\n src_size = 1 * 3 * input_height * input_width;\n \n for (auto &name: output_names)\n output_shapes[name] = BasicTNNHandler::get_output_shape(instance, name);\n#ifdef LITETNN_DEBUG\n this->print_debug_string();\n#endif\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"enum Dimensionformat { NHWC, NC4HW4, NCHW };\n","file_path":"MNN/expr/Expr.hpp","rank":0,"score":159329.26997513027},{"content":"function should be prototyped as void Foo(int,void\\*); , where the first parameter is the trackbar\n\nposition and the second parameter is the user data (see the next parameter). If the callback is\n\nthe NULL pointer, no callbacks are called, but only value is updated.\n\n@param userdata User data that is passed as is to the callback. It can be used to handle trackbar\n\nevents without using global variables.\n\n */\n\nCV_EXPORTS int createTrackbar(const String& trackbarname, const String& winname,\n\n int* value, int count,\n\n TrackbarCallback onChange = 0,\n\n void* userdata = 0);\n\n\n\n/** @brief Returns the trackbar position.\n\n\n\nThe function returns the current position of the specified trackbar.\n\n\n\n@note\n\n\n\n[__Qt Backend Only__] winname can be empty if the trackbar is attached to the control\n\npanel.\n\n\n","file_path":"opencv2/highgui.hpp","rank":1,"score":142770.72483673278},{"content":"function use the rational model and return 8 coefficients. If the flag is not set, the\n","file_path":"opencv2/calib3d.hpp","rank":2,"score":119248.57970633352},{"content":"struct Accumulator<unsigned int> { typedef float Type; };\n\ntemplate<>\n","file_path":"opencv2/flann/dist.h","rank":3,"score":118857.05111997866},{"content":"class NCNN_EXPORT Net\n\n{\n\npublic:\n\n // empty init\n\n Net();\n\n // clear and destroy\n\n virtual ~Net();\n\n\n\npublic:\n\n // option can be changed before loading\n\n Option opt;\n\n\n\n#if NCNN_VULKAN\n\n // set gpu device by index\n\n void set_vulkan_device(int device_index);\n\n\n\n // set gpu device by device handle, no owner transfer\n\n void set_vulkan_device(const VulkanDevice* vkdev);\n\n\n\n const VulkanDevice* vulkan_device() const;\n","file_path":"ncnn/net.h","rank":4,"score":108503.44064376353},{"content":"class Net;\n","file_path":"ncnn/paramdict.h","rank":5,"score":104565.93619895207},{"content":" struct\n\n {\n\n int size;\n\n int step;\n\n }\n","file_path":"opencv2/core/types_c.h","rank":6,"score":101100.630041141},{"content":" halide_dimension_t *dim;\n","file_path":"MNN/HalideRuntime.h","rank":7,"score":101100.630041141},{"content":" DeviceId Id() const {\n\n return device_id;\n","file_path":"onnxruntime/core/framework/ortdevice.h","rank":8,"score":99323.46716096142},{"content":" _In_reads_(input_len) const OrtValue* const* input, size_t input_len,\n","file_path":"onnxruntime/core/session/onnxruntime_c_api.h","rank":9,"score":97716.76308585136},{"content":" ORT_API2_STATUS(AddInitializer, _Inout_ OrtSessionOptions* options, _In_z_ const char* name,\n","file_path":"onnxruntime/core/session/onnxruntime_c_api.h","rank":10,"score":97694.09064123848},{"content":"struct MemoryAllocation {\n\n MemoryAllocation(OrtAllocator* allocator, void* p, size_t size);\n\n ~MemoryAllocation();\n\n MemoryAllocation(const MemoryAllocation&) = delete;\n\n MemoryAllocation& operator=(const MemoryAllocation&) = delete;\n\n MemoryAllocation(MemoryAllocation&&);\n\n MemoryAllocation& operator=(MemoryAllocation&&);\n\n\n\n void* get() { return p_; }\n","file_path":"onnxruntime/core/session/onnxruntime_cxx_api.h","rank":11,"score":96172.87408570621},{"content":"function return value).\n\n@param flags Flag that can take values of cv::KmeansFlags .\n\n\n\n@return\n\n - Compactness measure that is computed as\n\n\\f[\\sum _i \\| \\texttt{samples} _i - \\texttt{centers} _{ \\texttt{labels} _i} \\| ^2\\f]\n\nafter every attempt. The best (minimum) value is chosen and the corresponding labels and the\n\ncompactness value are returned by the function.\n\n - Integer array that stores the cluster indices for every sample.\n\n - Array of the cluster centers.\n\n*/\n\nGAPI_EXPORTS std::tuple<GOpaque<double>,GMat,GMat>\n\nkmeans(const GMat& data, const int K, const GMat& bestLabels,\n\n const TermCriteria& criteria, const int attempts, const KmeansFlags flags);\n\n\n\n/** @overload\n\n@note\n\n - Function textual ID is \"org.opencv.core.kmeansNDNoInit\"\n\n - #KMEANS_USE_INITIAL_LABELS flag must not be set while using this overload.\n\n */\n","file_path":"opencv2/gapi/core.hpp","rank":12,"score":91606.9756278658},{"content":"function either returns false (when quiet=true) or throws an exception.\n\n@param a input array.\n\n@param quiet a flag, indicating whether the functions quietly return false when the array elements\n\nare out of range or they throw an exception.\n\n@param pos optional output parameter, when not NULL, must be a pointer to array of src.dims\n\nelements.\n\n@param minVal inclusive lower boundary of valid values range.\n\n@param maxVal exclusive upper boundary of valid values range.\n\n*/\n\nCV_EXPORTS_W bool checkRange(InputArray a, bool quiet = true, CV_OUT Point* pos = 0,\n\n double minVal = -DBL_MAX, double maxVal = DBL_MAX);\n\n\n\n/** @brief converts NaNs to the given number\n\n@param a input/output matrix (CV_32F type).\n\n@param val value to convert the NaNs\n\n*/\n\nCV_EXPORTS_W void patchNaNs(InputOutputArray a, double val = 0);\n\n\n\n/** @brief Performs generalized matrix multiplication.\n\n\n","file_path":"opencv2/core.hpp","rank":13,"score":89293.70926575267},{"content":" _In_reads_(input_len) const char* const* input_names,\n","file_path":"onnxruntime/core/session/onnxruntime_c_api.h","rank":14,"score":86245.56047989702},{"content":" _Inout_ OrtSessionOptions* options, _In_ const char* dim_name,\n","file_path":"onnxruntime/core/session/onnxruntime_c_api.h","rank":15,"score":86243.81580132537},{"content":" class CV_EXPORTS_W_SIMPLE Net\n\n {\n\n public:\n\n\n\n CV_WRAP Net(); //!< Default constructor.\n\n CV_WRAP ~Net(); //!< Destructor frees the net only if there aren't references to the net anymore.\n\n\n\n /** @brief Create a network from Intel's Model Optimizer intermediate representation (IR).\n\n * @param[in] xml XML configuration file with network's topology.\n\n * @param[in] bin Binary file with trained weights.\n\n * Networks imported from Intel's Model Optimizer are launched in Intel's Inference Engine\n\n * backend.\n\n */\n\n CV_WRAP static Net readFromModelOptimizer(const String& xml, const String& bin);\n\n\n\n /** @brief Create a network from Intel's Model Optimizer in-memory buffers with intermediate representation (IR).\n\n * @param[in] bufferModelConfig buffer with model's configuration.\n\n * @param[in] bufferWeights buffer with model's trained weights.\n\n * @returns Net object.\n\n */\n","file_path":"opencv2/dnn/dnn.hpp","rank":16,"score":85847.97196217277},{"content":"#define ONNX_OPERATOR_KERNEL_EX(name, domain, ver, provider, builder, ...) \\\n\n class ONNX_OPERATOR_KERNEL_CLASS_NAME(provider, domain, ver, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_KERNEL_CLASS_NAME(provider, domain, ver, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(ver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\n#define ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name) \\\n\n provider##_##name##_##domain##_ver##startver##_##endver\n\n\n\n#define ONNX_CPU_OPERATOR_VERSIONED_KERNEL(name, startver, endver, builder, ...) \\\n\n ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, kOnnxDomain, startver, endver, kCpuExecutionProvider, builder, __VA_ARGS__)\n\n\n\n#define ONNX_CPU_OPERATOR_VERSIONED_ML_KERNEL(name, startver, endver, builder, ...) \\\n\n ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, kMLDomain, startver, endver, kCpuExecutionProvider, builder, __VA_ARGS__)\n\n\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":17,"score":84109.61194348108},{"content":"function returns the rotated rectangle structure that includes the object position, size, and\n\norientation. The next position of the search window can be obtained with RotatedRect::boundingRect()\n\n\n\nSee the OpenCV sample camshiftdemo.c that tracks colored objects.\n\n\n\n@note\n\n- (Python) A sample explaining the camshift tracking algorithm can be found at\n\n opencv_source_code/samples/python/camshift.py\n\n */\n\nCV_EXPORTS_W RotatedRect CamShift( InputArray probImage, CV_IN_OUT Rect& window,\n\n TermCriteria criteria );\n\n/** @example samples/cpp/camshiftdemo.cpp\n\nAn example using the mean-shift tracking algorithm\n\n*/\n\n\n\n/** @brief Finds an object on a back projection image.\n\n\n\n@param probImage Back projection of the object histogram. See calcBackProject for details.\n\n@param window Initial search window.\n\n@param criteria Stop criteria for the iterative search algorithm.\n","file_path":"opencv2/video/tracking.hpp","rank":18,"score":83413.6985961282},{"content":" // This enum is utilized mostly by GArray and GOpaque to store and recognize their internal data\n\n // types (aka Host type). Also it is widely used during serialization routine.\n\n enum class OpaqueKind: int\n\n {\n\n CV_UNKNOWN, // Unknown, generic, opaque-to-GAPI data type unsupported in graph seriallization\n\n CV_BOOL, // bool user G-API data\n\n CV_INT, // int user G-API data\n\n CV_DOUBLE, // double user G-API data\n\n CV_FLOAT, // float user G-API data\n\n CV_UINT64, // uint64_t user G-API data\n\n CV_STRING, // std::string user G-API data\n\n CV_POINT, // cv::Point user G-API data\n\n CV_POINT2F, // cv::Point2f user G-API data\n\n CV_SIZE, // cv::Size user G-API data\n\n CV_RECT, // cv::Rect user G-API data\n\n CV_SCALAR, // cv::Scalar user G-API data\n\n CV_MAT, // cv::Mat user G-API data\n\n CV_DRAW_PRIM, // cv::gapi::wip::draw::Prim user G-API data\n\n };\n\n\n\n // Type traits helper which simplifies the extraction of kind from type\n\n template<typename T> struct GOpaqueTraits;\n","file_path":"opencv2/gapi/gcommon.hpp","rank":19,"score":83204.86074518146},{"content":"// This definition is here because it is reused by both public(?) and internal\n\n// modules. Keeping it here wouldn't expose public details (e.g., API-level)\n\n// to components which are internal and operate on a lower-level entities\n\n// (e.g., compiler, backends).\n\n// FIXME: merge with ArgKind?\n\n// FIXME: replace with variant[format desc]?\n\nenum class GShape: int\n\n{\n\n GMAT,\n\n GSCALAR,\n\n GARRAY,\n\n GOPAQUE,\n\n GFRAME,\n\n};\n\n\n\nnamespace gapi {\n\nnamespace s11n {\n\nnamespace detail {\n\ntemplate<typename T> struct wrap_serialize;\n\n} // namespace detail\n\n} // namespace s11n\n\n} // namespace gapi\n\n\n\n\n","file_path":"opencv2/gapi/gcommon.hpp","rank":20,"score":83199.03222977163},{"content":"enum class MediaFormat: int\n\n{\n\n BGR = 0,\n\n NV12,\n\n};\n\n\n\n/**\n\n * \\addtogroup gapi_meta_args\n\n * @{\n\n */\n","file_path":"opencv2/gapi/gframe.hpp","rank":21,"score":83199.03222977163},{"content":"enum class TraitAs: int\n\n{\n\n TENSOR, //!< G-API traits an associated cv::Mat as a raw tensor and passes dimensions as-is\n\n IMAGE //!< G-API traits an associated cv::Mat as an image so creates an \"image\" blob (NCHW/NHWC, etc)\n\n};\n\n\n\nusing IEConfig = std::map<std::string, std::string>;\n\n\n\nnamespace detail {\n\n struct ParamDesc {\n\n std::string model_path;\n\n std::string weights_path;\n\n std::string device_id;\n\n\n\n // NB: Here order follows the `Net` API\n\n std::vector<std::string> input_names;\n\n std::vector<std::string> output_names;\n\n\n\n using ConstInput = std::pair<cv::Mat, TraitAs>;\n\n std::unordered_map<std::string, ConstInput> const_inputs;\n\n\n\n // NB: nun_* may differ from topology's real input/output port numbers\n\n // (e.g. topology's partial execution)\n\n std::size_t num_in; // How many inputs are defined in the operation\n\n std::size_t num_out; // How many outputs are defined in the operation\n\n\n","file_path":"opencv2/gapi/infer/ie.hpp","rank":22,"score":83199.03222977163},{"content":"enum class TraitAs: int {\n\n TENSOR, //!< G-API traits an associated cv::Mat as a raw tensor\n\n // and passes dimensions as-is\n\n IMAGE //!< G-API traits an associated cv::Mat as an image so\n\n // creates an \"image\" blob (NCHW/NHWC, etc)\n\n};\n\n\n\nusing PostProc = std::function<void(const std::unordered_map<std::string, cv::Mat> &,\n\n std::unordered_map<std::string, cv::Mat> &)>;\n\n\n\n\n\nnamespace detail {\n","file_path":"opencv2/gapi/infer/onnx.hpp","rank":23,"score":83199.03222977163},{"content":" // FIXME: These traits and enum and possible numerous switch(kind)\n\n // block may be replaced with a special Handler<T> object or with\n\n // a double dispatch\n\n enum class ArgKind: int\n\n {\n\n OPAQUE_VAL, // Unknown, generic, opaque-to-GAPI data type - STATIC\n\n // Note: OPAQUE is sometimes defined in Win sys headers\n\n#if !defined(OPAQUE) && !defined(CV_DOXYGEN)\n\n OPAQUE = OPAQUE_VAL, // deprecated value used for compatibility, use OPAQUE_VAL instead\n\n#endif\n\n GOBJREF, // <internal> reference to object\n\n GMAT, // a cv::GMat\n\n GMATP, // a cv::GMatP\n\n GFRAME, // a cv::GFrame\n\n GSCALAR, // a cv::GScalar\n\n GARRAY, // a cv::GArrayU (note - exactly GArrayU, not GArray<T>!)\n\n GOPAQUE, // a cv::GOpaqueU (note - exactly GOpaqueU, not GOpaque<T>!)\n\n };\n\n\n\n // Describe G-API types (G-types) with traits. Mostly used by\n\n // cv::GArg to store meta information about types passed into\n\n // operation arguments. Please note that cv::GComputation is\n\n // defined on GProtoArgs, not GArgs!\n","file_path":"opencv2/gapi/gtype_traits.hpp","rank":24,"score":81444.35000810632},{"content":"#define ONNX_OPERATOR_TYPED_KERNEL_EX(name, domain, ver, type, provider, builder, ...) \\\n\n class ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(ver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\n#define ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name) \\\n\n provider##_##name##_##domain##_ver##ver##_##type1##_##type2\n\n\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":25,"score":79375.74572507264},{"content":"#define ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, domain, startver, endver, provider, builder, ...) \\\n\n class ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(startver, endver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\n#define ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name) \\\n\n provider##_##name##_##domain##_ver##ver##_##type\n\n\n\n#define ONNX_CPU_OPERATOR_TYPED_KERNEL(name, ver, type, builder, ...) \\\n\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kOnnxDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\n\n\n\n#define ONNX_CPU_OPERATOR_TYPED_ML_KERNEL(name, ver, type, builder, ...) \\\n\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kMLDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\n\n\n\n#define ONNX_CPU_OPERATOR_TYPED_MS_KERNEL(name, ver, type, builder, ...) \\\n\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kMSDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\n\n\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":26,"score":79375.74572507264},{"content":" class LITE_EXPORTS BoundingBoxType<int, float>;\n\n\n\n template\n","file_path":"lite/types.h","rank":27,"score":77891.90458141497},{"content":"struct Accumulator<int> { typedef float Type; };\n\n\n\n#undef True\n\n#undef False\n\n\n","file_path":"opencv2/flann/dist.h","rank":28,"score":76745.9537691839},{"content":"#define ONNX_OPERATOR_TWO_TYPED_KERNEL_EX(name, domain, ver, type1, type2, provider, builder, ...) \\\n\n class ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(ver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\n#define ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type, name) \\\n\n provider##_##name##_##domain##_ver##startver##_##endver##_##type\n\n\n\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_KERNEL(name, startver, endver, type, builder, ...) \\\n\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kOnnxDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\n\n __VA_ARGS__)\n\n\n\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_ML_KERNEL(name, startver, endver, type, builder, ...) \\\n\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kMLDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\n\n __VA_ARGS__)\n\n\n\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_MS_KERNEL(name, startver, endver, type, builder, ...) \\\n\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kMSDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\n\n __VA_ARGS__)\n\n\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":29,"score":75202.65131138577},{"content":"#define ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, domain, startver, endver, type, provider, builder, ...) \\\n\n class ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, \\\n\n type, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(startver, endver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\n#define ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type1, type2, name) \\\n\n provider##_##name##_##domain##_ver##startver##_##endver##_##type1##_##type2\n\n\n\n#define ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_EX(name, domain, startver, endver, type1, type2, \\\n\n provider, builder, ...) \\\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":30,"score":75202.65131138577},{"content":" class GAPI_EXPORTS Priv; // internal use only\n\n Priv& priv(); // internal use only\n\n const Priv& priv() const; // internal use only\n\n\n\nprivate:\n\n std::unique_ptr<Priv> m_priv;\n\n const Cache* m_cache;\n\n};\n\n\n\n} // namespace cv::gapi::fluid\n\n} // namespace cv::gapi\n\n} // namespace cv\n\n\n\n#endif // OPENCV_GAPI_FLUID_BUFFER_HPP\n","file_path":"opencv2/gapi/fluid/gfluidbuffer.hpp","rank":31,"score":73365.80486320899},{"content":"type deserialize(const std::vector<char> &p) {\n\n return detail::getRunArgsWithRMats<RMatAdapterType>(p);\n\n}\n\n} // namespace gapi\n\n} // namespace cv\n\n\n\nnamespace cv {\n\nnamespace gapi {\n\nnamespace s11n {\n","file_path":"opencv2/gapi/s11n.hpp","rank":32,"score":72574.05552337898},{"content":"// Variant that only ever allows const access to nodes and optionally allows filtering of the nodes.\n\nclass ConstGraphNodes : public ValidNodes<const std::vector<std::unique_ptr<Node>>> {\n\n public:\n\n ConstGraphNodes(const std::vector<std::unique_ptr<Node>>& nodes) : ValidNodes(nodes) {\n\n }\n\n\n\n ConstGraphNodes(const std::vector<std::unique_ptr<Node>>& nodes,\n\n GraphNodes::NodeFilterFunc&& filter_func)\n\n : ValidNodes(nodes, std::move(filter_func)) {\n\n }\n\n};\n\n\n\n} // namespace onnxruntime\n","file_path":"onnxruntime/core/graph/graph_nodes.h","rank":33,"score":71944.30663099543},{"content":" class ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type1, type2, name); \\\n\n template <> \\\n\n KernelCreateInfo \\\n\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, \\\n\n type1, type2, name)>() { \\\n\n return KernelCreateInfo( \\\n\n builder.SetName(#name) \\\n\n .SetDomain(domain) \\\n\n .SinceVersion(startver, endver) \\\n\n .Provider(provider) \\\n\n .Build(), \\\n\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\n\n }\n\n\n\ntemplate <typename... Types>\n","file_path":"onnxruntime/core/framework/op_kernel.h","rank":34,"score":71481.9134841609},{"content":"class NetPrivate;\n","file_path":"ncnn/net.h","rank":35,"score":70795.82197608595},{"content":"class PUBLIC Instance {\n\npublic:\n\n Instance(NetworkConfig& net_config, ModelConfig& model_config);\n\n\n\n ~Instance();\n\n\n\n // init with model interpeter and inputs shape.\n\n Status Init(std::shared_ptr<AbstractModelInterpreter> interpreter, InputShapesMap inputs_shape);\n\n\n\n // init with model interpeter, min inputs shape and max inputs shape.\n\n Status Init(std::shared_ptr<AbstractModelInterpreter> interpreter, InputShapesMap min_inputs_shape, InputShapesMap max_inputs_shape);\n\n\n\n // deinit, release network\n\n Status DeInit();\n\n\n\n // return memory bytes required for forward\n\n Status GetForwardMemorySize(int& memory_size);\n\n\n\n // set memory to tnn instance. if success, return status code zero.\n\n // only instance created with SHARE_MEMORY_MODE_SET_FROM_EXTERNAL can be set from external.\n","file_path":"tnn/core/instance.h","rank":36,"score":68960.45406286124},{"content":"struct Depth< Range > { enum { value = Depth<int>::value }; };\n\ntemplate<>\n","file_path":"opencv2/core/types.hpp","rank":37,"score":67388.19123058612},{"content":"type for the input array should be either np.int32 or np.float32.\n\n\n\n@sa contourArea, arcLength\n\n */\n\nCV_EXPORTS_W Moments moments( InputArray array, bool binaryImage = false );\n\n\n\n/** @brief Calculates seven Hu invariants.\n\n\n\nThe function calculates seven Hu invariants (introduced in @cite Hu62; see also\n\n<http://en.wikipedia.org/wiki/Image_moment>) defined as:\n\n\n\n\\f[\\begin{array}{l} hu[0]= \\eta _{20}+ \\eta _{02} \\\\ hu[1]=( \\eta _{20}- \\eta _{02})^{2}+4 \\eta _{11}^{2} \\\\ hu[2]=( \\eta _{30}-3 \\eta _{12})^{2}+ (3 \\eta _{21}- \\eta _{03})^{2} \\\\ hu[3]=( \\eta _{30}+ \\eta _{12})^{2}+ ( \\eta _{21}+ \\eta _{03})^{2} \\\\ hu[4]=( \\eta _{30}-3 \\eta _{12})( \\eta _{30}+ \\eta _{12})[( \\eta _{30}+ \\eta _{12})^{2}-3( \\eta _{21}+ \\eta _{03})^{2}]+(3 \\eta _{21}- \\eta _{03})( \\eta _{21}+ \\eta _{03})[3( \\eta _{30}+ \\eta _{12})^{2}-( \\eta _{21}+ \\eta _{03})^{2}] \\\\ hu[5]=( \\eta _{20}- \\eta _{02})[( \\eta _{30}+ \\eta _{12})^{2}- ( \\eta _{21}+ \\eta _{03})^{2}]+4 \\eta _{11}( \\eta _{30}+ \\eta _{12})( \\eta _{21}+ \\eta _{03}) \\\\ hu[6]=(3 \\eta _{21}- \\eta _{03})( \\eta _{21}+ \\eta _{03})[3( \\eta _{30}+ \\eta _{12})^{2}-( \\eta _{21}+ \\eta _{03})^{2}]-( \\eta _{30}-3 \\eta _{12})( \\eta _{21}+ \\eta _{03})[3( \\eta _{30}+ \\eta _{12})^{2}-( \\eta _{21}+ \\eta _{03})^{2}] \\\\ \\end{array}\\f]\n\n\n\nwhere \\f$\\eta_{ji}\\f$ stands for \\f$\\texttt{Moments::nu}_{ji}\\f$ .\n\n\n\nThese values are proved to be invariants to the image scale, rotation, and reflection except the\n\nseventh one, whose sign is changed by reflection. This invariance is proved with the assumption of\n\ninfinite image resolution. In case of raster images, the computed Hu invariants for the original and\n\ntransformed images are a bit different.\n\n\n","file_path":"opencv2/imgproc.hpp","rank":38,"score":64338.868590093596},{"content":" function may return even if the copy operation is not finished.\n\n\n\n The copy operation may be overlapped with operations in other non-default streams if \\p stream is\n\n not the default stream and \\p dst is HostMem allocated with HostMem::PAGE_LOCKED option.\n\n */\n\n CV_WRAP void download(OutputArray dst, Stream& stream) const;\n\n\n\n //! returns deep copy of the GpuMat, i.e. the data is copied\n\n CV_WRAP GpuMat clone() const;\n\n\n\n //! copies the GpuMat content to device memory (Blocking call)\n\n CV_WRAP void copyTo(OutputArray dst) const;\n\n\n\n //! copies the GpuMat content to device memory (Non-Blocking call)\n\n CV_WRAP void copyTo(OutputArray dst, Stream& stream) const;\n\n\n\n //! copies those GpuMat elements to \"m\" that are marked with non-zero mask elements (Blocking call)\n\n CV_WRAP void copyTo(OutputArray dst, InputArray mask) const;\n\n\n\n //! copies those GpuMat elements to \"m\" that are marked with non-zero mask elements (Non-Blocking call)\n","file_path":"opencv2/core/cuda.hpp","rank":39,"score":64338.37061219402},{"content":"function does not copy src itself but simply constructs the border, for example:\n\n\n\n@code{.cpp}\n\n // let border be the same in all directions\n\n int border=2;\n\n // constructs a larger image to fit both the image and the border\n\n Mat gray_buf(rgb.rows + border*2, rgb.cols + border*2, rgb.depth());\n\n // select the middle part of it w/o copying data\n\n Mat gray(gray_canvas, Rect(border, border, rgb.cols, rgb.rows));\n\n // convert image from RGB to grayscale\n\n cvtColor(rgb, gray, COLOR_RGB2GRAY);\n\n // form a border in-place\n\n copyMakeBorder(gray, gray_buf, border, border,\n\n border, border, BORDER_REPLICATE);\n\n // now do some custom filtering ...\n\n ...\n\n@endcode\n\n@note When the source image is a part (ROI) of a bigger image, the function will try to use the\n\npixels outside of the ROI to form a border. To disable this feature and always do extrapolation, as\n\nif src was not a ROI, use borderType | #BORDER_ISOLATED.\n","file_path":"opencv2/core.hpp","rank":40,"score":63772.394104729254},{"content":" class ConstIterator {\n\n public:\n\n using const_iterator = typename Container::const_iterator;\n\n using iterator_category = std::input_iterator_tag;\n\n using value_type = T*;\n\n using difference_type = std::ptrdiff_t;\n\n using pointer = T**;\n\n using reference = T*&;\n\n\n\n /** Construct iterator for container that will return const T* entries.*/\n\n explicit ConstIterator(const_iterator position) noexcept : current_{position}, item_{nullptr} {}\n\n ConstIterator(const ConstIterator& other) = default;\n\n ConstIterator& operator=(const ConstIterator& other) = default;\n\n\n\n bool operator==(const ConstIterator& other) const noexcept { return current_ == other.current_; }\n\n bool operator!=(const ConstIterator& other) const noexcept { return current_ != other.current_; }\n\n\n\n ConstIterator& operator++() {\n\n ++current_;\n\n return *this;\n","file_path":"onnxruntime/core/common/const_pointer_container.h","rank":41,"score":63746.71299371178},{"content":"class MNN_PUBLIC AutoTime : Timer {\n\npublic:\n\n AutoTime(int line, const char* func);\n\n ~AutoTime();\n\n AutoTime(const AutoTime&) = delete;\n\n AutoTime(const AutoTime&&) = delete;\n\n AutoTime& operator=(const AutoTime&) = delete;\n\n AutoTime& operator=(const AutoTime&&) = delete;\n\n\n\nprivate:\n\n int mLine;\n\n char* mName;\n\n};\n\n} // namespace MNN\n\n\n\n#ifdef MNN_OPEN_TIME_TRACE\n\n#define AUTOTIME MNN::AutoTime ___t(__LINE__, __func__)\n\n#else\n\n#define AUTOTIME\n\n#endif\n\n\n\n#endif /* AutoTime_hpp */\n","file_path":"MNN/AutoTime.hpp","rank":42,"score":62193.890287877526},{"content":"class PUBLIC DimsVectorUtils {\n\npublic:\n\n // @brief all dims product, [start_index, end_index)\n\n // @param dims\n\n static int Count(const DimsVector &dims, int start_index = 0, int end_index = -1);\n\n\n\n // @brief max of dims0 and dims1, [start_index, end_index)\n\n static DimsVector Max(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\n\n\n\n // @brief min of dims0 and dims1, [start_index, end_index)\n\n static DimsVector Min(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\n\n\n\n // @brief equal of dims0 and dims1, [start_index, end_index)\n\n static bool Equal(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\n\n \n\n // @brief NCHW dims vector to NHWC dims vector\n\n static DimsVector NCHW2NHWC(const DimsVector &dims);\n\n\n\n // @brief NHWC dims vector to NCHW\n\n static DimsVector NHWC2NCHW(const DimsVector &dims);\n\n};\n\n\n\n} // namespace TNN_NS\n\n\n\n#endif // TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\n","file_path":"tnn/utils/dims_vector_utils.h","rank":43,"score":62188.333772142934},{"content":"class ConstPointerContainer {\n\n public:\n\n using T = typename std::remove_pointer<typename Container::value_type>::type;\n\n\n","file_path":"onnxruntime/core/common/const_pointer_container.h","rank":44,"score":62181.800322964555},{"content":"\n\n // convenient load network weight data from android asset model file\n\n int load_model(AAsset* asset);\n\n int load_model(AAssetManager* mgr, const char* assetpath);\n\n#endif // __ANDROID_API__ >= 9\n\n#endif // NCNN_PLATFORM_API\n\n\n\n // unload network structure and weight data\n\n void clear();\n\n\n\n // construct an Extractor from network\n\n Extractor create_extractor() const;\n\n\n\n // get input/output indexes/names\n\n const std::vector<int>& input_indexes() const;\n\n const std::vector<int>& output_indexes() const;\n\n#if NCNN_STRING\n\n const std::vector<const char*>& input_names() const;\n\n const std::vector<const char*>& output_names() const;\n\n#endif\n","file_path":"ncnn/net.h","rank":45,"score":62116.46463681968},{"content":" int extract(int blob_index, Mat& feat, int type = 0);\n\n\n\n#if NCNN_VULKAN\n\n#if NCNN_STRING\n\n // set input by blob name\n\n // return 0 if success\n\n int input(const char* blob_name, const VkMat& in);\n\n\n\n // get result by blob name\n\n // return 0 if success\n\n int extract(const char* blob_name, VkMat& feat, VkCompute& cmd);\n\n\n\n // set input by blob name\n\n // return 0 if success\n\n int input(const char* blob_name, const VkImageMat& in);\n\n\n\n // get result by blob name\n\n // return 0 if success\n\n int extract(const char* blob_name, VkImageMat& feat, VkCompute& cmd);\n\n#endif // NCNN_STRING\n","file_path":"ncnn/net.h","rank":46,"score":62114.717380012655},{"content":"#if NCNN_STRING\n\n // set input by blob name\n\n // return 0 if success\n\n int input(const char* blob_name, const Mat& in);\n\n\n\n // get result by blob name\n\n // return 0 if success\n\n // type = 0, default\n\n // type = 1, do not convert fp16/bf16 or / and packing\n\n int extract(const char* blob_name, Mat& feat, int type = 0);\n\n#endif // NCNN_STRING\n\n\n\n // set input by blob index\n\n // return 0 if success\n\n int input(int blob_index, const Mat& in);\n\n\n\n // get result by blob index\n\n // return 0 if success\n\n // type = 0, default\n\n // type = 1, do not convert fp16/bf16 or / and packing\n","file_path":"ncnn/net.h","rank":47,"score":62114.29048418305},{"content":"\n\n const std::vector<Blob>& blobs() const;\n\n const std::vector<Layer*>& layers() const;\n\n\n\n std::vector<Blob>& mutable_blobs();\n\n std::vector<Layer*>& mutable_layers();\n\n\n\nprotected:\n\n friend class Extractor;\n\n#if NCNN_STRING\n\n int find_blob_index_by_name(const char* name) const;\n\n int find_layer_index_by_name(const char* name) const;\n\n virtual int custom_layer_to_index(const char* type);\n\n virtual Layer* create_custom_layer(const char* type);\n\n#endif // NCNN_STRING\n\n virtual Layer* create_custom_layer(int index);\n\n\n\nprivate:\n\n Net(const Net&);\n\n Net& operator=(const Net&);\n\n\n\nprivate:\n\n NetPrivate* const d;\n\n};\n\n\n","file_path":"ncnn/net.h","rank":48,"score":62113.91248618529},{"content":"// Tencent is pleased to support the open source community by making ncnn available.\n\n//\n\n// Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.\n\n//\n\n// Licensed under the BSD 3-Clause License (the \"License\"); you may not use this file except\n\n// in compliance with the License. You may obtain a copy of the License at\n\n//\n\n// https://opensource.org/licenses/BSD-3-Clause\n\n//\n\n// Unless required by applicable law or agreed to in writing, software distributed\n\n// under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\n\n// specific language governing permissions and limitations under the License.\n\n\n\n#ifndef NCNN_NET_H\n\n#define NCNN_NET_H\n\n\n\n#include \"blob.h\"\n\n#include \"layer.h\"\n\n#include \"mat.h\"\n","file_path":"ncnn/net.h","rank":49,"score":62112.293172215635},{"content":"\n\n // set input by blob index\n\n // return 0 if success\n\n int input(int blob_index, const VkMat& in);\n\n\n\n // get result by blob index\n\n // return 0 if success\n\n int extract(int blob_index, VkMat& feat, VkCompute& cmd);\n\n\n\n // set input by blob index\n\n // return 0 if success\n\n int input(int blob_index, const VkImageMat& in);\n\n\n\n // get result by blob index\n\n // return 0 if success\n\n int extract(int blob_index, VkImageMat& feat, VkCompute& cmd);\n\n#endif // NCNN_VULKAN\n\n\n\nprotected:\n\n friend Extractor Net::create_extractor() const;\n","file_path":"ncnn/net.h","rank":50,"score":62111.51672710917},{"content":"#endif // NCNN_VULKAN\n\n\n\n#if NCNN_STRING\n\n // register custom layer by layer type name\n\n // return 0 if success\n\n int register_custom_layer(const char* type, layer_creator_func creator, layer_destroyer_func destroyer = 0, void* userdata = 0);\n\n#endif // NCNN_STRING\n\n // register custom layer by layer type\n\n // return 0 if success\n\n int register_custom_layer(int index, layer_creator_func creator, layer_destroyer_func destroyer = 0, void* userdata = 0);\n\n\n\n#if NCNN_STRING\n\n int load_param(const DataReader& dr);\n\n#endif // NCNN_STRING\n\n\n\n int load_param_bin(const DataReader& dr);\n\n\n\n int load_model(const DataReader& dr);\n\n\n\n#if NCNN_STDIO\n","file_path":"ncnn/net.h","rank":51,"score":62109.298508097534},{"content":" // return bytes consumed\n\n int load_param(const unsigned char* mem);\n\n\n\n // reference network weight data from external memory\n\n // weight data is not copied but referenced\n\n // so external memory should be retained when used\n\n // memory pointer must be 32-bit aligned\n\n // return bytes consumed\n\n int load_model(const unsigned char* mem);\n\n\n\n#if NCNN_PLATFORM_API\n\n#if __ANDROID_API__ >= 9\n\n#if NCNN_STRING\n\n // convenient load network structure from android asset plain param file\n\n int load_param(AAsset* asset);\n\n int load_param(AAssetManager* mgr, const char* assetpath);\n\n#endif // NCNN_STRING\n\n // convenient load network structure from android asset binary param file\n\n int load_param_bin(AAsset* asset);\n\n int load_param_bin(AAssetManager* mgr, const char* assetpath);\n","file_path":"ncnn/net.h","rank":52,"score":62108.475742931245},{"content":" // this will overwrite the global setting\n\n // default count is system depended\n\n void set_num_threads(int num_threads);\n\n\n\n // set blob memory allocator\n\n void set_blob_allocator(Allocator* allocator);\n\n\n\n // set workspace memory allocator\n\n void set_workspace_allocator(Allocator* allocator);\n\n\n\n#if NCNN_VULKAN\n\n void set_vulkan_compute(bool enable);\n\n\n\n void set_blob_vkallocator(VkAllocator* allocator);\n\n\n\n void set_workspace_vkallocator(VkAllocator* allocator);\n\n\n\n void set_staging_vkallocator(VkAllocator* allocator);\n\n#endif // NCNN_VULKAN\n\n\n","file_path":"ncnn/net.h","rank":53,"score":62104.20540597123},{"content":" Extractor(const Net* net, size_t blob_count);\n\n\n\nprivate:\n\n ExtractorPrivate* const d;\n\n};\n\n\n\n} // namespace ncnn\n\n\n\n#endif // NCNN_NET_H\n","file_path":"ncnn/net.h","rank":54,"score":62100.41192088727},{"content":"#include \"option.h\"\n\n#include \"platform.h\"\n\n\n\n#if NCNN_PLATFORM_API\n\n#if __ANDROID_API__ >= 9\n\n#include <android/asset_manager.h>\n\n#endif // __ANDROID_API__ >= 9\n\n#endif // NCNN_PLATFORM_API\n\n\n\nnamespace ncnn {\n\n\n\n#if NCNN_VULKAN\n","file_path":"ncnn/net.h","rank":55,"score":62100.09800414842},{"content":"#if NCNN_STRING\n\n // load network structure from plain param file\n\n // return 0 if success\n\n int load_param(FILE* fp);\n\n int load_param(const char* protopath);\n\n int load_param_mem(const char* mem);\n\n#endif // NCNN_STRING\n\n // load network structure from binary param file\n\n // return 0 if success\n\n int load_param_bin(FILE* fp);\n\n int load_param_bin(const char* protopath);\n\n\n\n // load network weight data from model file\n\n // return 0 if success\n\n int load_model(FILE* fp);\n\n int load_model(const char* modelpath);\n\n#endif // NCNN_STDIO\n\n\n\n // load network structure from external memory\n\n // memory pointer must be 32-bit aligned\n","file_path":"ncnn/net.h","rank":56,"score":62099.87841061977},{"content":"struct Type< Range > { enum { value = CV_MAKETYPE(Depth<int>::value, 2) }; };\n\n} // namespace\n\n\n\n\n\n//////////////////////////////// Scalar_ ///////////////////////////////\n\n\n\n/** @brief Template class for a 4-element vector derived from Vec.\n\n\n\nBeing derived from Vec\\<_Tp, 4\\> , Scalar\\_ and Scalar can be used just as typical 4-element\n\nvectors. In addition, they can be converted to/from CvScalar . The type Scalar is widely used in\n\nOpenCV to pass pixel values.\n\n*/\n\ntemplate<typename _Tp> class Scalar_ : public Vec<_Tp, 4>\n\n{\n\npublic:\n\n //! default constructor\n\n Scalar_();\n\n Scalar_(_Tp v0, _Tp v1, _Tp v2=0, _Tp v3=0);\n\n Scalar_(_Tp v0);\n\n\n","file_path":"opencv2/core/types.hpp","rank":57,"score":61382.054358225774},{"content":"//! @cond IGNORED\n\n// FIXIT Remove this (especially CV_EXPORTS modifier)\n\nstruct CV_EXPORTS Matx_AddOp { Matx_AddOp() {} Matx_AddOp(const Matx_AddOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":58,"score":60193.23708298516},{"content":"struct CV_EXPORTS Matx_TOp { Matx_TOp() {} Matx_TOp(const Matx_TOp&) {} };\n\n//! @endcond\n\n\n\n/** @brief Template class for small matrices whose type and size are known at compilation time\n\n\n\nIf you need a more flexible type, use Mat . The elements of the matrix M are accessible using the\n\nM(i,j) notation. Most of the common matrix operations (see also @ref MatrixExpressions ) are\n\navailable. To do an operation on Matx that is not implemented, you can easily convert the matrix to\n\nMat and backwards:\n\n@code{.cpp}\n\n Matx33f m(1, 2, 3,\n\n 4, 5, 6,\n\n 7, 8, 9);\n\n cout << sum(Mat(m*m.t())) << endl;\n\n@endcode\n\nExcept of the plain constructor which takes a list of elements, Matx can be initialized from a C-array:\n\n@code{.cpp}\n\n float values[] = { 1, 2, 3};\n\n Matx31f m(values);\n\n@endcode\n","file_path":"opencv2/core/matx.hpp","rank":59,"score":60193.23708298516},{"content":"struct CV_EXPORTS Matx_ScaleOp { Matx_ScaleOp() {} Matx_ScaleOp(const Matx_ScaleOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":60,"score":60193.23708298516},{"content":"struct CV_EXPORTS Matx_MulOp { Matx_MulOp() {} Matx_MulOp(const Matx_MulOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":61,"score":60193.23708298516},{"content":"struct CV_EXPORTS Matx_SubOp { Matx_SubOp() {} Matx_SubOp(const Matx_SubOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":62,"score":60193.23708298516},{"content":"struct CV_EXPORTS Matx_DivOp { Matx_DivOp() {} Matx_DivOp(const Matx_DivOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":63,"score":60193.23708298516},{"content":" // the memory size need >= GetForwardMemorySize().\n\n // releasing or otherwise using the memory for other purposes during the tnn network run\n\n // will result in undefined behavior.\n\n Status SetForwardMemory(void* memory);\n\n\n\n // reshape instance with new input shapes\n\n Status Reshape(const InputShapesMap& inputs);\n\n\n\n // get tnn command queue\n\n Status GetCommandQueue(void** command_queue);\n\n \n\n // @brief share command queue with another instance\n\n // @param instance to share command queue\n\n Status ShareCommandQueue(Instance *instance);\n\n\n\n // @brief tnn instance network infer, it will wait until all layer infer complete.\n\n Status Forward();\n\n\n\n#ifdef FORWARD_CALLBACK_ENABLE\n\n // tnn instance network infer with callback to get blob info\n","file_path":"tnn/core/instance.h","rank":64,"score":59288.81088190687},{"content":"// Tencent is pleased to support the open source community by making TNN available.\n\n//\n\n// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.\n\n//\n\n// Licensed under the BSD 3-Clause License (the \"License\"); you may not use this file except\n\n// in compliance with the License. You may obtain a copy of the License at\n\n//\n\n// https://opensource.org/licenses/BSD-3-Clause\n\n//\n\n// Unless required by applicable law or agreed to in writing, software distributed\n\n// under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\n\n// specific language governing permissions and limitations under the License.\n\n\n\n#ifndef TNN_INCLUDE_TNN_CORE_INSTANCE_H_\n\n#define TNN_INCLUDE_TNN_CORE_INSTANCE_H_\n\n\n\n#include <functional>\n\n#include <memory>\n\n#include <vector>\n","file_path":"tnn/core/instance.h","rank":65,"score":59286.326370883646},{"content":"\n\n#if TNN_PROFILE\n\npublic:\n\n /**start to profile each layer, dont call this func if you only want to profile the whole mode*/\n\n void StartProfile();\n\n /**finish profile each layer and show result*/\n\n std::string FinishProfile(bool do_print = false);\n\n#endif\n\n\n\nprivate:\n\n std::shared_ptr<AbstractModelInterpreter> interpreter_ = nullptr;\n\n std::shared_ptr<AbstractNetwork> network_ = nullptr;\n\n std::shared_ptr<AbstractNetwork> const_folder_ = nullptr;\n\n NetworkConfig net_config_;\n\n ModelConfig model_config_;\n\n \n\n AbstractNetwork *GetNetwork();\n\n \n\n //Mat interface for simple use\n\npublic:\n","file_path":"tnn/core/instance.h","rank":66,"score":59285.71574162249},{"content":" // set input Mat, if input_name is not set, take the first input as default\n\n Status SetInputMat(std::shared_ptr<Mat> mat,\n\n MatConvertParam param,\n\n std::string input_name = \"\");\n\n \n\n // get output Mat, if output_name is not set, take the first output as default\n\n Status GetOutputMat(std::shared_ptr<Mat>& mat,\n\n MatConvertParam param = MatConvertParam(),\n\n std::string output_name = \"\",\n\n DeviceType device = DEVICE_ARM, MatType mat_type = NCHW_FLOAT);\n\n \n\nprivate:\n\n // input converter\n\n std::map<std::string, std::shared_ptr<BlobConverter>> input_converters_ = {};\n\n\n\n // output converter\n\n std::map<std::string, std::shared_ptr<BlobConverter>> output_converters_ = {};\n\n\n\n // output mat\n\n std::map<std::string, std::shared_ptr<Mat>> output_mats_ = {};\n","file_path":"tnn/core/instance.h","rank":67,"score":59283.260672564684},{"content":" // output mat convert status\n\n std::map<std::string, int> output_mats_convert_status_ = {};\n\n};\n\n\n\n} // namespace TNN_NS\n\n\n\n#pragma warning(pop)\n\n\n\n#endif // TNN_INCLUDE_TNN_CORE_INSTANCE_H_\n","file_path":"tnn/core/instance.h","rank":68,"score":59282.8160712113},{"content":" Status ForwardWithCallback(BlobStatisticCallback before, BlobStatisticCallback after);\n\n#endif // end of FORWARD_CALLBACK_ENABLE\n\n\n\n#ifdef GET_INTERP_ENABLE\n\n // get model interpreter\n\n std::shared_ptr<AbstractModelInterpreter> GetInterpreter();\n\n#endif // end of GET_INTERP_ENABLE\n\n\n\n // tnn instance network infer async.\n\n // device gpu, all layer infer complete will call Callback.\n\n Status ForwardAsync(Callback call_back);\n\n\n\n // get all input blobs\n\n Status GetAllInputBlobs(BlobMap& blobs);\n\n\n\n // get all output blobs\n\n Status GetAllOutputBlobs(BlobMap& blobs);\n\n\n\n // set threads run on cpu\n\n Status SetCpuNumThreads(int num_threads);\n","file_path":"tnn/core/instance.h","rank":69,"score":59279.18429368589},{"content":"\n\n#include \"tnn/core/blob.h\"\n\n#include \"tnn/core/common.h\"\n\n#include \"tnn/core/macro.h\"\n\n#include \"tnn/core/status.h\"\n\n#include \"tnn/utils/blob_converter.h\"\n\n\n\n#pragma warning(push)\n\n#pragma warning(disable : 4251)\n\n\n\nnamespace TNN_NS {\n\n\n","file_path":"tnn/core/instance.h","rank":70,"score":59274.085280534106},{"content":"class MatConstIterator_ : public MatConstIterator\n\n{\n\npublic:\n\n typedef _Tp value_type;\n\n typedef ptrdiff_t difference_type;\n\n typedef const _Tp* pointer;\n\n typedef const _Tp& reference;\n\n\n\n typedef std::random_access_iterator_tag iterator_category;\n\n\n\n //! default constructor\n\n MatConstIterator_();\n\n //! constructor that sets the iterator to the beginning of the matrix\n\n MatConstIterator_(const Mat_<_Tp>* _m);\n\n //! constructor that sets the iterator to the specified element of the matrix\n\n MatConstIterator_(const Mat_<_Tp>* _m, int _row, int _col=0);\n\n //! constructor that sets the iterator to the specified element of the matrix\n\n MatConstIterator_(const Mat_<_Tp>* _m, Point _pt);\n\n //! constructor that sets the iterator to the specified element of the matrix\n\n MatConstIterator_(const Mat_<_Tp>* _m, const int* _idx);\n","file_path":"opencv2/core/mat.hpp","rank":71,"score":59271.68895543124},{"content":"class Extractor;\n","file_path":"ncnn/net.h","rank":72,"score":59187.11008487533},{"content":" class LITE_EXPORTS HRNet; // [67] reference: https://github.com/HRNet/HRNet-Facial-Landmark-Detection\n","file_path":"lite/ort/core/ort_core.h","rank":73,"score":58294.117268425},{"content":"struct CV_EXPORTS Matx_MatMulOp { Matx_MatMulOp() {} Matx_MatMulOp(const Matx_MatMulOp&) {} };\n","file_path":"opencv2/core/matx.hpp","rank":74,"score":56916.74502884897},{"content":"//\n\n// AutoTime.hpp\n\n// MNN\n\n//\n\n// Created by MNN on 2018/07/27.\n\n// Copyright © 2018, Alibaba Group Holding Limited\n\n//\n\n\n\n#ifndef AutoTime_hpp\n\n#define AutoTime_hpp\n\n\n\n#include <stdint.h>\n\n#include <stdio.h>\n\n#include <MNN/MNNDefine.h>\n\n\n\nnamespace MNN {\n\n\n","file_path":"MNN/AutoTime.hpp","rank":75,"score":56636.51935501077},{"content":"#endif // NCNN_VULKAN\n\nclass DataReader;\n","file_path":"ncnn/net.h","rank":76,"score":56548.446825630796},{"content":"#if NCNN_VULKAN\n\nclass VkCompute;\n","file_path":"ncnn/net.h","rank":77,"score":56541.51605871881},{"content":"class ExtractorPrivate;\n","file_path":"ncnn/net.h","rank":78,"score":56541.51605871881},{"content":"# include <opencv2/gapi/own/mat.hpp>\n\n// replacement of cv's structures:\n\nnamespace cv {\n\n using Rect = gapi::own::Rect;\n\n using Size = gapi::own::Size;\n\n using Point = gapi::own::Point;\n\n using Point2f = gapi::own::Point2f;\n\n using Scalar = gapi::own::Scalar;\n\n using Mat = gapi::own::Mat;\n\n} // namespace cv\n\n#endif // !defined(GAPI_STANDALONE)\n\n\n\n#endif // OPENCV_GAPI_OPENCV_INCLUDES_HPP\n","file_path":"opencv2/gapi/opencv_includes.hpp","rank":79,"score":54213.659508752935},{"content":"// Tencent is pleased to support the open source community by making TNN available.\n\n//\n\n// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.\n\n//\n\n// Licensed under the BSD 3-Clause License (the \"License\"); you may not use this file except\n\n// in compliance with the License. You may obtain a copy of the License at\n\n//\n\n// https://opensource.org/licenses/BSD-3-Clause\n\n//\n\n// Unless required by applicable law or agreed to in writing, software distributed\n\n// under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\n\n// specific language governing permissions and limitations under the License.\n\n\n\n#ifndef TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\n\n#define TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\n\n\n\n#include <algorithm>\n\n\n\n#include \"tnn/core/common.h\"\n\n#include \"tnn/core/macro.h\"\n\n#include \"tnn/core/status.h\"\n\n\n\nnamespace TNN_NS {\n\n\n","file_path":"tnn/utils/dims_vector_utils.h","rank":80,"score":54213.534685270264},{"content":"// This file is part of OpenCV project.\n\n// It is subject to the license terms in the LICENSE file found in the top-level directory\n\n// of this distribution and at http://opencv.org/license.html.\n\n//\n\n// Copyright (C) 2018 Intel Corporation\n\n\n\n\n\n#ifndef OPENCV_GAPI_UTIL_THROW_HPP\n\n#define OPENCV_GAPI_UTIL_THROW_HPP\n\n\n\n#include <utility> // std::forward\n\n\n\n#if !defined(__EXCEPTIONS)\n\n#include <stdlib.h>\n\n#include <stdio.h>\n\n#endif\n\n\n\nnamespace cv\n\n{\n\nnamespace util\n","file_path":"opencv2/gapi/util/throw.hpp","rank":81,"score":54212.61694712113},{"content":"{\n\ntemplate <class ExceptionType>\n\n[[noreturn]] void throw_error(ExceptionType &&e)\n\n{\n\n#if defined(__EXCEPTIONS) || defined(_CPPUNWIND)\n\n throw std::forward<ExceptionType>(e);\n\n#else\n\n fprintf(stderr, \"An exception thrown! %s\\n\" , e.what());\n\n fflush(stderr);\n\n abort();\n\n#endif\n\n}\n\n} // namespace util\n\n} // namespace cv\n\n\n\n#endif // OPENCV_GAPI_UTIL_THROW_HPP\n","file_path":"opencv2/gapi/util/throw.hpp","rank":82,"score":54210.06956052039},{"content":"// This file is part of OpenCV project.\n\n\n\n// It is subject to the license terms in the LICENSE file found in the top-level directory\n\n// of this distribution and at http://opencv.org/license.html.\n\n//\n\n// Copyright (C) 2018 Intel Corporation\n\n\n\n\n\n#ifndef OPENCV_GAPI_OPENCV_INCLUDES_HPP\n\n#define OPENCV_GAPI_OPENCV_INCLUDES_HPP\n\n\n\n#if !defined(GAPI_STANDALONE)\n\n# include <opencv2/core/mat.hpp>\n\n# include <opencv2/core/cvdef.h>\n\n# include <opencv2/core/types.hpp>\n\n# include <opencv2/core/base.hpp>\n\n#else // Without OpenCV\n\n# include <opencv2/gapi/own/cvdefs.hpp>\n\n# include <opencv2/gapi/own/types.hpp> // cv::gapi::own::Rect/Size/Point\n\n# include <opencv2/gapi/own/scalar.hpp> // cv::gapi::own::Scalar\n","file_path":"opencv2/gapi/opencv_includes.hpp","rank":83,"score":54207.296511486944},{"content":"struct LayerInfo;\n\n\n\n#ifdef FORWARD_CALLBACK_ENABLE\n\ntypedef std::function<void(std::vector<Blob*>& blobs, LayerInfo* info)> BlobStatisticCallback;\n\n#endif // end of FORWARD_CALLBACK_ENABLE\n\n\n","file_path":"tnn/core/instance.h","rank":84,"score":54194.48420536921},{"content":"class AbstractNetwork;\n","file_path":"tnn/core/instance.h","rank":85,"score":54194.48420536921},{"content":"class NCNN_EXPORT Extractor\n\n{\n\npublic:\n\n virtual ~Extractor();\n\n\n\n // copy\n\n Extractor(const Extractor&);\n\n\n\n // assign\n\n Extractor& operator=(const Extractor&);\n\n\n\n // clear blob mats and alloctors\n\n void clear();\n\n\n\n // enable light mode\n\n // intermediate blob will be recycled when enabled\n\n // enabled by default\n\n void set_light_mode(bool enable);\n\n\n\n // set thread count for this extractor\n","file_path":"ncnn/net.h","rank":86,"score":54122.31251157698},{"content":" }\n\n\n\n ConstIterator operator++(int) {\n\n ConstIterator tmp{*this};\n\n ++(*this);\n\n return tmp;\n\n }\n\n\n\n const T*& operator*() const {\n\n item_ = *current_;\n\n return item_;\n\n }\n\n\n\n const T** operator->() const { return &(operator*()); };\n\n\n\n private:\n\n const_iterator current_;\n\n mutable const T* item_;\n\n };\n\n\n","file_path":"onnxruntime/core/common/const_pointer_container.h","rank":87,"score":51977.77755741198},{"content":"// Copyright (c) Microsoft Corporation. All rights reserved.\n\n// Licensed under the MIT License.\n\n\n\n#pragma once\n\n\n\n#include <type_traits>\n\n\n\nnamespace onnxruntime {\n\n/**\n\n Container has T* entries. e.g. std::vector<T*>, and this class provides const access to those\n\n via iterators and direct access, as the standard behavior only makes the pointer constant,\n\n and not what is pointed too. i.e. you get a const pointer to T not a pointer to const T without this wrapper.\n\n See https://stackoverflow.com/questions/8017036/understanding-const-iterator-with-pointers\n\n*/\n\ntemplate <typename Container>\n","file_path":"onnxruntime/core/common/const_pointer_container.h","rank":88,"score":51974.47695941491},{"content":" /**\n\n Construct wrapper class that will provide const access to the pointers in a container of non-const pointers.\n\n @param data Container with non-const pointers. e.g. std::vector<T*>\n\n */\n\n explicit ConstPointerContainer(const Container& data) noexcept : data_(data) {}\n\n\n\n size_t size() const noexcept { return data_.size(); }\n\n bool empty() const noexcept { return data_.empty(); }\n\n\n\n ConstIterator cbegin() const noexcept { return ConstIterator(data_.cbegin()); }\n\n ConstIterator cend() const noexcept { return ConstIterator(data_.cend()); }\n\n\n\n ConstIterator begin() const noexcept { return ConstIterator(data_.cbegin()); }\n\n ConstIterator end() const noexcept { return ConstIterator(data_.cend()); }\n\n\n\n const T* operator[](size_t index) const { return data_[index]; }\n\n\n\n const T* at(size_t index) const {\n\n ORT_ENFORCE(index < data_.size());\n\n return data_[index];\n\n }\n\n\n\n private:\n\n const Container& data_;\n\n};\n\n} // namespace onnxruntime\n","file_path":"onnxruntime/core/common/const_pointer_container.h","rank":89,"score":51972.97142582076},{"content":"```\n\n\n\n* 实现 `transform` 和 `detect` 方法.\n\n\n\n```c++\n\n#include \"age_googlenet.h\"\n\n#include \"ort/core/ort_utils.h\"\n\n\n\nusing ortcv::AgeGoogleNet;\n\n\n\nort::Value AgeGoogleNet::transform(const cv::Mat &mat)\n\n{\n\n cv::Mat canva = mat.clone();\n\n cv::resize(canva, canva, cv::Size(input_node_dims.at(3), input_node_dims.at(2)));\n\n cv::cvtColor(canva, canva, cv::COLOR_BGR2RGB);\n\n // (1,3,224,224)\n\n ortcv::utils::transform::normalize_inplace(canva, mean_val, scale_val); // float32\n\n \n\n return ortcv::utils::transform::create_tensor(\n\n canva, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::CHW);\n\n}\n\n\n\nvoid AgeGoogleNet::detect(const cv::Mat &mat, types::Age &age)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n ort::Value &age_logits = output_tensors.at(0); // (1,8)\n\n auto age_dims = output_node_dims.at(0);\n\n unsigned int interval = 0;\n\n const unsigned int num_intervals = age_dims.at(1); // 8\n\n const float *pred_logits = age_logits.GetTensorMutableData<float>();\n\n auto softmax_probs = ortcv::utils::math::softmax<float>(pred_logits, num_intervals, interval);\n\n const float pred_age = static_cast<float>(age_intervals[interval][0] + age_intervals[interval][1]) / 2.0f;\n\n age.age = pred_age;\n\n age.age_interval[0] = age_intervals[interval][0];\n\n age.age_interval[1] = age_intervals[interval][1];\n\n age.interval_prob = softmax_probs[interval];\n\n age.flag = true;\n\n}\n\n```\n\n\n\n\n\n\n","file_path":"docs/ort/ort_handler.zh.md","rank":91,"score":52.56817515439065},{"content":"using ortcv::AgeGoogleNet;\n\n\n\nort::Value AgeGoogleNet::transform(const cv::Mat &mat)\n\n{\n\n cv::Mat canva = mat.clone();\n\n cv::resize(canva, canva, cv::Size(input_node_dims.at(3), input_node_dims.at(2)));\n\n cv::cvtColor(canva, canva, cv::COLOR_BGR2RGB);\n\n // (1,3,224,224)\n\n ortcv::utils::transform::normalize_inplace(canva, mean_val, scale_val); // float32\n\n \n\n return ortcv::utils::transform::create_tensor(\n\n canva, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::CHW);\n\n}\n\n\n\nvoid AgeGoogleNet::detect(const cv::Mat &mat, types::Age &age)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n ort::Value &age_logits = output_tensors.at(0); // (1,8)\n\n auto age_dims = output_node_dims.at(0);\n\n unsigned int interval = 0;\n\n const unsigned int num_intervals = age_dims.at(1); // 8\n\n const float *pred_logits = age_logits.GetTensorMutableData<float>();\n\n auto softmax_probs = ortcv::utils::math::softmax<float>(pred_logits, num_intervals, interval);\n\n const float pred_age = static_cast<float>(age_intervals[interval][0] + age_intervals[interval][1]) / 2.0f;\n\n age.age = pred_age;\n\n age.age_interval[0] = age_intervals[interval][0];\n\n age.age_interval[1] = age_intervals[interval][1];\n\n age.interval_prob = softmax_probs[interval];\n\n age.flag = true;\n\n}\n","file_path":"docs/ort/ort_handler.md","rank":92,"score":47.22921457483278},{"content":"\n\nvoid FastStyleTransfer::detect(const cv::Mat &mat, types::StyleContent &style_content)\n\n{\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n Ort::Value &pred_tensor = output_tensors.at(0); // (1,3,224,224)\n\n auto pred_dims = output_node_dims.at(0);\n\n const unsigned int rows = pred_dims.at(2); // H\n\n const unsigned int cols = pred_dims.at(3); // W\n\n\n\n style_content.mat.create(rows, cols, CV_8UC3); // release & create\n\n\n\n // time cost!\n\n for (unsigned int i = 0; i < rows; ++i)\n\n {\n","file_path":"lite/ort/cv/fast_style_transfer.cpp","rank":94,"score":44.64732430933586},{"content":" return Ort::Value::CreateTensor<uchar>(memory_info_handler, input_values_handler.data(),\n\n input_tensor_sizes.at(0),\n\n input_node_dims.at(0).data(),\n\n input_node_dims.at(0).size());\n\n\n\n}\n\n\n\n\n\nvoid SSDMobileNetV1::detect(const cv::Mat &mat, std::vector<types::Boxf> &detected_boxes,\n\n float score_threshold, float iou_threshold,\n\n unsigned int topk, unsigned int nms_type)\n\n{\n\n if (mat.empty()) return;\n\n const unsigned int img_height = mat.rows;\n\n const unsigned int img_width = mat.cols;\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference nums & boxes & scores & classes.\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n","file_path":"lite/ort/cv/ssd_mobilenetv1.cpp","rank":95,"score":44.431514223245614},{"content":" canvas, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::HWC);\n\n}\n\n\n\nvoid EfficientNetLite4::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n Ort::Value &scores_tensor = output_tensors.at(0); // (1,1000)\n\n const unsigned int num_classes = output_node_dims.at(0).at(1);\n\n const float *scores = scores_tensor.GetTensorMutableData<float>(); // float\n\n std::vector<unsigned int> sorted_indices = lite::utils::math::argsort<float>(scores, num_classes);\n\n if (top_k > num_classes) top_k = num_classes;\n\n\n","file_path":"lite/ort/cv/efficientnet_lite4.cpp","rank":96,"score":44.11565119581444},{"content":" canvas, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::CHW);\n\n}\n\n\n\nvoid ShuffleNetV2::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\n\n const unsigned int num_classes = output_node_dims.at(0).at(1);\n\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\n\n unsigned int max_id;\n\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\n\n std::vector<unsigned int> sorted_indices = lite::utils::math::argsort<float>(scores);\n","file_path":"lite/ort/cv/shufflenetv2.cpp","rank":97,"score":43.848575563868394},{"content":" return ortcv::utils::transform::create_tensor(\n\n canvas, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::CHW);\n\n}\n\n\n\nvoid GhostNet::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\n\n const unsigned int num_classes = output_node_dims.at(0).at(1);\n\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\n\n unsigned int max_id;\n\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\n","file_path":"lite/ort/cv/ghostnet.cpp","rank":98,"score":43.82395921161442},{"content":" return ortcv::utils::transform::create_tensor(\n\n canvas, input_node_dims, memory_info_handler,\n\n input_values_handler, ortcv::utils::transform::CHW);\n\n}\n\n\n\nvoid ResNet::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\n\n{\n\n if (mat.empty()) return;\n\n // 1. make input tensor\n\n Ort::Value input_tensor = this->transform(mat);\n\n // 2. inference\n\n auto output_tensors = ort_session->Run(\n\n Ort::RunOptions{nullptr}, input_node_names.data(),\n\n &input_tensor, 1, output_node_names.data(), num_outputs\n\n );\n\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\n\n const unsigned int num_classes = output_node_dims.at(0).at(1);\n\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\n\n unsigned int max_id;\n\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\n","file_path":"lite/ort/cv/resnet.cpp","rank":99,"score":43.82395921161442}],"string":"[\n {\n \"content\": \"enum Dimensionformat { NHWC, NC4HW4, NCHW };\\n\",\n \"file_path\": \"MNN/expr/Expr.hpp\",\n \"rank\": 0,\n \"score\": 159329.26997513027\n },\n {\n \"content\": \"function should be prototyped as void Foo(int,void\\\\*); , where the first parameter is the trackbar\\n\\nposition and the second parameter is the user data (see the next parameter). If the callback is\\n\\nthe NULL pointer, no callbacks are called, but only value is updated.\\n\\n@param userdata User data that is passed as is to the callback. It can be used to handle trackbar\\n\\nevents without using global variables.\\n\\n */\\n\\nCV_EXPORTS int createTrackbar(const String& trackbarname, const String& winname,\\n\\n int* value, int count,\\n\\n TrackbarCallback onChange = 0,\\n\\n void* userdata = 0);\\n\\n\\n\\n/** @brief Returns the trackbar position.\\n\\n\\n\\nThe function returns the current position of the specified trackbar.\\n\\n\\n\\n@note\\n\\n\\n\\n[__Qt Backend Only__] winname can be empty if the trackbar is attached to the control\\n\\npanel.\\n\\n\\n\",\n \"file_path\": \"opencv2/highgui.hpp\",\n \"rank\": 1,\n \"score\": 142770.72483673278\n },\n {\n \"content\": \"function use the rational model and return 8 coefficients. If the flag is not set, the\\n\",\n \"file_path\": \"opencv2/calib3d.hpp\",\n \"rank\": 2,\n \"score\": 119248.57970633352\n },\n {\n \"content\": \"struct Accumulator<unsigned int> { typedef float Type; };\\n\\ntemplate<>\\n\",\n \"file_path\": \"opencv2/flann/dist.h\",\n \"rank\": 3,\n \"score\": 118857.05111997866\n },\n {\n \"content\": \"class NCNN_EXPORT Net\\n\\n{\\n\\npublic:\\n\\n // empty init\\n\\n Net();\\n\\n // clear and destroy\\n\\n virtual ~Net();\\n\\n\\n\\npublic:\\n\\n // option can be changed before loading\\n\\n Option opt;\\n\\n\\n\\n#if NCNN_VULKAN\\n\\n // set gpu device by index\\n\\n void set_vulkan_device(int device_index);\\n\\n\\n\\n // set gpu device by device handle, no owner transfer\\n\\n void set_vulkan_device(const VulkanDevice* vkdev);\\n\\n\\n\\n const VulkanDevice* vulkan_device() const;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 4,\n \"score\": 108503.44064376353\n },\n {\n \"content\": \"class Net;\\n\",\n \"file_path\": \"ncnn/paramdict.h\",\n \"rank\": 5,\n \"score\": 104565.93619895207\n },\n {\n \"content\": \" struct\\n\\n {\\n\\n int size;\\n\\n int step;\\n\\n }\\n\",\n \"file_path\": \"opencv2/core/types_c.h\",\n \"rank\": 6,\n \"score\": 101100.630041141\n },\n {\n \"content\": \" halide_dimension_t *dim;\\n\",\n \"file_path\": \"MNN/HalideRuntime.h\",\n \"rank\": 7,\n \"score\": 101100.630041141\n },\n {\n \"content\": \" DeviceId Id() const {\\n\\n return device_id;\\n\",\n \"file_path\": \"onnxruntime/core/framework/ortdevice.h\",\n \"rank\": 8,\n \"score\": 99323.46716096142\n },\n {\n \"content\": \" _In_reads_(input_len) const OrtValue* const* input, size_t input_len,\\n\",\n \"file_path\": \"onnxruntime/core/session/onnxruntime_c_api.h\",\n \"rank\": 9,\n \"score\": 97716.76308585136\n },\n {\n \"content\": \" ORT_API2_STATUS(AddInitializer, _Inout_ OrtSessionOptions* options, _In_z_ const char* name,\\n\",\n \"file_path\": \"onnxruntime/core/session/onnxruntime_c_api.h\",\n \"rank\": 10,\n \"score\": 97694.09064123848\n },\n {\n \"content\": \"struct MemoryAllocation {\\n\\n MemoryAllocation(OrtAllocator* allocator, void* p, size_t size);\\n\\n ~MemoryAllocation();\\n\\n MemoryAllocation(const MemoryAllocation&) = delete;\\n\\n MemoryAllocation& operator=(const MemoryAllocation&) = delete;\\n\\n MemoryAllocation(MemoryAllocation&&);\\n\\n MemoryAllocation& operator=(MemoryAllocation&&);\\n\\n\\n\\n void* get() { return p_; }\\n\",\n \"file_path\": \"onnxruntime/core/session/onnxruntime_cxx_api.h\",\n \"rank\": 11,\n \"score\": 96172.87408570621\n },\n {\n \"content\": \"function return value).\\n\\n@param flags Flag that can take values of cv::KmeansFlags .\\n\\n\\n\\n@return\\n\\n - Compactness measure that is computed as\\n\\n\\\\f[\\\\sum _i \\\\| \\\\texttt{samples} _i - \\\\texttt{centers} _{ \\\\texttt{labels} _i} \\\\| ^2\\\\f]\\n\\nafter every attempt. The best (minimum) value is chosen and the corresponding labels and the\\n\\ncompactness value are returned by the function.\\n\\n - Integer array that stores the cluster indices for every sample.\\n\\n - Array of the cluster centers.\\n\\n*/\\n\\nGAPI_EXPORTS std::tuple<GOpaque<double>,GMat,GMat>\\n\\nkmeans(const GMat& data, const int K, const GMat& bestLabels,\\n\\n const TermCriteria& criteria, const int attempts, const KmeansFlags flags);\\n\\n\\n\\n/** @overload\\n\\n@note\\n\\n - Function textual ID is \\\"org.opencv.core.kmeansNDNoInit\\\"\\n\\n - #KMEANS_USE_INITIAL_LABELS flag must not be set while using this overload.\\n\\n */\\n\",\n \"file_path\": \"opencv2/gapi/core.hpp\",\n \"rank\": 12,\n \"score\": 91606.9756278658\n },\n {\n \"content\": \"function either returns false (when quiet=true) or throws an exception.\\n\\n@param a input array.\\n\\n@param quiet a flag, indicating whether the functions quietly return false when the array elements\\n\\nare out of range or they throw an exception.\\n\\n@param pos optional output parameter, when not NULL, must be a pointer to array of src.dims\\n\\nelements.\\n\\n@param minVal inclusive lower boundary of valid values range.\\n\\n@param maxVal exclusive upper boundary of valid values range.\\n\\n*/\\n\\nCV_EXPORTS_W bool checkRange(InputArray a, bool quiet = true, CV_OUT Point* pos = 0,\\n\\n double minVal = -DBL_MAX, double maxVal = DBL_MAX);\\n\\n\\n\\n/** @brief converts NaNs to the given number\\n\\n@param a input/output matrix (CV_32F type).\\n\\n@param val value to convert the NaNs\\n\\n*/\\n\\nCV_EXPORTS_W void patchNaNs(InputOutputArray a, double val = 0);\\n\\n\\n\\n/** @brief Performs generalized matrix multiplication.\\n\\n\\n\",\n \"file_path\": \"opencv2/core.hpp\",\n \"rank\": 13,\n \"score\": 89293.70926575267\n },\n {\n \"content\": \" _In_reads_(input_len) const char* const* input_names,\\n\",\n \"file_path\": \"onnxruntime/core/session/onnxruntime_c_api.h\",\n \"rank\": 14,\n \"score\": 86245.56047989702\n },\n {\n \"content\": \" _Inout_ OrtSessionOptions* options, _In_ const char* dim_name,\\n\",\n \"file_path\": \"onnxruntime/core/session/onnxruntime_c_api.h\",\n \"rank\": 15,\n \"score\": 86243.81580132537\n },\n {\n \"content\": \" class CV_EXPORTS_W_SIMPLE Net\\n\\n {\\n\\n public:\\n\\n\\n\\n CV_WRAP Net(); //!< Default constructor.\\n\\n CV_WRAP ~Net(); //!< Destructor frees the net only if there aren't references to the net anymore.\\n\\n\\n\\n /** @brief Create a network from Intel's Model Optimizer intermediate representation (IR).\\n\\n * @param[in] xml XML configuration file with network's topology.\\n\\n * @param[in] bin Binary file with trained weights.\\n\\n * Networks imported from Intel's Model Optimizer are launched in Intel's Inference Engine\\n\\n * backend.\\n\\n */\\n\\n CV_WRAP static Net readFromModelOptimizer(const String& xml, const String& bin);\\n\\n\\n\\n /** @brief Create a network from Intel's Model Optimizer in-memory buffers with intermediate representation (IR).\\n\\n * @param[in] bufferModelConfig buffer with model's configuration.\\n\\n * @param[in] bufferWeights buffer with model's trained weights.\\n\\n * @returns Net object.\\n\\n */\\n\",\n \"file_path\": \"opencv2/dnn/dnn.hpp\",\n \"rank\": 16,\n \"score\": 85847.97196217277\n },\n {\n \"content\": \"#define ONNX_OPERATOR_KERNEL_EX(name, domain, ver, provider, builder, ...) \\\\\\n\\n class ONNX_OPERATOR_KERNEL_CLASS_NAME(provider, domain, ver, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_KERNEL_CLASS_NAME(provider, domain, ver, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(ver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\n#define ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name) \\\\\\n\\n provider##_##name##_##domain##_ver##startver##_##endver\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_VERSIONED_KERNEL(name, startver, endver, builder, ...) \\\\\\n\\n ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, kOnnxDomain, startver, endver, kCpuExecutionProvider, builder, __VA_ARGS__)\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_VERSIONED_ML_KERNEL(name, startver, endver, builder, ...) \\\\\\n\\n ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, kMLDomain, startver, endver, kCpuExecutionProvider, builder, __VA_ARGS__)\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 17,\n \"score\": 84109.61194348108\n },\n {\n \"content\": \"function returns the rotated rectangle structure that includes the object position, size, and\\n\\norientation. The next position of the search window can be obtained with RotatedRect::boundingRect()\\n\\n\\n\\nSee the OpenCV sample camshiftdemo.c that tracks colored objects.\\n\\n\\n\\n@note\\n\\n- (Python) A sample explaining the camshift tracking algorithm can be found at\\n\\n opencv_source_code/samples/python/camshift.py\\n\\n */\\n\\nCV_EXPORTS_W RotatedRect CamShift( InputArray probImage, CV_IN_OUT Rect& window,\\n\\n TermCriteria criteria );\\n\\n/** @example samples/cpp/camshiftdemo.cpp\\n\\nAn example using the mean-shift tracking algorithm\\n\\n*/\\n\\n\\n\\n/** @brief Finds an object on a back projection image.\\n\\n\\n\\n@param probImage Back projection of the object histogram. See calcBackProject for details.\\n\\n@param window Initial search window.\\n\\n@param criteria Stop criteria for the iterative search algorithm.\\n\",\n \"file_path\": \"opencv2/video/tracking.hpp\",\n \"rank\": 18,\n \"score\": 83413.6985961282\n },\n {\n \"content\": \" // This enum is utilized mostly by GArray and GOpaque to store and recognize their internal data\\n\\n // types (aka Host type). Also it is widely used during serialization routine.\\n\\n enum class OpaqueKind: int\\n\\n {\\n\\n CV_UNKNOWN, // Unknown, generic, opaque-to-GAPI data type unsupported in graph seriallization\\n\\n CV_BOOL, // bool user G-API data\\n\\n CV_INT, // int user G-API data\\n\\n CV_DOUBLE, // double user G-API data\\n\\n CV_FLOAT, // float user G-API data\\n\\n CV_UINT64, // uint64_t user G-API data\\n\\n CV_STRING, // std::string user G-API data\\n\\n CV_POINT, // cv::Point user G-API data\\n\\n CV_POINT2F, // cv::Point2f user G-API data\\n\\n CV_SIZE, // cv::Size user G-API data\\n\\n CV_RECT, // cv::Rect user G-API data\\n\\n CV_SCALAR, // cv::Scalar user G-API data\\n\\n CV_MAT, // cv::Mat user G-API data\\n\\n CV_DRAW_PRIM, // cv::gapi::wip::draw::Prim user G-API data\\n\\n };\\n\\n\\n\\n // Type traits helper which simplifies the extraction of kind from type\\n\\n template<typename T> struct GOpaqueTraits;\\n\",\n \"file_path\": \"opencv2/gapi/gcommon.hpp\",\n \"rank\": 19,\n \"score\": 83204.86074518146\n },\n {\n \"content\": \"// This definition is here because it is reused by both public(?) and internal\\n\\n// modules. Keeping it here wouldn't expose public details (e.g., API-level)\\n\\n// to components which are internal and operate on a lower-level entities\\n\\n// (e.g., compiler, backends).\\n\\n// FIXME: merge with ArgKind?\\n\\n// FIXME: replace with variant[format desc]?\\n\\nenum class GShape: int\\n\\n{\\n\\n GMAT,\\n\\n GSCALAR,\\n\\n GARRAY,\\n\\n GOPAQUE,\\n\\n GFRAME,\\n\\n};\\n\\n\\n\\nnamespace gapi {\\n\\nnamespace s11n {\\n\\nnamespace detail {\\n\\ntemplate<typename T> struct wrap_serialize;\\n\\n} // namespace detail\\n\\n} // namespace s11n\\n\\n} // namespace gapi\\n\\n\\n\\n\\n\",\n \"file_path\": \"opencv2/gapi/gcommon.hpp\",\n \"rank\": 20,\n \"score\": 83199.03222977163\n },\n {\n \"content\": \"enum class MediaFormat: int\\n\\n{\\n\\n BGR = 0,\\n\\n NV12,\\n\\n};\\n\\n\\n\\n/**\\n\\n * \\\\addtogroup gapi_meta_args\\n\\n * @{\\n\\n */\\n\",\n \"file_path\": \"opencv2/gapi/gframe.hpp\",\n \"rank\": 21,\n \"score\": 83199.03222977163\n },\n {\n \"content\": \"enum class TraitAs: int\\n\\n{\\n\\n TENSOR, //!< G-API traits an associated cv::Mat as a raw tensor and passes dimensions as-is\\n\\n IMAGE //!< G-API traits an associated cv::Mat as an image so creates an \\\"image\\\" blob (NCHW/NHWC, etc)\\n\\n};\\n\\n\\n\\nusing IEConfig = std::map<std::string, std::string>;\\n\\n\\n\\nnamespace detail {\\n\\n struct ParamDesc {\\n\\n std::string model_path;\\n\\n std::string weights_path;\\n\\n std::string device_id;\\n\\n\\n\\n // NB: Here order follows the `Net` API\\n\\n std::vector<std::string> input_names;\\n\\n std::vector<std::string> output_names;\\n\\n\\n\\n using ConstInput = std::pair<cv::Mat, TraitAs>;\\n\\n std::unordered_map<std::string, ConstInput> const_inputs;\\n\\n\\n\\n // NB: nun_* may differ from topology's real input/output port numbers\\n\\n // (e.g. topology's partial execution)\\n\\n std::size_t num_in; // How many inputs are defined in the operation\\n\\n std::size_t num_out; // How many outputs are defined in the operation\\n\\n\\n\",\n \"file_path\": \"opencv2/gapi/infer/ie.hpp\",\n \"rank\": 22,\n \"score\": 83199.03222977163\n },\n {\n \"content\": \"enum class TraitAs: int {\\n\\n TENSOR, //!< G-API traits an associated cv::Mat as a raw tensor\\n\\n // and passes dimensions as-is\\n\\n IMAGE //!< G-API traits an associated cv::Mat as an image so\\n\\n // creates an \\\"image\\\" blob (NCHW/NHWC, etc)\\n\\n};\\n\\n\\n\\nusing PostProc = std::function<void(const std::unordered_map<std::string, cv::Mat> &,\\n\\n std::unordered_map<std::string, cv::Mat> &)>;\\n\\n\\n\\n\\n\\nnamespace detail {\\n\",\n \"file_path\": \"opencv2/gapi/infer/onnx.hpp\",\n \"rank\": 23,\n \"score\": 83199.03222977163\n },\n {\n \"content\": \" // FIXME: These traits and enum and possible numerous switch(kind)\\n\\n // block may be replaced with a special Handler<T> object or with\\n\\n // a double dispatch\\n\\n enum class ArgKind: int\\n\\n {\\n\\n OPAQUE_VAL, // Unknown, generic, opaque-to-GAPI data type - STATIC\\n\\n // Note: OPAQUE is sometimes defined in Win sys headers\\n\\n#if !defined(OPAQUE) && !defined(CV_DOXYGEN)\\n\\n OPAQUE = OPAQUE_VAL, // deprecated value used for compatibility, use OPAQUE_VAL instead\\n\\n#endif\\n\\n GOBJREF, // <internal> reference to object\\n\\n GMAT, // a cv::GMat\\n\\n GMATP, // a cv::GMatP\\n\\n GFRAME, // a cv::GFrame\\n\\n GSCALAR, // a cv::GScalar\\n\\n GARRAY, // a cv::GArrayU (note - exactly GArrayU, not GArray<T>!)\\n\\n GOPAQUE, // a cv::GOpaqueU (note - exactly GOpaqueU, not GOpaque<T>!)\\n\\n };\\n\\n\\n\\n // Describe G-API types (G-types) with traits. Mostly used by\\n\\n // cv::GArg to store meta information about types passed into\\n\\n // operation arguments. Please note that cv::GComputation is\\n\\n // defined on GProtoArgs, not GArgs!\\n\",\n \"file_path\": \"opencv2/gapi/gtype_traits.hpp\",\n \"rank\": 24,\n \"score\": 81444.35000810632\n },\n {\n \"content\": \"#define ONNX_OPERATOR_TYPED_KERNEL_EX(name, domain, ver, type, provider, builder, ...) \\\\\\n\\n class ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(ver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\n#define ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name) \\\\\\n\\n provider##_##name##_##domain##_ver##ver##_##type1##_##type2\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 25,\n \"score\": 79375.74572507264\n },\n {\n \"content\": \"#define ONNX_OPERATOR_VERSIONED_KERNEL_EX(name, domain, startver, endver, provider, builder, ...) \\\\\\n\\n class ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_KERNEL_CLASS_NAME(provider, domain, startver, endver, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(startver, endver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\n#define ONNX_OPERATOR_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type, name) \\\\\\n\\n provider##_##name##_##domain##_ver##ver##_##type\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_TYPED_KERNEL(name, ver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kOnnxDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_TYPED_ML_KERNEL(name, ver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kMLDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_TYPED_MS_KERNEL(name, ver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_TYPED_KERNEL_EX(name, kMSDomain, ver, type, kCpuExecutionProvider, builder, __VA_ARGS__)\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 26,\n \"score\": 79375.74572507264\n },\n {\n \"content\": \" class LITE_EXPORTS BoundingBoxType<int, float>;\\n\\n\\n\\n template\\n\",\n \"file_path\": \"lite/types.h\",\n \"rank\": 27,\n \"score\": 77891.90458141497\n },\n {\n \"content\": \"struct Accumulator<int> { typedef float Type; };\\n\\n\\n\\n#undef True\\n\\n#undef False\\n\\n\\n\",\n \"file_path\": \"opencv2/flann/dist.h\",\n \"rank\": 28,\n \"score\": 76745.9537691839\n },\n {\n \"content\": \"#define ONNX_OPERATOR_TWO_TYPED_KERNEL_EX(name, domain, ver, type1, type2, provider, builder, ...) \\\\\\n\\n class ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, ver, type1, type2, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(ver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\n#define ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type, name) \\\\\\n\\n provider##_##name##_##domain##_ver##startver##_##endver##_##type\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_KERNEL(name, startver, endver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kOnnxDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\\\\n\\n __VA_ARGS__)\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_ML_KERNEL(name, startver, endver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kMLDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\\\\n\\n __VA_ARGS__)\\n\\n\\n\\n#define ONNX_CPU_OPERATOR_VERSIONED_TYPED_MS_KERNEL(name, startver, endver, type, builder, ...) \\\\\\n\\n ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, kMSDomain, startver, endver, type, kCpuExecutionProvider, builder, \\\\\\n\\n __VA_ARGS__)\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 29,\n \"score\": 75202.65131138577\n },\n {\n \"content\": \"#define ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_EX(name, domain, startver, endver, type, provider, builder, ...) \\\\\\n\\n class ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, \\\\\\n\\n type, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(startver, endver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\n#define ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type1, type2, name) \\\\\\n\\n provider##_##name##_##domain##_ver##startver##_##endver##_##type1##_##type2\\n\\n\\n\\n#define ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_EX(name, domain, startver, endver, type1, type2, \\\\\\n\\n provider, builder, ...) \\\\\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 30,\n \"score\": 75202.65131138577\n },\n {\n \"content\": \" class GAPI_EXPORTS Priv; // internal use only\\n\\n Priv& priv(); // internal use only\\n\\n const Priv& priv() const; // internal use only\\n\\n\\n\\nprivate:\\n\\n std::unique_ptr<Priv> m_priv;\\n\\n const Cache* m_cache;\\n\\n};\\n\\n\\n\\n} // namespace cv::gapi::fluid\\n\\n} // namespace cv::gapi\\n\\n} // namespace cv\\n\\n\\n\\n#endif // OPENCV_GAPI_FLUID_BUFFER_HPP\\n\",\n \"file_path\": \"opencv2/gapi/fluid/gfluidbuffer.hpp\",\n \"rank\": 31,\n \"score\": 73365.80486320899\n },\n {\n \"content\": \"type deserialize(const std::vector<char> &p) {\\n\\n return detail::getRunArgsWithRMats<RMatAdapterType>(p);\\n\\n}\\n\\n} // namespace gapi\\n\\n} // namespace cv\\n\\n\\n\\nnamespace cv {\\n\\nnamespace gapi {\\n\\nnamespace s11n {\\n\",\n \"file_path\": \"opencv2/gapi/s11n.hpp\",\n \"rank\": 32,\n \"score\": 72574.05552337898\n },\n {\n \"content\": \"// Variant that only ever allows const access to nodes and optionally allows filtering of the nodes.\\n\\nclass ConstGraphNodes : public ValidNodes<const std::vector<std::unique_ptr<Node>>> {\\n\\n public:\\n\\n ConstGraphNodes(const std::vector<std::unique_ptr<Node>>& nodes) : ValidNodes(nodes) {\\n\\n }\\n\\n\\n\\n ConstGraphNodes(const std::vector<std::unique_ptr<Node>>& nodes,\\n\\n GraphNodes::NodeFilterFunc&& filter_func)\\n\\n : ValidNodes(nodes, std::move(filter_func)) {\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace onnxruntime\\n\",\n \"file_path\": \"onnxruntime/core/graph/graph_nodes.h\",\n \"rank\": 33,\n \"score\": 71944.30663099543\n },\n {\n \"content\": \" class ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, type1, type2, name); \\\\\\n\\n template <> \\\\\\n\\n KernelCreateInfo \\\\\\n\\n BuildKernelCreateInfo<ONNX_OPERATOR_VERSIONED_TWO_TYPED_KERNEL_CLASS_NAME(provider, domain, startver, endver, \\\\\\n\\n type1, type2, name)>() { \\\\\\n\\n return KernelCreateInfo( \\\\\\n\\n builder.SetName(#name) \\\\\\n\\n .SetDomain(domain) \\\\\\n\\n .SinceVersion(startver, endver) \\\\\\n\\n .Provider(provider) \\\\\\n\\n .Build(), \\\\\\n\\n static_cast<KernelCreatePtrFn>([](const OpKernelInfo& info) -> OpKernel* { return new __VA_ARGS__(info); })); \\\\\\n\\n }\\n\\n\\n\\ntemplate <typename... Types>\\n\",\n \"file_path\": \"onnxruntime/core/framework/op_kernel.h\",\n \"rank\": 34,\n \"score\": 71481.9134841609\n },\n {\n \"content\": \"class NetPrivate;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 35,\n \"score\": 70795.82197608595\n },\n {\n \"content\": \"class PUBLIC Instance {\\n\\npublic:\\n\\n Instance(NetworkConfig& net_config, ModelConfig& model_config);\\n\\n\\n\\n ~Instance();\\n\\n\\n\\n // init with model interpeter and inputs shape.\\n\\n Status Init(std::shared_ptr<AbstractModelInterpreter> interpreter, InputShapesMap inputs_shape);\\n\\n\\n\\n // init with model interpeter, min inputs shape and max inputs shape.\\n\\n Status Init(std::shared_ptr<AbstractModelInterpreter> interpreter, InputShapesMap min_inputs_shape, InputShapesMap max_inputs_shape);\\n\\n\\n\\n // deinit, release network\\n\\n Status DeInit();\\n\\n\\n\\n // return memory bytes required for forward\\n\\n Status GetForwardMemorySize(int& memory_size);\\n\\n\\n\\n // set memory to tnn instance. if success, return status code zero.\\n\\n // only instance created with SHARE_MEMORY_MODE_SET_FROM_EXTERNAL can be set from external.\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 36,\n \"score\": 68960.45406286124\n },\n {\n \"content\": \"struct Depth< Range > { enum { value = Depth<int>::value }; };\\n\\ntemplate<>\\n\",\n \"file_path\": \"opencv2/core/types.hpp\",\n \"rank\": 37,\n \"score\": 67388.19123058612\n },\n {\n \"content\": \"type for the input array should be either np.int32 or np.float32.\\n\\n\\n\\n@sa contourArea, arcLength\\n\\n */\\n\\nCV_EXPORTS_W Moments moments( InputArray array, bool binaryImage = false );\\n\\n\\n\\n/** @brief Calculates seven Hu invariants.\\n\\n\\n\\nThe function calculates seven Hu invariants (introduced in @cite Hu62; see also\\n\\n<http://en.wikipedia.org/wiki/Image_moment>) defined as:\\n\\n\\n\\n\\\\f[\\\\begin{array}{l} hu[0]= \\\\eta _{20}+ \\\\eta _{02} \\\\\\\\ hu[1]=( \\\\eta _{20}- \\\\eta _{02})^{2}+4 \\\\eta _{11}^{2} \\\\\\\\ hu[2]=( \\\\eta _{30}-3 \\\\eta _{12})^{2}+ (3 \\\\eta _{21}- \\\\eta _{03})^{2} \\\\\\\\ hu[3]=( \\\\eta _{30}+ \\\\eta _{12})^{2}+ ( \\\\eta _{21}+ \\\\eta _{03})^{2} \\\\\\\\ hu[4]=( \\\\eta _{30}-3 \\\\eta _{12})( \\\\eta _{30}+ \\\\eta _{12})[( \\\\eta _{30}+ \\\\eta _{12})^{2}-3( \\\\eta _{21}+ \\\\eta _{03})^{2}]+(3 \\\\eta _{21}- \\\\eta _{03})( \\\\eta _{21}+ \\\\eta _{03})[3( \\\\eta _{30}+ \\\\eta _{12})^{2}-( \\\\eta _{21}+ \\\\eta _{03})^{2}] \\\\\\\\ hu[5]=( \\\\eta _{20}- \\\\eta _{02})[( \\\\eta _{30}+ \\\\eta _{12})^{2}- ( \\\\eta _{21}+ \\\\eta _{03})^{2}]+4 \\\\eta _{11}( \\\\eta _{30}+ \\\\eta _{12})( \\\\eta _{21}+ \\\\eta _{03}) \\\\\\\\ hu[6]=(3 \\\\eta _{21}- \\\\eta _{03})( \\\\eta _{21}+ \\\\eta _{03})[3( \\\\eta _{30}+ \\\\eta _{12})^{2}-( \\\\eta _{21}+ \\\\eta _{03})^{2}]-( \\\\eta _{30}-3 \\\\eta _{12})( \\\\eta _{21}+ \\\\eta _{03})[3( \\\\eta _{30}+ \\\\eta _{12})^{2}-( \\\\eta _{21}+ \\\\eta _{03})^{2}] \\\\\\\\ \\\\end{array}\\\\f]\\n\\n\\n\\nwhere \\\\f$\\\\eta_{ji}\\\\f$ stands for \\\\f$\\\\texttt{Moments::nu}_{ji}\\\\f$ .\\n\\n\\n\\nThese values are proved to be invariants to the image scale, rotation, and reflection except the\\n\\nseventh one, whose sign is changed by reflection. This invariance is proved with the assumption of\\n\\ninfinite image resolution. In case of raster images, the computed Hu invariants for the original and\\n\\ntransformed images are a bit different.\\n\\n\\n\",\n \"file_path\": \"opencv2/imgproc.hpp\",\n \"rank\": 38,\n \"score\": 64338.868590093596\n },\n {\n \"content\": \" function may return even if the copy operation is not finished.\\n\\n\\n\\n The copy operation may be overlapped with operations in other non-default streams if \\\\p stream is\\n\\n not the default stream and \\\\p dst is HostMem allocated with HostMem::PAGE_LOCKED option.\\n\\n */\\n\\n CV_WRAP void download(OutputArray dst, Stream& stream) const;\\n\\n\\n\\n //! returns deep copy of the GpuMat, i.e. the data is copied\\n\\n CV_WRAP GpuMat clone() const;\\n\\n\\n\\n //! copies the GpuMat content to device memory (Blocking call)\\n\\n CV_WRAP void copyTo(OutputArray dst) const;\\n\\n\\n\\n //! copies the GpuMat content to device memory (Non-Blocking call)\\n\\n CV_WRAP void copyTo(OutputArray dst, Stream& stream) const;\\n\\n\\n\\n //! copies those GpuMat elements to \\\"m\\\" that are marked with non-zero mask elements (Blocking call)\\n\\n CV_WRAP void copyTo(OutputArray dst, InputArray mask) const;\\n\\n\\n\\n //! copies those GpuMat elements to \\\"m\\\" that are marked with non-zero mask elements (Non-Blocking call)\\n\",\n \"file_path\": \"opencv2/core/cuda.hpp\",\n \"rank\": 39,\n \"score\": 64338.37061219402\n },\n {\n \"content\": \"function does not copy src itself but simply constructs the border, for example:\\n\\n\\n\\n@code{.cpp}\\n\\n // let border be the same in all directions\\n\\n int border=2;\\n\\n // constructs a larger image to fit both the image and the border\\n\\n Mat gray_buf(rgb.rows + border*2, rgb.cols + border*2, rgb.depth());\\n\\n // select the middle part of it w/o copying data\\n\\n Mat gray(gray_canvas, Rect(border, border, rgb.cols, rgb.rows));\\n\\n // convert image from RGB to grayscale\\n\\n cvtColor(rgb, gray, COLOR_RGB2GRAY);\\n\\n // form a border in-place\\n\\n copyMakeBorder(gray, gray_buf, border, border,\\n\\n border, border, BORDER_REPLICATE);\\n\\n // now do some custom filtering ...\\n\\n ...\\n\\n@endcode\\n\\n@note When the source image is a part (ROI) of a bigger image, the function will try to use the\\n\\npixels outside of the ROI to form a border. To disable this feature and always do extrapolation, as\\n\\nif src was not a ROI, use borderType | #BORDER_ISOLATED.\\n\",\n \"file_path\": \"opencv2/core.hpp\",\n \"rank\": 40,\n \"score\": 63772.394104729254\n },\n {\n \"content\": \" class ConstIterator {\\n\\n public:\\n\\n using const_iterator = typename Container::const_iterator;\\n\\n using iterator_category = std::input_iterator_tag;\\n\\n using value_type = T*;\\n\\n using difference_type = std::ptrdiff_t;\\n\\n using pointer = T**;\\n\\n using reference = T*&;\\n\\n\\n\\n /** Construct iterator for container that will return const T* entries.*/\\n\\n explicit ConstIterator(const_iterator position) noexcept : current_{position}, item_{nullptr} {}\\n\\n ConstIterator(const ConstIterator& other) = default;\\n\\n ConstIterator& operator=(const ConstIterator& other) = default;\\n\\n\\n\\n bool operator==(const ConstIterator& other) const noexcept { return current_ == other.current_; }\\n\\n bool operator!=(const ConstIterator& other) const noexcept { return current_ != other.current_; }\\n\\n\\n\\n ConstIterator& operator++() {\\n\\n ++current_;\\n\\n return *this;\\n\",\n \"file_path\": \"onnxruntime/core/common/const_pointer_container.h\",\n \"rank\": 41,\n \"score\": 63746.71299371178\n },\n {\n \"content\": \"class MNN_PUBLIC AutoTime : Timer {\\n\\npublic:\\n\\n AutoTime(int line, const char* func);\\n\\n ~AutoTime();\\n\\n AutoTime(const AutoTime&) = delete;\\n\\n AutoTime(const AutoTime&&) = delete;\\n\\n AutoTime& operator=(const AutoTime&) = delete;\\n\\n AutoTime& operator=(const AutoTime&&) = delete;\\n\\n\\n\\nprivate:\\n\\n int mLine;\\n\\n char* mName;\\n\\n};\\n\\n} // namespace MNN\\n\\n\\n\\n#ifdef MNN_OPEN_TIME_TRACE\\n\\n#define AUTOTIME MNN::AutoTime ___t(__LINE__, __func__)\\n\\n#else\\n\\n#define AUTOTIME\\n\\n#endif\\n\\n\\n\\n#endif /* AutoTime_hpp */\\n\",\n \"file_path\": \"MNN/AutoTime.hpp\",\n \"rank\": 42,\n \"score\": 62193.890287877526\n },\n {\n \"content\": \"class PUBLIC DimsVectorUtils {\\n\\npublic:\\n\\n // @brief all dims product, [start_index, end_index)\\n\\n // @param dims\\n\\n static int Count(const DimsVector &dims, int start_index = 0, int end_index = -1);\\n\\n\\n\\n // @brief max of dims0 and dims1, [start_index, end_index)\\n\\n static DimsVector Max(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\\n\\n\\n\\n // @brief min of dims0 and dims1, [start_index, end_index)\\n\\n static DimsVector Min(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\\n\\n\\n\\n // @brief equal of dims0 and dims1, [start_index, end_index)\\n\\n static bool Equal(const DimsVector &dims0, const DimsVector &dims1, int start_index = 0, int end_index = -1);\\n\\n \\n\\n // @brief NCHW dims vector to NHWC dims vector\\n\\n static DimsVector NCHW2NHWC(const DimsVector &dims);\\n\\n\\n\\n // @brief NHWC dims vector to NCHW\\n\\n static DimsVector NHWC2NCHW(const DimsVector &dims);\\n\\n};\\n\\n\\n\\n} // namespace TNN_NS\\n\\n\\n\\n#endif // TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\\n\",\n \"file_path\": \"tnn/utils/dims_vector_utils.h\",\n \"rank\": 43,\n \"score\": 62188.333772142934\n },\n {\n \"content\": \"class ConstPointerContainer {\\n\\n public:\\n\\n using T = typename std::remove_pointer<typename Container::value_type>::type;\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/common/const_pointer_container.h\",\n \"rank\": 44,\n \"score\": 62181.800322964555\n },\n {\n \"content\": \"\\n\\n // convenient load network weight data from android asset model file\\n\\n int load_model(AAsset* asset);\\n\\n int load_model(AAssetManager* mgr, const char* assetpath);\\n\\n#endif // __ANDROID_API__ >= 9\\n\\n#endif // NCNN_PLATFORM_API\\n\\n\\n\\n // unload network structure and weight data\\n\\n void clear();\\n\\n\\n\\n // construct an Extractor from network\\n\\n Extractor create_extractor() const;\\n\\n\\n\\n // get input/output indexes/names\\n\\n const std::vector<int>& input_indexes() const;\\n\\n const std::vector<int>& output_indexes() const;\\n\\n#if NCNN_STRING\\n\\n const std::vector<const char*>& input_names() const;\\n\\n const std::vector<const char*>& output_names() const;\\n\\n#endif\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 45,\n \"score\": 62116.46463681968\n },\n {\n \"content\": \" int extract(int blob_index, Mat& feat, int type = 0);\\n\\n\\n\\n#if NCNN_VULKAN\\n\\n#if NCNN_STRING\\n\\n // set input by blob name\\n\\n // return 0 if success\\n\\n int input(const char* blob_name, const VkMat& in);\\n\\n\\n\\n // get result by blob name\\n\\n // return 0 if success\\n\\n int extract(const char* blob_name, VkMat& feat, VkCompute& cmd);\\n\\n\\n\\n // set input by blob name\\n\\n // return 0 if success\\n\\n int input(const char* blob_name, const VkImageMat& in);\\n\\n\\n\\n // get result by blob name\\n\\n // return 0 if success\\n\\n int extract(const char* blob_name, VkImageMat& feat, VkCompute& cmd);\\n\\n#endif // NCNN_STRING\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 46,\n \"score\": 62114.717380012655\n },\n {\n \"content\": \"#if NCNN_STRING\\n\\n // set input by blob name\\n\\n // return 0 if success\\n\\n int input(const char* blob_name, const Mat& in);\\n\\n\\n\\n // get result by blob name\\n\\n // return 0 if success\\n\\n // type = 0, default\\n\\n // type = 1, do not convert fp16/bf16 or / and packing\\n\\n int extract(const char* blob_name, Mat& feat, int type = 0);\\n\\n#endif // NCNN_STRING\\n\\n\\n\\n // set input by blob index\\n\\n // return 0 if success\\n\\n int input(int blob_index, const Mat& in);\\n\\n\\n\\n // get result by blob index\\n\\n // return 0 if success\\n\\n // type = 0, default\\n\\n // type = 1, do not convert fp16/bf16 or / and packing\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 47,\n \"score\": 62114.29048418305\n },\n {\n \"content\": \"\\n\\n const std::vector<Blob>& blobs() const;\\n\\n const std::vector<Layer*>& layers() const;\\n\\n\\n\\n std::vector<Blob>& mutable_blobs();\\n\\n std::vector<Layer*>& mutable_layers();\\n\\n\\n\\nprotected:\\n\\n friend class Extractor;\\n\\n#if NCNN_STRING\\n\\n int find_blob_index_by_name(const char* name) const;\\n\\n int find_layer_index_by_name(const char* name) const;\\n\\n virtual int custom_layer_to_index(const char* type);\\n\\n virtual Layer* create_custom_layer(const char* type);\\n\\n#endif // NCNN_STRING\\n\\n virtual Layer* create_custom_layer(int index);\\n\\n\\n\\nprivate:\\n\\n Net(const Net&);\\n\\n Net& operator=(const Net&);\\n\\n\\n\\nprivate:\\n\\n NetPrivate* const d;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 48,\n \"score\": 62113.91248618529\n },\n {\n \"content\": \"// Tencent is pleased to support the open source community by making ncnn available.\\n\\n//\\n\\n// Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.\\n\\n//\\n\\n// Licensed under the BSD 3-Clause License (the \\\"License\\\"); you may not use this file except\\n\\n// in compliance with the License. You may obtain a copy of the License at\\n\\n//\\n\\n// https://opensource.org/licenses/BSD-3-Clause\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software distributed\\n\\n// under the License is distributed on an \\\"AS IS\\\" BASIS, WITHOUT WARRANTIES OR\\n\\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\\n\\n// specific language governing permissions and limitations under the License.\\n\\n\\n\\n#ifndef NCNN_NET_H\\n\\n#define NCNN_NET_H\\n\\n\\n\\n#include \\\"blob.h\\\"\\n\\n#include \\\"layer.h\\\"\\n\\n#include \\\"mat.h\\\"\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 49,\n \"score\": 62112.293172215635\n },\n {\n \"content\": \"\\n\\n // set input by blob index\\n\\n // return 0 if success\\n\\n int input(int blob_index, const VkMat& in);\\n\\n\\n\\n // get result by blob index\\n\\n // return 0 if success\\n\\n int extract(int blob_index, VkMat& feat, VkCompute& cmd);\\n\\n\\n\\n // set input by blob index\\n\\n // return 0 if success\\n\\n int input(int blob_index, const VkImageMat& in);\\n\\n\\n\\n // get result by blob index\\n\\n // return 0 if success\\n\\n int extract(int blob_index, VkImageMat& feat, VkCompute& cmd);\\n\\n#endif // NCNN_VULKAN\\n\\n\\n\\nprotected:\\n\\n friend Extractor Net::create_extractor() const;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 50,\n \"score\": 62111.51672710917\n },\n {\n \"content\": \"#endif // NCNN_VULKAN\\n\\n\\n\\n#if NCNN_STRING\\n\\n // register custom layer by layer type name\\n\\n // return 0 if success\\n\\n int register_custom_layer(const char* type, layer_creator_func creator, layer_destroyer_func destroyer = 0, void* userdata = 0);\\n\\n#endif // NCNN_STRING\\n\\n // register custom layer by layer type\\n\\n // return 0 if success\\n\\n int register_custom_layer(int index, layer_creator_func creator, layer_destroyer_func destroyer = 0, void* userdata = 0);\\n\\n\\n\\n#if NCNN_STRING\\n\\n int load_param(const DataReader& dr);\\n\\n#endif // NCNN_STRING\\n\\n\\n\\n int load_param_bin(const DataReader& dr);\\n\\n\\n\\n int load_model(const DataReader& dr);\\n\\n\\n\\n#if NCNN_STDIO\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 51,\n \"score\": 62109.298508097534\n },\n {\n \"content\": \" // return bytes consumed\\n\\n int load_param(const unsigned char* mem);\\n\\n\\n\\n // reference network weight data from external memory\\n\\n // weight data is not copied but referenced\\n\\n // so external memory should be retained when used\\n\\n // memory pointer must be 32-bit aligned\\n\\n // return bytes consumed\\n\\n int load_model(const unsigned char* mem);\\n\\n\\n\\n#if NCNN_PLATFORM_API\\n\\n#if __ANDROID_API__ >= 9\\n\\n#if NCNN_STRING\\n\\n // convenient load network structure from android asset plain param file\\n\\n int load_param(AAsset* asset);\\n\\n int load_param(AAssetManager* mgr, const char* assetpath);\\n\\n#endif // NCNN_STRING\\n\\n // convenient load network structure from android asset binary param file\\n\\n int load_param_bin(AAsset* asset);\\n\\n int load_param_bin(AAssetManager* mgr, const char* assetpath);\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 52,\n \"score\": 62108.475742931245\n },\n {\n \"content\": \" // this will overwrite the global setting\\n\\n // default count is system depended\\n\\n void set_num_threads(int num_threads);\\n\\n\\n\\n // set blob memory allocator\\n\\n void set_blob_allocator(Allocator* allocator);\\n\\n\\n\\n // set workspace memory allocator\\n\\n void set_workspace_allocator(Allocator* allocator);\\n\\n\\n\\n#if NCNN_VULKAN\\n\\n void set_vulkan_compute(bool enable);\\n\\n\\n\\n void set_blob_vkallocator(VkAllocator* allocator);\\n\\n\\n\\n void set_workspace_vkallocator(VkAllocator* allocator);\\n\\n\\n\\n void set_staging_vkallocator(VkAllocator* allocator);\\n\\n#endif // NCNN_VULKAN\\n\\n\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 53,\n \"score\": 62104.20540597123\n },\n {\n \"content\": \" Extractor(const Net* net, size_t blob_count);\\n\\n\\n\\nprivate:\\n\\n ExtractorPrivate* const d;\\n\\n};\\n\\n\\n\\n} // namespace ncnn\\n\\n\\n\\n#endif // NCNN_NET_H\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 54,\n \"score\": 62100.41192088727\n },\n {\n \"content\": \"#include \\\"option.h\\\"\\n\\n#include \\\"platform.h\\\"\\n\\n\\n\\n#if NCNN_PLATFORM_API\\n\\n#if __ANDROID_API__ >= 9\\n\\n#include <android/asset_manager.h>\\n\\n#endif // __ANDROID_API__ >= 9\\n\\n#endif // NCNN_PLATFORM_API\\n\\n\\n\\nnamespace ncnn {\\n\\n\\n\\n#if NCNN_VULKAN\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 55,\n \"score\": 62100.09800414842\n },\n {\n \"content\": \"#if NCNN_STRING\\n\\n // load network structure from plain param file\\n\\n // return 0 if success\\n\\n int load_param(FILE* fp);\\n\\n int load_param(const char* protopath);\\n\\n int load_param_mem(const char* mem);\\n\\n#endif // NCNN_STRING\\n\\n // load network structure from binary param file\\n\\n // return 0 if success\\n\\n int load_param_bin(FILE* fp);\\n\\n int load_param_bin(const char* protopath);\\n\\n\\n\\n // load network weight data from model file\\n\\n // return 0 if success\\n\\n int load_model(FILE* fp);\\n\\n int load_model(const char* modelpath);\\n\\n#endif // NCNN_STDIO\\n\\n\\n\\n // load network structure from external memory\\n\\n // memory pointer must be 32-bit aligned\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 56,\n \"score\": 62099.87841061977\n },\n {\n \"content\": \"struct Type< Range > { enum { value = CV_MAKETYPE(Depth<int>::value, 2) }; };\\n\\n} // namespace\\n\\n\\n\\n\\n\\n//////////////////////////////// Scalar_ ///////////////////////////////\\n\\n\\n\\n/** @brief Template class for a 4-element vector derived from Vec.\\n\\n\\n\\nBeing derived from Vec\\\\<_Tp, 4\\\\> , Scalar\\\\_ and Scalar can be used just as typical 4-element\\n\\nvectors. In addition, they can be converted to/from CvScalar . The type Scalar is widely used in\\n\\nOpenCV to pass pixel values.\\n\\n*/\\n\\ntemplate<typename _Tp> class Scalar_ : public Vec<_Tp, 4>\\n\\n{\\n\\npublic:\\n\\n //! default constructor\\n\\n Scalar_();\\n\\n Scalar_(_Tp v0, _Tp v1, _Tp v2=0, _Tp v3=0);\\n\\n Scalar_(_Tp v0);\\n\\n\\n\",\n \"file_path\": \"opencv2/core/types.hpp\",\n \"rank\": 57,\n \"score\": 61382.054358225774\n },\n {\n \"content\": \"//! @cond IGNORED\\n\\n// FIXIT Remove this (especially CV_EXPORTS modifier)\\n\\nstruct CV_EXPORTS Matx_AddOp { Matx_AddOp() {} Matx_AddOp(const Matx_AddOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 58,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_TOp { Matx_TOp() {} Matx_TOp(const Matx_TOp&) {} };\\n\\n//! @endcond\\n\\n\\n\\n/** @brief Template class for small matrices whose type and size are known at compilation time\\n\\n\\n\\nIf you need a more flexible type, use Mat . The elements of the matrix M are accessible using the\\n\\nM(i,j) notation. Most of the common matrix operations (see also @ref MatrixExpressions ) are\\n\\navailable. To do an operation on Matx that is not implemented, you can easily convert the matrix to\\n\\nMat and backwards:\\n\\n@code{.cpp}\\n\\n Matx33f m(1, 2, 3,\\n\\n 4, 5, 6,\\n\\n 7, 8, 9);\\n\\n cout << sum(Mat(m*m.t())) << endl;\\n\\n@endcode\\n\\nExcept of the plain constructor which takes a list of elements, Matx can be initialized from a C-array:\\n\\n@code{.cpp}\\n\\n float values[] = { 1, 2, 3};\\n\\n Matx31f m(values);\\n\\n@endcode\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 59,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_ScaleOp { Matx_ScaleOp() {} Matx_ScaleOp(const Matx_ScaleOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 60,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_MulOp { Matx_MulOp() {} Matx_MulOp(const Matx_MulOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 61,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_SubOp { Matx_SubOp() {} Matx_SubOp(const Matx_SubOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 62,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_DivOp { Matx_DivOp() {} Matx_DivOp(const Matx_DivOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 63,\n \"score\": 60193.23708298516\n },\n {\n \"content\": \" // the memory size need >= GetForwardMemorySize().\\n\\n // releasing or otherwise using the memory for other purposes during the tnn network run\\n\\n // will result in undefined behavior.\\n\\n Status SetForwardMemory(void* memory);\\n\\n\\n\\n // reshape instance with new input shapes\\n\\n Status Reshape(const InputShapesMap& inputs);\\n\\n\\n\\n // get tnn command queue\\n\\n Status GetCommandQueue(void** command_queue);\\n\\n \\n\\n // @brief share command queue with another instance\\n\\n // @param instance to share command queue\\n\\n Status ShareCommandQueue(Instance *instance);\\n\\n\\n\\n // @brief tnn instance network infer, it will wait until all layer infer complete.\\n\\n Status Forward();\\n\\n\\n\\n#ifdef FORWARD_CALLBACK_ENABLE\\n\\n // tnn instance network infer with callback to get blob info\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 64,\n \"score\": 59288.81088190687\n },\n {\n \"content\": \"// Tencent is pleased to support the open source community by making TNN available.\\n\\n//\\n\\n// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.\\n\\n//\\n\\n// Licensed under the BSD 3-Clause License (the \\\"License\\\"); you may not use this file except\\n\\n// in compliance with the License. You may obtain a copy of the License at\\n\\n//\\n\\n// https://opensource.org/licenses/BSD-3-Clause\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software distributed\\n\\n// under the License is distributed on an \\\"AS IS\\\" BASIS, WITHOUT WARRANTIES OR\\n\\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\\n\\n// specific language governing permissions and limitations under the License.\\n\\n\\n\\n#ifndef TNN_INCLUDE_TNN_CORE_INSTANCE_H_\\n\\n#define TNN_INCLUDE_TNN_CORE_INSTANCE_H_\\n\\n\\n\\n#include <functional>\\n\\n#include <memory>\\n\\n#include <vector>\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 65,\n \"score\": 59286.326370883646\n },\n {\n \"content\": \"\\n\\n#if TNN_PROFILE\\n\\npublic:\\n\\n /**start to profile each layer, dont call this func if you only want to profile the whole mode*/\\n\\n void StartProfile();\\n\\n /**finish profile each layer and show result*/\\n\\n std::string FinishProfile(bool do_print = false);\\n\\n#endif\\n\\n\\n\\nprivate:\\n\\n std::shared_ptr<AbstractModelInterpreter> interpreter_ = nullptr;\\n\\n std::shared_ptr<AbstractNetwork> network_ = nullptr;\\n\\n std::shared_ptr<AbstractNetwork> const_folder_ = nullptr;\\n\\n NetworkConfig net_config_;\\n\\n ModelConfig model_config_;\\n\\n \\n\\n AbstractNetwork *GetNetwork();\\n\\n \\n\\n //Mat interface for simple use\\n\\npublic:\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 66,\n \"score\": 59285.71574162249\n },\n {\n \"content\": \" // set input Mat, if input_name is not set, take the first input as default\\n\\n Status SetInputMat(std::shared_ptr<Mat> mat,\\n\\n MatConvertParam param,\\n\\n std::string input_name = \\\"\\\");\\n\\n \\n\\n // get output Mat, if output_name is not set, take the first output as default\\n\\n Status GetOutputMat(std::shared_ptr<Mat>& mat,\\n\\n MatConvertParam param = MatConvertParam(),\\n\\n std::string output_name = \\\"\\\",\\n\\n DeviceType device = DEVICE_ARM, MatType mat_type = NCHW_FLOAT);\\n\\n \\n\\nprivate:\\n\\n // input converter\\n\\n std::map<std::string, std::shared_ptr<BlobConverter>> input_converters_ = {};\\n\\n\\n\\n // output converter\\n\\n std::map<std::string, std::shared_ptr<BlobConverter>> output_converters_ = {};\\n\\n\\n\\n // output mat\\n\\n std::map<std::string, std::shared_ptr<Mat>> output_mats_ = {};\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 67,\n \"score\": 59283.260672564684\n },\n {\n \"content\": \" // output mat convert status\\n\\n std::map<std::string, int> output_mats_convert_status_ = {};\\n\\n};\\n\\n\\n\\n} // namespace TNN_NS\\n\\n\\n\\n#pragma warning(pop)\\n\\n\\n\\n#endif // TNN_INCLUDE_TNN_CORE_INSTANCE_H_\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 68,\n \"score\": 59282.8160712113\n },\n {\n \"content\": \" Status ForwardWithCallback(BlobStatisticCallback before, BlobStatisticCallback after);\\n\\n#endif // end of FORWARD_CALLBACK_ENABLE\\n\\n\\n\\n#ifdef GET_INTERP_ENABLE\\n\\n // get model interpreter\\n\\n std::shared_ptr<AbstractModelInterpreter> GetInterpreter();\\n\\n#endif // end of GET_INTERP_ENABLE\\n\\n\\n\\n // tnn instance network infer async.\\n\\n // device gpu, all layer infer complete will call Callback.\\n\\n Status ForwardAsync(Callback call_back);\\n\\n\\n\\n // get all input blobs\\n\\n Status GetAllInputBlobs(BlobMap& blobs);\\n\\n\\n\\n // get all output blobs\\n\\n Status GetAllOutputBlobs(BlobMap& blobs);\\n\\n\\n\\n // set threads run on cpu\\n\\n Status SetCpuNumThreads(int num_threads);\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 69,\n \"score\": 59279.18429368589\n },\n {\n \"content\": \"\\n\\n#include \\\"tnn/core/blob.h\\\"\\n\\n#include \\\"tnn/core/common.h\\\"\\n\\n#include \\\"tnn/core/macro.h\\\"\\n\\n#include \\\"tnn/core/status.h\\\"\\n\\n#include \\\"tnn/utils/blob_converter.h\\\"\\n\\n\\n\\n#pragma warning(push)\\n\\n#pragma warning(disable : 4251)\\n\\n\\n\\nnamespace TNN_NS {\\n\\n\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 70,\n \"score\": 59274.085280534106\n },\n {\n \"content\": \"class MatConstIterator_ : public MatConstIterator\\n\\n{\\n\\npublic:\\n\\n typedef _Tp value_type;\\n\\n typedef ptrdiff_t difference_type;\\n\\n typedef const _Tp* pointer;\\n\\n typedef const _Tp& reference;\\n\\n\\n\\n typedef std::random_access_iterator_tag iterator_category;\\n\\n\\n\\n //! default constructor\\n\\n MatConstIterator_();\\n\\n //! constructor that sets the iterator to the beginning of the matrix\\n\\n MatConstIterator_(const Mat_<_Tp>* _m);\\n\\n //! constructor that sets the iterator to the specified element of the matrix\\n\\n MatConstIterator_(const Mat_<_Tp>* _m, int _row, int _col=0);\\n\\n //! constructor that sets the iterator to the specified element of the matrix\\n\\n MatConstIterator_(const Mat_<_Tp>* _m, Point _pt);\\n\\n //! constructor that sets the iterator to the specified element of the matrix\\n\\n MatConstIterator_(const Mat_<_Tp>* _m, const int* _idx);\\n\",\n \"file_path\": \"opencv2/core/mat.hpp\",\n \"rank\": 71,\n \"score\": 59271.68895543124\n },\n {\n \"content\": \"class Extractor;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 72,\n \"score\": 59187.11008487533\n },\n {\n \"content\": \" class LITE_EXPORTS HRNet; // [67] reference: https://github.com/HRNet/HRNet-Facial-Landmark-Detection\\n\",\n \"file_path\": \"lite/ort/core/ort_core.h\",\n \"rank\": 73,\n \"score\": 58294.117268425\n },\n {\n \"content\": \"struct CV_EXPORTS Matx_MatMulOp { Matx_MatMulOp() {} Matx_MatMulOp(const Matx_MatMulOp&) {} };\\n\",\n \"file_path\": \"opencv2/core/matx.hpp\",\n \"rank\": 74,\n \"score\": 56916.74502884897\n },\n {\n \"content\": \"//\\n\\n// AutoTime.hpp\\n\\n// MNN\\n\\n//\\n\\n// Created by MNN on 2018/07/27.\\n\\n// Copyright © 2018, Alibaba Group Holding Limited\\n\\n//\\n\\n\\n\\n#ifndef AutoTime_hpp\\n\\n#define AutoTime_hpp\\n\\n\\n\\n#include <stdint.h>\\n\\n#include <stdio.h>\\n\\n#include <MNN/MNNDefine.h>\\n\\n\\n\\nnamespace MNN {\\n\\n\\n\",\n \"file_path\": \"MNN/AutoTime.hpp\",\n \"rank\": 75,\n \"score\": 56636.51935501077\n },\n {\n \"content\": \"#endif // NCNN_VULKAN\\n\\nclass DataReader;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 76,\n \"score\": 56548.446825630796\n },\n {\n \"content\": \"#if NCNN_VULKAN\\n\\nclass VkCompute;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 77,\n \"score\": 56541.51605871881\n },\n {\n \"content\": \"class ExtractorPrivate;\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 78,\n \"score\": 56541.51605871881\n },\n {\n \"content\": \"# include <opencv2/gapi/own/mat.hpp>\\n\\n// replacement of cv's structures:\\n\\nnamespace cv {\\n\\n using Rect = gapi::own::Rect;\\n\\n using Size = gapi::own::Size;\\n\\n using Point = gapi::own::Point;\\n\\n using Point2f = gapi::own::Point2f;\\n\\n using Scalar = gapi::own::Scalar;\\n\\n using Mat = gapi::own::Mat;\\n\\n} // namespace cv\\n\\n#endif // !defined(GAPI_STANDALONE)\\n\\n\\n\\n#endif // OPENCV_GAPI_OPENCV_INCLUDES_HPP\\n\",\n \"file_path\": \"opencv2/gapi/opencv_includes.hpp\",\n \"rank\": 79,\n \"score\": 54213.659508752935\n },\n {\n \"content\": \"// Tencent is pleased to support the open source community by making TNN available.\\n\\n//\\n\\n// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.\\n\\n//\\n\\n// Licensed under the BSD 3-Clause License (the \\\"License\\\"); you may not use this file except\\n\\n// in compliance with the License. You may obtain a copy of the License at\\n\\n//\\n\\n// https://opensource.org/licenses/BSD-3-Clause\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software distributed\\n\\n// under the License is distributed on an \\\"AS IS\\\" BASIS, WITHOUT WARRANTIES OR\\n\\n// CONDITIONS OF ANY KIND, either express or implied. See the License for the\\n\\n// specific language governing permissions and limitations under the License.\\n\\n\\n\\n#ifndef TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\\n\\n#define TNN_INCLUDE_TNN_UTILS_DIMS_VECTOR_UTILS_H_\\n\\n\\n\\n#include <algorithm>\\n\\n\\n\\n#include \\\"tnn/core/common.h\\\"\\n\\n#include \\\"tnn/core/macro.h\\\"\\n\\n#include \\\"tnn/core/status.h\\\"\\n\\n\\n\\nnamespace TNN_NS {\\n\\n\\n\",\n \"file_path\": \"tnn/utils/dims_vector_utils.h\",\n \"rank\": 80,\n \"score\": 54213.534685270264\n },\n {\n \"content\": \"// This file is part of OpenCV project.\\n\\n// It is subject to the license terms in the LICENSE file found in the top-level directory\\n\\n// of this distribution and at http://opencv.org/license.html.\\n\\n//\\n\\n// Copyright (C) 2018 Intel Corporation\\n\\n\\n\\n\\n\\n#ifndef OPENCV_GAPI_UTIL_THROW_HPP\\n\\n#define OPENCV_GAPI_UTIL_THROW_HPP\\n\\n\\n\\n#include <utility> // std::forward\\n\\n\\n\\n#if !defined(__EXCEPTIONS)\\n\\n#include <stdlib.h>\\n\\n#include <stdio.h>\\n\\n#endif\\n\\n\\n\\nnamespace cv\\n\\n{\\n\\nnamespace util\\n\",\n \"file_path\": \"opencv2/gapi/util/throw.hpp\",\n \"rank\": 81,\n \"score\": 54212.61694712113\n },\n {\n \"content\": \"{\\n\\ntemplate <class ExceptionType>\\n\\n[[noreturn]] void throw_error(ExceptionType &&e)\\n\\n{\\n\\n#if defined(__EXCEPTIONS) || defined(_CPPUNWIND)\\n\\n throw std::forward<ExceptionType>(e);\\n\\n#else\\n\\n fprintf(stderr, \\\"An exception thrown! %s\\\\n\\\" , e.what());\\n\\n fflush(stderr);\\n\\n abort();\\n\\n#endif\\n\\n}\\n\\n} // namespace util\\n\\n} // namespace cv\\n\\n\\n\\n#endif // OPENCV_GAPI_UTIL_THROW_HPP\\n\",\n \"file_path\": \"opencv2/gapi/util/throw.hpp\",\n \"rank\": 82,\n \"score\": 54210.06956052039\n },\n {\n \"content\": \"// This file is part of OpenCV project.\\n\\n\\n\\n// It is subject to the license terms in the LICENSE file found in the top-level directory\\n\\n// of this distribution and at http://opencv.org/license.html.\\n\\n//\\n\\n// Copyright (C) 2018 Intel Corporation\\n\\n\\n\\n\\n\\n#ifndef OPENCV_GAPI_OPENCV_INCLUDES_HPP\\n\\n#define OPENCV_GAPI_OPENCV_INCLUDES_HPP\\n\\n\\n\\n#if !defined(GAPI_STANDALONE)\\n\\n# include <opencv2/core/mat.hpp>\\n\\n# include <opencv2/core/cvdef.h>\\n\\n# include <opencv2/core/types.hpp>\\n\\n# include <opencv2/core/base.hpp>\\n\\n#else // Without OpenCV\\n\\n# include <opencv2/gapi/own/cvdefs.hpp>\\n\\n# include <opencv2/gapi/own/types.hpp> // cv::gapi::own::Rect/Size/Point\\n\\n# include <opencv2/gapi/own/scalar.hpp> // cv::gapi::own::Scalar\\n\",\n \"file_path\": \"opencv2/gapi/opencv_includes.hpp\",\n \"rank\": 83,\n \"score\": 54207.296511486944\n },\n {\n \"content\": \"struct LayerInfo;\\n\\n\\n\\n#ifdef FORWARD_CALLBACK_ENABLE\\n\\ntypedef std::function<void(std::vector<Blob*>& blobs, LayerInfo* info)> BlobStatisticCallback;\\n\\n#endif // end of FORWARD_CALLBACK_ENABLE\\n\\n\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 84,\n \"score\": 54194.48420536921\n },\n {\n \"content\": \"class AbstractNetwork;\\n\",\n \"file_path\": \"tnn/core/instance.h\",\n \"rank\": 85,\n \"score\": 54194.48420536921\n },\n {\n \"content\": \"class NCNN_EXPORT Extractor\\n\\n{\\n\\npublic:\\n\\n virtual ~Extractor();\\n\\n\\n\\n // copy\\n\\n Extractor(const Extractor&);\\n\\n\\n\\n // assign\\n\\n Extractor& operator=(const Extractor&);\\n\\n\\n\\n // clear blob mats and alloctors\\n\\n void clear();\\n\\n\\n\\n // enable light mode\\n\\n // intermediate blob will be recycled when enabled\\n\\n // enabled by default\\n\\n void set_light_mode(bool enable);\\n\\n\\n\\n // set thread count for this extractor\\n\",\n \"file_path\": \"ncnn/net.h\",\n \"rank\": 86,\n \"score\": 54122.31251157698\n },\n {\n \"content\": \" }\\n\\n\\n\\n ConstIterator operator++(int) {\\n\\n ConstIterator tmp{*this};\\n\\n ++(*this);\\n\\n return tmp;\\n\\n }\\n\\n\\n\\n const T*& operator*() const {\\n\\n item_ = *current_;\\n\\n return item_;\\n\\n }\\n\\n\\n\\n const T** operator->() const { return &(operator*()); };\\n\\n\\n\\n private:\\n\\n const_iterator current_;\\n\\n mutable const T* item_;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"onnxruntime/core/common/const_pointer_container.h\",\n \"rank\": 87,\n \"score\": 51977.77755741198\n },\n {\n \"content\": \"// Copyright (c) Microsoft Corporation. All rights reserved.\\n\\n// Licensed under the MIT License.\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <type_traits>\\n\\n\\n\\nnamespace onnxruntime {\\n\\n/**\\n\\n Container has T* entries. e.g. std::vector<T*>, and this class provides const access to those\\n\\n via iterators and direct access, as the standard behavior only makes the pointer constant,\\n\\n and not what is pointed too. i.e. you get a const pointer to T not a pointer to const T without this wrapper.\\n\\n See https://stackoverflow.com/questions/8017036/understanding-const-iterator-with-pointers\\n\\n*/\\n\\ntemplate <typename Container>\\n\",\n \"file_path\": \"onnxruntime/core/common/const_pointer_container.h\",\n \"rank\": 88,\n \"score\": 51974.47695941491\n },\n {\n \"content\": \" /**\\n\\n Construct wrapper class that will provide const access to the pointers in a container of non-const pointers.\\n\\n @param data Container with non-const pointers. e.g. std::vector<T*>\\n\\n */\\n\\n explicit ConstPointerContainer(const Container& data) noexcept : data_(data) {}\\n\\n\\n\\n size_t size() const noexcept { return data_.size(); }\\n\\n bool empty() const noexcept { return data_.empty(); }\\n\\n\\n\\n ConstIterator cbegin() const noexcept { return ConstIterator(data_.cbegin()); }\\n\\n ConstIterator cend() const noexcept { return ConstIterator(data_.cend()); }\\n\\n\\n\\n ConstIterator begin() const noexcept { return ConstIterator(data_.cbegin()); }\\n\\n ConstIterator end() const noexcept { return ConstIterator(data_.cend()); }\\n\\n\\n\\n const T* operator[](size_t index) const { return data_[index]; }\\n\\n\\n\\n const T* at(size_t index) const {\\n\\n ORT_ENFORCE(index < data_.size());\\n\\n return data_[index];\\n\\n }\\n\\n\\n\\n private:\\n\\n const Container& data_;\\n\\n};\\n\\n} // namespace onnxruntime\\n\",\n \"file_path\": \"onnxruntime/core/common/const_pointer_container.h\",\n \"rank\": 89,\n \"score\": 51972.97142582076\n },\n {\n \"content\": \"```\\n\\n\\n\\n* 实现 `transform` 和 `detect` 方法.\\n\\n\\n\\n```c++\\n\\n#include \\\"age_googlenet.h\\\"\\n\\n#include \\\"ort/core/ort_utils.h\\\"\\n\\n\\n\\nusing ortcv::AgeGoogleNet;\\n\\n\\n\\nort::Value AgeGoogleNet::transform(const cv::Mat &mat)\\n\\n{\\n\\n cv::Mat canva = mat.clone();\\n\\n cv::resize(canva, canva, cv::Size(input_node_dims.at(3), input_node_dims.at(2)));\\n\\n cv::cvtColor(canva, canva, cv::COLOR_BGR2RGB);\\n\\n // (1,3,224,224)\\n\\n ortcv::utils::transform::normalize_inplace(canva, mean_val, scale_val); // float32\\n\\n \\n\\n return ortcv::utils::transform::create_tensor(\\n\\n canva, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::CHW);\\n\\n}\\n\\n\\n\\nvoid AgeGoogleNet::detect(const cv::Mat &mat, types::Age &age)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n ort::Value &age_logits = output_tensors.at(0); // (1,8)\\n\\n auto age_dims = output_node_dims.at(0);\\n\\n unsigned int interval = 0;\\n\\n const unsigned int num_intervals = age_dims.at(1); // 8\\n\\n const float *pred_logits = age_logits.GetTensorMutableData<float>();\\n\\n auto softmax_probs = ortcv::utils::math::softmax<float>(pred_logits, num_intervals, interval);\\n\\n const float pred_age = static_cast<float>(age_intervals[interval][0] + age_intervals[interval][1]) / 2.0f;\\n\\n age.age = pred_age;\\n\\n age.age_interval[0] = age_intervals[interval][0];\\n\\n age.age_interval[1] = age_intervals[interval][1];\\n\\n age.interval_prob = softmax_probs[interval];\\n\\n age.flag = true;\\n\\n}\\n\\n```\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"docs/ort/ort_handler.zh.md\",\n \"rank\": 91,\n \"score\": 52.56817515439065\n },\n {\n \"content\": \"using ortcv::AgeGoogleNet;\\n\\n\\n\\nort::Value AgeGoogleNet::transform(const cv::Mat &mat)\\n\\n{\\n\\n cv::Mat canva = mat.clone();\\n\\n cv::resize(canva, canva, cv::Size(input_node_dims.at(3), input_node_dims.at(2)));\\n\\n cv::cvtColor(canva, canva, cv::COLOR_BGR2RGB);\\n\\n // (1,3,224,224)\\n\\n ortcv::utils::transform::normalize_inplace(canva, mean_val, scale_val); // float32\\n\\n \\n\\n return ortcv::utils::transform::create_tensor(\\n\\n canva, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::CHW);\\n\\n}\\n\\n\\n\\nvoid AgeGoogleNet::detect(const cv::Mat &mat, types::Age &age)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n ort::Value &age_logits = output_tensors.at(0); // (1,8)\\n\\n auto age_dims = output_node_dims.at(0);\\n\\n unsigned int interval = 0;\\n\\n const unsigned int num_intervals = age_dims.at(1); // 8\\n\\n const float *pred_logits = age_logits.GetTensorMutableData<float>();\\n\\n auto softmax_probs = ortcv::utils::math::softmax<float>(pred_logits, num_intervals, interval);\\n\\n const float pred_age = static_cast<float>(age_intervals[interval][0] + age_intervals[interval][1]) / 2.0f;\\n\\n age.age = pred_age;\\n\\n age.age_interval[0] = age_intervals[interval][0];\\n\\n age.age_interval[1] = age_intervals[interval][1];\\n\\n age.interval_prob = softmax_probs[interval];\\n\\n age.flag = true;\\n\\n}\\n\",\n \"file_path\": \"docs/ort/ort_handler.md\",\n \"rank\": 92,\n \"score\": 47.22921457483278\n },\n {\n \"content\": \"\\n\\nvoid FastStyleTransfer::detect(const cv::Mat &mat, types::StyleContent &style_content)\\n\\n{\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n Ort::Value &pred_tensor = output_tensors.at(0); // (1,3,224,224)\\n\\n auto pred_dims = output_node_dims.at(0);\\n\\n const unsigned int rows = pred_dims.at(2); // H\\n\\n const unsigned int cols = pred_dims.at(3); // W\\n\\n\\n\\n style_content.mat.create(rows, cols, CV_8UC3); // release & create\\n\\n\\n\\n // time cost!\\n\\n for (unsigned int i = 0; i < rows; ++i)\\n\\n {\\n\",\n \"file_path\": \"lite/ort/cv/fast_style_transfer.cpp\",\n \"rank\": 94,\n \"score\": 44.64732430933586\n },\n {\n \"content\": \" return Ort::Value::CreateTensor<uchar>(memory_info_handler, input_values_handler.data(),\\n\\n input_tensor_sizes.at(0),\\n\\n input_node_dims.at(0).data(),\\n\\n input_node_dims.at(0).size());\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\nvoid SSDMobileNetV1::detect(const cv::Mat &mat, std::vector<types::Boxf> &detected_boxes,\\n\\n float score_threshold, float iou_threshold,\\n\\n unsigned int topk, unsigned int nms_type)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n const unsigned int img_height = mat.rows;\\n\\n const unsigned int img_width = mat.cols;\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference nums & boxes & scores & classes.\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\",\n \"file_path\": \"lite/ort/cv/ssd_mobilenetv1.cpp\",\n \"rank\": 95,\n \"score\": 44.431514223245614\n },\n {\n \"content\": \" canvas, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::HWC);\\n\\n}\\n\\n\\n\\nvoid EfficientNetLite4::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n Ort::Value &scores_tensor = output_tensors.at(0); // (1,1000)\\n\\n const unsigned int num_classes = output_node_dims.at(0).at(1);\\n\\n const float *scores = scores_tensor.GetTensorMutableData<float>(); // float\\n\\n std::vector<unsigned int> sorted_indices = lite::utils::math::argsort<float>(scores, num_classes);\\n\\n if (top_k > num_classes) top_k = num_classes;\\n\\n\\n\",\n \"file_path\": \"lite/ort/cv/efficientnet_lite4.cpp\",\n \"rank\": 96,\n \"score\": 44.11565119581444\n },\n {\n \"content\": \" canvas, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::CHW);\\n\\n}\\n\\n\\n\\nvoid ShuffleNetV2::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\\n\\n const unsigned int num_classes = output_node_dims.at(0).at(1);\\n\\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\\n\\n unsigned int max_id;\\n\\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\\n\\n std::vector<unsigned int> sorted_indices = lite::utils::math::argsort<float>(scores);\\n\",\n \"file_path\": \"lite/ort/cv/shufflenetv2.cpp\",\n \"rank\": 97,\n \"score\": 43.848575563868394\n },\n {\n \"content\": \" return ortcv::utils::transform::create_tensor(\\n\\n canvas, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::CHW);\\n\\n}\\n\\n\\n\\nvoid GhostNet::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\\n\\n const unsigned int num_classes = output_node_dims.at(0).at(1);\\n\\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\\n\\n unsigned int max_id;\\n\\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\\n\",\n \"file_path\": \"lite/ort/cv/ghostnet.cpp\",\n \"rank\": 98,\n \"score\": 43.82395921161442\n },\n {\n \"content\": \" return ortcv::utils::transform::create_tensor(\\n\\n canvas, input_node_dims, memory_info_handler,\\n\\n input_values_handler, ortcv::utils::transform::CHW);\\n\\n}\\n\\n\\n\\nvoid ResNet::detect(const cv::Mat &mat, types::ImageNetContent &content, unsigned int top_k)\\n\\n{\\n\\n if (mat.empty()) return;\\n\\n // 1. make input tensor\\n\\n Ort::Value input_tensor = this->transform(mat);\\n\\n // 2. inference\\n\\n auto output_tensors = ort_session->Run(\\n\\n Ort::RunOptions{nullptr}, input_node_names.data(),\\n\\n &input_tensor, 1, output_node_names.data(), num_outputs\\n\\n );\\n\\n Ort::Value &logits_tensor = output_tensors.at(0); // (1,1000)\\n\\n const unsigned int num_classes = output_node_dims.at(0).at(1);\\n\\n const float *logits = logits_tensor.GetTensorMutableData<float>(); // float\\n\\n unsigned int max_id;\\n\\n std::vector<float> scores = lite::utils::math::softmax<float>(logits, num_classes, max_id);\\n\",\n \"file_path\": \"lite/ort/cv/resnet.cpp\",\n \"rank\": 99,\n \"score\": 43.82395921161442\n }\n]","isConversational":false}}},{"rowIdx":388,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"stlio.hpp"},"repo_name":{"kind":"string","value":"legokangpalla/FileSTL"},"commit":{"kind":"string","value":"675b2cc1364e8d70be43ec09423dbc45b7b574b0"},"file_code":{"kind":"string","value":"\n\n#pragma once\n\n#include <vector>\n#include <type_traits>\n#include <utility>\n#include <fstream>\n\n#include <boost/config/warning_disable.hpp>\n#include <boost/spirit/include/qi.hpp>\n#include <boost/spirit/include/phoenix_core.hpp>\n#include <boost/spirit/include/phoenix_operator.hpp>\n#include <boost/spirit/include/phoenix_fusion.hpp>\n#include <boost/spirit/include/phoenix_stl.hpp>\n#include <boost/spirit/include/phoenix_object.hpp>\n#include <boost/fusion/include/adapt_struct.hpp>\n\nnamespace tyti {\n namespace stl {\n\n \n \n template<typename T>\n struct basic_vec3\n {\n using scalar_type = T;\n static_assert(std::is_floating_point<scalar_type>::value, \"T must be a floating point\");\n T data[3];\n basic_vec3():data{T(0),T(0),T(0)}{}\n basic_vec3(T x, T y, T z):data{x,y,z}{}\n \n T operator[](size_t i)const {return data[i];}\n const T &operator[](size_t i) { return data[i]; }\n };\n\n using dvec3 = basic_vec3<double>;\n using vec3 = basic_vec3<float>;\n\n \n\n \n \n template<typename T>\n struct basic_solid\n {\n using vec3 = basic_vec3<T>;\n using scalar_type = T;\n std::string header; \n std::vector<vec3> normals;\n std::vector<vec3> vertices;\n std::vector<std::uint16_t> attributes; \n };\n\n using dsolid = basic_solid<double>;\n using solid = basic_solid<float>;\n\n \n \n template <typename T, typename Iterator>\n struct stl_parser_ascii : boost::spirit::qi::grammar<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type>\n {\n\n stl_parser_ascii() : stl_parser_ascii::base_type(start)\n {\n namespace qi = boost::spirit::qi;\n namespace ql = qi::labels;\n namespace ascii = boost::spirit::ascii;\n namespace fusion = boost::fusion;\n namespace px = boost::phoenix;\n\n startSolid %= qi::lexeme[qi::lit(\"solid \") >> (+(ascii::char_ - qi::eol) | qi::attr(\"\"))]; \n\n endSolid = qi::lexeme[qi::lit(\"endsolid \") >> ascii::string(ql::_r1)];\n\n vector %= qi::float_ >> qi::float_ >> qi::float_;\n\n start =\n startSolid[px::at_c<0>(ql::_val) = ql::_1]\n\n >> *(qi::lit(\"facet\") >> qi::lit(\"normal\") >> vector[px::push_back(px::at_c<1>(ql::_val), ql::_1)]\n \n >> qi::lit(\"outer loop\")\n >> qi::repeat(3)[qi::lit(\"vertex\") >> vector[px::push_back(px::at_c<2>(ql::_val), ql::_1)]]\n >> qi::lit(\"endloop\")\n >> qi::lit(\"endfacet\")\n )\n \n >> endSolid(px::at_c<0>(ql::_val))\n ;\n }\n\n boost::spirit::qi::rule<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type> start;\n boost::spirit::qi::rule<Iterator, std::string(), boost::spirit::ascii::space_type> startSolid;\n boost::spirit::qi::rule<Iterator, basic_vec3<T>(), boost::spirit::ascii::space_type> vector;\n boost::spirit::qi::rule<Iterator, void(std::string), boost::spirit::ascii::space_type> endSolid;\n };\n\n template <typename T, typename Iterator>\n struct stl_parser_binary : boost::spirit::qi::grammar<Iterator, basic_solid<T>()>\n {\n\n stl_parser_binary() : stl_parser_binary::base_type(start)\n {\n namespace spirit = boost::spirit;\n namespace qi = boost::spirit::qi;\n namespace ql = qi::labels;\n namespace ascii = boost::spirit::ascii;\n namespace px = boost::phoenix;\n\n vector %= spirit::little_bin_float >> spirit::little_bin_float >> spirit::little_bin_float;\n\n start =\n qi::repeat(80)[spirit::byte_[px::at_c<0>(ql::_val) += ql::_1]] \n >> spirit::little_dword[px::reserve(px::at_c<1>(ql::_val), ql::_1),\n px::reserve(px::at_c<2>(ql::_val), 3 * ql::_1),\n px::reserve(px::at_c<3>(ql::_val), ql::_1)] \n >> *(vector[px::push_back(px::at_c<1>(ql::_val), ql::_1)] \n >> spirit::repeat(3)[vector[px::push_back(px::at_c<2>(ql::_val), ql::_1)]] \n >> spirit::little_word[px::push_back(px::at_c<3>(ql::_val), ql::_1)] \n )\n \n ;\n }\n\n boost::spirit::qi::rule<Iterator, basic_solid<T>()> start;\n boost::spirit::qi::rule<Iterator, basic_vec3<T>()> vector;\n boost::spirit::qi::rule<Iterator, void(std::string)> endSolid;\n };\n\n template <typename T, typename Iterator>\n struct stl_parser : boost::spirit::qi::grammar<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type>\n {\n stl_parser() : stl_parser::base_type(start)\n {\n start %= stl_ascii_ | boost::spirit::qi::lexeme[stl_binary_];\n }\n stl_parser_ascii<T, Iterator> stl_ascii_;\n stl_parser_binary<T, Iterator> stl_binary_;\n boost::spirit::qi::rule<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type> start;\n };\n\n \n \n \n\n \n \n template<typename T, typename IterT>\n inline bool read(basic_solid<T>& out, IterT begin, IterT end)\n {\n stl_parser< T, IterT > p;\n return boost::spirit::qi::phrase_parse(begin, end, p, boost::spirit::ascii::space, out);\n }\n\n template<typename T, typename IterT>\n inline std::pair< basic_solid<T>, bool > read(IterT begin, IterT end)\n {\n basic_solid<T> o;\n bool r = read(o, begin, end);\n return std::make_pair<basic_solid<T>, bool>(std::move(o), std::move(r));\n }\n\n template<typename IterT>\n inline std::pair< solid, bool > read(IterT begin, IterT end)\n {\n return read<float>(begin, end);\n }\n\n \n\n template<typename T>\n inline bool read(basic_solid<T>& out, const std::string& fileName)\n {\n std::ifstream f(fileName, std::ios::binary);\n std::string str;\n f.seekg(0, std::ios::end);\n str.resize((unsigned)f.tellg());\n f.seekg(0, std::ios::beg);\n f.read(&str[0], str.size());\n f.close();\n\n return read<T>(out, str.cbegin(), str.cend());\n }\n\n template<typename T>\n inline std::pair<basic_solid<T>, bool> read(const std::string& fileName)\n {\n basic_solid<T> out;\n bool r = read(out, fileName);\n return std::make_pair<basic_solid<T>, bool>(std::move(out), std::move(r));\n }\n\n inline std::pair<solid, bool> read(const std::string& fileName)\n {\n return read<float>(fileName);\n }\n\n \n \n\n template<typename T, typename streamT>\n void write_ascii(streamT& out, const basic_solid<T>&s)\n {\n out << \"solid \" << s.header << \"\\n\";\n\n for (size_t i = 0; i < s.normals.size(); ++i)\n {\n out << \"\\tfacet normal \"\n << s.normals[i][0] << \" \"\n << s.normals[i][1] << \" \"\n << s.normals[i][2] << \" \"\n << \"\\n\";\n\n out << \"\\t\\touter loop\\n\";\n for (size_t j = 0; j < 3; ++j)\n {\n out << \"\\t\\t\\tvertex \"\n << s.vertices[3 * i + j][0] << \" \"\n << s.vertices[3 * i + j][1] << \" \"\n << s.vertices[3 * i + j][2] << \" \"\n << \"\\n\";\n }\n out << \"\\t\\tendloop\\n\"\n << \"\\tendfacet\\n\";\n }\n out << \"endsolid \" << s.header << \"\\n\";\n }\n\n namespace detail \n {\n template<typename streamT>\n inline void write_vectorF32(streamT& out, const double* p)\n {\n for (size_t i = 0; i < 3; ++i)\n {\n const float f = static_cast<float>(p[i]);\n out.write(reinterpret_cast<const char *>(p), sizeof(float));\n }\n }\n\n template<typename streamT>\n inline void write_vectorF32(streamT& out, const float* p)\n {\n out.write(reinterpret_cast<const char*>(p), sizeof(float) * 3);\n }\n }\n\n template<typename T, typename streamT>\n void write_binary(streamT& out, basic_solid<T>&s)\n {\n s.header.resize(80);\n out.write(&s.header[0], 80);\n\n const size_t num_triangles{ s.normals.size() };\n s.attributes.resize(num_triangles);\n\n out.write(reinterpret_cast<const char*>(&num_triangles), 4);\n\n out << num_triangles;\n for (size_t i = 0; i < num_triangles; ++i)\n {\n \n detail::write_vectorF32(out, s.normals[i].data);\n for (size_t j = 0; j < 3; ++j)\n detail::write_vectorF32(out, s.vertices[3 * i + j].data);\n out.write(reinterpret_cast<const char*>(&s.attributes[i]), sizeof(uint16_t));\n }\n }\n\n template<typename T, typename streamT>\n void write(streamT& out, basic_solid<T>& s, bool binary)\n {\n s.vertices.resize(3 * s.normals.size());\n\n if (binary)\n write_binary(out, s);\n else\n write_ascii(out, s);\n }\n\n }\n}\n\nBOOST_FUSION_ADAPT_TPL_STRUCT(\n(T),\n(tyti::stl::basic_solid)(T),\n(std::string, header),\n(std::vector< tyti::stl::basic_vec3<T> >, normals),\n(std::vector< tyti::stl::basic_vec3<T> >, vertices),\n(std::vector<std::uint16_t>, attributes)\n);\n\nBOOST_FUSION_ADAPT_TPL_STRUCT(\n(T),\n(tyti::stl::basic_vec3)(T),\n(T, data[0])\n(T, data[1])\n(T, data[2])\n);\n"},"prefix":{"kind":"string","value":"\n\n#pragma once\n\n#include <vector>\n#include <type_traits>\n#include <utility>\n#include <fstream>\n\n#include <boost/config/warning_disable.hpp>\n#include <boost/spirit/include/qi.hpp>\n#include <boost/spirit/include/phoenix_core.hpp>\n#include <boost/spirit/include/phoenix_operator.hpp>\n#include <boost/spirit/include/phoenix_fusion.hpp>\n#include <boost/spirit/include/phoenix_stl.hpp>\n#include <boost/spirit/include/phoenix_object.hpp>\n#include <boost/fusion/include/adapt_struct.hpp>\n\nnamespace tyti {\n namespace stl {\n\n \n \n template<typename T>\n struct basic_vec3\n {\n using scalar_type = T;\n static_assert(std::is_floating_point<scalar_type>::value, \"T must be a floating point\");\n T data[3];\n basic_vec3():data{T(0),T(0),T(0)}{}\n basic_vec3(T x, T y, T z):data{x,y,z}{}\n \n T operator[](size_t i)const {return data[i];}\n const T &operator[](size_t i) { return data[i]; }\n };\n\n using dvec3 = basic_vec3<double>;\n using vec3 = basic_vec3<float>;\n\n \n\n \n \n template<typename T>\n struct basic_solid\n {\n using vec3 = basic_vec3<T>;\n using scalar_type = T;\n std::string header; \n std::vector<vec3> normals;\n std::vector<vec3> vertices;\n std::vector<std::uint16_t> attributes; \n };\n\n using dsolid = basic_solid<double>;\n using solid = basic_solid<float>;\n\n \n \n template <typename T, typename Iterator>\n struct stl_parser_ascii : boost::spirit::qi::grammar<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type>\n {\n\n stl_parser_ascii() : stl_parser_ascii::base_type(start)\n {\n namespace qi = boost::spirit::qi;\n namespace ql = qi::labels;\n namespace ascii = boost::spirit::ascii;\n namespace fusion = boost::fusion;\n namespace px = boost::phoenix;\n\n startSolid %= qi::lexeme[qi::lit(\"solid \") >> (+(ascii::char_ - qi::eol) | qi::attr(\"\"))]; \n\n endSolid = qi::lexeme[qi::lit(\"endsolid \") >> ascii::string(ql::_r1)];\n\n vector %= qi::float_ >> qi::float_ >> qi::float_;\n\n start =\n startSolid[px::at_c<0>(ql::_val) = ql::_1]\n\n >> *(qi::lit(\"facet\") >> qi::lit(\"normal\") >> vector[px::push_back(px::at_c<1>(ql::_val), ql::_1)]\n \n >> qi::lit(\"outer loop\")\n >> qi::repeat(3)[qi::lit(\"vertex\") >> vector[px::push_back(px::at_c<2>(ql::_val), ql::_1)]]\n >> qi::lit(\"endloop\")\n >> qi::lit(\"endfacet\")\n )\n \n >> endSolid(px::at_c<0>(ql::_val))\n ;\n }\n\n boost::spirit::qi::rule<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type> start;\n boost::spirit::qi::rule<Iterator, std::string(), boost::spirit::ascii::space_type> startSolid;\n boost::spirit::qi::rule<Iterator, basic_vec3<T>(), boost::spirit::ascii::space_type> vector;\n boost::spirit::qi::rule<Iterator, void(std::string), boost::spirit::ascii::space_type> endSolid;\n };\n\n template <typename T, typename Iterator>\n struct stl_parser_binary : boost::spirit::qi::grammar<Iterator, basic_solid<T>()>\n {\n\n stl_parser_binary() : stl_parser_binary::base_type(start)\n {\n namespace spirit = boost::spirit;\n namespace qi = boost::spirit::qi;\n namespace ql = qi::labels;\n namespace ascii = boost::spirit::ascii;\n namespace px = boost::phoenix;\n\n vector %= spirit::little_bin_float >> spirit::little_bin_float >> spirit::little_bin_float;\n\n start =\n qi::repeat(80)[spirit::byte_[px::at_c<0>(ql::_val) += ql::_1]] \n >> spirit::little_dword[px::reserve(px::at_c<1>(ql::_val), ql::_1),\n px::reserve(px::at_c<2>(ql::_val), 3 * ql::_1),\n px::reserve(px::at_c<3>(ql::_val), ql::_1)] \n >> *(vector[px::push_back(px::at_c<1>(ql::_val), ql::_1)] \n >> spirit::repeat(3)[vector[px::push_back(px::at_c<2>(ql::_val), ql::_1)]] \n >> spirit::little_word[px::push_back(px::at_c<3>(ql::_val), ql::_1)] \n )\n \n ;\n }\n\n boost::spirit::qi::rule<Iterator, basic_solid<T>()> start;\n boost::spirit::qi::rule<Iterator, basic_vec3<T>()> vector;\n boost::spirit::qi::rule<Iterator, void(std::string)> endSolid;\n };\n\n template <typename T, typename Iterator>\n struct stl_parser : boost::spirit::qi::grammar<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type>\n {\n stl_parser() : stl_parser::base_type(start)\n {\n start %= stl_ascii_ | boost::spirit::qi::lexeme[stl_binary_];\n }\n stl_parser_ascii<T, Iterator> stl_ascii_;\n stl_parser_binary<T, Iterator> stl_binary_;\n boost::spirit::qi::rule<Iterator, basic_solid<T>(), boost::spirit::ascii::space_type> start;\n };\n\n \n \n \n\n \n \n template<typename T, typename IterT>\n inline bool read(basic_solid<T>& out, IterT begin, IterT end)\n {\n stl_parser< T, IterT > p;\n return boost::spirit::qi::phrase_parse(begin, end, p, boost::spirit::ascii::space, out);\n }\n\n template<typename T, typename IterT>\n inline std::pair< basic_solid<T>, bool > read(IterT begin, IterT end)\n {\n basic_solid<T> o;\n bool r = read(o, begin, end);\n return std::make_pair<basic_solid<T>, bool>(std::move(o), std::move(r));\n }\n\n template<typename IterT>"},"suffix":{"kind":"string","value":" const size_t num_triangles{ s.normals.size() };\n s.attributes.resize(num_triangles);\n\n out.write(reinterpret_cast<const char*>(&num_triangles), 4);\n\n out << num_triangles;\n for (size_t i = 0; i < num_triangles; ++i)\n {\n \n detail::write_vectorF32(out, s.normals[i].data);\n for (size_t j = 0; j < 3; ++j)\n detail::write_vectorF32(out, s.vertices[3 * i + j].data);\n out.write(reinterpret_cast<const char*>(&s.attributes[i]), sizeof(uint16_t));\n }\n }\n\n template<typename T, typename streamT>\n void write(streamT& out, basic_solid<T>& s, bool binary)\n {\n s.vertices.resize(3 * s.normals.size());\n\n if (binary)\n write_binary(out, s);\n else\n write_ascii(out, s);\n }\n\n }\n}\n\nBOOST_FUSION_ADAPT_TPL_STRUCT(\n(T),\n(tyti::stl::basic_solid)(T),\n(std::string, header),\n(std::vector< tyti::stl::basic_vec3<T> >, normals),\n(std::vector< tyti::stl::basic_vec3<T> >, vertices),\n(std::vector<std::uint16_t>, attributes)\n);\n\nBOOST_FUSION_ADAPT_TPL_STRUCT(\n(T),\n(tyti::stl::basic_vec3)(T),\n(T, data[0])\n(T, data[1])\n(T, data[2])\n);\n"},"middle":{"kind":"string","value":"\n inline std::pair< solid, bool > read(IterT begin, IterT end)\n {\n return read<float>(begin, end);\n }\n\n \n\n template<typename T>\n inline bool read(basic_solid<T>& out, const std::string& fileName)\n {\n std::ifstream f(fileName, std::ios::binary);\n std::string str;\n f.seekg(0, std::ios::end);\n str.resize((unsigned)f.tellg());\n f.seekg(0, std::ios::beg);\n f.read(&str[0], str.size());\n f.close();\n\n return read<T>(out, str.cbegin(), str.cend());\n }\n\n template<typename T>\n inline std::pair<basic_solid<T>, bool> read(const std::string& fileName)\n {\n basic_solid<T> out;\n bool r = read(out, fileName);\n return std::make_pair<basic_solid<T>, bool>(std::move(out), std::move(r));\n }\n\n inline std::pair<solid, bool> read(const std::string& fileName)\n {\n return read<float>(fileName);\n }\n\n \n \n\n template<typename T, typename streamT>\n void write_ascii(streamT& out, const basic_solid<T>&s)\n {\n out << \"solid \" << s.header << \"\\n\";\n\n for (size_t i = 0; i < s.normals.size(); ++i)\n {\n out << \"\\tfacet normal \"\n << s.normals[i][0] << \" \"\n << s.normals[i][1] << \" \"\n << s.normals[i][2] << \" \"\n << \"\\n\";\n\n out << \"\\t\\touter loop\\n\";\n for (size_t j = 0; j < 3; ++j)\n {\n out << \"\\t\\t\\tvertex \"\n << s.vertices[3 * i + j][0] << \" \"\n << s.vertices[3 * i + j][1] << \" \"\n << s.vertices[3 * i + j][2] << \" \"\n << \"\\n\";\n }\n out << \"\\t\\tendloop\\n\"\n << \"\\tendfacet\\n\";\n }\n out << \"endsolid \" << s.header << \"\\n\";\n }\n\n namespace detail \n {\n template<typename streamT>\n inline void write_vectorF32(streamT& out, const double* p)\n {\n for (size_t i = 0; i < 3; ++i)\n {\n const float f = static_cast<float>(p[i]);\n out.write(reinterpret_cast<const char *>(p), sizeof(float));\n }\n }\n\n template<typename streamT>\n inline void write_vectorF32(streamT& out, const float* p)\n {\n out.write(reinterpret_cast<const char*>(p), sizeof(float) * 3);\n }\n }\n\n template<typename T, typename streamT>\n void write_binary(streamT& out, basic_solid<T>&s)\n {\n s.header.resize(80);\n out.write(&s.header[0], 80);\n\n"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#define BOOST_TEST_MODULE STL_IO\n\n\n\n#include <boost/test/included/unit_test.hpp>\n\n#include <boost/mpl/list.hpp>\n\n\n\n#include <sstream>\n\n\n\n#include \"../stlio.hpp\"\n\n\n\nusing test_types = boost::mpl::list<float, double>;\n\n\n\nusing namespace tyti;\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_ascii_from_string, T, test_types)\n\n{\n\n using solid = stl::basic_solid<T>;\n\n std::string str = \"solid Hi you\\n \\\n\n facet normal 0.5 0.6 0.7\\n\\\n\n outer loop\\n\\\n\n vertex 0.5 0.6 0.7\\n\\\n","file_path":"test/stl_parser_test.cpp","rank":0,"score":11115.289688987395},{"content":" vertex 0.5 0.6 0.7\\n\\\n\n vertex 0.5 0.6 0.7\\n\\\n\n endloop\\n\\\n\n endfacet\\n\\\n\n endsolid Hi you\\n\";\n\n\n\n auto out = stl::read<T>(str.begin(), str.end());\n\n\n\n BOOST_TEST(out.second);\n\n solid& s = out.first;\n\n BOOST_TEST(s.header == \"Hi you\");\n\n BOOST_TEST(s.normals.size() == 1);\n\n BOOST_TEST(s.vertices.size() == 3);\n\n BOOST_TEST(s.attributes.size() == 0);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_ascii_from_file, T, test_types)\n\n{\n\n const std::string test_data{ SOURCE_DIR \"/testdata/cube_ascii.stl\" };\n\n\n","file_path":"test/stl_parser_test.cpp","rank":1,"score":11112.840945052321},{"content":"}\n\n\n\ntemplate<typename T>\n\nvoid simple_read_test(bool binary)\n\n{\n\n using solid = stl::basic_solid<T>;\n\n using vec3 = stl::basic_vec3<T>;\n\n\n\n T n = T(1.0);\n\n vec3 vec_n(n, n, n);\n\n\n\n solid to_write;\n\n to_write.vertices.push_back(vec_n);\n\n to_write.vertices.push_back(vec_n);\n\n to_write.vertices.push_back(vec_n);\n\n to_write.normals.push_back(vec_n);\n\n\n\n std::stringstream sstream;\n\n stl::write(sstream, to_write, binary);\n\n\n","file_path":"test/stl_parser_test.cpp","rank":2,"score":11112.578891802792},{"content":" std::string str_w = sstream.str();\n\n auto out = stl::read<T>(str_w.begin(), str_w.end());\n\n BOOST_TEST(out.second);\n\n\n\n solid cmp = out.first;\n\n BOOST_TEST(to_write.header == cmp.header);\n\n BOOST_TEST(to_write.vertices.size() == cmp.vertices.size());\n\n BOOST_TEST(to_write.normals.size() == cmp.normals.size());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPLATE(write_binary, T, test_types)\n\n{\n\n simple_read_test<T>(true);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPLATE(write_ascii, T, test_types)\n\n{\n\n simple_read_test<T>(false);\n\n}","file_path":"test/stl_parser_test.cpp","rank":3,"score":11110.098238485776},{"content":" auto out = stl::read<T>(test_data);\n\n BOOST_TEST(out.second);\n\n stl::basic_solid<T>& s = out.first;\n\n\n\n BOOST_TEST(s.normals.size() == 12);\n\n BOOST_TEST(s.vertices.size() == 3*12);\n\n BOOST_TEST(s.attributes.size() == 0);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_binary_from_file, T, test_types)\n\n{\n\n const std::string test_data{ SOURCE_DIR \"/testdata/cube_binary.stl\" };\n\n\n\n auto out = stl::read<T>(test_data);\n\n BOOST_TEST(out.second);\n\n stl::basic_solid<T>& s = out.first;\n\n\n\n BOOST_TEST(s.normals.size() == 12);\n\n BOOST_TEST(s.vertices.size() == 3 * 12);\n\n BOOST_TEST(s.attributes.size() == 12);\n","file_path":"test/stl_parser_test.cpp","rank":4,"score":11108.96588228026},{"content":"# STL File Reader and Writer\n\nReads and writes STL files for 3D Geometry.\n\n\n\n## Install\n\nHeader only\n\n\n\n## Dependencies:\n\n - [Boost.Spirit](http://www.boost.org/)\n\n - [Boost.Test (for tests)](http://www.boost.org/)\n\n\n\n## Small and Fast Reference\n\nUse one of the read functions in namespace `tyti::stl`.\n\n\n\nPossible scalar values for the template `float, double`, default is `float`.\n\n\n\n```c++\n\n//////////////////////////////////////////////////////////////\n\n// Reader Functions:\n\ntemplate<typename T, typename IterT>\n\ninline bool read(basic_solid<T>& out, IterT begin, IterT end)\n\ntemplate<typename T, typename IterT>\n\ninline std::pair< basic_solid<T>, bool > read(IterT begin, IterT end)\n\ntemplate<typename IterT>\n\ninline std::pair< solid, bool > read(IterT begin, IterT end)\n\n\n\n//////////////////////////////////////////////////////////////\n\n// Writer Functions: (streamT is an output stream type)\n\ntemplate<typename T, typename streamT>\n\nvoid write(streamT& out, basic_solid<T>& s, bool binary)\n\ntemplate<typename T, typename streamT>\n\nvoid write_binary(streamT& out, basic_solid<T>&s)\n\ntemplate<typename T, typename streamT>\n\nvoid write_ascii(streamT& out, basic_solid<T>&s)\n\n\n\n// Remark: the solid parameter is not constant to ensure the correct size of the containers.\n\n// You may want to rewrite those functions corresponding on your error-checking presumptions\n\n\n\n// The write functions were just written as a proof of concept and you may want to avoid them\n\n\n\n//////////////////////////////////////////////////////////////\n\n// Output DataType:\n\ntemplate<typename T>\n\nstruct basic_solid\n\n{\n\n using vec3 = basic_vec3<T>;\n\n using scalar_type = T;\n\n std::string header; //solid name or header\n\n std::vector<vec3> normals;\n\n std::vector<vec3> vertices;\n\n std::vector<std::uint16_t> attributes; //only available in binary files\n\n};\n\n\n\ntypedef basic_solid<float> solid;\n\ntypedef basic_solid<float> dsolid;\n\n\n\ntemplate<typename T>\n\nstruct basic_vec3\n\n{\n\n using scalar_type = T;\n\n T data[3];\n\n};\n\n\n\ntypedef basic_vec3<float> vec3;\n\ntypedef basic_vec3<float> dvec3;\n\n```\n\n\n\n\n\n## License\n\n\n\n[MIT License](./LICENSE) © Matthias Möller. Made with ♥ in Germany.\n","file_path":"Readme.md","rank":5,"score":6357.771984835941}],"string":"[\n {\n \"content\": \"#define BOOST_TEST_MODULE STL_IO\\n\\n\\n\\n#include <boost/test/included/unit_test.hpp>\\n\\n#include <boost/mpl/list.hpp>\\n\\n\\n\\n#include <sstream>\\n\\n\\n\\n#include \\\"../stlio.hpp\\\"\\n\\n\\n\\nusing test_types = boost::mpl::list<float, double>;\\n\\n\\n\\nusing namespace tyti;\\n\\n\\n\\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_ascii_from_string, T, test_types)\\n\\n{\\n\\n using solid = stl::basic_solid<T>;\\n\\n std::string str = \\\"solid Hi you\\\\n \\\\\\n\\n facet normal 0.5 0.6 0.7\\\\n\\\\\\n\\n outer loop\\\\n\\\\\\n\\n vertex 0.5 0.6 0.7\\\\n\\\\\\n\",\n \"file_path\": \"test/stl_parser_test.cpp\",\n \"rank\": 0,\n \"score\": 11115.289688987395\n },\n {\n \"content\": \" vertex 0.5 0.6 0.7\\\\n\\\\\\n\\n vertex 0.5 0.6 0.7\\\\n\\\\\\n\\n endloop\\\\n\\\\\\n\\n endfacet\\\\n\\\\\\n\\n endsolid Hi you\\\\n\\\";\\n\\n\\n\\n auto out = stl::read<T>(str.begin(), str.end());\\n\\n\\n\\n BOOST_TEST(out.second);\\n\\n solid& s = out.first;\\n\\n BOOST_TEST(s.header == \\\"Hi you\\\");\\n\\n BOOST_TEST(s.normals.size() == 1);\\n\\n BOOST_TEST(s.vertices.size() == 3);\\n\\n BOOST_TEST(s.attributes.size() == 0);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_ascii_from_file, T, test_types)\\n\\n{\\n\\n const std::string test_data{ SOURCE_DIR \\\"/testdata/cube_ascii.stl\\\" };\\n\\n\\n\",\n \"file_path\": \"test/stl_parser_test.cpp\",\n \"rank\": 1,\n \"score\": 11112.840945052321\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate<typename T>\\n\\nvoid simple_read_test(bool binary)\\n\\n{\\n\\n using solid = stl::basic_solid<T>;\\n\\n using vec3 = stl::basic_vec3<T>;\\n\\n\\n\\n T n = T(1.0);\\n\\n vec3 vec_n(n, n, n);\\n\\n\\n\\n solid to_write;\\n\\n to_write.vertices.push_back(vec_n);\\n\\n to_write.vertices.push_back(vec_n);\\n\\n to_write.vertices.push_back(vec_n);\\n\\n to_write.normals.push_back(vec_n);\\n\\n\\n\\n std::stringstream sstream;\\n\\n stl::write(sstream, to_write, binary);\\n\\n\\n\",\n \"file_path\": \"test/stl_parser_test.cpp\",\n \"rank\": 2,\n \"score\": 11112.578891802792\n },\n {\n \"content\": \" std::string str_w = sstream.str();\\n\\n auto out = stl::read<T>(str_w.begin(), str_w.end());\\n\\n BOOST_TEST(out.second);\\n\\n\\n\\n solid cmp = out.first;\\n\\n BOOST_TEST(to_write.header == cmp.header);\\n\\n BOOST_TEST(to_write.vertices.size() == cmp.vertices.size());\\n\\n BOOST_TEST(to_write.normals.size() == cmp.normals.size());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE_TEMPLATE(write_binary, T, test_types)\\n\\n{\\n\\n simple_read_test<T>(true);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE_TEMPLATE(write_ascii, T, test_types)\\n\\n{\\n\\n simple_read_test<T>(false);\\n\\n}\",\n \"file_path\": \"test/stl_parser_test.cpp\",\n \"rank\": 3,\n \"score\": 11110.098238485776\n },\n {\n \"content\": \" auto out = stl::read<T>(test_data);\\n\\n BOOST_TEST(out.second);\\n\\n stl::basic_solid<T>& s = out.first;\\n\\n\\n\\n BOOST_TEST(s.normals.size() == 12);\\n\\n BOOST_TEST(s.vertices.size() == 3*12);\\n\\n BOOST_TEST(s.attributes.size() == 0);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE_TEMPLATE(read_binary_from_file, T, test_types)\\n\\n{\\n\\n const std::string test_data{ SOURCE_DIR \\\"/testdata/cube_binary.stl\\\" };\\n\\n\\n\\n auto out = stl::read<T>(test_data);\\n\\n BOOST_TEST(out.second);\\n\\n stl::basic_solid<T>& s = out.first;\\n\\n\\n\\n BOOST_TEST(s.normals.size() == 12);\\n\\n BOOST_TEST(s.vertices.size() == 3 * 12);\\n\\n BOOST_TEST(s.attributes.size() == 12);\\n\",\n \"file_path\": \"test/stl_parser_test.cpp\",\n \"rank\": 4,\n \"score\": 11108.96588228026\n },\n {\n \"content\": \"# STL File Reader and Writer\\n\\nReads and writes STL files for 3D Geometry.\\n\\n\\n\\n## Install\\n\\nHeader only\\n\\n\\n\\n## Dependencies:\\n\\n - [Boost.Spirit](http://www.boost.org/)\\n\\n - [Boost.Test (for tests)](http://www.boost.org/)\\n\\n\\n\\n## Small and Fast Reference\\n\\nUse one of the read functions in namespace `tyti::stl`.\\n\\n\\n\\nPossible scalar values for the template `float, double`, default is `float`.\\n\\n\\n\\n```c++\\n\\n//////////////////////////////////////////////////////////////\\n\\n// Reader Functions:\\n\\ntemplate<typename T, typename IterT>\\n\\ninline bool read(basic_solid<T>& out, IterT begin, IterT end)\\n\\ntemplate<typename T, typename IterT>\\n\\ninline std::pair< basic_solid<T>, bool > read(IterT begin, IterT end)\\n\\ntemplate<typename IterT>\\n\\ninline std::pair< solid, bool > read(IterT begin, IterT end)\\n\\n\\n\\n//////////////////////////////////////////////////////////////\\n\\n// Writer Functions: (streamT is an output stream type)\\n\\ntemplate<typename T, typename streamT>\\n\\nvoid write(streamT& out, basic_solid<T>& s, bool binary)\\n\\ntemplate<typename T, typename streamT>\\n\\nvoid write_binary(streamT& out, basic_solid<T>&s)\\n\\ntemplate<typename T, typename streamT>\\n\\nvoid write_ascii(streamT& out, basic_solid<T>&s)\\n\\n\\n\\n// Remark: the solid parameter is not constant to ensure the correct size of the containers.\\n\\n// You may want to rewrite those functions corresponding on your error-checking presumptions\\n\\n\\n\\n// The write functions were just written as a proof of concept and you may want to avoid them\\n\\n\\n\\n//////////////////////////////////////////////////////////////\\n\\n// Output DataType:\\n\\ntemplate<typename T>\\n\\nstruct basic_solid\\n\\n{\\n\\n using vec3 = basic_vec3<T>;\\n\\n using scalar_type = T;\\n\\n std::string header; //solid name or header\\n\\n std::vector<vec3> normals;\\n\\n std::vector<vec3> vertices;\\n\\n std::vector<std::uint16_t> attributes; //only available in binary files\\n\\n};\\n\\n\\n\\ntypedef basic_solid<float> solid;\\n\\ntypedef basic_solid<float> dsolid;\\n\\n\\n\\ntemplate<typename T>\\n\\nstruct basic_vec3\\n\\n{\\n\\n using scalar_type = T;\\n\\n T data[3];\\n\\n};\\n\\n\\n\\ntypedef basic_vec3<float> vec3;\\n\\ntypedef basic_vec3<float> dvec3;\\n\\n```\\n\\n\\n\\n\\n\\n## License\\n\\n\\n\\n[MIT License](./LICENSE) © Matthias Möller. Made with ♥ in Germany.\\n\",\n \"file_path\": \"Readme.md\",\n \"rank\": 5,\n \"score\": 6357.771984835941\n }\n]","isConversational":false}}},{"rowIdx":389,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"mxflib/vbi.cpp"},"repo_name":{"kind":"string","value":"Jamaika1/mxflib"},"commit":{"kind":"string","value":"7eefe6da1f76f7de4f2de48322311533369f8ba5"},"file_code":{"kind":"string","value":"\n\n#include <mxflib/mxflib.h>\n\nusing namespace mxflib;\n\nint ANCVBISource::Field2Offset(void)\n{\n\tif(F2Offset >= 0) return F2Offset;\n\n\tMDObjectPtr Descriptor = MasterSource->GetDescriptor();\n\tif(!Descriptor)\n\t{\n\t\terror(\"EssenceDescriptor not defined for master source of ANCVBISource before calling Field2Offset()\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\t\n\t\n\tif(Descriptor->IsA(MultipleDescriptor_UL))\n\t{\n\t\tMDObject::iterator it = Descriptor->begin();\n\t\twhile(it != Descriptor->end())\n\t\t{\n\t\t\tif((*it).second->IsA(GenericPictureEssenceDescriptor_UL))\n\t\t\t{\n\t\t\t\tDescriptor = (*it).second;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tit++;\n\t\t}\n\t}\n\n\t\n\n\tif(Descriptor->IsDValue(FrameLayout_UL))\n\t{\n\t\twarning(\"EssenceDescriptor for ANCVBISource does not have a valid FrameLayout\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tif(Descriptor->GetInt(FrameLayout_UL) != 1)\n\t{\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\t\n\t\n\n\tMDObjectPtr VideoLineMap = Descriptor->Child(VideoLineMap_UL);\n\tif(!VideoLineMap)\n\t{\n\t\terror(\"EssenceDescriptor for ANCVBISource does not have a valid VideoLineMap\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tMDObjectPtr F1Entry = VideoLineMap->Child(0);\n\tMDObjectPtr F2Entry = VideoLineMap->Child(1);\n\tif((!F1Entry) || (!F2Entry))\n\t{\n\t\terror(\"EssenceDescriptor for ANCVBISource does not have a valid VideoLineMap\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tF2Offset = static_cast<int>(F2Entry->GetInt() - F1Entry->GetInt());\n\treturn F2Offset;\n}\n\nDataChunkPtr ANCVBISource::BuildChunk(void)\n{\n\t\n\n\tANCVBILineSourceList::iterator LS_it = Sources.begin();\n\twhile(LS_it != Sources.end())\n\t{\n\t\tint LineNumber = (*LS_it)->GetLineNumber();\n\t\tif((*LS_it)->GetField() == 2) LineNumber += Field2Offset();\n\n\t\tLines.insert(ANCLineMap::value_type(\n\t\t\t\tLineNumber, \n\t\t\t\tnew ANCLine(LineNumber, \n\t\t\t\t(*LS_it)->GetWrappingType(), \n\t\t\t\t(*LS_it)->GetSampleCoding(), \n\t\t\t\t(*LS_it)->GetLineData(), \n\t\t\t\t(*LS_it)->GetDID(), \n\t\t\t\t(*LS_it)->GetSDID())));\n\n\t\tLS_it++;\n\t}\n\n\t\n\n\t\n\tif(Lines.empty())\n\t{\n\t\t\n\t\tDataChunkPtr Ret = new DataChunk(2);\n\t\tPutU16(0, Ret->Data);\n\n\t\treturn Ret;\n\t}\n\n\tVBILineMap::iterator it = Lines.begin();\n\n\t\n\t\n\t\n\tsize_t BufferSize = ((*it).second->GetFullDataSize() * Lines.size()) + 2;\n\n\t\n\tDataChunkPtr Ret = new DataChunk(BufferSize);\n\n\t\n\tUInt8 *pBuffer = Ret->Data;\n\n\t\n\tPutU16(static_cast<UInt16>(Lines.size()), Ret->Data);\n\tpBuffer += 2;\n\tBufferSize -= 2;\n\n\twhile(it != Lines.end())\n\t{\n\t\t\n\t\tsize_t RequiredBytes = (*it).second->GetFullDataSize();\n\n\t\t\n\t\tif(RequiredBytes > BufferSize)\n\t\t{\n\t\t\t\n\t\t\tsize_t CurrentPos = pBuffer - Ret->Data;\n\n\t\t\t\n\t\t\tRet->Resize(static_cast<UInt32>(CurrentPos + RequiredBytes));\n\n\t\t\t\n\t\t\tBufferSize = RequiredBytes;\n\n\t\t\t\n\t\t\tpBuffer = &Ret->Data[CurrentPos];\n\t\t}\n\n\t\t\n\t\t(*it).second->WriteData(pBuffer);\n\n\t\t\n\t\tpBuffer += RequiredBytes;\n\t\tBufferSize -= RequiredBytes;\n\n\t\tit++;\n\t}\n\n\t\n\tRet->Resize(static_cast<UInt32>(pBuffer - Ret->Data));\n\n\t\n\tLines.clear();\n\n\t\n\treturn Ret;\n}\n\nvoid ANCVBILine::WriteData(UInt8 *Buffer)\n{\n\t\n\tPutU16( LineNumber, Buffer);\n\n\t\n\tBuffer[2] = static_cast<UInt8>(WrappingType);\n\n\t\n\tBuffer[3] = static_cast<UInt8>(SampleCoding);\n\n\t\n\tPutU16(static_cast<UInt16>(SampleCount), &Buffer[4]);\n\n\t\n\tif(Data.Data)\n\t{\n\t\tPutU32(static_cast<UInt32>(Data.Size), &Buffer[6]);\n\t\tPutU32(1, &Buffer[10]);\n\t\tmemcpy(&Buffer[14], Data.Data, Data.Size);\n\t}\n\telse\n\t{\n\t\tPutU32(0, &Buffer[6]);\n\t\tPutU32(1, &Buffer[10]);\n\t}\n}\n\nbool ANCVBISource::EndSignalled(void)\n{\n\t\n\tif(EndAtPosition < 0)\n\t{\n\t\t\n\t\tif(!MasterSource) return true;\n\n\t\t\n\t\tif(MasterSource->EndOfData()) EndAtPosition = MasterSource->GetCurrentPosition();\n\t\t\n\t\telse EndAtPosition = 0;\n\n\t\t\n\t\tCurrentPosition = 0;\n\n\t}\n\n\t\n\tif(EndAtPosition)\n\t{\n\t\tif(CurrentPosition >= EndAtPosition) return true;\n\t\telse return false;\n\t}\n\n\t\n\treturn MasterSource->EndOfData();\n}\n\nsize_t ANCVBISource::GetEssenceDataSize(void)\n{\n\t\n\tif(BufferedData.empty())\n\t{\n\t\tif(EndSignalled()) return 0;\n\n\t\tBufferedData.push_back(BuildChunk());\n\t}\n\n\t\n\treturn static_cast<size_t>(BufferedData.front()->Size);\n}\n\nDataChunkPtr ANCVBISource::GetEssenceData(size_t Size , size_t MaxSize )\n{\n\t\n\tif(BodyParent) CurrentPosition = BodyParent->GetPosition();\n\telse if(MasterSource) CurrentPosition = MasterSource->GetCurrentPosition() - 1;\n\n\t\n\tif(BufferedData.empty())\n\t{\n\t\tif(EndSignalled()) return NULL;\n\n\t\tBufferedData.push_back(BuildChunk());\n\t}\n\n\t\n\tif(IndexMan) IndexMan->OfferEditUnit(IndexStreamID, CurrentPosition, 0, 0x80);\n\n\t\n\tCurrentPosition++;\n\n\t\n\tif((BufferOffset == 0) && ((MaxSize == 0) || (BufferedData.front()->Size <= MaxSize)))\n\t{\n\t\t\n\t\tDataChunkPtr Ret = BufferedData.front();\n\n\t\t\n\t\tBufferedData.pop_front();\n\n\t\t\n\t\treturn Ret;\n\t}\n\n\t\n\tsize_t Bytes = BufferedData.front()->Size - BufferOffset;\n\t\n\t\n\tif(Bytes <= MaxSize)\n\t{\n\t\t\n\t\tDataChunkPtr Ret = new DataChunk(Bytes);\n\n\t\t\n\t\tRet->Set(static_cast<UInt32>(Bytes), BufferedData.front()->Data);\n\n\t\t\n\t\tBufferedData.pop_front();\n\n\t\t\n\t\tBufferOffset = 0;\n\n\t\t\n\t\treturn Ret;\n\t}\n\n\t\n\tDataChunkPtr Ret = new DataChunk(MaxSize);\n\n\t\n\tRet->Set(static_cast<UInt32>(MaxSize), BufferedData.front()->Data);\n\n\t\n\tBufferOffset -= MaxSize;\n\n\t\n\treturn Ret;\n}\n\nEssenceParser::WrappingConfigPtr ANCVBISource::MakeWrappingConfig(WrappingConfigPtr MasterCfg)\n{\n\tEssenceParser::WrappingConfigPtr SubCfg;\n\n\t\n\n\t\n\tif(MasterCfg->WrapOpt->ThisWrapType != WrappingOption::Frame) return SubCfg;\n\n\t\n\tif(Sources.empty()) return SubCfg;\n\n\t\n\t\n\n\tstd::string Description;\n\tANCVBILineSourceList::iterator it = Sources.begin();\n\twhile(it != Sources.end())\n\t{\n\t\tstd::string ThisDesc = (*it)->ValidateConfig(MasterCfg);\n\t\tif(ThisDesc.empty()) return SubCfg;\n\n\t\tif(!Description.empty()) Description += \", plus \";\n\t\tDescription += ThisDesc;\n\n\t\tit++;\n\t}\n\n\t\n\n\tSubCfg = new EssenceParser::WrappingConfig();\n\n\tSubCfg->Parser = MasterCfg->Parser;\n\n\tSubCfg->WrapOpt = new WrappingOption();\n\tSubCfg->WrapOpt->Handler = SubCfg->Parser;\n\tSubCfg->WrapOpt->Name = \"\";\n\tSubCfg->WrapOpt->Description = Description;\n\tSubCfg->WrapOpt->GCEssenceType = GetGCEssenceType();\n\tSubCfg->WrapOpt->GCElementType = GetGCElementType();\n\tSubCfg->WrapOpt->ThisWrapType = MasterCfg->WrapOpt->ThisWrapType;\n\tSubCfg->WrapOpt->CanSlave = false;\n\tSubCfg->WrapOpt->CanIndex = true;\n\tSubCfg->WrapOpt->CBRIndex = false;\n\tSubCfg->WrapOpt->BERSize = 4;\n\tSubCfg->WrapOpt->BytesPerEditUnit = 0;\n\n\tSubCfg->WrapOpt->WrappingUL = GetWrappingUL();\n\n\tSubCfg->EssenceDescriptor = new MDObject(ANCDataDescriptor_UL);\n\tMDObjectPtr SampleRate = SubCfg->EssenceDescriptor->AddChild(SampleRate_UL);\n\tSampleRate->SetInt(\"Numerator\", MasterCfg->EditRate.Numerator);\n\tSampleRate->SetInt(\"Denominator\", MasterCfg->EditRate.Denominator);\n\tSubCfg->EssenceDescriptor->SetValue(EssenceContainer_UL, DataChunk(16,SubCfg->WrapOpt->WrappingUL->GetValue()));\n\n\tSubCfg->Stream = 0;\n\tSubCfg->EditRate = MasterCfg->EditRate;\n\tSubCfg->StartTimecode = 0;\n\n\treturn SubCfg;\n}\n\nstd::string SimpleAFDSource::ValidateConfig(WrappingConfigPtr MasterCfg)\n{\n\tif(FieldNum == 1) return \"Fixed F1 AFD of 0x\" + Int64toHexString(CurrentAFD);\n\treturn \"Fixed F2 AFD of 0x\" + Int64toHexString(CurrentAFD);\n}\n\nUInt8 SimpleAFDSource::TextToAFD(std::string Text)\n{\n\tbool Wide = false;\n\tUInt8 Ret = 0;\n\n\tstd::string::iterator it = Text.begin();\n\twhile(it != Text.end())\n\t{\n\t\tif(*it == '1') Ret = (Ret << 1) | 1;\n\t\telse if(*it == '0') Ret = (Ret << 1);\n\t\telse if(tolower(*it) == 'w') Wide = true;\n\t\tit++;\n\t}\n\n\t\n\treturn Wide ? (Ret << 3) | 4 : (Ret << 3);\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <mxflib/mxflib.h>\n\nusing namespace mxflib;\n\nint ANCVBISource::Field2Offset(void)\n{\n\tif(F2Offset >= 0) return F2Offset;\n\n\tMDObjectPtr Descriptor = MasterSource->GetDescriptor();\n\tif(!Descriptor)\n\t{\n\t\terror(\"EssenceDescriptor not defined for master source of ANCVBISource before calling Field2Offset()\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\t\n\t\n\tif(Descriptor->IsA(MultipleDescriptor_UL))\n\t{\n\t\tMDObject::iterator it = Descriptor->begin();\n\t\twhile(it != Descriptor->end())\n\t\t{\n\t\t\tif((*it).second->IsA(GenericPictureEssenceDescriptor_UL))\n\t\t\t{\n\t\t\t\tDescriptor = (*it).second;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tit++;\n\t\t}\n\t}\n\n\t\n\n\tif(Descriptor->IsDValue(FrameLayout_UL))\n\t{\n\t\twarning(\"EssenceDescriptor for ANCVBISource does not have a valid FrameLayout\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tif(Descriptor->GetInt(FrameLayout_UL) != 1)\n\t{\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\t\n\t\n\n\tMDObjectPtr VideoLineMap = Descriptor->Child(VideoLineMap_UL);\n\tif(!VideoLineMap)\n\t{\n\t\terror(\"EssenceDescriptor for ANCVBISource does not have a valid VideoLineMap\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tMDObjectPtr F1Entry = VideoLineMap->Child(0);\n\tMDObjectPtr F2Entry = VideoLineMap->Child(1);\n\tif((!F1Entry) || (!F2Entry))\n\t{\n\t\terror(\"EssenceDescriptor for ANCVBISource does not have a valid VideoLineMap\\n\");\n\t\tF2Offset = 0;\n\t\treturn F2Offset;\n\t}\n\n\tF2Offset = static_cast<int>(F2Entry->GetInt() - F1Entry->GetInt());\n\treturn F2Offset;\n}\n\nDataChunkPtr ANCVBISource::BuildChunk(void)\n{\n\t\n\n\tANCVBILineSourceList::iterator LS_it = Sources.begin();\n\twhile(LS_it != Sources.end())\n\t{\n\t\tint LineNumber = (*LS_it)->GetLineNumber();\n\t\tif((*LS_it)->GetField() == 2) LineNumber += Field2Offset();\n\n\t\tLines.insert("},"suffix":{"kind":"string","value":");\n\n\t\tLS_it++;\n\t}\n\n\t\n\n\t\n\tif(Lines.empty())\n\t{\n\t\t\n\t\tDataChunkPtr Ret = new DataChunk(2);\n\t\tPutU16(0, Ret->Data);\n\n\t\treturn Ret;\n\t}\n\n\tVBILineMap::iterator it = Lines.begin();\n\n\t\n\t\n\t\n\tsize_t BufferSize = ((*it).second->GetFullDataSize() * Lines.size()) + 2;\n\n\t\n\tDataChunkPtr Ret = new DataChunk(BufferSize);\n\n\t\n\tUInt8 *pBuffer = Ret->Data;\n\n\t\n\tPutU16(static_cast<UInt16>(Lines.size()), Ret->Data);\n\tpBuffer += 2;\n\tBufferSize -= 2;\n\n\twhile(it != Lines.end())\n\t{\n\t\t\n\t\tsize_t RequiredBytes = (*it).second->GetFullDataSize();\n\n\t\t\n\t\tif(RequiredBytes > BufferSize)\n\t\t{\n\t\t\t\n\t\t\tsize_t CurrentPos = pBuffer - Ret->Data;\n\n\t\t\t\n\t\t\tRet->Resize(static_cast<UInt32>(CurrentPos + RequiredBytes));\n\n\t\t\t\n\t\t\tBufferSize = RequiredBytes;\n\n\t\t\t\n\t\t\tpBuffer = &Ret->Data[CurrentPos];\n\t\t}\n\n\t\t\n\t\t(*it).second->WriteData(pBuffer);\n\n\t\t\n\t\tpBuffer += RequiredBytes;\n\t\tBufferSize -= RequiredBytes;\n\n\t\tit++;\n\t}\n\n\t\n\tRet->Resize(static_cast<UInt32>(pBuffer - Ret->Data));\n\n\t\n\tLines.clear();\n\n\t\n\treturn Ret;\n}\n\nvoid ANCVBILine::WriteData(UInt8 *Buffer)\n{\n\t\n\tPutU16( LineNumber, Buffer);\n\n\t\n\tBuffer[2] = static_cast<UInt8>(WrappingType);\n\n\t\n\tBuffer[3] = static_cast<UInt8>(SampleCoding);\n\n\t\n\tPutU16(static_cast<UInt16>(SampleCount), &Buffer[4]);\n\n\t\n\tif(Data.Data)\n\t{\n\t\tPutU32(static_cast<UInt32>(Data.Size), &Buffer[6]);\n\t\tPutU32(1, &Buffer[10]);\n\t\tmemcpy(&Buffer[14], Data.Data, Data.Size);\n\t}\n\telse\n\t{\n\t\tPutU32(0, &Buffer[6]);\n\t\tPutU32(1, &Buffer[10]);\n\t}\n}\n\nbool ANCVBISource::EndSignalled(void)\n{\n\t\n\tif(EndAtPosition < 0)\n\t{\n\t\t\n\t\tif(!MasterSource) return true;\n\n\t\t\n\t\tif(MasterSource->EndOfData()) EndAtPosition = MasterSource->GetCurrentPosition();\n\t\t\n\t\telse EndAtPosition = 0;\n\n\t\t\n\t\tCurrentPosition = 0;\n\n\t}\n\n\t\n\tif(EndAtPosition)\n\t{\n\t\tif(CurrentPosition >= EndAtPosition) return true;\n\t\telse return false;\n\t}\n\n\t\n\treturn MasterSource->EndOfData();\n}\n\nsize_t ANCVBISource::GetEssenceDataSize(void)\n{\n\t\n\tif(BufferedData.empty())\n\t{\n\t\tif(EndSignalled()) return 0;\n\n\t\tBufferedData.push_back(BuildChunk());\n\t}\n\n\t\n\treturn static_cast<size_t>(BufferedData.front()->Size);\n}\n\nDataChunkPtr ANCVBISource::GetEssenceData(size_t Size , size_t MaxSize )\n{\n\t\n\tif(BodyParent) CurrentPosition = BodyParent->GetPosition();\n\telse if(MasterSource) CurrentPosition = MasterSource->GetCurrentPosition() - 1;\n\n\t\n\tif(BufferedData.empty())\n\t{\n\t\tif(EndSignalled()) return NULL;\n\n\t\tBufferedData.push_back(BuildChunk());\n\t}\n\n\t\n\tif(IndexMan) IndexMan->OfferEditUnit(IndexStreamID, CurrentPosition, 0, 0x80);\n\n\t\n\tCurrentPosition++;\n\n\t\n\tif((BufferOffset == 0) && ((MaxSize == 0) || (BufferedData.front()->Size <= MaxSize)))\n\t{\n\t\t\n\t\tDataChunkPtr Ret = BufferedData.front();\n\n\t\t\n\t\tBufferedData.pop_front();\n\n\t\t\n\t\treturn Ret;\n\t}\n\n\t\n\tsize_t Bytes = BufferedData.front()->Size - BufferOffset;\n\t\n\t\n\tif(Bytes <= MaxSize)\n\t{\n\t\t\n\t\tDataChunkPtr Ret = new DataChunk(Bytes);\n\n\t\t\n\t\tRet->Set(static_cast<UInt32>(Bytes), BufferedData.front()->Data);\n\n\t\t\n\t\tBufferedData.pop_front();\n\n\t\t\n\t\tBufferOffset = 0;\n\n\t\t\n\t\treturn Ret;\n\t}\n\n\t\n\tDataChunkPtr Ret = new DataChunk(MaxSize);\n\n\t\n\tRet->Set(static_cast<UInt32>(MaxSize), BufferedData.front()->Data);\n\n\t\n\tBufferOffset -= MaxSize;\n\n\t\n\treturn Ret;\n}\n\nEssenceParser::WrappingConfigPtr ANCVBISource::MakeWrappingConfig(WrappingConfigPtr MasterCfg)\n{\n\tEssenceParser::WrappingConfigPtr SubCfg;\n\n\t\n\n\t\n\tif(MasterCfg->WrapOpt->ThisWrapType != WrappingOption::Frame) return SubCfg;\n\n\t\n\tif(Sources.empty()) return SubCfg;\n\n\t\n\t\n\n\tstd::string Description;\n\tANCVBILineSourceList::iterator it = Sources.begin();\n\twhile(it != Sources.end())\n\t{\n\t\tstd::string ThisDesc = (*it)->ValidateConfig(MasterCfg);\n\t\tif(ThisDesc.empty()) return SubCfg;\n\n\t\tif(!Description.empty()) Description += \", plus \";\n\t\tDescription += ThisDesc;\n\n\t\tit++;\n\t}\n\n\t\n\n\tSubCfg = new EssenceParser::WrappingConfig();\n\n\tSubCfg->Parser = MasterCfg->Parser;\n\n\tSubCfg->WrapOpt = new WrappingOption();\n\tSubCfg->WrapOpt->Handler = SubCfg->Parser;\n\tSubCfg->WrapOpt->Name = \"\";\n\tSubCfg->WrapOpt->Description = Description;\n\tSubCfg->WrapOpt->GCEssenceType = GetGCEssenceType();\n\tSubCfg->WrapOpt->GCElementType = GetGCElementType();\n\tSubCfg->WrapOpt->ThisWrapType = MasterCfg->WrapOpt->ThisWrapType;\n\tSubCfg->WrapOpt->CanSlave = false;\n\tSubCfg->WrapOpt->CanIndex = true;\n\tSubCfg->WrapOpt->CBRIndex = false;\n\tSubCfg->WrapOpt->BERSize = 4;\n\tSubCfg->WrapOpt->BytesPerEditUnit = 0;\n\n\tSubCfg->WrapOpt->WrappingUL = GetWrappingUL();\n\n\tSubCfg->EssenceDescriptor = new MDObject(ANCDataDescriptor_UL);\n\tMDObjectPtr SampleRate = SubCfg->EssenceDescriptor->AddChild(SampleRate_UL);\n\tSampleRate->SetInt(\"Numerator\", MasterCfg->EditRate.Numerator);\n\tSampleRate->SetInt(\"Denominator\", MasterCfg->EditRate.Denominator);\n\tSubCfg->EssenceDescriptor->SetValue(EssenceContainer_UL, DataChunk(16,SubCfg->WrapOpt->WrappingUL->GetValue()));\n\n\tSubCfg->Stream = 0;\n\tSubCfg->EditRate = MasterCfg->EditRate;\n\tSubCfg->StartTimecode = 0;\n\n\treturn SubCfg;\n}\n\nstd::string SimpleAFDSource::ValidateConfig(WrappingConfigPtr MasterCfg)\n{\n\tif(FieldNum == 1) return \"Fixed F1 AFD of 0x\" + Int64toHexString(CurrentAFD);\n\treturn \"Fixed F2 AFD of 0x\" + Int64toHexString(CurrentAFD);\n}\n\nUInt8 SimpleAFDSource::TextToAFD(std::string Text)\n{\n\tbool Wide = false;\n\tUInt8 Ret = 0;\n\n\tstd::string::iterator it = Text.begin();\n\twhile(it != Text.end())\n\t{\n\t\tif(*it == '1') Ret = (Ret << 1) | 1;\n\t\telse if(*it == '0') Ret = (Ret << 1);\n\t\telse if(tolower(*it) == 'w') Wide = true;\n\t\tit++;\n\t}\n\n\t\n\treturn Wide ? (Ret << 3) | 4 : (Ret << 3);\n}\n"},"middle":{"kind":"string","value":"ANCLineMap::value_type(\n\t\t\t\tLineNumber, \n\t\t\t\tnew ANCLine(LineNumber, \n\t\t\t\t(*LS_it)->GetWrappingType(), \n\t\t\t\t(*LS_it)->GetSampleCoding(), \n\t\t\t\t(*LS_it)->GetLineData(), \n\t\t\t\t(*LS_it)->GetDID(), \n\t\t\t\t(*LS_it)->GetSDID()))"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"namespace mxflib {}\n","file_path":"mxflib/mxflib.h","rank":0,"score":89973.22926212748},{"content":"namespace mxflib\n\n{\n\n\n\n\t//! Load classes and types from a Metadictionary object\n\n\t/*! At the point where this function is called, you need to have all the component parts loaded and\n\n\t * all the strong references within the metadictionary need to be satisfied\n\n\t */\n\n\tbool LoadMetadictionary(MDObjectPtr &Meta, SymbolSpacePtr &SymSpace);\n\n\n\n\t//! Build a metadictionary from current classes and types used in a given list of metadata trees\n\n\t/*! If Meta is supplied, then all classes in the trees strongly linked from it are written to the metadictionary, \n\n\t * including all properties of those classes (whether used or not) and any types used by those properties\n\n\t */\n\n\tMDObjectPtr BuildMetadictionary(MDObjectList &MetaList, Primer *UsePrimer);\n","file_path":"mxflib/metadict.h","rank":1,"score":86374.1332027388},{"content":"\tnamespace mxflib\n\n\t{\n\n\t\tconst UInt8 AES3PCMDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x47, 0x00 };\n\n\t\tconst UL AES3PCMDescriptor_UL(AES3PCMDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 ANCDataDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5c, 0x00 };\n\n\t\tconst UL ANCDataDescriptor_UL(ANCDataDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 ATSCA52_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x04, 0x02, 0x02, 0x02, 0x03, 0x02, 0x01, 0x00 };\n\n\t\tconst UL ATSCA52_UL(ATSCA52_UL_Data);\n\n\n\n\t\tconst UInt8 AUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AUID_UL(AUID_UL_Data);\n\n\n\n\t\tconst UInt8 AUIDArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AUIDArray_UL(AUIDArray_UL_Data);\n\n\n\n\t\tconst UInt8 AUIDSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x03, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AUIDSet_UL(AUIDSet_UL_Data);\n\n\n\n\t\tconst UInt8 AUL_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AUL_UL(AUL_UL_Data);\n\n\n\n\t\tconst UInt8 AbstractObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x7f, 0x00 };\n\n\t\tconst UL AbstractObject_UL(AbstractObject_UL_Data);\n\n\n\n\t\tconst UInt8 ActiveFormatDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ActiveFormatDescriptor_UL(ActiveFormatDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 AlphaMaxRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AlphaMaxRef_UL(AlphaMaxRef_UL_Data);\n\n\n\n\t\tconst UInt8 AlphaMinRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AlphaMinRef_UL(AlphaMinRef_UL_Data);\n\n\n\n\t\tconst UInt8 AlphaSampleDepth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AlphaSampleDepth_UL(AlphaSampleDepth_UL_Data);\n\n\n\n\t\tconst UInt8 AlphaTransparency_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AlphaTransparency_UL(AlphaTransparency_UL_Data);\n\n\n\n\t\tconst UInt8 AnnotationSource_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0a, 0x00, 0x00 };\n\n\t\tconst UL AnnotationSource_UL(AnnotationSource_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationEnvironmentID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0f, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ApplicationEnvironmentID_UL(ApplicationEnvironmentID_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x66, 0x00 };\n\n\t\tconst UL ApplicationObject_UL(ApplicationObject_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationPluginBatch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0e, 0x00, 0x00 };\n\n\t\tconst UL ApplicationPluginBatch_UL(ApplicationPluginBatch_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationPluginInstanceID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ApplicationPluginInstanceID_UL(ApplicationPluginInstanceID_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationPluginObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x61, 0x00 };\n\n\t\tconst UL ApplicationPluginObject_UL(ApplicationPluginObject_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationReferencedObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x62, 0x00 };\n\n\t\tconst UL ApplicationReferencedObject_UL(ApplicationReferencedObject_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x04, 0x06, 0x08, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ApplicationScheme_UL(ApplicationScheme_UL_Data);\n\n\n\n\t\tconst UInt8 ApplicationSchemesBatch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x01, 0x02, 0x02, 0x10, 0x02, 0x03, 0x00, 0x00 };\n\n\t\tconst UL ApplicationSchemesBatch_UL(ApplicationSchemesBatch_UL_Data);\n\n\n\n\t\tconst UInt8 AspectRatio_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AspectRatio_UL(AspectRatio_UL_Data);\n\n\n\n\t\tconst UInt8 AudioRefLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x02, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AudioRefLevel_UL(AudioRefLevel_UL_Data);\n\n\n\n\t\tconst UInt8 AudioSamplingRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x01, 0x01, 0x01, 0x00, 0x00 };\n\n\t\tconst UL AudioSamplingRate_UL(AudioSamplingRate_UL_Data);\n\n\n\n\t\tconst UInt8 AuxBitsMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AuxBitsMode_UL(AuxBitsMode_UL_Data);\n\n\n\n\t\tconst UInt8 AvgBps_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x03, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL AvgBps_UL(AvgBps_UL_Data);\n\n\n\n\t\tconst UInt8 BPictureCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x09, 0x00, 0x00 };\n\n\t\tconst UL BPictureCount_UL(BPictureCount_UL_Data);\n\n\n\n\t\tconst UInt8 BaseClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x01, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL BaseClass_UL(BaseClass_UL_Data);\n\n\n\n\t\tconst UInt8 BitRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL BitRate_UL(BitRate_UL_Data);\n\n\n\n\t\tconst UInt8 BlackRefLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x03, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL BlackRefLevel_UL(BlackRefLevel_UL_Data);\n\n\n\n\t\tconst UInt8 BlockAlign_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL BlockAlign_UL(BlockAlign_UL_Data);\n\n\n\n\t\tconst UInt8 BlockStartOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL BlockStartOffset_UL(BlockStartOffset_UL_Data);\n\n\n\n\t\tconst UInt8 BodyOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x08, 0x01, 0x02, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL BodyOffset_UL(BodyOffset_UL_Data);\n\n\n\n\t\tconst UInt8 BodySID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x04, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL BodySID_UL(BodySID_UL_Data);\n\n\n\n\t\tconst UInt8 Boolean_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x04, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Boolean_UL(Boolean_UL_Data);\n\n\n\n\t\tconst UInt8 Build_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Build_UL(Build_UL_Data);\n\n\n\n\t\tconst UInt8 ByteOrder_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ByteOrder_UL(ByteOrder_UL_Data);\n\n\n\n\t\tconst UInt8 CDCIEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x28, 0x00 };\n\n\t\tconst UL CDCIEssenceDescriptor_UL(CDCIEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 ChannelAssignment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x07, 0x04, 0x02, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChannelAssignment_UL(ChannelAssignment_UL_Data);\n\n\n\n\t\tconst UInt8 ChannelCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x01, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChannelCount_UL(ChannelCount_UL_Data);\n\n\n\n\t\tconst UInt8 ChannelIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x07, 0x06, 0x01, 0x01, 0x03, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChannelIDs_UL(ChannelIDs_UL_Data);\n\n\n\n\t\tconst UInt8 ChannelStatusMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChannelStatusMode_UL(ChannelStatusMode_UL_Data);\n\n\n\n\t\tconst UInt8 ChannelStatusModeType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x25, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChannelStatusModeType_UL(ChannelStatusModeType_UL_Data);\n\n\n\n\t\tconst UInt8 ChunkData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x07, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChunkData_UL(ChunkData_UL_Data);\n\n\n\n\t\tconst UInt8 ChunkID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x06, 0x08, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChunkID_UL(ChunkID_UL_Data);\n\n\n\n\t\tconst UInt8 ChunkLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x06, 0x09, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ChunkLength_UL(ChunkLength_UL_Data);\n\n\n\n\t\tconst UInt8 CipherAlgorithm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL CipherAlgorithm_UL(CipherAlgorithm_UL_Data);\n\n\n\n\t\tconst UInt8 CipherAlgorithmAES128CBC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x02, 0x09, 0x02, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL CipherAlgorithmAES128CBC_UL(CipherAlgorithmAES128CBC_UL_Data);\n\n\n\n\t\tconst UInt8 ClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL ClassDefinition_UL(ClassDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 ClassDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ClassDefinitions_UL(ClassDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x02, 0x00 };\n\n\t\tconst UL ClosedBodyPartition_UL(ClosedBodyPartition_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedCompleteBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x04, 0x00 };\n\n\t\tconst UL ClosedCompleteBodyPartition_UL(ClosedCompleteBodyPartition_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedCompleteHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x04, 0x00 };\n\n\t\tconst UL ClosedCompleteHeader_UL(ClosedCompleteHeader_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x06, 0x00, 0x00 };\n\n\t\tconst UL ClosedGOP_UL(ClosedGOP_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x02, 0x00 };\n\n\t\tconst UL ClosedHeader_UL(ClosedHeader_UL_Data);\n\n\n\n\t\tconst UInt8 Codec_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL Codec_UL(Codec_UL_Data);\n\n\n\n\t\tconst UInt8 CodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1f, 0x00 };\n\n\t\tconst UL CodecDefinition_UL(CodecDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 CodecDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x07, 0x00, 0x00 };\n\n\t\tconst UL CodecDefinitions_UL(CodecDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 CodedContentType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x04, 0x00, 0x00 };\n\n\t\tconst UL CodedContentType_UL(CodedContentType_UL_Data);\n\n\n\n\t\tconst UInt8 CodingEquations_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\n\n\t\tconst UL CodingEquations_UL(CodingEquations_UL_Data);\n\n\n\n\t\tconst UInt8 CodingStyleDefault_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL CodingStyleDefault_UL(CodingStyleDefault_UL_Data);\n\n\n\n\t\tconst UInt8 ColorPrimaries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x06, 0x01, 0x00 };\n\n\t\tconst UL ColorPrimaries_UL(ColorPrimaries_UL_Data);\n\n\n\n\t\tconst UInt8 ColorRange_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ColorRange_UL(ColorRange_UL_Data);\n\n\n\n\t\tconst UInt8 ColorSiting_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ColorSiting_UL(ColorSiting_UL_Data);\n\n\n\n\t\tconst UInt8 CommentMarker_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00 };\n\n\t\tconst UL CommentMarker_UL(CommentMarker_UL_Data);\n\n\n\n\t\tconst UInt8 CompanyName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL CompanyName_UL(CompanyName_UL_Data);\n\n\n\n\t\tconst UInt8 CompleteFooter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x04, 0x04, 0x00 };\n\n\t\tconst UL CompleteFooter_UL(CompleteFooter_UL_Data);\n\n\n\n\t\tconst UInt8 ComponentDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x07, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ComponentDataDefinition_UL(ComponentDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 ComponentDepth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ComponentDepth_UL(ComponentDepth_UL_Data);\n\n\n\n\t\tconst UInt8 ComponentLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x02, 0x01, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL ComponentLength_UL(ComponentLength_UL_Data);\n\n\n\n\t\tconst UInt8 ComponentMaxRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ComponentMaxRef_UL(ComponentMaxRef_UL_Data);\n\n\n\n\t\tconst UInt8 ComponentMinRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ComponentMinRef_UL(ComponentMinRef_UL_Data);\n\n\n\n\t\tconst UInt8 ConstantBFrames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL ConstantBFrames_UL(ConstantBFrames_UL_Data);\n\n\n\n\t\tconst UInt8 ContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x20, 0x00 };\n\n\t\tconst UL ContainerDefinition_UL(ContainerDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 ContainerDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x08, 0x00, 0x00 };\n\n\t\tconst UL ContainerDefinitions_UL(ContainerDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 ContainerDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ContainerDuration_UL(ContainerDuration_UL_Data);\n\n\n\n\t\tconst UInt8 ContentStorage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00 };\n\n\t\tconst UL ContentStorage_UL(ContentStorage_UL_Data);\n\n\n\n\t\tconst UInt8 ContentStorageObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL ContentStorageObject_UL(ContentStorageObject_UL_Data);\n\n\n\n\t\tconst UInt8 ContextID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x01, 0x01, 0x15, 0x11, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ContextID_UL(ContextID_UL_Data);\n\n\n\n\t\tconst UInt8 ContextIDLink_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x06, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ContextIDLink_UL(ContextIDLink_UL_Data);\n\n\n\n\t\tconst UInt8 ContextSR_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0d, 0x00, 0x00 };\n\n\t\tconst UL ContextSR_UL(ContextSR_UL_Data);\n\n\n\n\t\tconst UInt8 CryptographicContext_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x02, 0x00, 0x00 };\n\n\t\tconst UL CryptographicContext_UL(CryptographicContext_UL_Data);\n\n\n\n\t\tconst UInt8 CryptographicFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL CryptographicFramework_UL(CryptographicFramework_UL_Data);\n\n\n\n\t\tconst UInt8 CryptographicFrameworkLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x01, 0x01, 0x00 };\n\n\t\tconst UL CryptographicFrameworkLabel_UL(CryptographicFrameworkLabel_UL_Data);\n\n\n\n\t\tconst UInt8 CryptographicKeyID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL CryptographicKeyID_UL(CryptographicKeyID_UL_Data);\n\n\n\n\t\tconst UInt8 Csiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Csiz_UL(Csiz_UL_Data);\n\n\n\n\t\tconst UInt8 DCinemaTimedText_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x0a, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x13, 0x01, 0x01 };\n\n\t\tconst UL DCinemaTimedText_UL(DCinemaTimedText_UL_Data);\n\n\n\n\t\tconst UInt8 DMFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0c, 0x00, 0x00 };\n\n\t\tconst UL DMFramework_UL(DMFramework_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DMS1_UL(DMS1_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1Clip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x02, 0x01 };\n\n\t\tconst UL DMS1Clip_UL(DMS1Clip_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1ClipExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x02, 0x02 };\n\n\t\tconst UL DMS1ClipExtended_UL(DMS1ClipExtended_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1Production_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01 };\n\n\t\tconst UL DMS1Production_UL(DMS1Production_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1ProductionExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x02 };\n\n\t\tconst UL DMS1ProductionExtended_UL(DMS1ProductionExtended_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1Scene_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x01 };\n\n\t\tconst UL DMS1Scene_UL(DMS1Scene_UL_Data);\n\n\n\n\t\tconst UInt8 DMS1SceneExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x02 };\n\n\t\tconst UL DMS1SceneExtended_UL(DMS1SceneExtended_UL_Data);\n\n\n\n\t\tconst UInt8 DMSCrypto_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DMSCrypto_UL(DMSCrypto_UL_Data);\n\n\n\n\t\tconst UInt8 DMSchemes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x10, 0x02, 0x02, 0x00, 0x00 };\n\n\t\tconst UL DMSchemes_UL(DMSchemes_UL_Data);\n\n\n\n\t\tconst UInt8 DMSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x41, 0x00 };\n\n\t\tconst UL DMSegment_UL(DMSegment_UL_Data);\n\n\n\n\t\tconst UInt8 DMSourceClip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x45, 0x00 };\n\n\t\tconst UL DMSourceClip_UL(DMSourceClip_UL_Data);\n\n\n\n\t\tconst UInt8 DMSourceClipTrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x07, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DMSourceClipTrackIDs_UL(DMSourceClipTrackIDs_UL_Data);\n\n\n\n\t\tconst UInt8 DM_Framework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DM_Framework_UL(DM_Framework_UL_Data);\n\n\n\n\t\tconst UInt8 DM_Set_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DM_Set_UL(DM_Set_UL_Data);\n\n\n\n\t\tconst UInt8 DataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1b, 0x00 };\n\n\t\tconst UL DataDefinition_UL(DataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 DataDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x05, 0x00, 0x00 };\n\n\t\tconst UL DataDefinitions_UL(DataDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 DataEssenceCoding_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x03, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DataEssenceCoding_UL(DataEssenceCoding_UL_Data);\n\n\n\n\t\tconst UInt8 DataEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DataEssenceTrack_UL(DataEssenceTrack_UL_Data);\n\n\n\n\t\tconst UInt8 DataValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DataValue_UL(DataValue_UL_Data);\n\n\n\n\t\tconst UInt8 DateStruct_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DateStruct_UL(DateStruct_UL_Data);\n\n\n\n\t\tconst UInt8 Day_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Day_UL(Day_UL_Data);\n\n\n\n\t\tconst UInt8 DefinitionObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1a, 0x00 };\n\n\t\tconst UL DefinitionObject_UL(DefinitionObject_UL_Data);\n\n\n\n\t\tconst UInt8 DefinitionObjectDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x02, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL DefinitionObjectDescription_UL(DefinitionObjectDescription_UL_Data);\n\n\n\n\t\tconst UInt8 DefinitionObjectIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x15, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DefinitionObjectIdentification_UL(DefinitionObjectIdentification_UL_Data);\n\n\n\n\t\tconst UInt8 DefinitionObjectName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x02, 0x03, 0x01, 0x00, 0x00 };\n\n\t\tconst UL DefinitionObjectName_UL(DefinitionObjectName_UL_Data);\n\n\n\n\t\tconst UInt8 DeltaEntryArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DeltaEntryArray_UL(DeltaEntryArray_UL_Data);\n\n\n\n\t\tconst UInt8 Denominator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Denominator_UL(Denominator_UL_Data);\n\n\n\n\t\tconst UInt8 DescriptiveMetadataApplicationEnvironmentID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DescriptiveMetadataApplicationEnvironmentID_UL(DescriptiveMetadataApplicationEnvironmentID_UL_Data);\n\n\n\n\t\tconst UInt8 DescriptiveMetadataPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DescriptiveMetadataPluginID_UL(DescriptiveMetadataPluginID_UL_Data);\n\n\n\n\t\tconst UInt8 DescriptiveMetadataScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x04, 0x06, 0x08, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DescriptiveMetadataScheme_UL(DescriptiveMetadataScheme_UL_Data);\n\n\n\n\t\tconst UInt8 DescriptiveMetadataTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DescriptiveMetadataTrack_UL(DescriptiveMetadataTrack_UL_Data);\n\n\n\n\t\tconst UInt8 Descriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x03, 0x00, 0x00 };\n\n\t\tconst UL Descriptor_UL(Descriptor_UL_Data);\n\n\n\n\t\tconst UInt8 DialNorm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x07, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DialNorm_UL(DialNorm_UL_Data);\n\n\n\n\t\tconst UInt8 DictReferenceCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DictReferenceCodecDefinition_UL(DictReferenceCodecDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 DictReferenceContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DictReferenceContainerDefinition_UL(DictReferenceContainerDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 DictReferenceDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DictReferenceDataDefinition_UL(DictReferenceDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 DictReferenceVectorDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x04, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DictReferenceVectorDataDefinition_UL(DictReferenceVectorDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 Dictionaries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x02, 0x00, 0x00 };\n\n\t\tconst UL Dictionaries_UL(Dictionaries_UL_Data);\n\n\n\n\t\tconst UInt8 Dictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x22, 0x00 };\n\n\t\tconst UL Dictionary_UL(Dictionary_UL_Data);\n\n\n\n\t\tconst UInt8 DisplayF2Offset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DisplayF2Offset_UL(DisplayF2Offset_UL_Data);\n\n\n\n\t\tconst UInt8 DisplayHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DisplayHeight_UL(DisplayHeight_UL_Data);\n\n\n\n\t\tconst UInt8 DisplayWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DisplayWidth_UL(DisplayWidth_UL_Data);\n\n\n\n\t\tconst UInt8 DisplayXOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DisplayXOffset_UL(DisplayXOffset_UL_Data);\n\n\n\n\t\tconst UInt8 DisplayYOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DisplayYOffset_UL(DisplayYOffset_UL_Data);\n\n\n\n\t\tconst UInt8 DropFrame_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x04, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DropFrame_UL(DropFrame_UL_Data);\n\n\n\n\t\tconst UInt8 EditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x05, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EditRate_UL(EditRate_UL_Data);\n\n\n\n\t\tconst UInt8 EditUnitByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EditUnitByteCount_UL(EditUnitByteCount_UL_Data);\n\n\n\n\t\tconst UInt8 ElectroSpatialFormulation_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x02, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElectroSpatialFormulation_UL(ElectroSpatialFormulation_UL_Data);\n\n\n\n\t\tconst UInt8 ElementCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElementCount_UL(ElementCount_UL_Data);\n\n\n\n\t\tconst UInt8 ElementNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElementNames_UL(ElementNames_UL_Data);\n\n\n\n\t\tconst UInt8 ElementOf_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x21, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElementOf_UL(ElementOf_UL_Data);\n\n\n\n\t\tconst UInt8 ElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElementType_UL(ElementType_UL_Data);\n\n\n\n\t\tconst UInt8 ElementValues_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ElementValues_UL(ElementValues_UL_Data);\n\n\n\n\t\tconst UInt8 Emphasis_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Emphasis_UL(Emphasis_UL_Data);\n\n\n\n\t\tconst UInt8 EncryptedContainerLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0b, 0x01, 0x00 };\n\n\t\tconst UL EncryptedContainerLabel_UL(EncryptedContainerLabel_UL_Data);\n\n\n\n\t\tconst UInt8 EncryptedSourceValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EncryptedSourceValue_UL(EncryptedSourceValue_UL_Data);\n\n\n\n\t\tconst UInt8 EncryptedTriplet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x04, 0x01, 0x07, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7e, 0x01, 0x00 };\n\n\t\tconst UL EncryptedTriplet_UL(EncryptedTriplet_UL_Data);\n\n\n\n\t\tconst UInt8 EssenceContainer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x02, 0x00, 0x00 };\n\n\t\tconst UL EssenceContainer_UL(EssenceContainer_UL_Data);\n\n\n\n\t\tconst UInt8 EssenceContainerData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x23, 0x00 };\n\n\t\tconst UL EssenceContainerData_UL(EssenceContainerData_UL_Data);\n\n\n\n\t\tconst UInt8 EssenceContainers_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x10, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL EssenceContainers_UL(EssenceContainers_UL_Data);\n\n\n\n\t\tconst UInt8 EssenceDataObjects_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x02, 0x00, 0x00 };\n\n\t\tconst UL EssenceDataObjects_UL(EssenceDataObjects_UL_Data);\n\n\n\n\t\tconst UInt8 EssenceIsIdentified_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EssenceIsIdentified_UL(EssenceIsIdentified_UL_Data);\n\n\n\n\t\tconst UInt8 Event_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00 };\n\n\t\tconst UL Event_UL(Event_UL_Data);\n\n\n\n\t\tconst UInt8 EventComment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x04, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EventComment_UL(EventComment_UL_Data);\n\n\n\n\t\tconst UInt8 EventEditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL EventEditRate_UL(EventEditRate_UL_Data);\n\n\n\n\t\tconst UInt8 EventOrigin_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL EventOrigin_UL(EventOrigin_UL_Data);\n\n\n\n\t\tconst UInt8 EventStartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x03, 0x03, 0x00, 0x00 };\n\n\t\tconst UL EventStartPosition_UL(EventStartPosition_UL_Data);\n\n\n\n\t\tconst UInt8 EventTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x39, 0x00 };\n\n\t\tconst UL EventTrack_UL(EventTrack_UL_Data);\n\n\n\n\t\tconst UInt8 ExtElementNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ExtElementNames_UL(ExtElementNames_UL_Data);\n\n\n\n\t\tconst UInt8 ExtElementValues_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ExtElementValues_UL(ExtElementValues_UL_Data);\n\n\n\n\t\tconst UInt8 ExtendibleEnumerationElement_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x7e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ExtendibleEnumerationElement_UL(ExtendibleEnumerationElement_UL_Data);\n\n\n\n\t\tconst UInt8 ExtensionDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ExtensionDescription_UL(ExtensionDescription_UL_Data);\n\n\n\n\t\tconst UInt8 ExtensionScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x26, 0x00, 0x00 };\n\n\t\tconst UL ExtensionScheme_UL(ExtensionScheme_UL_Data);\n\n\n\n\t\tconst UInt8 ExtensionSchemeID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ExtensionSchemeID_UL(ExtensionSchemeID_UL_Data);\n\n\n\n\t\tconst UInt8 FieldDominance_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FieldDominance_UL(FieldDominance_UL_Data);\n\n\n\n\t\tconst UInt8 FileDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x25, 0x00 };\n\n\t\tconst UL FileDescriptor_UL(FileDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 FileDescriptors_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x04, 0x06, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL FileDescriptors_UL(FileDescriptors_UL_Data);\n\n\n\n\t\tconst UInt8 Filler_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x09, 0x00 };\n\n\t\tconst UL Filler_UL(Filler_UL_Data);\n\n\n\n\t\tconst UInt8 FixedArrayElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FixedArrayElementType_UL(FixedArrayElementType_UL_Data);\n\n\n\n\t\tconst UInt8 FixedChannelStatusData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FixedChannelStatusData_UL(FixedChannelStatusData_UL_Data);\n\n\n\n\t\tconst UInt8 FixedUserData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FixedUserData_UL(FixedUserData_UL_Data);\n\n\n\n\t\tconst UInt8 Float32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Float32_UL(Float32_UL_Data);\n\n\n\n\t\tconst UInt8 Float64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Float64_UL(Float64_UL_Data);\n\n\n\n\t\tconst UInt8 Footer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x04, 0x02, 0x00 };\n\n\t\tconst UL Footer_UL(Footer_UL_Data);\n\n\n\n\t\tconst UInt8 FooterPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x05, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FooterPartition_UL(FooterPartition_UL_Data);\n\n\n\n\t\tconst UInt8 FrameLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL FrameLayout_UL(FrameLayout_UL_Data);\n\n\n\n\t\tconst UInt8 GenerationUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL GenerationUID_UL(GenerationUID_UL_Data);\n\n\n\n\t\tconst UInt8 GenericDataEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x43, 0x00 };\n\n\t\tconst UL GenericDataEssenceDescriptor_UL(GenericDataEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 GenericDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x24, 0x00 };\n\n\t\tconst UL GenericDescriptor_UL(GenericDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 GenericEssenceContainerMultipleWrappings_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x03, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7f, 0x01, 0x00 };\n\n\t\tconst UL GenericEssenceContainerMultipleWrappings_UL(GenericEssenceContainerMultipleWrappings_UL_Data);\n\n\n\n\t\tconst UInt8 GenericPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x34, 0x00 };\n\n\t\tconst UL GenericPackage_UL(GenericPackage_UL_Data);\n\n\n\n\t\tconst UInt8 GenericPictureEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x27, 0x00 };\n\n\t\tconst UL GenericPictureEssenceDescriptor_UL(GenericPictureEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 GenericSoundEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x42, 0x00 };\n\n\t\tconst UL GenericSoundEssenceDescriptor_UL(GenericSoundEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 GenericStreamPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x11, 0x00 };\n\n\t\tconst UL GenericStreamPartition_UL(GenericStreamPartition_UL_Data);\n\n\n\n\t\tconst UInt8 GenericTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x38, 0x00 };\n\n\t\tconst UL GenericTrack_UL(GenericTrack_UL_Data);\n\n\n\n\t\tconst UInt8 GlobalAUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x03, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL GlobalAUID_UL(GlobalAUID_UL_Data);\n\n\n\n\t\tconst UInt8 HMACAlgorithmSHA1128_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x02, 0x09, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL HMACAlgorithmSHA1128_UL(HMACAlgorithmSHA1128_UL_Data);\n\n\n\n\t\tconst UInt8 HeaderByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x09, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL HeaderByteCount_UL(HeaderByteCount_UL_Data);\n\n\n\n\t\tconst UInt8 HorizontalSubsampling_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL HorizontalSubsampling_UL(HorizontalSubsampling_UL_Data);\n\n\n\n\t\tconst UInt8 Hours_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Hours_UL(Hours_UL_Data);\n\n\n\n\t\tconst UInt8 ISO7_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ISO7_UL(ISO7_UL_Data);\n\n\n\n\t\tconst UInt8 ISO7String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ISO7String_UL(ISO7String_UL_Data);\n\n\n\n\t\tconst UInt8 IdenticalGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x07, 0x00, 0x00 };\n\n\t\tconst UL IdenticalGOP_UL(IdenticalGOP_UL_Data);\n\n\n\n\t\tconst UInt8 Identification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x30, 0x00 };\n\n\t\tconst UL Identification_UL(Identification_UL_Data);\n\n\n\n\t\tconst UInt8 Identifications_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x04, 0x00, 0x00 };\n\n\t\tconst UL Identifications_UL(Identifications_UL_Data);\n\n\n\n\t\tconst UInt8 ImageAlignmentOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ImageAlignmentOffset_UL(ImageAlignmentOffset_UL_Data);\n\n\n\n\t\tconst UInt8 ImageEndOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ImageEndOffset_UL(ImageEndOffset_UL_Data);\n\n\n\n\t\tconst UInt8 ImageStartOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ImageStartOffset_UL(ImageStartOffset_UL_Data);\n\n\n\n\t\tconst UInt8 IndexByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x09, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IndexByteCount_UL(IndexByteCount_UL_Data);\n\n\n\n\t\tconst UInt8 IndexDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x02, 0x01, 0x01, 0x02, 0x00, 0x00 };\n\n\t\tconst UL IndexDuration_UL(IndexDuration_UL_Data);\n\n\n\n\t\tconst UInt8 IndexEditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x05, 0x30, 0x04, 0x06, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IndexEditRate_UL(IndexEditRate_UL_Data);\n\n\n\n\t\tconst UInt8 IndexEntryArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x02, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IndexEntryArray_UL(IndexEntryArray_UL_Data);\n\n\n\n\t\tconst UInt8 IndexSID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x04, 0x05, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IndexSID_UL(IndexSID_UL_Data);\n\n\n\n\t\tconst UInt8 IndexStartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0a, 0x00, 0x00 };\n\n\t\tconst UL IndexStartPosition_UL(IndexStartPosition_UL_Data);\n\n\n\n\t\tconst UInt8 IndexTableSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x10, 0x01, 0x00 };\n\n\t\tconst UL IndexTableSegment_UL(IndexTableSegment_UL_Data);\n\n\n\n\t\tconst UInt8 Indirect_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Indirect_UL(Indirect_UL_Data);\n\n\n\n\t\tconst UInt8 InstanceUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x15, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL InstanceUID_UL(InstanceUID_UL_Data);\n\n\n\n\t\tconst UInt8 Int16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int16_UL(Int16_UL_Data);\n\n\n\n\t\tconst UInt8 Int32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int32_UL(Int32_UL_Data);\n\n\n\n\t\tconst UInt8 Int32Batch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int32Batch_UL(Int32Batch_UL_Data);\n\n\n\n\t\tconst UInt8 Int64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int64_UL(Int64_UL_Data);\n\n\n\n\t\tconst UInt8 Int64Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int64Array_UL(Int64Array_UL_Data);\n\n\n\n\t\tconst UInt8 Int8_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Int8_UL(Int8_UL_Data);\n\n\n\n\t\tconst UInt8 InterchangeObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\t\tconst UL InterchangeObject_UL(InterchangeObject_UL_Data);\n\n\n\n\t\tconst UInt8 IsConcrete_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IsConcrete_UL(IsConcrete_UL_Data);\n\n\n\n\t\tconst UInt8 IsOptional_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IsOptional_UL(IsOptional_UL_Data);\n\n\n\n\t\tconst UInt8 IsSigned_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IsSigned_UL(IsSigned_UL_Data);\n\n\n\n\t\tconst UInt8 IsUniqueIdentifier_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL IsUniqueIdentifier_UL(IsUniqueIdentifier_UL_Data);\n\n\n\n\t\tconst UInt8 JPEG2000PictureSubDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5a, 0x00 };\n\n\t\tconst UL JPEG2000PictureSubDescriptor_UL(JPEG2000PictureSubDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 KAGSize_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x03, 0x01, 0x02, 0x01, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL KAGSize_UL(KAGSize_UL_Data);\n\n\n\n\t\tconst UInt8 KLVFill_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x10, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL KLVFill_UL(KLVFill_UL_Data);\n\n\n\n\t\tconst UInt8 LastModifiedDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x04, 0x00, 0x00 };\n\n\t\tconst UL LastModifiedDate_UL(LastModifiedDate_UL_Data);\n\n\n\n\t\tconst UInt8 LayoutType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LayoutType_UL(LayoutType_UL_Data);\n\n\n\n\t\tconst UInt8 Length_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Length_UL(Length_UL_Data);\n\n\n\n\t\tconst UInt8 LengthType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LengthType_UL(LengthType_UL_Data);\n\n\n\n\t\tconst UInt8 LinkedApplicationPluginInstanceID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LinkedApplicationPluginInstanceID_UL(LinkedApplicationPluginInstanceID_UL_Data);\n\n\n\n\t\tconst UInt8 LinkedDescriptiveFrameworkPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LinkedDescriptiveFrameworkPluginID_UL(LinkedDescriptiveFrameworkPluginID_UL_Data);\n\n\n\n\t\tconst UInt8 LinkedDescriptiveObjectPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x11, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LinkedDescriptiveObjectPluginID_UL(LinkedDescriptiveObjectPluginID_UL_Data);\n\n\n\n\t\tconst UInt8 LinkedPackageUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LinkedPackageUID_UL(LinkedPackageUID_UL_Data);\n\n\n\n\t\tconst UInt8 LinkedTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x03, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LinkedTrackID_UL(LinkedTrackID_UL_Data);\n\n\n\n\t\tconst UInt8 LocalIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LocalIdentification_UL(LocalIdentification_UL_Data);\n\n\n\n\t\tconst UInt8 LocalTag_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x03, 0x06, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LocalTag_UL(LocalTag_UL_Data);\n\n\n\n\t\tconst UInt8 LocalTagEntries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x07, 0x15, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LocalTagEntries_UL(LocalTagEntries_UL_Data);\n\n\n\n\t\tconst UInt8 LocalTagType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LocalTagType_UL(LocalTagType_UL_Data);\n\n\n\n\t\tconst UInt8 Locator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x31, 0x00 };\n\n\t\tconst UL Locator_UL(Locator_UL_Data);\n\n\n\n\t\tconst UInt8 LocatorName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL LocatorName_UL(LocatorName_UL_Data);\n\n\n\n\t\tconst UInt8 Locators_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x03, 0x00, 0x00 };\n\n\t\tconst UL Locators_UL(Locators_UL_Data);\n\n\n\n\t\tconst UInt8 Locked_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x02, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Locked_UL(Locked_UL_Data);\n\n\n\n\t\tconst UInt8 LowDelay_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x05, 0x00, 0x00 };\n\n\t\tconst UL LowDelay_UL(LowDelay_UL_Data);\n\n\n\n\t\tconst UInt8 MIC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x02, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MIC_UL(MIC_UL_Data);\n\n\n\n\t\tconst UInt8 MICAlgorithm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MICAlgorithm_UL(MICAlgorithm_UL_Data);\n\n\n\n\t\tconst UInt8 MPEG2VideoDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x51, 0x00 };\n\n\t\tconst UL MPEG2VideoDescriptor_UL(MPEG2VideoDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 MXFEC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MXFEC_UL(MXFEC_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MXFGC_UL(MXFGC_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCAESBWF_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x06, 0x00, 0x00 };\n\n\t\tconst UL MXFGCAESBWF_UL(MXFGCAESBWF_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCALaw_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0a, 0x00, 0x00 };\n\n\t\tconst UL MXFGCALaw_UL(MXFGCALaw_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCD10_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL MXFGCD10_UL(MXFGCD10_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCD11_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x03, 0x00, 0x00 };\n\n\t\tconst UL MXFGCD11_UL(MXFGCD11_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCDV_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x02, 0x00, 0x00 };\n\n\t\tconst UL MXFGCDV_UL(MXFGCDV_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCEncrypted_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL MXFGCEncrypted_UL(MXFGCEncrypted_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCJP2K_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0c, 0x00, 0x00 };\n\n\t\tconst UL MXFGCJP2K_UL(MXFGCJP2K_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCMPEGES_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x04, 0x00, 0x00 };\n\n\t\tconst UL MXFGCMPEGES_UL(MXFGCMPEGES_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCMPEGPES_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x07, 0x00, 0x00 };\n\n\t\tconst UL MXFGCMPEGPES_UL(MXFGCMPEGPES_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCMPEGPS_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x08, 0x00, 0x00 };\n\n\t\tconst UL MXFGCMPEGPS_UL(MXFGCMPEGPS_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCMPEGTS_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x09, 0x00, 0x00 };\n\n\t\tconst UL MXFGCMPEGTS_UL(MXFGCMPEGTS_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCMultiple_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x03, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7f, 0x01, 0x00 };\n\n\t\tconst UL MXFGCMultiple_UL(MXFGCMultiple_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCUncompressed_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x05, 0x00, 0x00 };\n\n\t\tconst UL MXFGCUncompressed_UL(MXFGCUncompressed_UL_Data);\n\n\n\n\t\tconst UInt8 MXFGCVBI_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0d, 0x00, 0x00 };\n\n\t\tconst UL MXFGCVBI_UL(MXFGCVBI_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP1a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\t\tconst UL MXFOP1a_UL(MXFOP1a_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP1b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x01, 0x00 };\n\n\t\tconst UL MXFOP1b_UL(MXFOP1b_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP1c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\n\n\t\tconst UL MXFOP1c_UL(MXFOP1c_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP1x_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\t\tconst UL MXFOP1x_UL(MXFOP1x_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP2a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01, 0x00 };\n\n\t\tconst UL MXFOP2a_UL(MXFOP2a_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP2b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x02, 0x01, 0x00 };\n\n\t\tconst UL MXFOP2b_UL(MXFOP2b_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP2c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x03, 0x01, 0x00 };\n\n\t\tconst UL MXFOP2c_UL(MXFOP2c_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP3a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x01, 0x01, 0x00 };\n\n\t\tconst UL MXFOP3a_UL(MXFOP3a_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP3b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x02, 0x01, 0x00 };\n\n\t\tconst UL MXFOP3b_UL(MXFOP3b_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOP3c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x03, 0x01, 0x00 };\n\n\t\tconst UL MXFOP3c_UL(MXFOP3c_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOPAtom_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MXFOPAtom_UL(MXFOPAtom_UL_Data);\n\n\n\n\t\tconst UInt8 MXFOPSpecialized_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MXFOPSpecialized_UL(MXFOPSpecialized_UL_Data);\n\n\n\n\t\tconst UInt8 Major_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Major_UL(Major_UL_Data);\n\n\n\n\t\tconst UInt8 MajorVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x03, 0x01, 0x02, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MajorVersion_UL(MajorVersion_UL_Data);\n\n\n\n\t\tconst UInt8 MaterialPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x36, 0x00 };\n\n\t\tconst UL MaterialPackage_UL(MaterialPackage_UL_Data);\n\n\n\n\t\tconst UInt8 MaxGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x08, 0x00, 0x00 };\n\n\t\tconst UL MaxGOP_UL(MaxGOP_UL_Data);\n\n\n\n\t\tconst UInt8 MemberNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MemberNames_UL(MemberNames_UL_Data);\n\n\n\n\t\tconst UInt8 MemberTypes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x11, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MemberTypes_UL(MemberTypes_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x24, 0x00, 0x00 };\n\n\t\tconst UL MetaDefinition_UL(MetaDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDefinitionDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x14, 0x01, 0x00, 0x00 };\n\n\t\tconst UL MetaDefinitionDescription_UL(MetaDefinitionDescription_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDefinitionIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x13, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MetaDefinitionIdentification_UL(MetaDefinitionIdentification_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDefinitionName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x02, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00 };\n\n\t\tconst UL MetaDefinitionName_UL(MetaDefinitionName_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1f, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MetaDefinitions_UL(MetaDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 MetaDictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x25, 0x00, 0x00 };\n\n\t\tconst UL MetaDictionary_UL(MetaDictionary_UL_Data);\n\n\n\n\t\tconst UInt8 MetaReferenceClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MetaReferenceClassDefinition_UL(MetaReferenceClassDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 MetaReferenceTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MetaReferenceTypeDefinition_UL(MetaReferenceTypeDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 Minor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Minor_UL(Minor_UL_Data);\n\n\n\n\t\tconst UInt8 MinorVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x03, 0x01, 0x02, 0x01, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MinorVersion_UL(MinorVersion_UL_Data);\n\n\n\n\t\tconst UInt8 Minutes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Minutes_UL(Minutes_UL_Data);\n\n\n\n\t\tconst UInt8 ModificationDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x03, 0x00, 0x00 };\n\n\t\tconst UL ModificationDate_UL(ModificationDate_UL_Data);\n\n\n\n\t\tconst UInt8 MonoSourceTrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x06, 0x01, 0x01, 0x03, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL MonoSourceTrackIDs_UL(MonoSourceTrackIDs_UL_Data);\n\n\n\n\t\tconst UInt8 Month_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Month_UL(Month_UL_Data);\n\n\n\n\t\tconst UInt8 MultipleDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x44, 0x00 };\n\n\t\tconst UL MultipleDescriptor_UL(MultipleDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 NetworkLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x32, 0x00 };\n\n\t\tconst UL NetworkLocator_UL(NetworkLocator_UL_Data);\n\n\n\n\t\tconst UInt8 Numerator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Numerator_UL(Numerator_UL_Data);\n\n\n\n\t\tconst UInt8 ObjectClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00 };\n\n\t\tconst UL ObjectClass_UL(ObjectClass_UL_Data);\n\n\n\n\t\tconst UInt8 ObjectModelVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ObjectModelVersion_UL(ObjectModelVersion_UL_Data);\n\n\n\n\t\tconst UInt8 Opaque_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Opaque_UL(Opaque_UL_Data);\n\n\n\n\t\tconst UInt8 OpenBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\n\n\t\tconst UL OpenBodyPartition_UL(OpenBodyPartition_UL_Data);\n\n\n\n\t\tconst UInt8 OpenCompleteBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x03, 0x00 };\n\n\t\tconst UL OpenCompleteBodyPartition_UL(OpenCompleteBodyPartition_UL_Data);\n\n\n\n\t\tconst UInt8 OpenCompleteHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x03, 0x00 };\n\n\t\tconst UL OpenCompleteHeader_UL(OpenCompleteHeader_UL_Data);\n\n\n\n\t\tconst UInt8 OpenHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x01, 0x00 };\n\n\t\tconst UL OpenHeader_UL(OpenHeader_UL_Data);\n\n\n\n\t\tconst UInt8 OperationalPattern_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL OperationalPattern_UL(OperationalPattern_UL_Data);\n\n\n\n\t\tconst UInt8 Origin_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL Origin_UL(Origin_UL_Data);\n\n\n\n\t\tconst UInt8 OriginalProperty_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x20, 0x00, 0x00, 0x00 };\n\n\t\tconst UL OriginalProperty_UL(OriginalProperty_UL_Data);\n\n\n\n\t\tconst UInt8 PackageCreationDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x01, 0x03, 0x00, 0x00 };\n\n\t\tconst UL PackageCreationDate_UL(PackageCreationDate_UL_Data);\n\n\n\n\t\tconst UInt8 PackageID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PackageID_UL(PackageID_UL_Data);\n\n\n\n\t\tconst UInt8 PackageMarkInPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0e, 0x00, 0x00 };\n\n\t\tconst UL PackageMarkInPosition_UL(PackageMarkInPosition_UL_Data);\n\n\n\n\t\tconst UInt8 PackageMarkOutPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x07, 0x02, 0x01, 0x03, 0x02, 0x04, 0x00, 0x00 };\n\n\t\tconst UL PackageMarkOutPosition_UL(PackageMarkOutPosition_UL_Data);\n\n\n\n\t\tconst UInt8 PackageMarker_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0f, 0x00, 0x00 };\n\n\t\tconst UL PackageMarker_UL(PackageMarker_UL_Data);\n\n\n\n\t\tconst UInt8 PackageMarkerObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x60, 0x00 };\n\n\t\tconst UL PackageMarkerObject_UL(PackageMarkerObject_UL_Data);\n\n\n\n\t\tconst UInt8 PackageModifiedDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x05, 0x00, 0x00 };\n\n\t\tconst UL PackageModifiedDate_UL(PackageModifiedDate_UL_Data);\n\n\n\n\t\tconst UInt8 PackageName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PackageName_UL(PackageName_UL_Data);\n\n\n\n\t\tconst UInt8 PackageUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x15, 0x10, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PackageUID_UL(PackageUID_UL_Data);\n\n\n\n\t\tconst UInt8 Packages_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x01, 0x00, 0x00 };\n\n\t\tconst UL Packages_UL(Packages_UL_Data);\n\n\n\n\t\tconst UInt8 PaddingBits_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PaddingBits_UL(PaddingBits_UL_Data);\n\n\n\n\t\tconst UInt8 Palette_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Palette_UL(Palette_UL_Data);\n\n\n\n\t\tconst UInt8 PaletteLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PaletteLayout_UL(PaletteLayout_UL_Data);\n\n\n\n\t\tconst UInt8 ParentClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ParentClass_UL(ParentClass_UL_Data);\n\n\n\n\t\tconst UInt8 PartitionArray_UL_Data[16] = { 0x80, 0x62, 0xc1, 0x08, 0xa8, 0x0d, 0xeb, 0xfe, 0x3a, 0x9d, 0xc8, 0xe1, 0x7e, 0x83, 0xb6, 0x4b };\n\n\t\tconst UL PartitionArray_UL(PartitionArray_UL_Data);\n\n\n\n\t\tconst UInt8 PartitionMetadata_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x06, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PartitionMetadata_UL(PartitionMetadata_UL_Data);\n\n\n\n\t\tconst UInt8 Patch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Patch_UL(Patch_UL_Data);\n\n\n\n\t\tconst UInt8 PeakChannels_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakChannels_UL(PeakChannels_UL_Data);\n\n\n\n\t\tconst UInt8 PeakEnvelopeBlockSize_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakEnvelopeBlockSize_UL(PeakEnvelopeBlockSize_UL_Data);\n\n\n\n\t\tconst UInt8 PeakEnvelopeData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x01, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakEnvelopeData_UL(PeakEnvelopeData_UL_Data);\n\n\n\n\t\tconst UInt8 PeakEnvelopeFormat_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakEnvelopeFormat_UL(PeakEnvelopeFormat_UL_Data);\n\n\n\n\t\tconst UInt8 PeakEnvelopeTimestamp_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakEnvelopeTimestamp_UL(PeakEnvelopeTimestamp_UL_Data);\n\n\n\n\t\tconst UInt8 PeakEnvelopeVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakEnvelopeVersion_UL(PeakEnvelopeVersion_UL_Data);\n\n\n\n\t\tconst UInt8 PeakFrames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakFrames_UL(PeakFrames_UL_Data);\n\n\n\n\t\tconst UInt8 PeakOfPeaksPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PeakOfPeaksPosition_UL(PeakOfPeaksPosition_UL_Data);\n\n\n\n\t\tconst UInt8 PictureComponentSizing_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PictureComponentSizing_UL(PictureComponentSizing_UL_Data);\n\n\n\n\t\tconst UInt8 PictureEssenceCoding_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PictureEssenceCoding_UL(PictureEssenceCoding_UL_Data);\n\n\n\n\t\tconst UInt8 PictureEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PictureEssenceTrack_UL(PictureEssenceTrack_UL_Data);\n\n\n\n\t\tconst UInt8 PixelLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PixelLayout_UL(PixelLayout_UL_Data);\n\n\n\n\t\tconst UInt8 PlaintextOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x09, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PlaintextOffset_UL(PlaintextOffset_UL_Data);\n\n\n\n\t\tconst UInt8 Platform_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x06, 0x01, 0x00, 0x00 };\n\n\t\tconst UL Platform_UL(Platform_UL_Data);\n\n\n\n\t\tconst UInt8 PointsPerPeakValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PointsPerPeakValue_UL(PointsPerPeakValue_UL_Data);\n\n\n\n\t\tconst UInt8 PosTableCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x01, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PosTableCount_UL(PosTableCount_UL_Data);\n\n\n\n\t\tconst UInt8 Position_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Position_UL(Position_UL_Data);\n\n\n\n\t\tconst UInt8 Preface_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x2f, 0x00 };\n\n\t\tconst UL Preface_UL(Preface_UL_Data);\n\n\n\n\t\tconst UInt8 PreferredPrefix_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PreferredPrefix_UL(PreferredPrefix_UL_Data);\n\n\n\n\t\tconst UInt8 PreviousPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PreviousPartition_UL(PreviousPartition_UL_Data);\n\n\n\n\t\tconst UInt8 PrimaryPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x04, 0x01, 0x08, 0x00, 0x00 };\n\n\t\tconst UL PrimaryPackage_UL(PrimaryPackage_UL_Data);\n\n\n\n\t\tconst UInt8 Primer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x05, 0x01, 0x00 };\n\n\t\tconst UL Primer_UL(Primer_UL_Data);\n\n\n\n\t\tconst UInt8 ProductName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x03, 0x01, 0x00, 0x00 };\n\n\t\tconst UL ProductName_UL(ProductName_UL_Data);\n\n\n\n\t\tconst UInt8 ProductUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ProductUID_UL(ProductUID_UL_Data);\n\n\n\n\t\tconst UInt8 ProductVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ProductVersion_UL(ProductVersion_UL_Data);\n\n\n\n\t\tconst UInt8 ProductVersionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ProductVersionType_UL(ProductVersionType_UL_Data);\n\n\n\n\t\tconst UInt8 ProfileAndLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x0a, 0x00, 0x00 };\n\n\t\tconst UL ProfileAndLevel_UL(ProfileAndLevel_UL_Data);\n\n\n\n\t\tconst UInt8 Properties_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Properties_UL(Properties_UL_Data);\n\n\n\n\t\tconst UInt8 PropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x02, 0x00, 0x00 };\n\n\t\tconst UL PropertyDefinition_UL(PropertyDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 PropertyType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL PropertyType_UL(PropertyType_UL_Data);\n\n\n\n\t\tconst UInt8 PropertyWrapperDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x27, 0x00, 0x00 };\n\n\t\tconst UL PropertyWrapperDefinition_UL(PropertyWrapperDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 QuantizationBits_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x02, 0x03, 0x03, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL QuantizationBits_UL(QuantizationBits_UL_Data);\n\n\n\n\t\tconst UInt8 QuantizationDefault_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL QuantizationDefault_UL(QuantizationDefault_UL_Data);\n\n\n\n\t\tconst UInt8 RGBACode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x0e, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RGBACode_UL(RGBACode_UL_Data);\n\n\n\n\t\tconst UInt8 RGBAEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x29, 0x00 };\n\n\t\tconst UL RGBAEssenceDescriptor_UL(RGBAEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 RGBALayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RGBALayout_UL(RGBALayout_UL_Data);\n\n\n\n\t\tconst UInt8 RGBALayoutItem_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RGBALayoutItem_UL(RGBALayoutItem_UL_Data);\n\n\n\n\t\tconst UInt8 RandomIndexMetadata_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x11, 0x01, 0x00 };\n\n\t\tconst UL RandomIndexMetadata_UL(RandomIndexMetadata_UL_Data);\n\n\n\n\t\tconst UInt8 RandomIndexMetadataV10_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x11, 0x00, 0x00 };\n\n\t\tconst UL RandomIndexMetadataV10_UL(RandomIndexMetadataV10_UL_Data);\n\n\n\n\t\tconst UInt8 Rational_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Rational_UL(Rational_UL_Data);\n\n\n\n\t\tconst UInt8 RationalArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RationalArray_UL(RationalArray_UL_Data);\n\n\n\n\t\tconst UInt8 ReferencedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ReferencedType_UL(ReferencedType_UL_Data);\n\n\n\n\t\tconst UInt8 Release_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x05, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Release_UL(Release_UL_Data);\n\n\n\n\t\tconst UInt8 RenamedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x12, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RenamedType_UL(RenamedType_UL_Data);\n\n\n\n\t\tconst UInt8 ReversedByteOrder_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x03, 0x01, 0x02, 0x01, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ReversedByteOrder_UL(ReversedByteOrder_UL_Data);\n\n\n\n\t\tconst UInt8 Root_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Root_UL(Root_UL_Data);\n\n\n\n\t\tconst UInt8 RootExtensions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x7f, 0x01, 0x00, 0x00 };\n\n\t\tconst UL RootExtensions_UL(RootExtensions_UL_Data);\n\n\n\n\t\tconst UInt8 RootFormatVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x19, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RootFormatVersion_UL(RootFormatVersion_UL_Data);\n\n\n\n\t\tconst UInt8 RootPreface_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x17, 0x00, 0x00, 0x00 };\n\n\t\tconst UL RootPreface_UL(RootPreface_UL_Data);\n\n\n\n\t\tconst UInt8 RoundedTimecodeBase_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x04, 0x01, 0x01, 0x02, 0x06, 0x00, 0x00 };\n\n\t\tconst UL RoundedTimecodeBase_UL(RoundedTimecodeBase_UL_Data);\n\n\n\n\t\tconst UInt8 Rsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Rsiz_UL(Rsiz_UL_Data);\n\n\n\n\t\tconst UInt8 SMPTE12MTimecodeActiveUserBitsTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SMPTE12MTimecodeActiveUserBitsTrack_UL(SMPTE12MTimecodeActiveUserBitsTrack_UL_Data);\n\n\n\n\t\tconst UInt8 SMPTE12MTimecodeTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SMPTE12MTimecodeTrack_UL(SMPTE12MTimecodeTrack_UL_Data);\n\n\n\n\t\tconst UInt8 SMPTE309MTimecodeTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SMPTE309MTimecodeTrack_UL(SMPTE309MTimecodeTrack_UL_Data);\n\n\n\n\t\tconst UInt8 SampleRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SampleRate_UL(SampleRate_UL_Data);\n\n\n\n\t\tconst UInt8 SampledHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SampledHeight_UL(SampledHeight_UL_Data);\n\n\n\n\t\tconst UInt8 SampledWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SampledWidth_UL(SampledWidth_UL_Data);\n\n\n\n\t\tconst UInt8 SampledXOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SampledXOffset_UL(SampledXOffset_UL_Data);\n\n\n\n\t\tconst UInt8 SampledYOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SampledYOffset_UL(SampledYOffset_UL_Data);\n\n\n\n\t\tconst UInt8 ScanningDirection_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x04, 0x04, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ScanningDirection_UL(ScanningDirection_UL_Data);\n\n\n\n\t\tconst UInt8 Seconds_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Seconds_UL(Seconds_UL_Data);\n\n\n\n\t\tconst UInt8 Segment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00 };\n\n\t\tconst UL Segment_UL(Segment_UL_Data);\n\n\n\n\t\tconst UInt8 Sequence_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x0f, 0x00 };\n\n\t\tconst UL Sequence_UL(Sequence_UL_Data);\n\n\n\n\t\tconst UInt8 SequenceNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x10, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SequenceNumber_UL(SequenceNumber_UL_Data);\n\n\n\n\t\tconst UInt8 SequenceOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SequenceOffset_UL(SequenceOffset_UL_Data);\n\n\n\n\t\tconst UInt8 SetElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SetElementType_UL(SetElementType_UL_Data);\n\n\n\n\t\tconst UInt8 SignalStandard_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x05, 0x01, 0x13, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SignalStandard_UL(SignalStandard_UL_Data);\n\n\n\n\t\tconst UInt8 SingleSequence_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x02, 0x00, 0x00 };\n\n\t\tconst UL SingleSequence_UL(SingleSequence_UL_Data);\n\n\n\n\t\tconst UInt8 Size_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Size_UL(Size_UL_Data);\n\n\n\n\t\tconst UInt8 SliceCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x04, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SliceCount_UL(SliceCount_UL_Data);\n\n\n\n\t\tconst UInt8 SoundEssenceCompression_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x02, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SoundEssenceCompression_UL(SoundEssenceCompression_UL_Data);\n\n\n\n\t\tconst UInt8 SoundEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SoundEssenceTrack_UL(SoundEssenceTrack_UL_Data);\n\n\n\n\t\tconst UInt8 SourceClip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x11, 0x00 };\n\n\t\tconst UL SourceClip_UL(SourceClip_UL_Data);\n\n\n\n\t\tconst UInt8 SourceEssenceContainer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x02, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SourceEssenceContainer_UL(SourceEssenceContainer_UL_Data);\n\n\n\n\t\tconst UInt8 SourceKey_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SourceKey_UL(SourceKey_UL_Data);\n\n\n\n\t\tconst UInt8 SourceLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x04, 0x06, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SourceLength_UL(SourceLength_UL_Data);\n\n\n\n\t\tconst UInt8 SourcePackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x37, 0x00 };\n\n\t\tconst UL SourcePackage_UL(SourcePackage_UL_Data);\n\n\n\n\t\tconst UInt8 SourcePackageID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x03, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SourcePackageID_UL(SourcePackageID_UL_Data);\n\n\n\n\t\tconst UInt8 SourceReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x10, 0x00 };\n\n\t\tconst UL SourceReference_UL(SourceReference_UL_Data);\n\n\n\n\t\tconst UInt8 SourceTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x03, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SourceTrackID_UL(SourceTrackID_UL_Data);\n\n\n\n\t\tconst UInt8 StartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00 };\n\n\t\tconst UL StartPosition_UL(StartPosition_UL_Data);\n\n\n\n\t\tconst UInt8 StartTimecode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x05, 0x00, 0x00 };\n\n\t\tconst UL StartTimecode_UL(StartTimecode_UL_Data);\n\n\n\n\t\tconst UInt8 StaticTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x3a, 0x00 };\n\n\t\tconst UL StaticTrack_UL(StaticTrack_UL_Data);\n\n\n\n\t\tconst UInt8 StoredF2Offset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StoredF2Offset_UL(StoredF2Offset_UL_Data);\n\n\n\n\t\tconst UInt8 StoredHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StoredHeight_UL(StoredHeight_UL_Data);\n\n\n\n\t\tconst UInt8 StoredWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x02, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StoredWidth_UL(StoredWidth_UL_Data);\n\n\n\n\t\tconst UInt8 Stream_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Stream_UL(Stream_UL_Data);\n\n\n\n\t\tconst UInt8 StringArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StringArray_UL(StringArray_UL_Data);\n\n\n\n\t\tconst UInt8 StringElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0f, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StringElementType_UL(StringElementType_UL_Data);\n\n\n\n\t\tconst UInt8 StrongRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongRef_UL(StrongRef_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceCodecDefinition_UL(StrongReferenceCodecDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceComponent_UL(StrongReferenceComponent_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0c, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceContainerDefinition_UL(StrongReferenceContainerDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceContentStorage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceContentStorage_UL(StrongReferenceContentStorage_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceDataDefinition_UL(StrongReferenceDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceDictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceDictionary_UL(StrongReferenceDictionary_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceEssenceData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceEssenceData_UL(StrongReferenceEssenceData_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceEssenceDescriptor_UL(StrongReferenceEssenceDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceIdentification_UL(StrongReferenceIdentification_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceInterpolationDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceInterpolationDefinition_UL(StrongReferenceInterpolationDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceKLVData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x1c, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceKLVData_UL(StrongReferenceKLVData_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceKLVDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceKLVDataDefinition_UL(StrongReferenceKLVDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x12, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceLocator_UL(StrongReferenceLocator_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceNetworkLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceNetworkLocator_UL(StrongReferenceNetworkLocator_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferencePackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x13, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferencePackage_UL(StrongReferencePackage_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceParameter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x16, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceParameter_UL(StrongReferenceParameter_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x17, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceParameterDefinition_UL(StrongReferenceParameterDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferencePluginDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferencePluginDefinition_UL(StrongReferencePluginDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferencePropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x19, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferencePropertyDefinition_UL(StrongReferencePropertyDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSegment_UL(StrongReferenceSegment_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetClassDefinition_UL(StrongReferenceSetClassDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetCodecDefinition_UL(StrongReferenceSetCodecDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetContainerDefinition_UL(StrongReferenceSetContainerDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetDataDefinition_UL(StrongReferenceSetDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetEssenceData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetEssenceData_UL(StrongReferenceSetEssenceData_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetInterpolationDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetInterpolationDefinition_UL(StrongReferenceSetInterpolationDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetKLVDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0d, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetKLVDataDefinition_UL(StrongReferenceSetKLVDataDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetPackage_UL(StrongReferenceSetPackage_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetParameterDefinition_UL(StrongReferenceSetParameterDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetPluginDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetPluginDefinition_UL(StrongReferenceSetPluginDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetPropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetPropertyDefinition_UL(StrongReferenceSetPropertyDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetTaggedValueDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetTaggedValueDefinition_UL(StrongReferenceSetTaggedValueDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSetTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0c, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSetTypeDefinition_UL(StrongReferenceSetTypeDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceSourceReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceSourceReference_UL(StrongReferenceSourceReference_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceTaggedValueDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceTaggedValueDefinition_UL(StrongReferenceTaggedValueDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceTrack_UL(StrongReferenceTrack_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorComponent_UL(StrongReferenceVectorComponent_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorFileDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorFileDescriptor_UL(StrongReferenceVectorFileDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorIdentification_UL(StrongReferenceVectorIdentification_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorKLVData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorKLVData_UL(StrongReferenceVectorKLVData_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorLocator_UL(StrongReferenceVectorLocator_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorParameter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorParameter_UL(StrongReferenceVectorParameter_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorSegment_UL(StrongReferenceVectorSegment_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorSubDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorSubDescriptor_UL(StrongReferenceVectorSubDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 StrongReferenceVectorTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL StrongReferenceVectorTrack_UL(StrongReferenceVectorTrack_UL_Data);\n\n\n\n\t\tconst UInt8 StructuralComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00 };\n\n\t\tconst UL StructuralComponent_UL(StructuralComponent_UL_Data);\n\n\n\n\t\tconst UInt8 StructuralComponents_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x09, 0x00, 0x00 };\n\n\t\tconst UL StructuralComponents_UL(StructuralComponents_UL_Data);\n\n\n\n\t\tconst UInt8 SubDescriptors_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x04, 0x06, 0x10, 0x00, 0x00 };\n\n\t\tconst UL SubDescriptors_UL(SubDescriptors_UL_Data);\n\n\n\n\t\tconst UInt8 SymbolSpaceURI_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1c, 0x00, 0x00, 0x00 };\n\n\t\tconst UL SymbolSpaceURI_UL(SymbolSpaceURI_UL_Data);\n\n\n\n\t\tconst UInt8 TargetSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x0b, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TargetSet_UL(TargetSet_UL_Data);\n\n\n\n\t\tconst UInt8 TextLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x33, 0x00 };\n\n\t\tconst UL TextLocator_UL(TextLocator_UL_Data);\n\n\n\n\t\tconst UInt8 ThisGenerationUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ThisGenerationUID_UL(ThisGenerationUID_UL_Data);\n\n\n\n\t\tconst UInt8 ThisPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x03, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ThisPartition_UL(ThisPartition_UL_Data);\n\n\n\n\t\tconst UInt8 TimeStruct_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TimeStruct_UL(TimeStruct_UL_Data);\n\n\n\n\t\tconst UInt8 TimebaseReferenceTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x03, 0x0e, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TimebaseReferenceTrackID_UL(TimebaseReferenceTrackID_UL_Data);\n\n\n\n\t\tconst UInt8 TimecodeComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x14, 0x00 };\n\n\t\tconst UL TimecodeComponent_UL(TimecodeComponent_UL_Data);\n\n\n\n\t\tconst UInt8 Timestamp_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Timestamp_UL(Timestamp_UL_Data);\n\n\n\n\t\tconst UInt8 ToolkitVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ToolkitVersion_UL(ToolkitVersion_UL_Data);\n\n\n\n\t\tconst UInt8 Track_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x3b, 0x00 };\n\n\t\tconst UL Track_UL(Track_UL_Data);\n\n\n\n\t\tconst UInt8 TrackFileID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x06, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TrackFileID_UL(TrackFileID_UL_Data);\n\n\n\n\t\tconst UInt8 TrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TrackID_UL(TrackID_UL_Data);\n\n\n\n\t\tconst UInt8 TrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x07, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TrackIDs_UL(TrackIDs_UL_Data);\n\n\n\n\t\tconst UInt8 TrackName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TrackName_UL(TrackName_UL_Data);\n\n\n\n\t\tconst UInt8 TrackNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TrackNumber_UL(TrackNumber_UL_Data);\n\n\n\n\t\tconst UInt8 TrackSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x04, 0x00, 0x00 };\n\n\t\tconst UL TrackSegment_UL(TrackSegment_UL_Data);\n\n\n\n\t\tconst UInt8 Tracks_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x05, 0x00, 0x00 };\n\n\t\tconst UL Tracks_UL(Tracks_UL_Data);\n\n\n\n\t\tconst UInt8 TransferCharacteristic_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x01, 0x02, 0x00 };\n\n\t\tconst UL TransferCharacteristic_UL(TransferCharacteristic_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinition_UL(TypeDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionCharacter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x23, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionCharacter_UL(TypeDefinitionCharacter_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionEnumeration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x07, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionEnumeration_UL(TypeDefinitionEnumeration_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionExtendibleEnumeration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x20, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionExtendibleEnumeration_UL(TypeDefinitionExtendibleEnumeration_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionFixedArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x08, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionFixedArray_UL(TypeDefinitionFixedArray_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionIndirect_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x21, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionIndirect_UL(TypeDefinitionIndirect_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionInteger_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x04, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionInteger_UL(TypeDefinitionInteger_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionOpaque_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x22, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionOpaque_UL(TypeDefinitionOpaque_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionRecord_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0d, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionRecord_UL(TypeDefinitionRecord_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionRename_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0e, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionRename_UL(TypeDefinitionRename_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0a, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionSet_UL(TypeDefinitionSet_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionStream_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0c, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionStream_UL(TypeDefinitionStream_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0b, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionString_UL(TypeDefinitionString_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionStrongObjectReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x05, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionStrongObjectReference_UL(TypeDefinitionStrongObjectReference_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionVariableArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x09, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionVariableArray_UL(TypeDefinitionVariableArray_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitionWeakObjectReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x06, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitionWeakObjectReference_UL(TypeDefinitionWeakObjectReference_UL_Data);\n\n\n\n\t\tconst UInt8 TypeDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL TypeDefinitions_UL(TypeDefinitions_UL_Data);\n\n\n\n\t\tconst UInt8 UInt16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt16_UL(UInt16_UL_Data);\n\n\n\n\t\tconst UInt8 UInt32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt32_UL(UInt32_UL_Data);\n\n\n\n\t\tconst UInt8 UInt32Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt32Array_UL(UInt32Array_UL_Data);\n\n\n\n\t\tconst UInt8 UInt32Batch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt32Batch_UL(UInt32Batch_UL_Data);\n\n\n\n\t\tconst UInt8 UInt64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt64_UL(UInt64_UL_Data);\n\n\n\n\t\tconst UInt8 UInt8_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt8_UL(UInt8_UL_Data);\n\n\n\n\t\tconst UInt8 UInt8Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UInt8Array_UL(UInt8Array_UL_Data);\n\n\n\n\t\tconst UInt8 UL_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UL_UL(UL_UL_Data);\n\n\n\n\t\tconst UInt8 UMID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x30, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UMID_UL(UMID_UL_Data);\n\n\n\n\t\tconst UInt8 URLString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL URLString_UL(URLString_UL_Data);\n\n\n\n\t\tconst UInt8 UTF16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UTF16_UL(UTF16_UL_Data);\n\n\n\n\t\tconst UInt8 UTF16String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UTF16String_UL(UTF16String_UL_Data);\n\n\n\n\t\tconst UInt8 UTF7String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x20, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UTF7String_UL(UTF7String_UL_Data);\n\n\n\n\t\tconst UInt8 UUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UUID_UL(UUID_UL_Data);\n\n\n\n\t\tconst UInt8 UnknownChunk_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x4f, 0x00 };\n\n\t\tconst UL UnknownChunk_UL(UnknownChunk_UL_Data);\n\n\n\n\t\tconst UInt8 UserDataMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UserDataMode_UL(UserDataMode_UL_Data);\n\n\n\n\t\tconst UInt8 VBIDataDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5b, 0x00 };\n\n\t\tconst UL VBIDataDescriptor_UL(VBIDataDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 VariableArrayElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0d, 0x00, 0x00, 0x00 };\n\n\t\tconst UL VariableArrayElementType_UL(VariableArrayElementType_UL_Data);\n\n\n\n\t\tconst UInt8 Version_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x01, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Version_UL(Version_UL_Data);\n\n\n\n\t\tconst UInt8 VersionString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x05, 0x01, 0x00, 0x00 };\n\n\t\tconst UL VersionString_UL(VersionString_UL_Data);\n\n\n\n\t\tconst UInt8 VersionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL VersionType_UL(VersionType_UL_Data);\n\n\n\n\t\tconst UInt8 VerticalSubsampling_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\t\tconst UL VerticalSubsampling_UL(VerticalSubsampling_UL_Data);\n\n\n\n\t\tconst UInt8 VideoLineMap_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x03, 0x02, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL VideoLineMap_UL(VideoLineMap_UL_Data);\n\n\n\n\t\tconst UInt8 WaveAudioDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x48, 0x00 };\n\n\t\tconst UL WaveAudioDescriptor_UL(WaveAudioDescriptor_UL_Data);\n\n\n\n\t\tconst UInt8 WeakRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WeakRef_UL(WeakRef_UL_Data);\n\n\n\n\t\tconst UInt8 WeakReferenceArrayTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WeakReferenceArrayTypeDefinition_UL(WeakReferenceArrayTypeDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 WeakReferenceParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WeakReferenceParameterDefinition_UL(WeakReferenceParameterDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 WeakReferenceSetParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x03, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WeakReferenceSetParameterDefinition_UL(WeakReferenceSetParameterDefinition_UL_Data);\n\n\n\n\t\tconst UInt8 WeakReferencedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0a, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WeakReferencedType_UL(WeakReferencedType_UL_Data);\n\n\n\n\t\tconst UInt8 WhiteReflevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x03, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL WhiteReflevel_UL(WhiteReflevel_UL_Data);\n\n\n\n\t\tconst UInt8 XOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x04, 0x00, 0x00, 0x00 };\n\n\t\tconst UL XOsiz_UL(XOsiz_UL_Data);\n\n\n\n\t\tconst UInt8 XTOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x08, 0x00, 0x00, 0x00 };\n\n\t\tconst UL XTOsiz_UL(XTOsiz_UL_Data);\n\n\n\n\t\tconst UInt8 XTsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x06, 0x00, 0x00, 0x00 };\n\n\t\tconst UL XTsiz_UL(XTsiz_UL_Data);\n\n\n\n\t\tconst UInt8 Xsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x02, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Xsiz_UL(Xsiz_UL_Data);\n\n\n\n\t\tconst UInt8 YOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x05, 0x00, 0x00, 0x00 };\n\n\t\tconst UL YOsiz_UL(YOsiz_UL_Data);\n\n\n\n\t\tconst UInt8 YTOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x09, 0x00, 0x00, 0x00 };\n\n\t\tconst UL YTOsiz_UL(YTOsiz_UL_Data);\n\n\n\n\t\tconst UInt8 YTsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x07, 0x00, 0x00, 0x00 };\n\n\t\tconst UL YTsiz_UL(YTsiz_UL_Data);\n\n\n\n\t\tconst UInt8 Year_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Year_UL(Year_UL_Data);\n\n\n\n\t\tconst UInt8 Ysiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x03, 0x00, 0x00, 0x00 };\n\n\t\tconst UL Ysiz_UL(Ysiz_UL_Data);\n\n\n\n\t\tconst UInt8 msBy4_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL msBy4_UL(msBy4_UL_Data);\n\n\n","file_path":"mxflib/ulmap.h","rank":2,"score":86361.94720784588},{"content":"namespace mxflib\n\n{\n\n\t/* Standard library features (bits 0 to 30) */\n\n\n\n\tconst UInt64 FeatureVersion1KLVFill\t = UINT64_C(1) << 0;\t//!< MXFLib feature: Write KLVFill items with the version 1 key\n\n\tconst UInt64 FeatureUnknownsByUL2Name = UINT64_C(1) << 1;\t//!< MXFLib feature: If an unknown UL is converted to a name during MDObject construction, using UL2NameFunc, check if this name is a known type\n\n\n\n\tconst UInt64 FeatureFullDescriptors = UINT64_C(1) << 2;\t//!< MXFLib feature: Fill in ALL Descriptor properties\n\n\tconst UInt64 FeatureStreamZeroBase = UINT64_C(1) << 3;\t//!< MXFLib feature: Set GC Essence Element Key StreamBase = 0, not 1\n\n\tconst UInt64 FeatureForceAES\t\t = UINT64_C(1) << 4;\t//!< MXFLib feature: Force PCM to act like AES\n\n\tconst UInt64 FeatureAlignAllStreams\t = UINT64_C(1) << 5;\t//!< MXFLib feature: Add alignment between GC Elements of same Type\n\n\n\n\t/* This sub-range is currently used by temporary fixes (bits 16 to 30) */\n\n\n\n\tconst UInt64 FeatureNegPrechargeIndex = UINT64_C(1) << 16;\t//!< MXFLib feature: Use -ve indexing for precharge\n\n\tconst UInt64 FeatureRDD9Properties = UINT64_C(1) << 17;\t//!< MXFLib feature: Do bad things to Descriptor properties\n\n\n\n\t/* Reserve a sub-range for user-extensions */\n\n\n\n\tconst UInt64 UserExtension = UINT64_C(1) << 31;\t//!< MXFLib feature: Reserved to allow user extensions\n\n\n\n\t/* Non-Standard library functions - may cause non-compliant behaviour (bits 32 to 63) */\n\n\n\n\n\n\n\n\tconst UInt64 FeatureLoadMetadict =\tUINT64_C(1) << 48;\t//!< Load any metadict when reading metadata\n\n\tconst UInt64 FeatureSaveMetadict = UINT64_C(1) << 49;\t//!< Add a KLV metadict when writing metadata (Only contains extension data)\n\n\tconst UInt64 FeatureUsedMetadict = UINT64_C(1) << 50;\t//!< Write any metadict as a complete version holding all types and sets used in the file along with all known properties of those sets\n\n\tconst UInt64 FeatureFullMetadict = UINT64_C(1) << 51;\t//!< Write any metadict as a full version holding all known types, sets and properties\n\n\tconst UInt64 FeatureKXSMetadict = UINT64_C(1) << 52;\t//!< Use version 1b of KLV Encoded Extension Syntax for any metadict\n\n\tconst UInt64 FeatureForceVBRIndex =\tUINT64_C(1) << 54;\t//!< Where possible write a VBR index even though CBR makes sense\n\n\tconst UInt64 FeatureNoHeaderIndex = UINT64_C(1) << 55;\t//!< Do not write index in header, mimic avid files\n\n\n\n\n\n\n\n\t// Declare the features bitmap\n\n\textern UInt64 Features;\n\n\n\n\n\n\t//! Set an MXFLib library feature (or multiple features)\n\n\t/*! \\return true if features set as requested\n\n\t * \\note If multiple features are requested and any one is unavailable none will be set\n\n\t *\n\n\t * DRAGONS: This code is written so that it will fold to:\n\n\t * - a simple bit-set if the value of SetValue is known at compile-time and it is enabled and unlocked\n\n\t * - an error message if the value of SetValue is known at compile-time and it is disabled or locked off\n\n\t * - a simple bit-set if the value of SetValue is non known at compile time, but no features are disabled or locked off\n\n\t * - the full function in all other cases\n\n\t */\n\n\tinline bool SetFeature(const UInt64 SetValue)\n\n\t{\n\n\t\t// Fail if any of the features are disabled\n\n\t\tif((SetValue & MXFLIB_FEATURE_MASK) != SetValue)\n\n\t\t{\n\n\t\t\terror(\"Feature 0x%s is not enabled in the current library\\n\", Int64toHexString(SetValue).c_str());\n\n\t\t\treturn false;\n\n\t\t}\n\n\n\n\t\t// Fail if any of the features are locked (unless they are locked enabled!)\n\n\t\tif(SetValue & MXFLIB_FEATURE_LOCK)\n\n\t\t{\n\n\t\t\t// Check if the locked bits are a problem (the locked value may be \"on\", which is fine)\n\n\t\t\tUInt64 Locked = SetValue & MXFLIB_FEATURE_LOCK;\n\n\t\t\tif(Locked & (~MXFLIB_FEATURE_DEFAULT))\n\n\t\t\t{\n\n\t\t\t\terror(\"Feature 0x%s is locked off in the current library\\n\", Int64toHexString(SetValue).c_str());\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\t// Set the feature or features\n\n\t\tFeatures |= SetValue;\n\n\n\n\t\t// All OK\n\n\t\treturn true;\n\n\t}\n\n\n\n\n\n\t//! Clear an MXFLib library feature (or multiple features)\n\n\t/*! \\return true if features cleared as requested\n\n\t * \\note If clearing of multiple features is requested and any one is locked on none will be cleared\n\n\t *\n\n\t * DRAGONS: This code is written so that it will fold to:\n\n\t * - a simple bit-clear if the value of SetValue is known at compile-time and it is unlocked\n\n\t * - an error message if the value of SetValue is known at compile-time and it is locked on\n\n\t * - a simple bit-clear if the value of SetValue is non known at compile time, but no features are locked on\n\n\t * - the full function in all other cases\n\n\t */\n\n\tinline bool ClearFeature(const UInt64 ClearValue)\n\n\t{\n\n\t\t// Fail if any of the features are locked (and they are locked enabled!)\n\n\t\tif(ClearValue & MXFLIB_FEATURE_LOCK)\n\n\t\t{\n\n\t\t\t// Check if the locked bits are a problem (the locked value may be \"off\", which is fine)\n\n\t\t\tUInt64 Locked = ClearValue & MXFLIB_FEATURE_LOCK;\n\n\t\t\tif(Locked & MXFLIB_FEATURE_DEFAULT)\n\n\t\t\t{\n\n\t\t\t\terror(\"Feature 0x%s is locked on in the current library\\n\", Int64toHexString(ClearValue).c_str());\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\t// Clear the feature or features\n\n\t\tFeatures &= ~ClearValue;\n\n\n\n\t\t// All OK\n\n\t\treturn true;\n\n\t}\n\n\n\n\n\n\t//! Determine if an MXFLibrary feature is selected (or combination of features are all selected)\n\n\t/* DRAGONS: This code is written so that it will fold to:\n\n\t * - a compile-time result if the value of Value is known at compile-time and it is disabled or locked (on or off)\n\n\t * - a simple bit-test if the value of SetValue is non known at compile time, but no features are disabled or locked\n\n\t * - the full function in all other cases\n\n\t */\n\n\tinline bool Feature(const UInt64 Value)\n\n\t{\n\n\t\t// If any of the features are disabled don't bother to read it\n\n\t\tif((Value & MXFLIB_FEATURE_MASK) != Value) return false;\n\n\n\n\t\t// If all of the features are locked simply return the compile-time setting\n\n\t\tif(Value & MXFLIB_FEATURE_LOCK)\n\n\t\t{\n\n\t\t\tif((Value & MXFLIB_FEATURE_DEFAULT) == Value) return true; else return false;\n\n\t\t}\n\n\n\n\t\t// Run-time test\n\n\t\tif((Value & Features) == Value) return true; else return false;\n\n\t}\n","file_path":"mxflib/features.h","rank":3,"score":86356.08929983043},{"content":"namespace mxflib\n\n{\n\n\ttypedef struct sopSAXHandlerStruct sopSAXHandler;\n\n\ttypedef sopSAXHandler *sopSAXHandlerPtr;\n\n\n\n\n\n\t/* Function pointer definitions */\n\n\ttypedef void (*startElementSAXFunc) (void *, const char *, const char **);\n\n\ttypedef void (*endElementSAXFunc) (void *, const char *);\n\n\ttypedef void (*warningSAXFunc) (void *, const char *msg, ...);\n\n\ttypedef void (*errorSAXFunc) (void *, const char *msg, ...);\n\n\ttypedef void (*fatalErrorSAXFunc) (void *, const char *msg, ...);\n\n\n\n\n\n\t/* Handler structure */\n\n\tstruct sopSAXHandlerStruct\n\n\t{\n\n\t\tstartElementSAXFunc startElement;\t\t/* startElement */\n\n\t\tendElementSAXFunc endElement;\t\t\t/* endElement */\n\n\t\twarningSAXFunc warning;\t\t\t\t\t/* warning */\n\n\t\terrorSAXFunc error;\t\t\t\t\t\t/* error */\n\n\t\tfatalErrorSAXFunc fatalError;\t\t\t/* fatalError */\n\n\t};\n\n\n\n\n\n\t/* Function Prototypes */\n\n\tbool sopSAXParseFile(sopSAXHandlerPtr sax, void *UserData, const char *filename);\n","file_path":"mxflib/sopsax.h","rank":4,"score":86356.08929983043},{"content":"namespace mxflib\n\n{\n\n#ifdef MXFLIB_DEBUG\n\n\tvoid debug(const char *Fmt, ...);\t\t\t\t\t\t//!< Display a general debug message\n\n#else\n\n\tinline void debug(const char *Fmt, ...) { return; };\t//!< Make debug messages optimise out\n\n#endif\n\n\n\n\tvoid warning(const char *Fmt, ...);\t\t\t\t\t\t//!< Display a warning message\n\n\tvoid error(const char *Fmt, ...);\t\t\t\t\t\t//!< Display an error message\n","file_path":"mxflib/debug.h","rank":5,"score":86356.08929983043},{"content":"namespace mxflib\n\n{\n\n\t//! Load dictionary from the specified legacy format XML definitions with a default symbol space\n\n\t/*! \\return 0 if all OK\n\n\t * \\return -1 on error\n\n\t */\n\n\tint LoadLegacyDictionary(const char *DictFile, SymbolSpacePtr DefaultSymbolSpace, bool FastFail = false);\n\n\n\n\t//! Load dictionary from the specified legacy format XML definitions with a default symbol space\n\n\t/*! \\return 0 if all OK\n\n\t * \\return -1 on error\n\n\t */\n\n\tinline int LoadLegacyDictionary(std::string DictFile, SymbolSpacePtr DefaultSymbolSpace, bool FastFail = false)\n\n\t{\n\n\t\treturn LoadLegacyDictionary(DictFile.c_str(), DefaultSymbolSpace, FastFail );\n","file_path":"mxflib/legacytypes.h","rank":6,"score":86356.08929983043},{"content":"namespace mxflib\n\n{\n\n\ttypedef UInt8 Uint8;\n\n\ttypedef UInt16 Uint16;\n\n\ttypedef UInt32 Uint32;\n\n\ttypedef UInt64 Uint64;\n\n\tinline std::string Uint64toString(Uint64 Val) { return UInt64toString(Val); }\n","file_path":"mxflib/system.h","rank":7,"score":86356.08929983043},{"content":"namespace mxflib {\n\n\n\n\t//! types of XML output format\n\n\tenum XML_Type_t {\n\n\t\tXML_Type_None,\n\n\t\tXML_Type_Default,\n\n\t\tXML_Type_AAFx,\n\n\t\tXML_Type_AAF_XML,\t// pre-std RegXML per AAFSDK 1.1.4\n\n\t\tXML_Type_MXFixer,\n\n\t\tXML_Type_RegXML,\t// SMPTE 2001 once it is approved\n\n\t\tXML_Type_SMPTE_434\n\n\t};\n\n\n\n\t//! XML output options struct\n\n\ttypedef struct _XML_options_t {\n\n\n\n\t\tXML_Type_t XMLType;\n\n\n\n\t} XML_options_t;\n\n\n\n\t//! Dump an MDObject\n\n\tvoid DumpObject( MDObjectPtr Object, std::string PrefixString, bool bare = false );\n\n\n","file_path":"mxflib/dumpobject.h","rank":8,"score":86356.08929983043},{"content":"namespace mxflib\n\n{\n\n\t/*\n\n\t** PutUxx() - Put unsigned xx-bit integer\n\n\t*/\n\n\tinline void PutU8(UInt8 x, unsigned char *dest) { *dest=(x); }\n\n\tinline void PutU16(UInt16 Data, unsigned char *Dest) { PutU8(Data >> 8, Dest); PutU8(Data & 0xff, &Dest[1]); }\n\n\tinline void PutU32(UInt32 Data, unsigned char *Dest) { PutU16(Data >> 16, Dest); PutU16(Data & 0xffff, &Dest[2]); }\n\n\tinline void PutU64(UInt64 Data, unsigned char *Dest) { PutU32((UInt32)(Data >> 32), Dest); \n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t PutU32((UInt32)Data & 0xffffffff, &Dest[4]); }\n\n\n\n\t/*\n\n\t** PutIxx() - Signed versions of PutUxx()\n\n\t*/\n\n\tinline void PutI8(Int8 x, unsigned char *dest) { PutU8((UInt8)x,dest); }\n\n\tinline void PutI16(Int16 x, unsigned char *dest) { PutU16((UInt16)x,dest); }\n\n\tinline void PutI32(Int32 x, unsigned char *dest) { PutU32((UInt32)x,dest); }\n\n\tinline void PutI64(Int64 x, unsigned char *dest) { PutU64((UInt64)x,dest); }\n\n\n\n\t/*\n\n\t** GetUxx() - Get unsigned xx-bit integer\n\n\t*/\n\n\tinline UInt8 GetU8(const unsigned char *src) { return (UInt8) *src; }\n\n\tinline UInt16 GetU16(const unsigned char *src) { return (GetU8(src) << 8) | GetU8(&src[1]); }\n\n\tinline UInt32 GetU32(const unsigned char *src) { return (GetU16(src) << 16) | GetU16(&src[2]); }\n\n\tinline UInt64 GetU64(const unsigned char *src) { return (((UInt64)GetU32(src)) << 32) | (GetU32(&src[4])); }\n\n\n\n\t/*\n\n\t** GetIxx() - Signed versions of GetUxx()\n\n\t*/\n\n\tinline Int8 GetI8(const unsigned char *src) { return (Int8)GetU8(src); }\n\n\tinline Int16 GetI16(const unsigned char *src) { return (Int16)GetU16(src); }\n\n\tinline Int32 GetI32(const unsigned char *src) { return (Int32)GetU32(src); }\n\n\tinline Int64 GetI64(const unsigned char *src) { return (Int64)GetU64(src); }\n\n\n\n\t/*\n\n\t** PutUxx_LE() - Put LITTLE ENDIAN unsigned xx-bit integer\n\n\t*/\n\n\tinline void PutU8_LE(UInt8 x, unsigned char *dest) { *dest=(x); }\n\n\tinline void PutU16_LE(UInt16 Data, unsigned char *Dest) { PutU8_LE(Data & 0xff, Dest); PutU8_LE(Data >> 8, &Dest[1]); }\n\n\tinline void PutU32_LE(UInt32 Data, unsigned char *Dest) { PutU16_LE(Data & 0xffff, Dest); PutU16_LE(Data >> 16, &Dest[2]); }\n\n\tinline void PutU64_LE(UInt64 Data, unsigned char *Dest) { PutU32_LE((UInt32)(Data & 0xffffffff), Dest); \n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t PutU32_LE((UInt32)(Data >> 32), &Dest[4]); }\n\n\n\n\t/*\n\n\t** PutIxx_LE() - Signed versions of PutUxx_LE()\n\n\t*/\n\n\tinline void PutI8_LE(Int8 x, unsigned char *dest) { PutU8_LE((UInt8)x,dest); }\n\n\tinline void PutI16_LE(Int16 x, unsigned char *dest) { PutU16_LE((UInt16)x,dest); }\n\n\tinline void PutI32_LE(Int32 x, unsigned char *dest) { PutU32_LE((UInt32)x,dest); }\n\n\tinline void PutI64_LE(Int64 x, unsigned char *dest) { PutU64_LE((UInt64)x,dest); }\n\n\n\n\t/*\n\n\t** GetUxx_LE() - Get LITTLE ENDIAN unsigned xx-bit integer\n\n\t*/\n\n\tinline UInt8 GetU8_LE(const unsigned char *src) { return (UInt8) *src; }\n\n\tinline UInt16 GetU16_LE(const unsigned char *src) { return GetU8_LE(src) | (GetU8_LE(&src[1]) << 8); }\n\n\tinline UInt32 GetU32_LE(const unsigned char *src) { return GetU16_LE(src) | (GetU16_LE(&src[2]) << 16); }\n\n\tinline UInt64 GetU64_LE(const unsigned char *src) { return GetU32_LE(src) | ((UInt64)(GetU32_LE(&src[4])) << 32); }\n\n\n\n\t/*\n\n\t** GetIxx_LE() - Signed versions of GetUxx_LE()\n\n\t*/\n\n\tinline Int8 GetI8_LE(const unsigned char *src) { return (Int8)GetU8_LE(src); }\n\n\tinline Int16 GetI16_LE(const unsigned char *src) { return (Int16)GetU16_LE(src); }\n\n\tinline Int32 GetI32_LE(const unsigned char *src) { return (Int32)GetU32_LE(src); }\n\n\tinline Int64 GetI64_LE(const unsigned char *src) { return (Int64)GetU64_LE(src); }\n\n\n","file_path":"mxflib/endian.h","rank":9,"score":86356.08929983043},{"content":"\tnamespace mxflib\n\n\t{\n\n\t\tconst UInt8 AS_12_ShimName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x01 };\n\n\t\tconst UL AS_12_ShimName_UL(AS_12_ShimName_UL_Data);\n\n\n\n\t\tconst UInt8 AS_12_Slate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x02 };\n\n\t\tconst UL AS_12_Slate_UL(AS_12_Slate_UL_Data);\n\n\n\n\t\tconst UInt8 DMS_AS_12_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x00, 0x00 };\n\n\t\tconst UL DMS_AS_12_UL(DMS_AS_12_UL_Data);\n\n\n\n\t\tconst UInt8 DMS_AS_12_AdID_Slate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL DMS_AS_12_AdID_Slate_UL(DMS_AS_12_AdID_Slate_UL_Data);\n\n\n\n\t\tconst UInt8 DMS_AS_12_Framework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x00 };\n\n\t\tconst UL DMS_AS_12_Framework_UL(DMS_AS_12_Framework_UL_Data);\n\n\n\n\t\tconst UInt8 AS_12_DescriptiveObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x02, 0x00 };\n\n\t\tconst UL AS_12_DescriptiveObject_UL(AS_12_DescriptiveObject_UL_Data);\n\n\n\n\t\tconst UInt8 ad_title_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL ad_title_UL(ad_title_UL_Data);\n\n\n\n\t\tconst UInt8 adid_code_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL adid_code_UL(adid_code_UL_Data);\n\n\n\n\t\tconst UInt8 adid_prefix_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL adid_prefix_UL(adid_prefix_UL_Data);\n\n\n\n\t\tconst UInt8 advertiser_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL advertiser_UL(advertiser_UL_Data);\n\n\n\n\t\tconst UInt8 agency_office_location_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL agency_office_location_UL(agency_office_location_UL_Data);\n\n\n\n\t\tconst UInt8 brand_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL brand_UL(brand_UL_Data);\n\n\n\n\t\tconst UInt8 length_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL length_UL(length_UL_Data);\n\n\n\n\t\tconst UInt8 product_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00 };\n\n\t\tconst UL product_UL(product_UL_Data);\n\n\n","file_path":"mxflib/dict_DMS_AS_03.h","rank":10,"score":84981.41102193357},{"content":"using namespace std;\n","file_path":"mxflib/dumpobject.h","rank":11,"score":81110.09081996424},{"content":"namespace mxflib\n\n{\n\n\t// Operational Pattern Labels\n\n\t// ==========================\n\n\t// DRAGONS: These are often just the degenerate labels - Qualifiers need to be filled in later!\n\n\n\n\t// OP-Atom - #### DRAGONS: Qualifiers need work later!\n\n\t// Note: pre mxflib 0.5.3, byte 8 version was erroneously = 01\n\n\tconst UInt8 OPAtom_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\tconst UL OPAtomUL(OPAtom_Data);\n\n\n\n\tconst UInt8 OPAtom_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\n\n\tconst UL OPAtom_UL(OPAtom_UL_Data);\n\n\n\n\t// OP1a - #### DRAGONS: Qualifiers may need work!\n\n\tconst UInt8 OP1a_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\tconst UL OP1aUL(OP1a_Data);\n\n\n\n\t// OP1b - #### DRAGONS: Qualifiers need work!\n\n\tconst UInt8 OP1b_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x05, 0x00 };\n\n\tconst UL OP1bUL(OP1b_Data);\n\n\n\n\t// OP2a - #### DRAGONS: Qualifiers need work!\n\n\tconst UInt8 OP2a_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01, 0x00 };\n\n\tconst UL OP2aUL(OP2a_Data);\n\n\n\n\t// OP2b - #### DRAGONS: Qualifiers need work!\n\n\tconst UInt8 OP2b_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x02, 0x05, 0x00 };\n\n\tconst UL OP2bUL(OP2b_Data);\n","file_path":"libprocesswrap/opmap.h","rank":12,"score":80455.43522530445},{"content":"\t//! Version for VBI usage of ANCVBISource\n\n\tclass VBISource : public ANCVBISource\n\n\t{\n\n\tpublic:\n\n\t\tVBISource(EssenceSource *Master = NULL) : ANCVBISource(Master) {};\n\n\n\n\t\t//! Get the GCEssenceType to use when wrapping this essence in a Generic Container\n\n\t\tvirtual UInt8 GetGCElementType(void) { return 0x01; }\n\n\n\n\tprotected:\n\n\t\t//! Get the wrapping UL to use\n\n\t\tvirtual ULPtr GetWrappingUL(void)\n\n\t\t{\n\n\t\t\tconst UInt8 WrappingUL[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x09, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0d, 0x00, 0x00 };\n\n\t\t\treturn new UL(WrappingUL);\n\n\t\t}\n\n\t};\n\n\n\n\n\n\t//! Smart pointer to ANCVBISource\n\n\ttypedef SmartPtr<ANCVBISource> ANCVBISourcePtr;\n\n\n\n\t//! Alias for ANC usage of ANCVBISourcePtr\n\n\ttypedef ANCVBISourcePtr ANCSourcePtr;\n\n\n\n\t//! Alias for VBI usage of ANCVBISourcePtr\n\n\ttypedef ANCVBISourcePtr VBISourcePtr;\n\n\n\n\n","file_path":"mxflib/vbi.h","rank":13,"score":80216.26160409968},{"content":"\t//! Version for ANC usage of ANCVBISource\n\n\tclass ANCSource : public ANCVBISource\n\n\t{\n\n\tpublic:\n\n\t\tANCSource(EssenceSource *Master = NULL) : ANCVBISource(Master) {};\n\n\n\n\t\t//! Get the GCEssenceType to use when wrapping this essence in a Generic Container\n\n\t\tvirtual UInt8 GetGCElementType(void) { return 0x02; }\n\n\n\n\tprotected:\n\n\t\t//! Get the wrapping UL to use\n\n\t\tvirtual ULPtr GetWrappingUL(void)\n\n\t\t{\n\n\t\t\tconst UInt8 WrappingUL[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x09, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0e, 0x00, 0x00 };\n\n\t\t\treturn new UL(WrappingUL);\n\n\t\t}\n\n\t};\n\n\n","file_path":"mxflib/vbi.h","rank":14,"score":80216.26160409968},{"content":"\t//! Class for essence source that supplies system items\n\n\tclass SystemSource : public EssenceSource\n\n\t{\n\n\tprotected:\n\n\t\tEssenceSourceParent Master;\t\t\t\t\t\t\t\t//!< The master stream for this essence\n\n\t\tGCStreamID SMPackID;\t\t\t\t\t\t\t\t\t//!< Stream ID of the system metadata pack\n\n\t\tGCStreamID PMPackID;\t\t\t\t\t\t\t\t\t//!< Stream ID of the package metadata pack\n\n\t\tUInt16 ContinuityCount;\t\t\t\t\t\t\t\t\t//!< Continuity count as per SMPTE 385M\n\n\t\tint FPS;\t\t\t\t\t\t\t\t\t\t\t\t//!< Integer frame rate value (25 or 30)\n\n\t\tbool Rate1001;\t\t\t\t\t\t\t\t\t\t\t//!< True if FSP is a (n*1000) / 1001 rate\n\n\t\tUInt8 EssenceLabel[16];\t\t\t\t\t\t\t\t\t//!< The essence container label\n\n\t\tbool DropFrame;\t\t\t\t\t\t\t\t\t\t\t//!< True if timecode is using drop-frame counting\n\n\t\tUInt8 EssenceBitmap;\t\t\t\t\t\t\t\t\t//!< Bitmap flags for essence items, bit 1 = 1 if data, bit 2 = 1 if sound, bit 3 = 1 if picture\n\n\t\tBodyStream *Stream;\t\t\t\t\t\t\t\t\t\t//!< Our parent stream\n\n\t\tDataChunk CreationDate;\t\t\t\t\t\t\t\t\t//!< A pre-formatted 17-byte chunk holding the creation date/time, or an empty chunk if not set\n\n\t\tDataChunk TimecodeData;\t\t\t\t\t\t\t\t\t//!< A pre-formatted 17-byte chunk holding the timecode, or an empty chunk if not set\n\n\t\tDataChunk UMIDData;\t\t\t\t\t\t\t\t\t\t//!< A pre-formatted chunk holding the UMID data for the Package Item, or an empty chunk if not set\n\n\t\tDataChunk KLVData;\t\t\t\t\t\t\t\t\t\t//!< A pre-formatted chunk holding the KLV metadata for the Package Item, or an empty chunk if not set\n\n\n\n\tpublic:\n\n\t\tSystemSource(EssenceSource *MasterSource, const UL &WrappingUL) : EssenceSource()\n","file_path":"mxflib/essence.h","rank":15,"score":80216.1963906149},{"content":"\tclass SourceClip;\n","file_path":"mxflib/metadata.h","rank":16,"score":78617.61180730443},{"content":"\tclass EssenceSource;\n\n\n\n\t//! Return the MXF version as the year of the main MXF specification document\n\n\t/*! /ret 2004 if we are writing files as per SMPTE 377M-2004\n\n\t *! /ret 2009 if we are writing files as per SMPTE 377-1-2009\n\n\t */\n\n\tint MXFVersion(void);\n\n\n\n\t//! Set the MXF version as the year of the main MXF specification document\n\n\t/*! Use 2004 if we are writing files as per SMPTE 377M-2004\n\n\t *! Use 2009 if we are writing files as per SMPTE 377-1-2009\n\n\t */\n\n\tvoid SetMXFVersion(int Year);\n\n\n\n\t// Declare the global null-ul which is 16 zero bytes\n\n\textern const UL Null_UL;\n\n//_atoi64 is s wondows only - rewrite to linux version\n\n#ifndef _WIN32\n\n#define _atoi64 atoll\n\n#endif\n","file_path":"mxflib/helper.h","rank":17,"score":78617.61180730443},{"content":"\tMXFLIB_DICTIONARY_END\n\n\n\n\n\n\t// Define ULs for the global keys in this dictionary\n\n\tnamespace AS_11\n\n\t{\n\n\t\tconst UInt8 AS11CoreFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x00 };\n\n\t\tconst UL AS11CoreFramework_UL(AS11CoreFramework_UL_Data);\n\n\n\n\t\tconst UInt8 AS11CoreSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x00, 0x00 };\n\n\t\tconst UL AS11CoreSchemeLabel_UL(AS11CoreSchemeLabel_UL_Data);\n\n\n\n\t\tconst UInt8 AS11SegmentationFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x00 };\n\n\t\tconst UL AS11SegmentationFramework_UL(AS11SegmentationFramework_UL_Data);\n\n\n\n\t\tconst UInt8 AS11SegmentationSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x00, 0x00 };\n\n\t\tconst UL AS11SegmentationSchemeLabel_UL(AS11SegmentationSchemeLabel_UL_Data);\n\n\n\n\t\tconst UInt8 AudioComments_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x14, 0x00 };\n\n\t\tconst UL AudioComments_UL(AudioComments_UL_Data);\n\n\n\n\t\tconst UInt8 AudioDescriptionPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x19, 0x00 };\n\n\t\tconst UL AudioDescriptionPresent_UL(AudioDescriptionPresent_UL_Data);\n\n\n\n\t\tconst UInt8 AudioDescriptionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1a, 0x00 };\n\n\t\tconst UL AudioDescriptionType_UL(AudioDescriptionType_UL_Data);\n\n\n\n\t\tconst UInt8 AudioLoudnessStandard_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x13, 0x00 };\n\n\t\tconst UL AudioLoudnessStandard_UL(AudioLoudnessStandard_UL_Data);\n\n\n\n\t\tconst UInt8 AudioTrackLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x05 };\n\n\t\tconst UL AudioTrackLayout_UL(AudioTrackLayout_UL_Data);\n\n\n\n\t\tconst UInt8 AFD_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x05, 0x01, 0x0b, 0x01, 0x01, 0x05 };\n\n\t\tconst UL AFD_UL(AFD_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedCaptionsLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x09 };\n\n\t\tconst UL ClosedCaptionsLanguage_UL(ClosedCaptionsLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedCaptionsPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x07 };\n\n\t\tconst UL ClosedCaptionsPresent_UL(ClosedCaptionsPresent_UL_Data);\n\n\n\n\t\tconst UInt8 ClosedCaptionsType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x08 };\n\n\t\tconst UL ClosedCaptionsType_UL(ClosedCaptionsType_UL_Data);\n\n\n\n\t\tconst UInt8 CompletionDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x20, 0x00 };\n\n\t\tconst UL CompletionDate_UL(CompletionDate_UL_Data);\n\n\n\n\t\tconst UInt8 ContactEmail_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x24, 0x00 };\n\n\t\tconst UL ContactEmail_UL(ContactEmail_UL_Data);\n\n\n\n\t\tconst UInt8 ContactTelephoneNo_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x25, 0x00 };\n\n\t\tconst UL ContactTelephoneNo_UL(ContactTelephoneNo_UL_Data);\n\n\n\n\t\tconst UInt8 CopyrightYear_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x04, 0x00 };\n\n\t\tconst UL CopyrightYear_UL(CopyrightYear_UL_Data);\n\n\n\n\t\tconst UInt8 DMSegmentationFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\t\tconst UL DMSegmentationFramework_UL(DMSegmentationFramework_UL_Data);\n\n\n\n\t\tconst UInt8 Distributor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00 };\n\n\t\tconst UL Distributor_UL(Distributor_UL_Data);\n\n\n\n\t\tconst UInt8 EpisodeTitleNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x03 };\n\n\t\tconst UL EpisodeTitleNumber_UL(EpisodeTitleNumber_UL_Data);\n\n\n\n\t\tconst UInt8 FPAManufacturer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0e, 0x00 };\n\n\t\tconst UL FPAManufacturer_UL(FPAManufacturer_UL_Data);\n\n\n\n\t\tconst UInt8 FPAPass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x00 };\n\n\t\tconst UL FPAPass_UL(FPAPass_UL_Data);\n\n\n\n\t\tconst UInt8 FPAVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0f, 0x00 };\n\n\t\tconst UL FPAVersion_UL(FPAVersion_UL_Data);\n\n\n\n\t\tconst UInt8 Genre_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x07, 0x00 };\n\n\t\tconst UL Genre_UL(Genre_UL_Data);\n\n\n\n\t\tconst UInt8 IdentClockStart_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x16, 0x00 };\n\n\t\tconst UL IdentClockStart_UL(IdentClockStart_UL_Data);\n\n\n\n\t\tconst UInt8 LineUpStart_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x15, 0x00 };\n\n\t\tconst UL LineUpStart_UL(LineUpStart_UL_Data);\n\n\n\n\t\tconst UInt8 OpenCaptionsLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1d, 0x00 };\n\n\t\tconst UL OpenCaptionsLanguage_UL(OpenCaptionsLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 OpenCaptionsPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1b, 0x00 };\n\n\t\tconst UL OpenCaptionsPresent_UL(OpenCaptionsPresent_UL_Data);\n\n\n\n\t\tconst UInt8 OpenCaptionsType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1c, 0x00 };\n\n\t\tconst UL OpenCaptionsType_UL(OpenCaptionsType_UL_Data);\n\n\n\n\t\tconst UInt8 Originator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00 };\n\n\t\tconst UL Originator_UL(Originator_UL_Data);\n\n\n\n\t\tconst UInt8 OtherIdentifier_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x05, 0x00 };\n\n\t\tconst UL OtherIdentifier_UL(OtherIdentifier_UL_Data);\n\n\n\n\t\tconst UInt8 OtherIdentifierType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00 };\n\n\t\tconst UL OtherIdentifierType_UL(OtherIdentifierType_UL_Data);\n\n\n\n\t\tconst UInt8 PartNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x01 };\n\n\t\tconst UL PartNumber_UL(PartNumber_UL_Data);\n\n\n\n\t\tconst UInt8 PartTotal_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x02 };\n\n\t\tconst UL PartTotal_UL(PartTotal_UL_Data);\n\n\n\n\t\tconst UInt8 PictureRatio_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x09, 0x00 };\n\n\t\tconst UL PictureRatio_UL(PictureRatio_UL_Data);\n\n\n\n\t\tconst UInt8 PrimaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x06 };\n\n\t\tconst UL PrimaryAudioLanguage_UL(PrimaryAudioLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 ProductPlacement_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0c, 0x00 };\n\n\t\tconst UL ProductPlacement_UL(ProductPlacement_UL_Data);\n\n\n\n\t\tconst UInt8 ProductionNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00 };\n\n\t\tconst UL ProductionNumber_UL(ProductionNumber_UL_Data);\n\n\n\n\t\tconst UInt8 ProgrammeHasText_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x22, 0x00 };\n\n\t\tconst UL ProgrammeHasText_UL(ProgrammeHasText_UL_Data);\n\n\n\n\t\tconst UInt8 ProgrammeTextLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x23, 0x00 };\n\n\t\tconst UL ProgrammeTextLanguage_UL(ProgrammeTextLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 ProgrammeTitle_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x02 };\n\n\t\tconst UL ProgrammeTitle_UL(ProgrammeTitle_UL_Data);\n\n\n\n\t\tconst UInt8 SecondaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x11, 0x00 };\n\n\t\tconst UL SecondaryAudioLanguage_UL(SecondaryAudioLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 SeriesTitle_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x01 };\n\n\t\tconst UL SeriesTitle_UL(SeriesTitle_UL_Data);\n\n\n\n\t\tconst UInt8 ShimName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x04 };\n\n\t\tconst UL ShimName_UL(ShimName_UL_Data);\n\n\n\n\t\tconst UInt8 SignLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1f, 0x00 };\n\n\t\tconst UL SignLanguage_UL(SignLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 SigningPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1e, 0x00 };\n\n\t\tconst UL SigningPresent_UL(SigningPresent_UL_Data);\n\n\n\n\t\tconst UInt8 Synopsis_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00 };\n\n\t\tconst UL Synopsis_UL(Synopsis_UL_Data);\n\n\n\n\t\tconst UInt8 TertiaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x12, 0x00 };\n\n\t\tconst UL TertiaryAudioLanguage_UL(TertiaryAudioLanguage_UL_Data);\n\n\n\n\t\tconst UInt8 TextlessElementsExist_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x21, 0x00 };\n\n\t\tconst UL TextlessElementsExist_UL(TextlessElementsExist_UL_Data);\n\n\n\n\t\tconst UInt8 ThreeD_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0a, 0x00 };\n\n\t\tconst UL ThreeD_UL(ThreeD_UL_Data);\n\n\n\n\t\tconst UInt8 ThreeDType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0b, 0x00 };\n\n\t\tconst UL ThreeDType_UL(ThreeDType_UL_Data);\n\n\n\n\t\tconst UInt8 TotalNumberOfParts_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x17, 0x00 };\n\n\t\tconst UL TotalNumberOfParts_UL(TotalNumberOfParts_UL_Data);\n\n\n\n\t\tconst UInt8 TotalProgrammeDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00 };\n\n\t\tconst UL TotalProgrammeDuration_UL(TotalProgrammeDuration_UL_Data);\n\n\n\n\t\tconst UInt8 UKDPPFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00 };\n\n\t\tconst UL UKDPPFramework_UL(UKDPPFramework_UL_Data);\n\n\n\n\t\tconst UInt8 UKDPPSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\n\n\t\tconst UL UKDPPSchemeLabel_UL(UKDPPSchemeLabel_UL_Data);\n\n\n\n\t\tconst UInt8 VideoComments_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x10, 0x00 };\n\n\t\tconst UL VideoComments_UL(VideoComments_UL_Data);\n\n\n","file_path":"mxflib/dict_as11.h","rank":18,"score":77456.04504559484},{"content":"\t//! An essence source for sub-streams that slave from a master stream\n\n\tclass EssenceSubSource : public EssenceSource\n\n\t{\n\n\tprotected:\n\n\t\tEssenceSourceParent MasterSource;\t\t//!< The EssenceSource for the master source\n\n\t\tWrappingOptionPtr SelectedWrapping;\t\t//!< The selected wrapping options\n\n\n\n\tpublic:\n\n\t\t//! Base constructor\n\n\t\tEssenceSubSource(EssenceSource *Master = NULL) : MasterSource(Master) {};\n\n\n\n\t\t//! Virtual destructor to allow polymorphism\n\n\t\tvirtual ~EssenceSubSource() {};\n\n\n\n\t\t//! Set a new master after construction (useful if the master source is not known at construction time) \n\n\t\tvoid SetMaster(EssenceSource *Master)\n\n\t\t{\n\n\t\t\tMasterSource = Master;\n\n\t\t}\n\n\n\n\t\t//! Get a pointer to the current master source, this may be NULL if it is not yet defined\n","file_path":"mxflib/essence.h","rank":19,"score":76900.55598803768},{"content":"\t//! Essence source class to be used as the output of AudioDemux objects\n\n\tclass AudioDemuxSource : public EssenceSource\n\n\t{\n\n\tprotected:\n\n\t\tAudioDemuxParent Parent;\t\t\t//!< The parent demux object\n\n\t\tint Channel;\t\t\t\t\t\t//!< The number of our first channel (zero being the first in the outer source)\n\n\t\tint ChannelCount;\t\t\t\t\t//!< The number of channels to read at a time (e.g. ChannelCount = 2 give a stereo pair)\n\n\t\tbool Eoi;\t\t\t\t\t\t\t//!< True if the last GetEssenceData() call completed a wrapping item\n\n\n\n\t\tLength BytesPerEditUnit;\t\t\t//!< The size of an edit unit, if constant, else zero. Set to -1 when not known\n\n\t\tUInt32 BPEUKAGSize;\t\t\t\t\t//!< The KAGSize used to calculate BytesPerEditUnit\n\n\n\n\tprivate:\n\n\t\tAudioDemuxSource();\t\t\t\t\t//!< Prevent default construction\n\n\t\tAudioDemuxSource(AudioDemux&);\t\t//!< Prevent copy construction\n\n\n\n\tpublic:\n\n\t\t/*! \\param Channel The number of the first channel to read with the new source (zero being the first in the outer source)\n\n\t\t * \\param ChannelCount The number of channels to read at a time (e.g. ChannelCount = 2 give a stereo pair)\n\n\t\t */\n\n\t\tAudioDemuxSource(AudioDemux *Parent, unsigned int Channel, unsigned int ChannelCount = 1) \n","file_path":"mxflib/audiomux.h","rank":20,"score":76900.24200014865},{"content":"\t\t//! Essence Source that manages a sequence of essence sources from a list of file patterns\n\n\t\tclass SequentialEssenceSource : public EssenceSource\n\n\t\t{\n\n\t\tprotected:\n\n\t\t\tEssenceSourcePtr CurrentSource;\t\t\t\t//!< An EssenceSource for the current source file\n\n\t\t\tFileParserPtr Outer;\t\t\t\t\t\t//!< The outer file parser which is owned by us to prevent it being released until be are done\n\n\t\t\tLength PreviousLength;\t\t\t\t\t\t//!< The total size of all previously read essence sources for this set\n\n\t\t\tbool VBRIndexMode;\t\t\t\t\t\t\t//!< Are we needing to use VBRIndexMode for this essence?\n\n\t\t\t\n\n\t\t\t//! Option pair for OptionList\n\n\t\t\ttypedef std::pair<std::string, Int64> OptionPair;\n\n\t\t\t\n\n\t\t\t//! List of all options set for this source\n\n\t\t\tstd::list<OptionPair> OptionList;\n\n\n\n\t\t\t//! Prevent default construction\n\n\t\t\tSequentialEssenceSource();\n\n\n\n\t\tpublic:\n\n\t\t\t//! Construct a SequentialEssenceSource\n\n\t\t\tSequentialEssenceSource(FileParser *Outer) : Outer(Outer), PreviousLength(0), VBRIndexMode(false) {}\n","file_path":"mxflib/essence.h","rank":21,"score":76895.58375280364},{"content":"\t//! Holds data relating to a DMSourceClip\n\n\tclass DMSourceClip : public SourceClip\n\n\t{\n\n\tprotected:\n\n\t\t//! Protected constructor used to create from an existing MDObject\n\n\t\tDMSourceClip(MDObjectPtr BaseObject) : SourceClip(BaseObject) {}\n\n\n\n\tpublic:\n\n\t\tDMSourceClip(std::string BaseType) : SourceClip(BaseType) {};\n\n\t\tDMSourceClip(MDOTypePtr BaseType) : SourceClip(BaseType) {};\n\n\t\tDMSourceClip(const UL &BaseUL) : SourceClip(BaseUL) {};\n\n\t\tDMSourceClip(ULPtr &BaseUL) : SourceClip(BaseUL) {};\n\n\n\n\t\t//! Return the containing \"DMSourceClip\" object for this MDObject\n\n\t\t/*! \\return NULL if MDObject is not contained in a SourceClip object\n\n\t\t */\n\n\t\tstatic DMSourceClipPtr GetDMSourceClip(MDObjectPtr Object);\n\n\n\n\t\t//! Parse an existing MDObject into a DMSourceClip object\n\n\t\tstatic DMSourceClipPtr Parse(MDObjectPtr BaseObject);\n\n\t};\n\n}\n\n\n\n\n\nnamespace mxflib\n\n{\n","file_path":"mxflib/metadata.h","rank":22,"score":76894.75852668207},{"content":"\t//! Class that holds the ANC or VBI data for a frame and supplies it as an EssenceSource\n\n\tclass ANCVBISource : public EssenceSubSource\n\n\t{\n\n\tprotected:\n\n\t\tANCVBILineSourceList Sources;\t\t//!< List of line sources used to build lines\n\n\n\n\t\tANCVBILineMap Lines;\t\t\t\t//!< Map of lines built for this frame\n\n\n\n\t\tDataChunkList BufferedData;\t\t\t//!< List of data items prepared and ready to be supplied in response to GetEssenceData() - next to be supplied is the head\n\n\n\n\t\tsize_t BufferOffset;\t\t\t\t//!< An offset into the current data buffer if we are returning a partial chunk in GetEssenceData()\n\n\n\n\t\tPosition CurrentPosition;\t\t\t//!< Our current position. This is relative to the start of the stream, so the first edit unit is always 0\n\n\n\n\t\tint F2Offset;\t\t\t\t\t\t//!< The offset to add to field 2 line numbers (0 if no field 2, -1 if unknown)\n\n\n\n\t\tPosition EndAtPosition;\t\t\t\t//!< The position at which we end (0 for slave from master, -1 for not yet set)\n\n\n\n\tpublic:\n\n\t\t//! Base constructor\n\n\t\tANCVBISource(EssenceSource *Master = NULL) : EssenceSubSource(Master), BufferOffset(0), CurrentPosition(0), F2Offset(-1), EndAtPosition(-1) {};\n","file_path":"mxflib/vbi.h","rank":23,"score":76894.57129089406},{"content":"\t\tclass ESP_EssenceSource : public EssenceSource\n\n\t\t{\n\n\t\tprotected:\n\n\t\t\tEssenceSubParserPtr Caller;\n\n\t\t\tFileHandle File;\n\n\t\t\tUInt32 Stream;\n\n\t\t\tUInt64 RequestedCount;\n\n\t\t\tIndexTablePtr Index;\n\n\t\t\tDataChunkPtr RemainingData;\n\n\t\t\tbool AtEndOfData;\n\n\t\t\tbool Started;\n\n\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1)\n\n\t\t\t{\n\n\t\t\t\tCaller = TheCaller;\n\n\t\t\t\tFile = InFile;\n\n\t\t\t\tStream = UseStream;\n\n\t\t\t\tRequestedCount = Count;\n","file_path":"mxflib/essence.h","rank":24,"score":76888.94732715066},{"content":"\tclass RangedEssenceSource : public EssenceSource\n\n\t{\n\n\tprotected:\n\n\t\tEssenceSourcePtr Base;\t\t\t\t\t\t\t\t//!< The source being filtered\n\n\t\tPosition CurrentPosition;\t\t\t\t\t\t\t//!< The current position, stream relative not range relative\n\n\t\tPosition RequestedStart;\t\t\t\t\t\t\t//!< The requested first edit unit\n\n\t\tPosition RequestedEnd;\t\t\t\t\t\t\t\t//!< The requested last edit unit, or -1 if using RequestedDuration\n\n\t\tLength RequestedDuration;\t\t\t\t\t\t\t//!< The requested duration, or -1 if using RequestedEnd\n\n\n\n\t\tbool Started;\t\t\t\t\t\t\t\t\t\t//!< Set true once we have skipped the edit units before any pre-charge\n\n\t\tbool Ending;\t\t\t\t\t\t\t\t\t\t//!< Set true once beyond the end of the range, but not necessarily done with the overrun\n\n\t\tbool Ended;\t\t\t\t\t\t\t\t\t\t\t//!< Set true once the overrun is done\n\n\n\n\t\tPosition PreChargeStart;\t\t\t\t\t\t\t//!< The first edit unit in any pre-charge\n\n\t\tDataChunkList PreCharge;\t\t\t\t\t\t\t//!< Buffers of pre-charge essence\n\n\n\n\t\tDataChunkPtr FirstData;\t\t\t\t\t\t\t\t//!< The first edit unit following any pre-charge (as we will need to read it to check the pre-charge size)\n\n\n\n\tprivate:\n\n\t\t//! Prevent a default constructor\n","file_path":"mxflib/essence.h","rank":25,"score":76888.94732715066},{"content":"\t//! Class for holding a description of an essence stream \n\n\tclass EssenceStreamDescriptor;\n\n\n\n\t//! A smart pointer to a EssenceStreamDescriptor object\n\n\ttypedef SmartPtr<EssenceStreamDescriptor> EssenceStreamDescriptorPtr;\n\n\n\n\t//! A list of smart pointers to EssenceStreamDescriptor objects\n\n\ttypedef std::list<EssenceStreamDescriptorPtr> EssenceStreamDescriptorList;\n\n\n\n\t/*! \\page SubStreamNotes Notes on Sub-Streams\n\n\t * \\section SubStreams1 Sub-Streams Introduction\n\n\t * Certain essence streams may have intimate data related to the essence that is linked as a substream.\n\n\t * \\section SubParserSubStreams Sub-Streams in EssenceSubParsers\n\n\t * An EssenceSubParser may produce a main EssenceSource with sub-streams which are EssenceSources whose \n\n\t * data is extracted during the parsing that produces the main source's data. These SubStreams are indicated\n\n\t * by members of the EssenceStreamDescriptor::SubStreams properties of members of the EssenceStreamDescriptorList\n\n\t * returned by a call to EssenceSubParserBase::IdentifyEssence(). This in turn gets propogated to the \n\n\t * EssenceParser::WrapingConfig::SubStreams properties of members of the EssenceParser::WrapingConfigList\n\n\t * returned by a call to EssenceParser::ListWrappingOptions().\n\n\t *\n\n\t * The value of EssenceStreamDescriptor::ID, and hence EssenceParser::WrapingConfig::Stream, will differ\n","file_path":"mxflib/essence.h","rank":26,"score":73923.4727817756},{"content":"\t// Forward declare the demux output source class\n\n\tclass AudioDemuxSource;\n\n\n\n\t// A Smart pointer to an AudioDemuxSource object\n\n\ttypedef SmartPtr<AudioDemuxSource> AudioDemuxSourcePtr;\n\n\n\n\t// A parent pointer to an AudioDemuxSource object\n\n\ttypedef ParentPtr<AudioDemuxSource> AudioDemuxSourceParent;\n\n\n\n\n","file_path":"mxflib/audiomux.h","rank":27,"score":73901.68874945595},{"content":"\tclass DMSourceClip;\n","file_path":"mxflib/metadata.h","rank":28,"score":73895.87754992454},{"content":"\t//! Simple AFD line source\n\n\tclass SimpleAFDSource : public ANCVBILineSource\n\n\t{\n\n\tprotected:\n\n\t\tUInt8 CurrentAFD;\t\t\t\t\t\t\t\t//!< Current value of the AFD, will insert this value each frame\n\n\t\tint FieldNum;\t\t\t\t\t\t\t\t\t//!< Field number in which to insert this AFD\n\n\t\tint LineNum;\t\t\t\t\t\t\t\t\t//!< Line number in field to insert this AFD\n\n\n\n\tpublic:\n\n\t\t//! Construct from binary value\n\n\t\tSimpleAFDSource(UInt8 AFDValue, int Field, int Line) : CurrentAFD(AFDValue), FieldNum(Field), LineNum(Line) {};\n\n\n\n\t\t//! Construct from text value\n\n\t\tSimpleAFDSource(std::string AFDText, int Field, int Line) : FieldNum(Field), LineNum(Line) \n\n\t\t{\n\n\t\t\tCurrentAFD = TextToAFD(AFDText);\n\n\t\t};\n\n\n\n\t\t//! Allow polymorphic destructors\n\n\t\tvirtual ~SimpleAFDSource() {};\n\n\n","file_path":"mxflib/vbi.h","rank":29,"score":73844.95933130838},{"content":"\tclass EssenceSource : public RefCount<EssenceSource>\n\n\t{\n\n\tprotected:\n\n\t\t//! Holds the stream ID for this essence stream when added to a GCWriter\n\n\t\t/*! This value is persisted here between calls to a GCWriter via BodyWriter or similar.\n\n\t\t * Set to -1 if no stream ID yet set.\n\n\t\t */\n\n\t\tGCStreamID StreamID;\n\n\t\t\n\n\t\t//! Index manager to use if we can index the essence\n\n\t\tIndexManagerPtr IndexMan;\n\n\n\n\t\t//! Sub-stream ID to use for our index data if we can index the essence\n\n\t\tint IndexStreamID;\n\n\n\n\t\t//! If the default essence key has been overridden for this source it is stored here\n\n\t\tDataChunkPtr SpecifiedKey;\n\n\n\n\t\t//! True if the default essence key has been overridden with a key that does not use GC track number mechanism\n\n\t\tbool NonGC;\n","file_path":"mxflib/essence.h","rank":30,"score":73839.01622453978},{"content":"\t//! A smart pointer to a SourceClip object (with operator[] overload)\n\n\tclass SourceClipPtr : public SmartPtr<SourceClip>\n\n\t{\n\n\tpublic:\n\n\t\t//! Build a NULL pointer\n\n\t\tSourceClipPtr() : SmartPtr<SourceClip>() {}\n\n\n\n\t\t//! Build a pointer to an existing object\n\n\t\t/*! \\note The IRefCount has to be to a Component because that is what SourceClip is derived from */\n\n\t\tSourceClipPtr(IRefCount<Component> * ptr) : SmartPtr<SourceClip>((IRefCount<SourceClip> *)ptr) {}\n\n\n\n\t\t//! Child access operators that overcome dereferencing problems with SmartPtrs\n\n\t\tMDObjectPtr operator[](const char *ChildName);\n\n\t\tMDObjectPtr operator[](MDOTypePtr ChildType);\n\n\t\tMDObjectPtr operator[](const UL &ChildType);\n\n\t\tMDObjectPtr operator[](ULPtr &ChildType);\n\n\t};\n\n\n\n\n","file_path":"mxflib/metadata.h","rank":31,"score":71033.52882985433},{"content":"\tclass RangedEssenceSubSource : public EssenceSubSource\n\n\t{\n\n\tprotected:\n\n\t\tEssenceSourcePtr Base;\t\t\t\t\t\t\t\t//!< The source being filtered\n\n\t\tPosition RequestedStart;\t\t\t\t\t\t\t//!< The requested first edit unit\n\n\t\tPosition RequestedEnd;\t\t\t\t\t\t\t\t//!< The requested last edit unit, or -1 if using RequestedDuration\n\n\t\tLength RequestedDuration;\t\t\t\t\t\t\t//!< The requested duration, or -1 if using RequestedEnd\n\n\n\n\t\tbool Started;\t\t\t\t\t\t\t\t\t\t//!< Set true once we are ready to start reading\n\n\t\tbool Ended;\t\t\t\t\t\t\t\t\t\t\t//!< Set true once the range is done\n\n\n\n\tprivate:\n\n\t\t//! Prevent a default constructor\n\n\t\tRangedEssenceSubSource();\n\n\n\n\t\t//! Prevent copy construction\n\n\t\tRangedEssenceSubSource(const RangedEssenceSource &);\n\n\n\n\tpublic:\n\n\t\t// Base constructor\n","file_path":"mxflib/essence.h","rank":32,"score":71027.78141228095},{"content":"using namespace mxflib;\n","file_path":"libprocesswrap/opmap.h","rank":33,"score":69731.78750782346},{"content":"using namespace mxflib;\n","file_path":"libprocesswrap/process.h","rank":34,"score":69731.78750782346},{"content":"\t//! Holds data relating to a SourceClip\n\n\tclass SourceClip : public Component\n\n\t{\n\n\tprotected:\n\n\n\n\t\t//! Common construction code\n\n\t\tvoid Init(void)\n\n\t\t{\n\n\t\t}\n\n\n\n\t\t//! Protected constructor used to create from an existing MDObject\n\n\t\tSourceClip(MDObjectPtr BaseObject) : Component(BaseObject) { Init(); }\n\n\n\n\tpublic:\n\n\t\tSourceClip(std::string BaseType) : Component(BaseType) { Init(); };\n\n\t\tSourceClip(MDOTypePtr BaseType) : Component(BaseType) { Init(); };\n\n\t\tSourceClip(const UL &BaseUL) : Component(BaseUL) { Init(); };\n\n\t\tSourceClip(ULPtr &BaseUL) : Component(BaseUL) { Init(); };\n\n\n\n\n\n\t\t//! Make a link to a specified track\n","file_path":"mxflib/metadata.h","rank":35,"score":69715.05568676494},{"content":"\tclass EssenceStreamDescriptor : public RefCount<EssenceStreamDescriptor>\n\n\t{\n\n\tpublic:\n\n\t\t//! Construct with any optional items cleared\n\n\t\tEssenceStreamDescriptor() : StartTimecode(0) {}\n\n\n\n\tpublic:\n\n\t\tUInt32 ID;\t\t\t\t\t\t\t\t//!< ID for this essence stream\n\n\t\tstd::string Description;\t\t\t\t//!< Description of this essence stream\n\n\t\tUUID SourceFormat;\t\t\t\t\t\t//!< A UUID (or byte-swapped UL) identifying the source format\n\n\t\tMDObjectPtr Descriptor;\t\t\t\t\t//!< Pointer to an actual essence descriptor for this stream\n\n\t\tEssenceStreamDescriptorList SubStreams;\t//!< A list of sub-streams that can be derived from this stream. See \\ref SubStreamNotes\n\n\t\tPosition StartTimecode;\t\t\t\t\t//!< The starting timecode of this essence, if known, or zero\n\n\t};\n\n\n\n\n","file_path":"mxflib/essence.h","rank":36,"score":68457.42446379681},{"content":"\t//! Superclass for objects that supply data to be wrapped by an ANCVBISource\n\n\tclass ANCVBILineSource : public RefCount<ANCVBILineSource>\n\n\t{\n\n\tprotected:\n\n\t\tEssenceSourceParent Parent;\t\t\t\t\t\t//!< The ANCVBISource that owns this line source\n\n\n\n\tpublic:\n\n\t\t//! Get the field number for the supplied ANC/VBI line\n\n\t\tvirtual int GetField(void) = 0;\n\n\n\n\t\t//! Get the line number within the field for the supplied ANC/VBI line\n\n\t\tvirtual int GetLineNumber(void) = 0;\n\n\n\n\t\t//! Get the SMPTE 436M wrapping type for this line\n\n\t\tvirtual ANCWrappingType GetWrappingType(void) = 0;\n\n\n\n\t\t//! Get the SMPTE 436M sample coding for this line\n\n\t\tvirtual ANCSampleCoding GetSampleCoding(void) = 0;\n\n\n\n\t\t//! Get the next line of data to wrap\n\n\t\tvirtual DataChunkPtr GetLineData(void) = 0;\n","file_path":"mxflib/vbi.h","rank":37,"score":68433.37769034416},{"content":"\t//! A smart pointer to a DMSourceClip object (with operator[] overload)\n\n\tclass DMSourceClipPtr : public SmartPtr<DMSourceClip>\n\n\t{\n\n\tpublic:\n\n\t\t//! Build a NULL pointer\n\n\t\tDMSourceClipPtr() : SmartPtr<DMSourceClip>() {}\n\n\n\n\t\t//! Build a pointer to an existing object\n\n\t\t/*! \\note The IRefCount has to be to a Component because that is what DMSourceClip is derived from */\n\n\t\tDMSourceClipPtr(IRefCount<Component> * ptr) : SmartPtr<DMSourceClip>((IRefCount<DMSourceClip> *)ptr) {}\n\n\n\n\t\t//! Child access operators that overcome dereferencing problems with SmartPtrs\n\n\t\tMDObjectPtr operator[](const char *ChildName);\n\n\t\tMDObjectPtr operator[](MDOTypePtr ChildType);\n\n\t\tMDObjectPtr operator[](const UL &ChildType);\n\n\t\tMDObjectPtr operator[](ULPtr &ChildType);\n\n\t};\n\n\n","file_path":"mxflib/metadata.h","rank":38,"score":66020.82385365084},{"content":"\tbool UseIndex\t;\t\t\t\t\t\t//!< Write complete index tables\n","file_path":"libprocesswrap/process.h","rank":39,"score":65999.51548227791},{"content":"\tbool IncludeSubstreams;\t\t\t\t\t//!< Should sub-streams also be wrapped\n","file_path":"libprocesswrap/process.h","rank":40,"score":65999.51548227791},{"content":"using namespace mxflib;\n","file_path":"libprocesswrap/process_utils.h","rank":41,"score":65992.84893587037},{"content":"using namespace mxflib;\n","file_path":"libprocesswrap/process_metadata.h","rank":42,"score":65992.84893587037},{"content":"\t//! List of pairs of essence parser pointers with associated file descriptors\n\n\tclass ParserDescriptorList : public RefCount<ParserDescriptorList>, public std::list<ParserDescriptorPair> {};\n\n\ttypedef SmartPtr<ParserDescriptorList> ParserDescriptorListPtr;\n\n\n\n\n","file_path":"mxflib/essence.h","rank":43,"score":64596.353533565074},{"content":"\t// Forware declare MDObjectPtr and EssenceSource\n\n\tclass MDObjectPtr;\n","file_path":"mxflib/helper.h","rank":44,"score":63912.761412228494},{"content":"\tclass MDObjectPtr;\n\n}\n\n\n\n\n\nnamespace mxflib\n\n{\n\n\t//! Soft limit for strings returned by MDTraits\n\n\t/*! \\note This is a soft limit in that it is not enforced strictly.\n\n\t * It is possible for string values to be returned that are longer than this value, but where\n\n\t *\t\t the string is built by several passes around a loop that loop should exit once this value\n\n\t *\t\t has been reached\n\n\t *\n\n * TODO: Apply this limit to everywhere it is required!!\n\n\t */\n\n\textern UInt32 MDTraits_StringLimit;\n\n\n\n\t//! Set the string size soft limit\n\n\tinline void SetStringLimit(UInt32 StringLimit) { MDTraits_StringLimit = StringLimit; }\n\n\n\n\t//! Get the current string size soft limit\n","file_path":"mxflib/mdtraits.h","rank":45,"score":63907.01399465511},{"content":"\tclass MDObjectPtr;\n","file_path":"mxflib/typeif.h","rank":46,"score":63907.01399465511},{"content":"\t\t//! Class for EssenceSource objects for parsing/sourcing <Type> essence\n\n\t\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\n\n\t\t{\n\n\t\tprotected:\n\n\t\t\tsize_t BytesRemaining;\t\t\t\t\t\t\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\n\n\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\n\n\t\t\t\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \n\n\t\t\t{\n\n\t\t\t\tBytesRemaining = 0;\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the size of the essence data in bytes\n\n\t\t\t/*! \\note There is intentionally no support for an \"unknown\" response \n\n\t\t\t */\n\n\t\t\tvirtual size_t GetEssenceDataSize(void) \n\n\t\t\t{\n\n\t\t\t\tTEMPLATE_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, TEMPLATE_EssenceSubParser);\n\n\t\t\t\treturn pCaller->ReadInternal(File, Stream, RequestedCount);\n","file_path":"mxflib/esp_template.h","rank":47,"score":61682.55573922708},{"content":"\t\t//! Class for EssenceSource objects for parsing/sourcing <Type> essence\n\n\t\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\n\n\t\t\t\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \n\n\t\t\t{\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the size of the essence data in bytes\n\n\t\t\t/*! \\note There is intentionally no support for an \"unknown\" response \n\n\t\t\t */\n\n\t\t\tvirtual size_t GetEssenceDataSize(void) \n\n\t\t\t{\n\n\t\t\t\tJP2K_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, JP2K_EssenceSubParser);\n\n\t\t\t\treturn pCaller->ReadInternal(File, Stream, RequestedCount);\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the next \"installment\" of essence data\n\n\t\t\t/*! \\return Pointer to a data chunk holding the next data or a NULL pointer when no more remains\n","file_path":"mxflib/esp_jp2k.h","rank":48,"score":61682.55573922708},{"content":"\t\t//! Class for EssenceSource objects for parsing/sourcing MPEG-VES essence\n\n\t\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\n\n\t\t{\n\n\t\tprotected:\n\n\t\t\tsize_t BytesRemaining;\t\t\t\t\t\t\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\n\n\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1)\n\n\t\t\t\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count) \n\n\t\t\t{\n\n\t\t\t\tBytesRemaining = 0;\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the size of the essence data in bytes\n\n\t\t\t/*! \\note There is intentionally no support for an \"unknown\" response \n\n\t\t\t */\n\n\t\t\tvirtual size_t GetEssenceDataSize(void) \n\n\t\t\t{\n\n\t\t\t\tMPEG2_VES_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, MPEG2_VES_EssenceSubParser);\n\n\t\t\t\t\n","file_path":"mxflib/esp_mpeg2ves.h","rank":49,"score":61682.51341797262},{"content":"\t\t//! Class for EssenceSource objects for parsing/sourcing DV-DIF essence\n\n\t\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\n\n\t\t\t\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \n\n\t\t\t{\n\n\t\t\t\tDV_DIF_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, DV_DIF_EssenceSubParser);\n\n\n\n\t\t\t\tif(pCaller->SelectedWrapping->ThisWrapType == WrappingOption::Clip) RequestedCount = 0;\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the size of the essence data in bytes\n\n\t\t\t/*! \\note There is intentionally no support for an \"unknown\" response \n\n\t\t\t */\n\n\t\t\tvirtual size_t GetEssenceDataSize(void) \n\n\t\t\t{\n\n\t\t\t\tDV_DIF_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, DV_DIF_EssenceSubParser);\n\n\t\t\t\treturn pCaller->ReadInternal(File, Stream, RequestedCount/*, Index*/);\n\n\t\t\t};\n","file_path":"mxflib/esp_dvdif.h","rank":50,"score":61682.51341797262},{"content":"\t\t//! Class for EssenceSource objects for parsing/sourcing MPEG-VES essence\n\n\t\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\n\n\t\t{\n\n\t\tprotected:\n\n\t\t\tsize_t BytesRemaining;\t\t\t\t\t\t\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\n\n\n\n\t\t\tbool PaddingEnabled;\t\t\t\t\t\t\t//!< Is padding after the end of the essence stream enabled? Used when audio input is less than video\n\n\t\t\tDataChunkPtr PaddingChunk;\t\t\t\t\t\t//!< A chunk containing padding bytes (if required) for use in GetPadding()\n\n\t\t\tInt64 ExtraSamples;\t\t\t\t\t\t\t //!< Number of extra samples to output after end of frame\n\n\n\n\n\n\t\tpublic:\n\n\t\t\t//! Construct and initialise for essence parsing/sourcing\n\n\t\t\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\n\n\t\t\t\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \n\n\t\t\t{\n\n\t\t\t\tBytesRemaining = 0;\n\n\t\t\t\tPaddingEnabled = false;\n\n\t\t\t};\n\n\n\n\t\t\t//! Get the size of the essence data in bytes\n","file_path":"mxflib/esp_wavepcm.h","rank":51,"score":61682.51341797262},{"content":"\t// Extended implementations\n\n\tclass MDTraits_BasicInt : public MDTraits\n\n\t{\n\n\tpublic:\n\n\t\t//! A unique name for this trait\n\n\t\tvirtual std::string Name() const { return \"mxflib::MDTraits_BasicInt\"; };\n\n\n\n\tprotected:\n\n\t\tvirtual void SetInt64(MDObject *Object, Int64 Val);\n\n\t\tvirtual void SetUInt(MDObject *Object, UInt32 Val);\n\n\t\tvirtual void SetUInt64(MDObject *Object, UInt64 Val);\n\n\t\tvirtual void SetString(MDObject *Object, std::string Val);\n\n\t\tvirtual Int64 GetInt64(const MDObject *Object) const;\n\n\t\tvirtual UInt64 GetUInt64(const MDObject *Object) const;\n\n\t\tvirtual std::string GetString(const MDObject *Object) const;\n\n\n\n //Overridden to avoid partial overriden virtual function issues with ICC\n\n virtual std::string GetString(const MDObject *Object, OutputFormatEnum Format) const { return GetString(Object); }\n\n\n\n\t\tvirtual size_t ReadValue(MDObject *Object, const UInt8 *Buffer, size_t Size, int Count=0);\n\n\t};\n\n\n\n\t//! Special unsigned integer ReadValue\n\n\tsize_t ReadValueUInt(MDObject *Object, const UInt8 *Buffer, size_t Size, int Count=0);\n\n\n","file_path":"mxflib/mdtraits.h","rank":52,"score":59604.26416957685},{"content":"\tclass MDTraits_Int16 : public MDTraits_BasicInt\n\n\t{\n\n\tpublic:\n\n\t\t//! A unique name for this trait\n\n\t\tvirtual std::string Name() const { return \"mxflib::MDTraits_Int16\"; };\n\n\n\n\tprotected:\n\n\t\tvirtual void SetInt(MDObject *Object, Int32 Val);\n\n\t\tvirtual Int32 GetInt(const MDObject *Object) const;\n\n\t\tvirtual UInt32 GetUInt(const MDObject *Object) const;\n\n\t};\n\n\n","file_path":"mxflib/mdtraits.h","rank":53,"score":56851.20020699433},{"content":"\tclass MDTraits_Int32 : public MDTraits_BasicInt\n\n\t{\n\n\tpublic:\n\n\t\t//! A unique name for this trait\n\n\t\tvirtual std::string Name() const { return \"mxflib::MDTraits_Int32\"; };\n\n\n\n\tprotected:\n\n\t\tvirtual void SetInt(MDObject *Object, Int32 Val);\n\n\t\tvirtual Int32 GetInt(const MDObject *Object) const;\n\n\t\tvirtual UInt32 GetUInt(const MDObject *Object) const;\n\n\t};\n\n\n","file_path":"mxflib/mdtraits.h","rank":54,"score":56851.20020699433},{"content":"\tclass MDTraits_Int8 : public MDTraits_BasicInt\n\n\t{\n\n\tpublic:\n\n\t\t//! A unique name for this trait\n\n\t\tvirtual std::string Name() const { return \"mxflib::MDTraits_Int8\"; };\n\n\n\n\tprotected:\n\n\t\tvirtual void SetInt(MDObject *Object, Int32 Val);\n\n\t\tvirtual Int32 GetInt(const MDObject *Object) const;\n\n\t\tvirtual UInt32 GetUInt(const MDObject *Object) const;\n\n\t};\n\n\n","file_path":"mxflib/mdtraits.h","rank":55,"score":56851.20020699433},{"content":"struct tm mxflib::StringToTm(std::string String)\n\n{\n\n\tstruct tm Time;\n\n\tTime.tm_isdst = 0;\n\n\n\n\tif(String.length() < 18)\n\n\t{\n\n\t\tTime.tm_year = 0;\n\n\t\tTime.tm_mon = 0;\n\n\t\tTime.tm_mday = 0;\n\n\t\tTime.tm_hour = 0;\n\n\t\tTime.tm_min = 0;\n\n\t\tTime.tm_sec = 0;\n\n\t\treturn Time;\n\n\t}\n\n\n\n\tTime.tm_year = atoi(&String.c_str()[0]) - 1970;\n\n\tTime.tm_mon = atoi(&String.c_str()[5]) - 1;\n\n\tTime.tm_mday = atoi(&String.c_str()[8]);\n\n\tTime.tm_hour = atoi(&String.c_str()[11]);\n","file_path":"mxflib/helper.cpp","rank":56,"score":52681.55245362313},{"content":"\tclass BodyStream : public RefCount<BodyStream>, public EssenceSourceList\n\n\t{\n\n\tpublic:\n\n\t\t//! Define the action required next for this stream\n\n\t\tenum StateType\n\n\t\t{\n\n\t\t\tBodyStreamStart = 0,\t\t\t\t\t\t\t\t\t//!< This stream has not yet done anything - state unknown\n\n\t\t\tBodyStreamHeadIndex,\t\t\t\t\t\t\t\t\t//!< Next action: Write a \"header\" index table - if required in an isolated partition following the header\n\n\t\t\tBodyStreamPreBodyIndex,\t\t\t\t\t\t\t\t\t//!< Next action: Write an isolated index table before the next body partition\n\n\t\t\tBodyStreamBodyWithIndex,\t\t\t\t\t\t\t\t//!< Next action: Write a body partition with an index table\n\n\t\t\tBodyStreamBodyNoIndex,\t\t\t\t\t\t\t\t\t//!< Next action: Write a body partition without index table\n\n\t\t\tBodyStreamPostBodyIndex,\t\t\t\t\t\t\t\t//!< Next action: Write an isolated index table after a body partition\n\n\t\t\tBodyStreamFootIndex,\t\t\t\t\t\t\t\t\t//!< Next action: Write a \"footer\" index table - if required in an isolated partition before the footer\n\n\t\t\tBodyStreamDone\t\t\t\t\t\t\t\t\t\t\t//!< All done - no more actions required\n\n\t\t};\n\n\n\n\t\t//! The index table type or types of this stream\n\n\t\tenum IndexType\n\n\t\t{\n\n\t\t\tStreamIndexNone = 0,\t\t\t\t\t\t\t\t\t//!< No index table will be written\n","file_path":"mxflib/essence.h","rank":57,"score":49913.59438482755},{"content":"\tMXFLIB_TYPE_END\n\n\n\n\t// Types definitions converted from file ./dict.xml\n","file_path":"mxflib/dict.h","rank":58,"score":45684.801582741486},{"content":"\t\tMXFLIB_DICTIONARY_CLASSES(DictData_Classes_10)\n","file_path":"mxflib/dict.h","rank":59,"score":45684.801582741486},{"content":"\t\tMXFLIB_CLASS_SET_END\n\n\tMXFLIB_CLASS_END\n\n\n","file_path":"mxflib/dict.h","rank":60,"score":45684.801582741486},{"content":"\t\tMXFLIB_DICTIONARY_TYPES(DictData_Types_8)\n","file_path":"mxflib/dict.h","rank":61,"score":45684.801582741486},{"content":"\t\tMXFLIB_DICTIONARY_CLASSES(DictData_Classes_8)\n","file_path":"mxflib/dict.h","rank":62,"score":45684.801582741486},{"content":"\tMXFLIB_TYPE_END\n\n\n\n\t// Class definitions converted from file ./dict.xml\n","file_path":"mxflib/dict.h","rank":63,"score":45684.801582741486},{"content":"\t//! A smart pointer to an MDObject object (with operator[] overloads)\n\n\tclass MDObjectPtr : public SmartPtr<MDObject>\n\n\t{\n\n\tpublic:\n\n\t\tMDObjectPtr() : SmartPtr<MDObject>() {};\n\n\t\tMDObjectPtr(IRefCount<MDObject> * ptr) : SmartPtr<MDObject>(ptr) {};\n\n\t\tMDObjectPtr(MDObjectParent ptr);\n\n\n\n\t\t//! Child access operators that overcome dereferencing problems with SmartPtrs\n\n\t\tMDObjectPtr operator[](const char *ChildName) const;\n\n\t\tMDObjectPtr operator[](const MDOTypePtr &ChildType) const;\n\n\t\tMDObjectPtr operator[](const MDTypePtr &ChildType) const;\n\n\t\tMDObjectPtr operator[](int Index) const;\n\n\t\tMDObjectPtr operator[](const UL &ChildType) const;\n\n\t\tMDObjectPtr operator[](const ULPtr &ChildType) const;\n\n\t};\n\n\n","file_path":"mxflib/forward.h","rank":64,"score":45138.35083437733},{"content":"\tMXFLIB_TYPE_END\n\n\n\n\t// Types definitions converted from file C:\\dev\\mxflib\\dict_as11.xml\n","file_path":"mxflib/dict_as11.h","rank":65,"score":44451.244470523605},{"content":"\t\tMXFLIB_CLASS_SET_END\n\n\tMXFLIB_CLASS_END\n\n\n","file_path":"mxflib/dict_as11.h","rank":66,"score":44451.244470523605},{"content":"\tMXFLIB_DICTIONARY_START(AS11)\n","file_path":"mxflib/dict_as11.h","rank":67,"score":44451.244470523605},{"content":"\t\tMXFLIB_TYPE_ENUM_END\n\n\tMXFLIB_TYPE_END\n\n\n","file_path":"mxflib/dict_as11.h","rank":68,"score":44451.244470523605},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\nusing namespace mxflib;\n\n\n\n// Define the features bitmap - turn on those features set by compile time switch\n\nUInt64 mxflib::Features = MXFLIB_FEATURE_DEFAULT & MXFLIB_FEATURE_MASK;\n\n\n\n\n\nnamespace\n\n{\n\n\t//! The version year of the MXF specification being used to write files. Returned by MXFVersion() and set by SetMXFVersion()\n\n\tint MXFVersionYear = 2004;\n\n\n","file_path":"mxflib/helper.cpp","rank":69,"score":36.449243272925585},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"testmxfsplit.h\"\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"libmxfsplit.h\"\n\n#include \"containerinfo.h\"\n\n\n\n//! very basic usage assumes all Descriptors wanted\n\nbool Wanted( DescriptorPtr d ){ return true; }\n\n\n\n//! Simple test of Processor-based splitting\n\nint Simple( const char *file, const unsigned firstFrame, const unsigned nFrames, const char ProcSink /*='\\0'*/ )\n","file_path":"libmxfsplit/testmxfsplit.cpp","rank":70,"score":33.82557317315029},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n#include \"dumpobject.h\"\n\n\n\n#include \"utility/utility.h\"\n\nusing namespace utility;\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n\nusing namespace std;\n\n\n\nnamespace mxflib {\n\n\n","file_path":"mxflib/dumpobject.cpp","rank":71,"score":31.958112786446378},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"libmxfsplit.h\"\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"containerinfo.h\"\n\n\n\n//! Initialize SplitProcessor\n\nint SplitProcessor::Initialize()\n\n{\n\n\tint Ret = 0;\n\n\n\n\t_ContainerInfo = ContainerInfo::CreateAndBuild(_File);\n","file_path":"libmxfsplit/libmxfsplit.cpp","rank":72,"score":31.605117030177887},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n#ifndef _LIBMXFSPLIT_H_\n\n#define _LIBMXFSPLIT_H_\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"containerinfo.h\"\n\n#include \"basesink.h\"\n\n\n\n#include <vector>\n\n\n\ntypedef MDObjectPtr DescriptorPtr;\n\n\n\nnamespace mxflib\n\n{\n\n\t//! SplitProcessor - singleton class to do all processing of MXF file splitting\n","file_path":"libmxfsplit/libmxfsplit.h","rank":73,"score":31.420824721353483},{"content":"#include \"DotFile.h\"\n\n#include <mxflib/mxflib.h>\n\n\n\n#include <vector>\n\n#include <cassert>\n\n#include <stdarg.h>\n\n\n\n\n\n#ifdef COMPILED_DICT\n\n#include <mxflib/dict.h>\n\n#endif\n\n\n\nusing namespace std;\n\nusing namespace dot;\n\nusing namespace mxflib;\n\n\n\n\n\n// Debug flag for KLVLib\n\nint Verbose = 0;\n\n\n","file_path":"mxf2dot/mxf2dot.cpp","rank":74,"score":31.256964811172637},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n\n\n\n\n#include <string.h>\t\t/* strcpy */\n\n\n\n\n\n#include \"mxflib/mxflib.h\"\n\n#include \"sopsax.h\"\n\n\n\nusing namespace mxflib;\n\n\n\n\n\n/* Local Prototypes */\n\nstatic int sopSkipToClose(FILE *xmlFile);\n","file_path":"mxflib/sopsax.cpp","rank":75,"score":31.189863623602072},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n\n\n\nusing namespace std;\n\n\n\n\n\n\n\nnamespace\n\n{\n","file_path":"mxflib/metadict.cpp","rank":76,"score":31.1639638406016},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <string>\n\nusing namespace std;\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n\n\n#include \"process.h\"\n\n#include \"process_utils.h\"\n\n\n\n\n","file_path":"libprocesswrap/process.cpp","rank":77,"score":30.474614319973153},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"process_utils.h\"\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <string>\n\n\n\nusing namespace std;\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"libprocesswrap/process.h\"\n\n\n","file_path":"libprocesswrap/process_utils.cpp","rank":78,"score":30.341821430295212},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"process_metadata.h\"\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n\n#include <string>\n\nusing namespace std;\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n// Include the timecode class\n\n#include \"utility/timecode.h\"\n\n\n","file_path":"libprocesswrap/process_metadata.cpp","rank":79,"score":30.21552679282955},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"parseoptions.h\"\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\nusing namespace std;\n\n\n\n#include \"mxflib/system.h\" // for stricmp/strcasecmp\n\n\n\n#include \"libprocesswrap/process.h\"\n\n\n\n#define KXS\t\t\t\t\t\"kxs\"\n\n#define KXS_Used\t\t\t\"kxu\"\n\n#define KXS_Loaded\t\t\t\"kxl\"\n","file_path":"mxfwrap/parseoptions.cpp","rank":80,"score":29.805578894637097},{"content":" * 1. The origin of this software must not be misrepresented; you must\n\n * not claim that you wrote the original software. If you use this\n\n * software in a product, you must include an acknowledgment of the\n\n * authorship in the product documentation.\n\n * \n\n * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n \n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <stdarg.h>\n\n\n\nusing namespace mxflib;\n\n\n\n\n\n//! Static flag to say if dark metadata sets that appear to be valid KLV 2x2 sets should be parsed\n","file_path":"mxflib/mdobject.cpp","rank":81,"score":29.769496698259506},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n \n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <stdarg.h>\n\n\n\n\n\nusing namespace mxflib;\n\n\n\n// Allow us simple access to deftypes specials\n\nusing namespace mxflib_deftypes;\n\n\n\n\n\n/* XML parsing functions - with file scope */\n\nnamespace\n","file_path":"mxflib/legacytypes.cpp","rank":82,"score":29.50570239884339},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <math.h>\t// For \"floor\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <mxflib/esp_template.h>\n\n\n\n\n\n//! Local definitions\n\nnamespace\n\n{\n\n\t//! Modified UUID for <Source Type>\n","file_path":"mxflib/esp_template.cpp","rank":83,"score":29.38867445930807},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <math.h>\t// For \"floor\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <mxflib/esp_wavepcm.h>\n\n\n\n\n\n\n\n//! Local definitions\n\nnamespace\n\n{\n","file_path":"mxflib/esp_wavepcm.cpp","rank":84,"score":29.349967532773842},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n#ifndef _BASESINK_H_\n\n#define _BASESINK_H_\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"IPartial.h\"\n\n#include \"streamfile.h\"\n\n\n\nnamespace mxflib\n\n{\n","file_path":"libmxfsplit/basesink.h","rank":85,"score":29.051372793288046},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <math.h>\t// For \"floor\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <mxflib/esp_dvdif.h>\n\n\n\n\n\n//! Local definitions\n\nnamespace\n\n{\n\n\t//! Modified UUID for raw DV\n","file_path":"mxflib/esp_dvdif.cpp","rank":86,"score":28.759439663559426},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include <mxflib/mxflib.h>\n\n\n\n#include <math.h>\t// For \"floor\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <mxflib/esp_mpeg2ves.h>\n\n\n\n\n\n//! Local definitions\n\nnamespace\n\n{\n\n\t//! Modified UUID for MPEG2-VES\n","file_path":"mxflib/esp_mpeg2ves.cpp","rank":87,"score":28.759439663559426},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n\n\n#include \"timecode.h\"\n\n\n\n#ifndef EXCLUDE_MXFLIB_H\n\nusing namespace mxflib;\n\n#endif\n\n\n\n\t// construct from string\n\n\t// note that defaults to 1000 fps - intentionally\n\n\t// MUST call SetFPS() before persisting\n\n\tTimecode_t::Timecode_t( const char* arg, unsigned fps /* = defaultfps */, bool drop /*= false*/ ) : _start(0),_valid(false),_fps(fps),_drop(drop),_text(NULL)\n\n\t{\n\n\t\tif((!arg) || !strlen(arg)) return;\n","file_path":"utility/timecode.cpp","rank":88,"score":28.702441135122225},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <ios>\n\n#include <sstream>\n\n\n\n// Use mxflib by default in library source\n\nusing namespace mxflib;\n\n\n\n// Standard library includes\n\n//#include <stdexcept>\n\n\n\n//! Soft limit for strings returned by MDTraits - Defaults to 10k\n\n/*! \\note This is a soft limit in that it is not enforced strictly.\n","file_path":"mxflib/mdtraits.cpp","rank":89,"score":28.48310028624482},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <math.h>\t// For \"floor\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <mxflib/esp_jp2k.h>\n\n\n\n\n\n//! Local definitions\n\nnamespace\n\n{\n\n\tconst char *PictureEssenceCoding_Base = \"060e2b34.04010107.04010202.03010100\";\n","file_path":"mxflib/esp_jp2k.cpp","rank":90,"score":28.47392565521818},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"libprocesswrap/process.h\"\n\n\n\n\n\n\n\n#include \"parseoptions.h\"\n\n\n\n\n\n\n\n#include <stdio.h>\n\n#include <iostream>\n","file_path":"mxfwrap/mxfwrap.cpp","rank":91,"score":28.4438328446601},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\n\n\nusing namespace mxflib;\n\n\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n\n\n\n\n// Include the AS-DCP crypto header\n\n#include \"crypto_asdcp.h\"\n\n\n\n#include \"mxflib/dict.h\"\n\n\n","file_path":"mxfcrypt/mxfcrypt.cpp","rank":92,"score":28.23023422159863},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n \n\n#include \"mxflib/mxflib.h\"\n\n\n\n#include <stdarg.h>\n\n\n\n/* Allow us to use std::numeric_limits<>::max(), which includes removing any \"max\" macro! */\n\n#ifdef max\n\n#undef max\n\n#endif\n\n#include <limits>\n\n/******************************************************************************************/\n\n\n\nusing namespace mxflib;\n\n\n","file_path":"mxflib/rxiparser.cpp","rank":93,"score":28.025461462236272},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"utility/osprintf.h\"\n\n\n\n// include the autogenerated dictionary\n\n#include \"mxflib/dict.h\"\n\n\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <iostream>\n\n#include <map>\n\n#include <stdarg.h>\n","file_path":"mxfsplit/mxfsplit.cpp","rank":94,"score":27.8810799356323},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n\n\n#include \"mxflib/mxflib.h\"\n\n#include <cstddef>\n\n\n\n\n\n\n\nusing namespace mxflib;\n\n\n\n//! Template for all GC essence item keys\n\n/*! DRAGONS: Version number is hard coded as 0 - must be overwritten */\n\n\n\nnamespace\n\n{\n","file_path":"mxflib/essence.cpp","rank":95,"score":27.599134880439173},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n\n\n#include <mxflib/mxflib.h>\n\n\n\nusing namespace mxflib;\n\n\n\n\n\n/* List of all essence sub-parser header files */\n\n/***********************************************/\n\n\n\n#include <mxflib/esp_mpeg2ves.h>\n\n#include <mxflib/esp_wavepcm.h>\n\n#include <mxflib/esp_dvdif.h>\n\n#include <mxflib/esp_jp2k.h>\n","file_path":"mxflib/esp.cpp","rank":96,"score":27.564960593189276},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n#ifndef _CONTAINERINFO_H_\n\n#define _CONTAINERINFO_H_\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\nnamespace mxflib\n\n{\n\n\t//! Map of Descriptors indexed by Track Number\n\n\ttypedef std::map<UInt32, MDObjectPtr> TrackDescriptorMap;\n\n\n\n\t//! Map of EssenceSinks indexed by Track Number\n\n\ttypedef std::map<UInt32, EssenceSinkPtr> EssenceSinkMap;\n\n\n\n\t//! Structure holding information about the essence in each Container\n","file_path":"libmxfsplit/containerinfo.h","rank":97,"score":27.564820187638173},{"content":" * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n\n\n#include <mxflib/mxflib.h>\n\n\n\nusing namespace mxflib;\n\n\n\n\n\n#ifdef COMPILED_DICT\n\nbool UseCompiledDict = true;\n\n// include the autogenerated dictionary\n\n#include \"mxflib/dict.h\"\n\n#else // COMPILED_DICT\n\nbool UseCompiledDict = false;\n\nMXFLIB_DICTIONARY_START(DictData)\n\nMXFLIB_DICTIONARY_END\n\n#endif // COMPILED_DICT\n\n\n\n// Include the bootstrap dictionary\n","file_path":"mxfdump/mxfdump.cpp","rank":98,"score":27.55070170195469},{"content":" * 2. Altered source versions must be plainly marked as such, and must\n\n * not be misrepresented as being the original software.\n\n * \n\n * 3. This notice may not be removed or altered from any source\n\n * distribution.\n\n */\n\n#ifndef _AUDIOSINK_H_\n\n#define _AUDIOSINK_H_\n\n\n\n#include \"mxflib/mxflib.h\"\n\nusing namespace mxflib;\n\n\n\n#include \"streamfile.h\"\n\n\n\nnamespace mxflib\n\n{\n\n\t//! EssenceSink that writes a wave file to the currently open file\n","file_path":"libmxfsplit/audiosink.h","rank":99,"score":27.536829092147634}],"string":"[\n {\n \"content\": \"namespace mxflib {}\\n\",\n \"file_path\": \"mxflib/mxflib.h\",\n \"rank\": 0,\n \"score\": 89973.22926212748\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\n\\n\\t//! Load classes and types from a Metadictionary object\\n\\n\\t/*! At the point where this function is called, you need to have all the component parts loaded and\\n\\n\\t * all the strong references within the metadictionary need to be satisfied\\n\\n\\t */\\n\\n\\tbool LoadMetadictionary(MDObjectPtr &Meta, SymbolSpacePtr &SymSpace);\\n\\n\\n\\n\\t//! Build a metadictionary from current classes and types used in a given list of metadata trees\\n\\n\\t/*! If Meta is supplied, then all classes in the trees strongly linked from it are written to the metadictionary, \\n\\n\\t * including all properties of those classes (whether used or not) and any types used by those properties\\n\\n\\t */\\n\\n\\tMDObjectPtr BuildMetadictionary(MDObjectList &MetaList, Primer *UsePrimer);\\n\",\n \"file_path\": \"mxflib/metadict.h\",\n \"rank\": 1,\n \"score\": 86374.1332027388\n },\n {\n \"content\": \"\\tnamespace mxflib\\n\\n\\t{\\n\\n\\t\\tconst UInt8 AES3PCMDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x47, 0x00 };\\n\\n\\t\\tconst UL AES3PCMDescriptor_UL(AES3PCMDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ANCDataDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5c, 0x00 };\\n\\n\\t\\tconst UL ANCDataDescriptor_UL(ANCDataDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ATSCA52_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x04, 0x02, 0x02, 0x02, 0x03, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL ATSCA52_UL(ATSCA52_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AUID_UL(AUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AUIDArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AUIDArray_UL(AUIDArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AUIDSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x03, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AUIDSet_UL(AUIDSet_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AUL_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AUL_UL(AUL_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AbstractObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x7f, 0x00 };\\n\\n\\t\\tconst UL AbstractObject_UL(AbstractObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ActiveFormatDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ActiveFormatDescriptor_UL(ActiveFormatDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AlphaMaxRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AlphaMaxRef_UL(AlphaMaxRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AlphaMinRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AlphaMinRef_UL(AlphaMinRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AlphaSampleDepth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AlphaSampleDepth_UL(AlphaSampleDepth_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AlphaTransparency_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AlphaTransparency_UL(AlphaTransparency_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AnnotationSource_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0a, 0x00, 0x00 };\\n\\n\\t\\tconst UL AnnotationSource_UL(AnnotationSource_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationEnvironmentID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0f, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ApplicationEnvironmentID_UL(ApplicationEnvironmentID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x66, 0x00 };\\n\\n\\t\\tconst UL ApplicationObject_UL(ApplicationObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationPluginBatch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0e, 0x00, 0x00 };\\n\\n\\t\\tconst UL ApplicationPluginBatch_UL(ApplicationPluginBatch_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationPluginInstanceID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ApplicationPluginInstanceID_UL(ApplicationPluginInstanceID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationPluginObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x61, 0x00 };\\n\\n\\t\\tconst UL ApplicationPluginObject_UL(ApplicationPluginObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationReferencedObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x62, 0x00 };\\n\\n\\t\\tconst UL ApplicationReferencedObject_UL(ApplicationReferencedObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x04, 0x06, 0x08, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ApplicationScheme_UL(ApplicationScheme_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ApplicationSchemesBatch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x01, 0x02, 0x02, 0x10, 0x02, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL ApplicationSchemesBatch_UL(ApplicationSchemesBatch_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AspectRatio_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AspectRatio_UL(AspectRatio_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioRefLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x02, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AudioRefLevel_UL(AudioRefLevel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioSamplingRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x01, 0x01, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL AudioSamplingRate_UL(AudioSamplingRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AuxBitsMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AuxBitsMode_UL(AuxBitsMode_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AvgBps_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x03, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL AvgBps_UL(AvgBps_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BPictureCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x09, 0x00, 0x00 };\\n\\n\\t\\tconst UL BPictureCount_UL(BPictureCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BaseClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x01, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL BaseClass_UL(BaseClass_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BitRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL BitRate_UL(BitRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BlackRefLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x03, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL BlackRefLevel_UL(BlackRefLevel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BlockAlign_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL BlockAlign_UL(BlockAlign_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BlockStartOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL BlockStartOffset_UL(BlockStartOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BodyOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x08, 0x01, 0x02, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL BodyOffset_UL(BodyOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 BodySID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x04, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL BodySID_UL(BodySID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Boolean_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x04, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Boolean_UL(Boolean_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Build_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Build_UL(Build_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ByteOrder_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ByteOrder_UL(ByteOrder_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CDCIEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x28, 0x00 };\\n\\n\\t\\tconst UL CDCIEssenceDescriptor_UL(CDCIEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChannelAssignment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x07, 0x04, 0x02, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChannelAssignment_UL(ChannelAssignment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChannelCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x01, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChannelCount_UL(ChannelCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChannelIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x07, 0x06, 0x01, 0x01, 0x03, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChannelIDs_UL(ChannelIDs_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChannelStatusMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChannelStatusMode_UL(ChannelStatusMode_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChannelStatusModeType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x25, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChannelStatusModeType_UL(ChannelStatusModeType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChunkData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x07, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChunkData_UL(ChunkData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChunkID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x06, 0x08, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChunkID_UL(ChunkID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ChunkLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x06, 0x09, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ChunkLength_UL(ChunkLength_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CipherAlgorithm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL CipherAlgorithm_UL(CipherAlgorithm_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CipherAlgorithmAES128CBC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x02, 0x09, 0x02, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL CipherAlgorithmAES128CBC_UL(CipherAlgorithmAES128CBC_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL ClassDefinition_UL(ClassDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClassDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ClassDefinitions_UL(ClassDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x02, 0x00 };\\n\\n\\t\\tconst UL ClosedBodyPartition_UL(ClosedBodyPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedCompleteBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x04, 0x00 };\\n\\n\\t\\tconst UL ClosedCompleteBodyPartition_UL(ClosedCompleteBodyPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedCompleteHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x04, 0x00 };\\n\\n\\t\\tconst UL ClosedCompleteHeader_UL(ClosedCompleteHeader_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x06, 0x00, 0x00 };\\n\\n\\t\\tconst UL ClosedGOP_UL(ClosedGOP_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x02, 0x00 };\\n\\n\\t\\tconst UL ClosedHeader_UL(ClosedHeader_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Codec_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL Codec_UL(Codec_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1f, 0x00 };\\n\\n\\t\\tconst UL CodecDefinition_UL(CodecDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CodecDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x07, 0x00, 0x00 };\\n\\n\\t\\tconst UL CodecDefinitions_UL(CodecDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CodedContentType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL CodedContentType_UL(CodedContentType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CodingEquations_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\\n\\n\\t\\tconst UL CodingEquations_UL(CodingEquations_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CodingStyleDefault_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL CodingStyleDefault_UL(CodingStyleDefault_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ColorPrimaries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x06, 0x01, 0x00 };\\n\\n\\t\\tconst UL ColorPrimaries_UL(ColorPrimaries_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ColorRange_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ColorRange_UL(ColorRange_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ColorSiting_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ColorSiting_UL(ColorSiting_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CommentMarker_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00 };\\n\\n\\t\\tconst UL CommentMarker_UL(CommentMarker_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CompanyName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL CompanyName_UL(CompanyName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CompleteFooter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x04, 0x04, 0x00 };\\n\\n\\t\\tconst UL CompleteFooter_UL(CompleteFooter_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ComponentDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x07, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ComponentDataDefinition_UL(ComponentDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ComponentDepth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ComponentDepth_UL(ComponentDepth_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ComponentLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x02, 0x01, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL ComponentLength_UL(ComponentLength_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ComponentMaxRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ComponentMaxRef_UL(ComponentMaxRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ComponentMinRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x05, 0x03, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ComponentMinRef_UL(ComponentMinRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ConstantBFrames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL ConstantBFrames_UL(ConstantBFrames_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x20, 0x00 };\\n\\n\\t\\tconst UL ContainerDefinition_UL(ContainerDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContainerDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x08, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContainerDefinitions_UL(ContainerDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContainerDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContainerDuration_UL(ContainerDuration_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContentStorage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00 };\\n\\n\\t\\tconst UL ContentStorage_UL(ContentStorage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContentStorageObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContentStorageObject_UL(ContentStorageObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContextID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x01, 0x01, 0x15, 0x11, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContextID_UL(ContextID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContextIDLink_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x06, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContextIDLink_UL(ContextIDLink_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContextSR_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0d, 0x00, 0x00 };\\n\\n\\t\\tconst UL ContextSR_UL(ContextSR_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CryptographicContext_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL CryptographicContext_UL(CryptographicContext_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CryptographicFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL CryptographicFramework_UL(CryptographicFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CryptographicFrameworkLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL CryptographicFrameworkLabel_UL(CryptographicFrameworkLabel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CryptographicKeyID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL CryptographicKeyID_UL(CryptographicKeyID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Csiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Csiz_UL(Csiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DCinemaTimedText_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x0a, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x13, 0x01, 0x01 };\\n\\n\\t\\tconst UL DCinemaTimedText_UL(DCinemaTimedText_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0c, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMFramework_UL(DMFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMS1_UL(DMS1_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1Clip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x02, 0x01 };\\n\\n\\t\\tconst UL DMS1Clip_UL(DMS1Clip_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1ClipExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x02, 0x02 };\\n\\n\\t\\tconst UL DMS1ClipExtended_UL(DMS1ClipExtended_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1Production_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01 };\\n\\n\\t\\tconst UL DMS1Production_UL(DMS1Production_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1ProductionExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x02 };\\n\\n\\t\\tconst UL DMS1ProductionExtended_UL(DMS1ProductionExtended_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1Scene_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x01 };\\n\\n\\t\\tconst UL DMS1Scene_UL(DMS1Scene_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS1SceneExtended_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x04, 0x0d, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x02 };\\n\\n\\t\\tconst UL DMS1SceneExtended_UL(DMS1SceneExtended_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSCrypto_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x04, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMSCrypto_UL(DMSCrypto_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSchemes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x10, 0x02, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMSchemes_UL(DMSchemes_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x41, 0x00 };\\n\\n\\t\\tconst UL DMSegment_UL(DMSegment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSourceClip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x45, 0x00 };\\n\\n\\t\\tconst UL DMSourceClip_UL(DMSourceClip_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSourceClipTrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x07, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMSourceClipTrackIDs_UL(DMSourceClipTrackIDs_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DM_Framework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DM_Framework_UL(DM_Framework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DM_Set_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DM_Set_UL(DM_Set_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1b, 0x00 };\\n\\n\\t\\tconst UL DataDefinition_UL(DataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DataDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL DataDefinitions_UL(DataDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DataEssenceCoding_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x03, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DataEssenceCoding_UL(DataEssenceCoding_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DataEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DataEssenceTrack_UL(DataEssenceTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DataValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DataValue_UL(DataValue_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DateStruct_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DateStruct_UL(DateStruct_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Day_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Day_UL(Day_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DefinitionObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x1a, 0x00 };\\n\\n\\t\\tconst UL DefinitionObject_UL(DefinitionObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DefinitionObjectDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x02, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL DefinitionObjectDescription_UL(DefinitionObjectDescription_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DefinitionObjectIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x15, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DefinitionObjectIdentification_UL(DefinitionObjectIdentification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DefinitionObjectName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x02, 0x03, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL DefinitionObjectName_UL(DefinitionObjectName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DeltaEntryArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DeltaEntryArray_UL(DeltaEntryArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Denominator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Denominator_UL(Denominator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DescriptiveMetadataApplicationEnvironmentID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DescriptiveMetadataApplicationEnvironmentID_UL(DescriptiveMetadataApplicationEnvironmentID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DescriptiveMetadataPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DescriptiveMetadataPluginID_UL(DescriptiveMetadataPluginID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DescriptiveMetadataScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x04, 0x06, 0x08, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DescriptiveMetadataScheme_UL(DescriptiveMetadataScheme_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DescriptiveMetadataTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DescriptiveMetadataTrack_UL(DescriptiveMetadataTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Descriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL Descriptor_UL(Descriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DialNorm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x07, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DialNorm_UL(DialNorm_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DictReferenceCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DictReferenceCodecDefinition_UL(DictReferenceCodecDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DictReferenceContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DictReferenceContainerDefinition_UL(DictReferenceContainerDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DictReferenceDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DictReferenceDataDefinition_UL(DictReferenceDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DictReferenceVectorDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x04, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DictReferenceVectorDataDefinition_UL(DictReferenceVectorDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Dictionaries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL Dictionaries_UL(Dictionaries_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Dictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x22, 0x00 };\\n\\n\\t\\tconst UL Dictionary_UL(Dictionary_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DisplayF2Offset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DisplayF2Offset_UL(DisplayF2Offset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DisplayHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DisplayHeight_UL(DisplayHeight_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DisplayWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DisplayWidth_UL(DisplayWidth_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DisplayXOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DisplayXOffset_UL(DisplayXOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DisplayYOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DisplayYOffset_UL(DisplayYOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DropFrame_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x04, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DropFrame_UL(DropFrame_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x05, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EditRate_UL(EditRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EditUnitByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EditUnitByteCount_UL(EditUnitByteCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElectroSpatialFormulation_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x02, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElectroSpatialFormulation_UL(ElectroSpatialFormulation_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElementCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElementCount_UL(ElementCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElementNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElementNames_UL(ElementNames_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElementOf_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x21, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElementOf_UL(ElementOf_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElementType_UL(ElementType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ElementValues_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ElementValues_UL(ElementValues_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Emphasis_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Emphasis_UL(Emphasis_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EncryptedContainerLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0b, 0x01, 0x00 };\\n\\n\\t\\tconst UL EncryptedContainerLabel_UL(EncryptedContainerLabel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EncryptedSourceValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EncryptedSourceValue_UL(EncryptedSourceValue_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EncryptedTriplet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x04, 0x01, 0x07, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7e, 0x01, 0x00 };\\n\\n\\t\\tconst UL EncryptedTriplet_UL(EncryptedTriplet_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EssenceContainer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL EssenceContainer_UL(EssenceContainer_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EssenceContainerData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x23, 0x00 };\\n\\n\\t\\tconst UL EssenceContainerData_UL(EssenceContainerData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EssenceContainers_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x10, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL EssenceContainers_UL(EssenceContainers_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EssenceDataObjects_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL EssenceDataObjects_UL(EssenceDataObjects_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EssenceIsIdentified_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EssenceIsIdentified_UL(EssenceIsIdentified_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Event_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00 };\\n\\n\\t\\tconst UL Event_UL(Event_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EventComment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x04, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EventComment_UL(EventComment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EventEditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x30, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL EventEditRate_UL(EventEditRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EventOrigin_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL EventOrigin_UL(EventOrigin_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EventStartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x03, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL EventStartPosition_UL(EventStartPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EventTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x39, 0x00 };\\n\\n\\t\\tconst UL EventTrack_UL(EventTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtElementNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtElementNames_UL(ExtElementNames_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtElementValues_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtElementValues_UL(ExtElementValues_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtendibleEnumerationElement_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x7e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtendibleEnumerationElement_UL(ExtendibleEnumerationElement_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtensionDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtensionDescription_UL(ExtensionDescription_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtensionScheme_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x26, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtensionScheme_UL(ExtensionScheme_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ExtensionSchemeID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ExtensionSchemeID_UL(ExtensionSchemeID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FieldDominance_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FieldDominance_UL(FieldDominance_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FileDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x25, 0x00 };\\n\\n\\t\\tconst UL FileDescriptor_UL(FileDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FileDescriptors_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x04, 0x06, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL FileDescriptors_UL(FileDescriptors_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Filler_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x09, 0x00 };\\n\\n\\t\\tconst UL Filler_UL(Filler_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FixedArrayElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FixedArrayElementType_UL(FixedArrayElementType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FixedChannelStatusData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FixedChannelStatusData_UL(FixedChannelStatusData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FixedUserData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FixedUserData_UL(FixedUserData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Float32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Float32_UL(Float32_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Float64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Float64_UL(Float64_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Footer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x04, 0x02, 0x00 };\\n\\n\\t\\tconst UL Footer_UL(Footer_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FooterPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x05, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FooterPartition_UL(FooterPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FrameLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL FrameLayout_UL(FrameLayout_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenerationUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL GenerationUID_UL(GenerationUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericDataEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x43, 0x00 };\\n\\n\\t\\tconst UL GenericDataEssenceDescriptor_UL(GenericDataEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x24, 0x00 };\\n\\n\\t\\tconst UL GenericDescriptor_UL(GenericDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericEssenceContainerMultipleWrappings_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x03, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7f, 0x01, 0x00 };\\n\\n\\t\\tconst UL GenericEssenceContainerMultipleWrappings_UL(GenericEssenceContainerMultipleWrappings_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x34, 0x00 };\\n\\n\\t\\tconst UL GenericPackage_UL(GenericPackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericPictureEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x27, 0x00 };\\n\\n\\t\\tconst UL GenericPictureEssenceDescriptor_UL(GenericPictureEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericSoundEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x42, 0x00 };\\n\\n\\t\\tconst UL GenericSoundEssenceDescriptor_UL(GenericSoundEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericStreamPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x11, 0x00 };\\n\\n\\t\\tconst UL GenericStreamPartition_UL(GenericStreamPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GenericTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x38, 0x00 };\\n\\n\\t\\tconst UL GenericTrack_UL(GenericTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 GlobalAUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x03, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL GlobalAUID_UL(GlobalAUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 HMACAlgorithmSHA1128_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x07, 0x02, 0x09, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL HMACAlgorithmSHA1128_UL(HMACAlgorithmSHA1128_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 HeaderByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x09, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL HeaderByteCount_UL(HeaderByteCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 HorizontalSubsampling_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL HorizontalSubsampling_UL(HorizontalSubsampling_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Hours_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Hours_UL(Hours_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ISO7_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ISO7_UL(ISO7_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ISO7String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ISO7String_UL(ISO7String_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IdenticalGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x07, 0x00, 0x00 };\\n\\n\\t\\tconst UL IdenticalGOP_UL(IdenticalGOP_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Identification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x30, 0x00 };\\n\\n\\t\\tconst UL Identification_UL(Identification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Identifications_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL Identifications_UL(Identifications_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ImageAlignmentOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ImageAlignmentOffset_UL(ImageAlignmentOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ImageEndOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ImageEndOffset_UL(ImageEndOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ImageStartOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ImageStartOffset_UL(ImageStartOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexByteCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x09, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexByteCount_UL(IndexByteCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x02, 0x01, 0x01, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexDuration_UL(IndexDuration_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexEditRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x05, 0x30, 0x04, 0x06, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexEditRate_UL(IndexEditRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexEntryArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x02, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexEntryArray_UL(IndexEntryArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexSID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x03, 0x04, 0x05, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexSID_UL(IndexSID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexStartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0a, 0x00, 0x00 };\\n\\n\\t\\tconst UL IndexStartPosition_UL(IndexStartPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IndexTableSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x10, 0x01, 0x00 };\\n\\n\\t\\tconst UL IndexTableSegment_UL(IndexTableSegment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Indirect_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Indirect_UL(Indirect_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 InstanceUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x15, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL InstanceUID_UL(InstanceUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int16_UL(Int16_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int32_UL(Int32_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int32Batch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int32Batch_UL(Int32Batch_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int64_UL(Int64_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int64Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int64Array_UL(Int64Array_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Int8_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Int8_UL(Int8_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 InterchangeObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL InterchangeObject_UL(InterchangeObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IsConcrete_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IsConcrete_UL(IsConcrete_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IsOptional_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IsOptional_UL(IsOptional_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IsSigned_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IsSigned_UL(IsSigned_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IsUniqueIdentifier_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL IsUniqueIdentifier_UL(IsUniqueIdentifier_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 JPEG2000PictureSubDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5a, 0x00 };\\n\\n\\t\\tconst UL JPEG2000PictureSubDescriptor_UL(JPEG2000PictureSubDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 KAGSize_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x03, 0x01, 0x02, 0x01, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL KAGSize_UL(KAGSize_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 KLVFill_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x10, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL KLVFill_UL(KLVFill_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LastModifiedDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL LastModifiedDate_UL(LastModifiedDate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LayoutType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LayoutType_UL(LayoutType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Length_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x06, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Length_UL(Length_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LengthType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LengthType_UL(LengthType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LinkedApplicationPluginInstanceID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LinkedApplicationPluginInstanceID_UL(LinkedApplicationPluginInstanceID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LinkedDescriptiveFrameworkPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LinkedDescriptiveFrameworkPluginID_UL(LinkedDescriptiveFrameworkPluginID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LinkedDescriptiveObjectPluginID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x05, 0x20, 0x07, 0x01, 0x11, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LinkedDescriptiveObjectPluginID_UL(LinkedDescriptiveObjectPluginID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LinkedPackageUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LinkedPackageUID_UL(LinkedPackageUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LinkedTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x03, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LinkedTrackID_UL(LinkedTrackID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LocalIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LocalIdentification_UL(LocalIdentification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LocalTag_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x03, 0x06, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LocalTag_UL(LocalTag_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LocalTagEntries_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x06, 0x01, 0x01, 0x07, 0x15, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LocalTagEntries_UL(LocalTagEntries_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LocalTagType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LocalTagType_UL(LocalTagType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Locator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x31, 0x00 };\\n\\n\\t\\tconst UL Locator_UL(Locator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LocatorName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL LocatorName_UL(LocatorName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Locators_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL Locators_UL(Locators_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Locked_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x02, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Locked_UL(Locked_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LowDelay_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL LowDelay_UL(LowDelay_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MIC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x02, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MIC_UL(MIC_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MICAlgorithm_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x02, 0x09, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MICAlgorithm_UL(MICAlgorithm_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MPEG2VideoDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x51, 0x00 };\\n\\n\\t\\tconst UL MPEG2VideoDescriptor_UL(MPEG2VideoDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFEC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFEC_UL(MXFEC_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGC_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGC_UL(MXFGC_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCAESBWF_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x06, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCAESBWF_UL(MXFGCAESBWF_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCALaw_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0a, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCALaw_UL(MXFGCALaw_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCD10_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCD10_UL(MXFGCD10_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCD11_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCD11_UL(MXFGCD11_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCDV_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCDV_UL(MXFGCDV_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCEncrypted_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCEncrypted_UL(MXFGCEncrypted_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCJP2K_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0c, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCJP2K_UL(MXFGCJP2K_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCMPEGES_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCMPEGES_UL(MXFGCMPEGES_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCMPEGPES_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x07, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCMPEGPES_UL(MXFGCMPEGPES_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCMPEGPS_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x08, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCMPEGPS_UL(MXFGCMPEGPS_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCMPEGTS_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x09, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCMPEGTS_UL(MXFGCMPEGTS_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCMultiple_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x03, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x7f, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFGCMultiple_UL(MXFGCMultiple_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCUncompressed_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCUncompressed_UL(MXFGCUncompressed_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFGCVBI_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0d, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFGCVBI_UL(MXFGCVBI_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP1a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP1a_UL(MXFOP1a_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP1b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP1b_UL(MXFOP1b_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP1c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP1c_UL(MXFOP1c_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP1x_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP1x_UL(MXFOP1x_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP2a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP2a_UL(MXFOP2a_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP2b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP2b_UL(MXFOP2b_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP2c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x03, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP2c_UL(MXFOP2c_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP3a_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP3a_UL(MXFOP3a_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP3b_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP3b_UL(MXFOP3b_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOP3c_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x03, 0x03, 0x01, 0x00 };\\n\\n\\t\\tconst UL MXFOP3c_UL(MXFOP3c_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOPAtom_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFOPAtom_UL(MXFOPAtom_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MXFOPSpecialized_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x00, 0x0d, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MXFOPSpecialized_UL(MXFOPSpecialized_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Major_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Major_UL(Major_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MajorVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x03, 0x01, 0x02, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MajorVersion_UL(MajorVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MaterialPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x36, 0x00 };\\n\\n\\t\\tconst UL MaterialPackage_UL(MaterialPackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MaxGOP_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x08, 0x00, 0x00 };\\n\\n\\t\\tconst UL MaxGOP_UL(MaxGOP_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MemberNames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MemberNames_UL(MemberNames_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MemberTypes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x11, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MemberTypes_UL(MemberTypes_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x24, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDefinition_UL(MetaDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDefinitionDescription_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x14, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDefinitionDescription_UL(MetaDefinitionDescription_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDefinitionIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x13, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDefinitionIdentification_UL(MetaDefinitionIdentification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDefinitionName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x02, 0x04, 0x01, 0x02, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDefinitionName_UL(MetaDefinitionName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1f, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDefinitions_UL(MetaDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaDictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x25, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaDictionary_UL(MetaDictionary_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaReferenceClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaReferenceClassDefinition_UL(MetaReferenceClassDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MetaReferenceTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MetaReferenceTypeDefinition_UL(MetaReferenceTypeDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Minor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Minor_UL(Minor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MinorVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x03, 0x01, 0x02, 0x01, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MinorVersion_UL(MinorVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Minutes_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Minutes_UL(Minutes_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ModificationDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL ModificationDate_UL(ModificationDate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MonoSourceTrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x06, 0x01, 0x01, 0x03, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL MonoSourceTrackIDs_UL(MonoSourceTrackIDs_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Month_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Month_UL(Month_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 MultipleDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x44, 0x00 };\\n\\n\\t\\tconst UL MultipleDescriptor_UL(MultipleDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 NetworkLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x32, 0x00 };\\n\\n\\t\\tconst UL NetworkLocator_UL(NetworkLocator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Numerator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Numerator_UL(Numerator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ObjectClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL ObjectClass_UL(ObjectClass_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ObjectModelVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ObjectModelVersion_UL(ObjectModelVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Opaque_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Opaque_UL(Opaque_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x01, 0x00 };\\n\\n\\t\\tconst UL OpenBodyPartition_UL(OpenBodyPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenCompleteBodyPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x03, 0x03, 0x00 };\\n\\n\\t\\tconst UL OpenCompleteBodyPartition_UL(OpenCompleteBodyPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenCompleteHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x03, 0x00 };\\n\\n\\t\\tconst UL OpenCompleteHeader_UL(OpenCompleteHeader_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenHeader_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL OpenHeader_UL(OpenHeader_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OperationalPattern_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x01, 0x02, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL OperationalPattern_UL(OperationalPattern_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Origin_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL Origin_UL(Origin_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OriginalProperty_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x20, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL OriginalProperty_UL(OriginalProperty_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageCreationDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x01, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageCreationDate_UL(PackageCreationDate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageID_UL(PackageID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageMarkInPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x07, 0x02, 0x01, 0x03, 0x01, 0x0e, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageMarkInPosition_UL(PackageMarkInPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageMarkOutPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x07, 0x02, 0x01, 0x03, 0x02, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageMarkOutPosition_UL(PackageMarkOutPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageMarker_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x04, 0x02, 0x0f, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageMarker_UL(PackageMarker_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageMarkerObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x60, 0x00 };\\n\\n\\t\\tconst UL PackageMarkerObject_UL(PackageMarkerObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageModifiedDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x10, 0x02, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageModifiedDate_UL(PackageModifiedDate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x03, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageName_UL(PackageName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PackageUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x15, 0x10, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PackageUID_UL(PackageUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Packages_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x05, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL Packages_UL(Packages_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PaddingBits_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x18, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PaddingBits_UL(PaddingBits_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Palette_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Palette_UL(Palette_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PaletteLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PaletteLayout_UL(PaletteLayout_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ParentClass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ParentClass_UL(ParentClass_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PartitionArray_UL_Data[16] = { 0x80, 0x62, 0xc1, 0x08, 0xa8, 0x0d, 0xeb, 0xfe, 0x3a, 0x9d, 0xc8, 0xe1, 0x7e, 0x83, 0xb6, 0x4b };\\n\\n\\t\\tconst UL PartitionArray_UL(PartitionArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PartitionMetadata_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x06, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PartitionMetadata_UL(PartitionMetadata_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Patch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Patch_UL(Patch_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakChannels_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakChannels_UL(PeakChannels_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakEnvelopeBlockSize_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakEnvelopeBlockSize_UL(PeakEnvelopeBlockSize_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakEnvelopeData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x01, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakEnvelopeData_UL(PeakEnvelopeData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakEnvelopeFormat_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakEnvelopeFormat_UL(PeakEnvelopeFormat_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakEnvelopeTimestamp_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakEnvelopeTimestamp_UL(PeakEnvelopeTimestamp_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakEnvelopeVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakEnvelopeVersion_UL(PeakEnvelopeVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakFrames_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakFrames_UL(PeakFrames_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PeakOfPeaksPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x0c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PeakOfPeaksPosition_UL(PeakOfPeaksPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PictureComponentSizing_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PictureComponentSizing_UL(PictureComponentSizing_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PictureEssenceCoding_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PictureEssenceCoding_UL(PictureEssenceCoding_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PictureEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PictureEssenceTrack_UL(PictureEssenceTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PixelLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x03, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PixelLayout_UL(PixelLayout_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PlaintextOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x09, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PlaintextOffset_UL(PlaintextOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Platform_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x06, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL Platform_UL(Platform_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PointsPerPeakValue_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x08, 0x04, 0x02, 0x03, 0x01, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PointsPerPeakValue_UL(PointsPerPeakValue_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PosTableCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x04, 0x04, 0x01, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PosTableCount_UL(PosTableCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Position_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x20, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Position_UL(Position_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Preface_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x2f, 0x00 };\\n\\n\\t\\tconst UL Preface_UL(Preface_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PreferredPrefix_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PreferredPrefix_UL(PreferredPrefix_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PreviousPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PreviousPartition_UL(PreviousPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PrimaryPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x04, 0x01, 0x08, 0x00, 0x00 };\\n\\n\\t\\tconst UL PrimaryPackage_UL(PrimaryPackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Primer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x05, 0x01, 0x00 };\\n\\n\\t\\tconst UL Primer_UL(Primer_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x03, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL ProductName_UL(ProductName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ProductUID_UL(ProductUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ProductVersion_UL(ProductVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductVersionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ProductVersionType_UL(ProductVersionType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProfileAndLevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x0a, 0x00, 0x00 };\\n\\n\\t\\tconst UL ProfileAndLevel_UL(ProfileAndLevel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Properties_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Properties_UL(Properties_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL PropertyDefinition_UL(PropertyDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PropertyType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL PropertyType_UL(PropertyType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PropertyWrapperDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x27, 0x00, 0x00 };\\n\\n\\t\\tconst UL PropertyWrapperDefinition_UL(PropertyWrapperDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 QuantizationBits_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x02, 0x03, 0x03, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL QuantizationBits_UL(QuantizationBits_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 QuantizationDefault_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL QuantizationDefault_UL(QuantizationDefault_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RGBACode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x0e, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RGBACode_UL(RGBACode_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RGBAEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x29, 0x00 };\\n\\n\\t\\tconst UL RGBAEssenceDescriptor_UL(RGBAEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RGBALayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RGBALayout_UL(RGBALayout_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RGBALayoutItem_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RGBALayoutItem_UL(RGBALayoutItem_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RandomIndexMetadata_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x11, 0x01, 0x00 };\\n\\n\\t\\tconst UL RandomIndexMetadata_UL(RandomIndexMetadata_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RandomIndexMetadataV10_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x05, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x11, 0x00, 0x00 };\\n\\n\\t\\tconst UL RandomIndexMetadataV10_UL(RandomIndexMetadataV10_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Rational_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Rational_UL(Rational_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RationalArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RationalArray_UL(RationalArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ReferencedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ReferencedType_UL(ReferencedType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Release_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x02, 0x05, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Release_UL(Release_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RenamedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x12, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RenamedType_UL(RenamedType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ReversedByteOrder_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x03, 0x01, 0x02, 0x01, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ReversedByteOrder_UL(ReversedByteOrder_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Root_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Root_UL(Root_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RootExtensions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x7f, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL RootExtensions_UL(RootExtensions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RootFormatVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x19, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RootFormatVersion_UL(RootFormatVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RootPreface_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x06, 0x01, 0x01, 0x07, 0x17, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL RootPreface_UL(RootPreface_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 RoundedTimecodeBase_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x04, 0x01, 0x01, 0x02, 0x06, 0x00, 0x00 };\\n\\n\\t\\tconst UL RoundedTimecodeBase_UL(RoundedTimecodeBase_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Rsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Rsiz_UL(Rsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SMPTE12MTimecodeActiveUserBitsTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SMPTE12MTimecodeActiveUserBitsTrack_UL(SMPTE12MTimecodeActiveUserBitsTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SMPTE12MTimecodeTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SMPTE12MTimecodeTrack_UL(SMPTE12MTimecodeTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SMPTE309MTimecodeTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x01, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SMPTE309MTimecodeTrack_UL(SMPTE309MTimecodeTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SampleRate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x06, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SampleRate_UL(SampleRate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SampledHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SampledHeight_UL(SampledHeight_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SampledWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SampledWidth_UL(SampledWidth_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SampledXOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SampledXOffset_UL(SampledXOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SampledYOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x01, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SampledYOffset_UL(SampledYOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ScanningDirection_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x04, 0x04, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ScanningDirection_UL(ScanningDirection_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Seconds_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Seconds_UL(Seconds_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Segment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00 };\\n\\n\\t\\tconst UL Segment_UL(Segment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Sequence_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x0f, 0x00 };\\n\\n\\t\\tconst UL Sequence_UL(Sequence_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SequenceNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x10, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SequenceNumber_UL(SequenceNumber_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SequenceOffset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x03, 0x02, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SequenceOffset_UL(SequenceOffset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SetElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SetElementType_UL(SetElementType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SignalStandard_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x05, 0x01, 0x13, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SignalStandard_UL(SignalStandard_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SingleSequence_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x06, 0x02, 0x01, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL SingleSequence_UL(SingleSequence_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Size_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Size_UL(Size_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SliceCount_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x04, 0x04, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SliceCount_UL(SliceCount_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SoundEssenceCompression_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x02, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SoundEssenceCompression_UL(SoundEssenceCompression_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SoundEssenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x02, 0x02, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SoundEssenceTrack_UL(SoundEssenceTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceClip_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x11, 0x00 };\\n\\n\\t\\tconst UL SourceClip_UL(SourceClip_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceEssenceContainer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x02, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SourceEssenceContainer_UL(SourceEssenceContainer_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceKey_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SourceKey_UL(SourceKey_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceLength_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x04, 0x06, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SourceLength_UL(SourceLength_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourcePackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x37, 0x00 };\\n\\n\\t\\tconst UL SourcePackage_UL(SourcePackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourcePackageID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x03, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SourcePackageID_UL(SourcePackageID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x10, 0x00 };\\n\\n\\t\\tconst UL SourceReference_UL(SourceReference_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SourceTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x03, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SourceTrackID_UL(SourceTrackID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StartPosition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL StartPosition_UL(StartPosition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StartTimecode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x07, 0x02, 0x01, 0x03, 0x01, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL StartTimecode_UL(StartTimecode_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StaticTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x3a, 0x00 };\\n\\n\\t\\tconst UL StaticTrack_UL(StaticTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StoredF2Offset_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x01, 0x03, 0x02, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StoredF2Offset_UL(StoredF2Offset_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StoredHeight_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StoredHeight_UL(StoredHeight_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StoredWidth_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x02, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StoredWidth_UL(StoredWidth_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Stream_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Stream_UL(Stream_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StringArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StringArray_UL(StringArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StringElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0f, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StringElementType_UL(StringElementType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongRef_UL(StrongRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceCodecDefinition_UL(StrongReferenceCodecDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceComponent_UL(StrongReferenceComponent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0c, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceContainerDefinition_UL(StrongReferenceContainerDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceContentStorage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceContentStorage_UL(StrongReferenceContentStorage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceDataDefinition_UL(StrongReferenceDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceDictionary_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceDictionary_UL(StrongReferenceDictionary_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceEssenceData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceEssenceData_UL(StrongReferenceEssenceData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceEssenceDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceEssenceDescriptor_UL(StrongReferenceEssenceDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceIdentification_UL(StrongReferenceIdentification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceInterpolationDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceInterpolationDefinition_UL(StrongReferenceInterpolationDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceKLVData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x1c, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceKLVData_UL(StrongReferenceKLVData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceKLVDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceKLVDataDefinition_UL(StrongReferenceKLVDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x12, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceLocator_UL(StrongReferenceLocator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceNetworkLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceNetworkLocator_UL(StrongReferenceNetworkLocator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferencePackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x13, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferencePackage_UL(StrongReferencePackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceParameter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x16, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceParameter_UL(StrongReferenceParameter_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x17, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceParameterDefinition_UL(StrongReferenceParameterDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferencePluginDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferencePluginDefinition_UL(StrongReferencePluginDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferencePropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x19, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferencePropertyDefinition_UL(StrongReferencePropertyDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSegment_UL(StrongReferenceSegment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetClassDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetClassDefinition_UL(StrongReferenceSetClassDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetCodecDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetCodecDefinition_UL(StrongReferenceSetCodecDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetContainerDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetContainerDefinition_UL(StrongReferenceSetContainerDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetDataDefinition_UL(StrongReferenceSetDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetEssenceData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetEssenceData_UL(StrongReferenceSetEssenceData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetInterpolationDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetInterpolationDefinition_UL(StrongReferenceSetInterpolationDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetKLVDataDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0d, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetKLVDataDefinition_UL(StrongReferenceSetKLVDataDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetPackage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetPackage_UL(StrongReferenceSetPackage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetParameterDefinition_UL(StrongReferenceSetParameterDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetPluginDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetPluginDefinition_UL(StrongReferenceSetPluginDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetPropertyDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetPropertyDefinition_UL(StrongReferenceSetPropertyDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetTaggedValueDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetTaggedValueDefinition_UL(StrongReferenceSetTaggedValueDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSetTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x05, 0x0c, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSetTypeDefinition_UL(StrongReferenceSetTypeDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceSourceReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceSourceReference_UL(StrongReferenceSourceReference_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceTaggedValueDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceTaggedValueDefinition_UL(StrongReferenceTaggedValueDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x02, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceTrack_UL(StrongReferenceTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorComponent_UL(StrongReferenceVectorComponent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorFileDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0b, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorFileDescriptor_UL(StrongReferenceVectorFileDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorIdentification_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorIdentification_UL(StrongReferenceVectorIdentification_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorKLVData_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorKLVData_UL(StrongReferenceVectorKLVData_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorLocator_UL(StrongReferenceVectorLocator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorParameter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorParameter_UL(StrongReferenceVectorParameter_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorSegment_UL(StrongReferenceVectorSegment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorSubDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorSubDescriptor_UL(StrongReferenceVectorSubDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StrongReferenceVectorTrack_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x06, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL StrongReferenceVectorTrack_UL(StrongReferenceVectorTrack_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StructuralComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00 };\\n\\n\\t\\tconst UL StructuralComponent_UL(StructuralComponent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 StructuralComponents_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x09, 0x00, 0x00 };\\n\\n\\t\\tconst UL StructuralComponents_UL(StructuralComponents_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SubDescriptors_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x04, 0x06, 0x10, 0x00, 0x00 };\\n\\n\\t\\tconst UL SubDescriptors_UL(SubDescriptors_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SymbolSpaceURI_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x06, 0x01, 0x01, 0x07, 0x1c, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL SymbolSpaceURI_UL(SymbolSpaceURI_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TargetSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x03, 0x0b, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TargetSet_UL(TargetSet_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TextLocator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x33, 0x00 };\\n\\n\\t\\tconst UL TextLocator_UL(TextLocator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ThisGenerationUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ThisGenerationUID_UL(ThisGenerationUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ThisPartition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x06, 0x10, 0x10, 0x03, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ThisPartition_UL(ThisPartition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TimeStruct_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TimeStruct_UL(TimeStruct_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TimebaseReferenceTrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0c, 0x06, 0x01, 0x01, 0x03, 0x0e, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TimebaseReferenceTrackID_UL(TimebaseReferenceTrackID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TimecodeComponent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x14, 0x00 };\\n\\n\\t\\tconst UL TimecodeComponent_UL(TimecodeComponent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Timestamp_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Timestamp_UL(Timestamp_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ToolkitVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ToolkitVersion_UL(ToolkitVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Track_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x3b, 0x00 };\\n\\n\\t\\tconst UL Track_UL(Track_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackFileID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x09, 0x06, 0x01, 0x01, 0x06, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackFileID_UL(TrackFileID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackID_UL(TrackID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackIDs_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x04, 0x01, 0x07, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackIDs_UL(TrackIDs_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x07, 0x01, 0x02, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackName_UL(TrackName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x01, 0x04, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackNumber_UL(TrackNumber_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TrackSegment_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x02, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL TrackSegment_UL(TrackSegment_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Tracks_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x04, 0x06, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL Tracks_UL(Tracks_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TransferCharacteristic_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x02, 0x01, 0x01, 0x01, 0x02, 0x00 };\\n\\n\\t\\tconst UL TransferCharacteristic_UL(TransferCharacteristic_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x03, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinition_UL(TypeDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionCharacter_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x23, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionCharacter_UL(TypeDefinitionCharacter_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionEnumeration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x07, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionEnumeration_UL(TypeDefinitionEnumeration_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionExtendibleEnumeration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x20, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionExtendibleEnumeration_UL(TypeDefinitionExtendibleEnumeration_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionFixedArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x08, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionFixedArray_UL(TypeDefinitionFixedArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionIndirect_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x21, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionIndirect_UL(TypeDefinitionIndirect_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionInteger_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x04, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionInteger_UL(TypeDefinitionInteger_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionOpaque_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x22, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionOpaque_UL(TypeDefinitionOpaque_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionRecord_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0d, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionRecord_UL(TypeDefinitionRecord_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionRename_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0e, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionRename_UL(TypeDefinitionRename_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionSet_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0a, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionSet_UL(TypeDefinitionSet_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionStream_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0c, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionStream_UL(TypeDefinitionStream_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x0b, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionString_UL(TypeDefinitionString_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionStrongObjectReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x05, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionStrongObjectReference_UL(TypeDefinitionStrongObjectReference_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionVariableArray_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x09, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionVariableArray_UL(TypeDefinitionVariableArray_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitionWeakObjectReference_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x02, 0x06, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitionWeakObjectReference_UL(TypeDefinitionWeakObjectReference_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TypeDefinitions_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL TypeDefinitions_UL(TypeDefinitions_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt16_UL(UInt16_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt32_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt32_UL(UInt32_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt32Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt32Array_UL(UInt32Array_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt32Batch_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x03, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt32Batch_UL(UInt32Batch_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt64_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt64_UL(UInt64_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt8_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt8_UL(UInt8_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UInt8Array_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x04, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UInt8Array_UL(UInt8Array_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UL_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UL_UL(UL_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UMID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x30, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UMID_UL(UMID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 URLString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL URLString_UL(URLString_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UTF16_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UTF16_UL(UTF16_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UTF16String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x10, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UTF16String_UL(UTF16String_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UTF7String_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x20, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UTF7String_UL(UTF7String_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UUID_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x01, 0x03, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UUID_UL(UUID_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UnknownChunk_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x4f, 0x00 };\\n\\n\\t\\tconst UL UnknownChunk_UL(UnknownChunk_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UserDataMode_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x05, 0x04, 0x02, 0x05, 0x01, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UserDataMode_UL(UserDataMode_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VBIDataDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x5b, 0x00 };\\n\\n\\t\\tconst UL VBIDataDescriptor_UL(VBIDataDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VariableArrayElementType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0d, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL VariableArrayElementType_UL(VariableArrayElementType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Version_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x02, 0x01, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Version_UL(Version_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VersionString_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x05, 0x20, 0x07, 0x01, 0x05, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL VersionString_UL(VersionString_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VersionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL VersionType_UL(VersionType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VerticalSubsampling_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x05, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL VerticalSubsampling_UL(VerticalSubsampling_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VideoLineMap_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x04, 0x01, 0x03, 0x02, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL VideoLineMap_UL(VideoLineMap_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WaveAudioDescriptor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x48, 0x00 };\\n\\n\\t\\tconst UL WaveAudioDescriptor_UL(WaveAudioDescriptor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WeakRef_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WeakRef_UL(WeakRef_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WeakReferenceArrayTypeDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x04, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WeakReferenceArrayTypeDefinition_UL(WeakReferenceArrayTypeDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WeakReferenceParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WeakReferenceParameterDefinition_UL(WeakReferenceParameterDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WeakReferenceSetParameterDefinition_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x05, 0x03, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WeakReferenceSetParameterDefinition_UL(WeakReferenceSetParameterDefinition_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WeakReferencedType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x02, 0x06, 0x01, 0x01, 0x07, 0x0a, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WeakReferencedType_UL(WeakReferencedType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 WhiteReflevel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x04, 0x01, 0x05, 0x03, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL WhiteReflevel_UL(WhiteReflevel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 XOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x04, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL XOsiz_UL(XOsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 XTOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x08, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL XTOsiz_UL(XTOsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 XTsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x06, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL XTsiz_UL(XTsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Xsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x02, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Xsiz_UL(Xsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 YOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x05, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL YOsiz_UL(YOsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 YTOsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x09, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL YTOsiz_UL(YTOsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 YTsiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x07, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL YTsiz_UL(YTsiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Year_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x05, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Year_UL(Year_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Ysiz_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0a, 0x04, 0x01, 0x06, 0x03, 0x03, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL Ysiz_UL(Ysiz_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 msBy4_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x04, 0x01, 0x01, 0x03, 0x01, 0x06, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL msBy4_UL(msBy4_UL_Data);\\n\\n\\n\",\n \"file_path\": \"mxflib/ulmap.h\",\n \"rank\": 2,\n \"score\": 86361.94720784588\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\t/* Standard library features (bits 0 to 30) */\\n\\n\\n\\n\\tconst UInt64 FeatureVersion1KLVFill\\t = UINT64_C(1) << 0;\\t//!< MXFLib feature: Write KLVFill items with the version 1 key\\n\\n\\tconst UInt64 FeatureUnknownsByUL2Name = UINT64_C(1) << 1;\\t//!< MXFLib feature: If an unknown UL is converted to a name during MDObject construction, using UL2NameFunc, check if this name is a known type\\n\\n\\n\\n\\tconst UInt64 FeatureFullDescriptors = UINT64_C(1) << 2;\\t//!< MXFLib feature: Fill in ALL Descriptor properties\\n\\n\\tconst UInt64 FeatureStreamZeroBase = UINT64_C(1) << 3;\\t//!< MXFLib feature: Set GC Essence Element Key StreamBase = 0, not 1\\n\\n\\tconst UInt64 FeatureForceAES\\t\\t = UINT64_C(1) << 4;\\t//!< MXFLib feature: Force PCM to act like AES\\n\\n\\tconst UInt64 FeatureAlignAllStreams\\t = UINT64_C(1) << 5;\\t//!< MXFLib feature: Add alignment between GC Elements of same Type\\n\\n\\n\\n\\t/* This sub-range is currently used by temporary fixes (bits 16 to 30) */\\n\\n\\n\\n\\tconst UInt64 FeatureNegPrechargeIndex = UINT64_C(1) << 16;\\t//!< MXFLib feature: Use -ve indexing for precharge\\n\\n\\tconst UInt64 FeatureRDD9Properties = UINT64_C(1) << 17;\\t//!< MXFLib feature: Do bad things to Descriptor properties\\n\\n\\n\\n\\t/* Reserve a sub-range for user-extensions */\\n\\n\\n\\n\\tconst UInt64 UserExtension = UINT64_C(1) << 31;\\t//!< MXFLib feature: Reserved to allow user extensions\\n\\n\\n\\n\\t/* Non-Standard library functions - may cause non-compliant behaviour (bits 32 to 63) */\\n\\n\\n\\n\\n\\n\\n\\n\\tconst UInt64 FeatureLoadMetadict =\\tUINT64_C(1) << 48;\\t//!< Load any metadict when reading metadata\\n\\n\\tconst UInt64 FeatureSaveMetadict = UINT64_C(1) << 49;\\t//!< Add a KLV metadict when writing metadata (Only contains extension data)\\n\\n\\tconst UInt64 FeatureUsedMetadict = UINT64_C(1) << 50;\\t//!< Write any metadict as a complete version holding all types and sets used in the file along with all known properties of those sets\\n\\n\\tconst UInt64 FeatureFullMetadict = UINT64_C(1) << 51;\\t//!< Write any metadict as a full version holding all known types, sets and properties\\n\\n\\tconst UInt64 FeatureKXSMetadict = UINT64_C(1) << 52;\\t//!< Use version 1b of KLV Encoded Extension Syntax for any metadict\\n\\n\\tconst UInt64 FeatureForceVBRIndex =\\tUINT64_C(1) << 54;\\t//!< Where possible write a VBR index even though CBR makes sense\\n\\n\\tconst UInt64 FeatureNoHeaderIndex = UINT64_C(1) << 55;\\t//!< Do not write index in header, mimic avid files\\n\\n\\n\\n\\n\\n\\n\\n\\t// Declare the features bitmap\\n\\n\\textern UInt64 Features;\\n\\n\\n\\n\\n\\n\\t//! Set an MXFLib library feature (or multiple features)\\n\\n\\t/*! \\\\return true if features set as requested\\n\\n\\t * \\\\note If multiple features are requested and any one is unavailable none will be set\\n\\n\\t *\\n\\n\\t * DRAGONS: This code is written so that it will fold to:\\n\\n\\t * - a simple bit-set if the value of SetValue is known at compile-time and it is enabled and unlocked\\n\\n\\t * - an error message if the value of SetValue is known at compile-time and it is disabled or locked off\\n\\n\\t * - a simple bit-set if the value of SetValue is non known at compile time, but no features are disabled or locked off\\n\\n\\t * - the full function in all other cases\\n\\n\\t */\\n\\n\\tinline bool SetFeature(const UInt64 SetValue)\\n\\n\\t{\\n\\n\\t\\t// Fail if any of the features are disabled\\n\\n\\t\\tif((SetValue & MXFLIB_FEATURE_MASK) != SetValue)\\n\\n\\t\\t{\\n\\n\\t\\t\\terror(\\\"Feature 0x%s is not enabled in the current library\\\\n\\\", Int64toHexString(SetValue).c_str());\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Fail if any of the features are locked (unless they are locked enabled!)\\n\\n\\t\\tif(SetValue & MXFLIB_FEATURE_LOCK)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Check if the locked bits are a problem (the locked value may be \\\"on\\\", which is fine)\\n\\n\\t\\t\\tUInt64 Locked = SetValue & MXFLIB_FEATURE_LOCK;\\n\\n\\t\\t\\tif(Locked & (~MXFLIB_FEATURE_DEFAULT))\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\terror(\\\"Feature 0x%s is locked off in the current library\\\\n\\\", Int64toHexString(SetValue).c_str());\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Set the feature or features\\n\\n\\t\\tFeatures |= SetValue;\\n\\n\\n\\n\\t\\t// All OK\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\t//! Clear an MXFLib library feature (or multiple features)\\n\\n\\t/*! \\\\return true if features cleared as requested\\n\\n\\t * \\\\note If clearing of multiple features is requested and any one is locked on none will be cleared\\n\\n\\t *\\n\\n\\t * DRAGONS: This code is written so that it will fold to:\\n\\n\\t * - a simple bit-clear if the value of SetValue is known at compile-time and it is unlocked\\n\\n\\t * - an error message if the value of SetValue is known at compile-time and it is locked on\\n\\n\\t * - a simple bit-clear if the value of SetValue is non known at compile time, but no features are locked on\\n\\n\\t * - the full function in all other cases\\n\\n\\t */\\n\\n\\tinline bool ClearFeature(const UInt64 ClearValue)\\n\\n\\t{\\n\\n\\t\\t// Fail if any of the features are locked (and they are locked enabled!)\\n\\n\\t\\tif(ClearValue & MXFLIB_FEATURE_LOCK)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Check if the locked bits are a problem (the locked value may be \\\"off\\\", which is fine)\\n\\n\\t\\t\\tUInt64 Locked = ClearValue & MXFLIB_FEATURE_LOCK;\\n\\n\\t\\t\\tif(Locked & MXFLIB_FEATURE_DEFAULT)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\terror(\\\"Feature 0x%s is locked on in the current library\\\\n\\\", Int64toHexString(ClearValue).c_str());\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Clear the feature or features\\n\\n\\t\\tFeatures &= ~ClearValue;\\n\\n\\n\\n\\t\\t// All OK\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\n\\n\\t//! Determine if an MXFLibrary feature is selected (or combination of features are all selected)\\n\\n\\t/* DRAGONS: This code is written so that it will fold to:\\n\\n\\t * - a compile-time result if the value of Value is known at compile-time and it is disabled or locked (on or off)\\n\\n\\t * - a simple bit-test if the value of SetValue is non known at compile time, but no features are disabled or locked\\n\\n\\t * - the full function in all other cases\\n\\n\\t */\\n\\n\\tinline bool Feature(const UInt64 Value)\\n\\n\\t{\\n\\n\\t\\t// If any of the features are disabled don't bother to read it\\n\\n\\t\\tif((Value & MXFLIB_FEATURE_MASK) != Value) return false;\\n\\n\\n\\n\\t\\t// If all of the features are locked simply return the compile-time setting\\n\\n\\t\\tif(Value & MXFLIB_FEATURE_LOCK)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif((Value & MXFLIB_FEATURE_DEFAULT) == Value) return true; else return false;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Run-time test\\n\\n\\t\\tif((Value & Features) == Value) return true; else return false;\\n\\n\\t}\\n\",\n \"file_path\": \"mxflib/features.h\",\n \"rank\": 3,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\ttypedef struct sopSAXHandlerStruct sopSAXHandler;\\n\\n\\ttypedef sopSAXHandler *sopSAXHandlerPtr;\\n\\n\\n\\n\\n\\n\\t/* Function pointer definitions */\\n\\n\\ttypedef void (*startElementSAXFunc) (void *, const char *, const char **);\\n\\n\\ttypedef void (*endElementSAXFunc) (void *, const char *);\\n\\n\\ttypedef void (*warningSAXFunc) (void *, const char *msg, ...);\\n\\n\\ttypedef void (*errorSAXFunc) (void *, const char *msg, ...);\\n\\n\\ttypedef void (*fatalErrorSAXFunc) (void *, const char *msg, ...);\\n\\n\\n\\n\\n\\n\\t/* Handler structure */\\n\\n\\tstruct sopSAXHandlerStruct\\n\\n\\t{\\n\\n\\t\\tstartElementSAXFunc startElement;\\t\\t/* startElement */\\n\\n\\t\\tendElementSAXFunc endElement;\\t\\t\\t/* endElement */\\n\\n\\t\\twarningSAXFunc warning;\\t\\t\\t\\t\\t/* warning */\\n\\n\\t\\terrorSAXFunc error;\\t\\t\\t\\t\\t\\t/* error */\\n\\n\\t\\tfatalErrorSAXFunc fatalError;\\t\\t\\t/* fatalError */\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\t/* Function Prototypes */\\n\\n\\tbool sopSAXParseFile(sopSAXHandlerPtr sax, void *UserData, const char *filename);\\n\",\n \"file_path\": \"mxflib/sopsax.h\",\n \"rank\": 4,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n#ifdef MXFLIB_DEBUG\\n\\n\\tvoid debug(const char *Fmt, ...);\\t\\t\\t\\t\\t\\t//!< Display a general debug message\\n\\n#else\\n\\n\\tinline void debug(const char *Fmt, ...) { return; };\\t//!< Make debug messages optimise out\\n\\n#endif\\n\\n\\n\\n\\tvoid warning(const char *Fmt, ...);\\t\\t\\t\\t\\t\\t//!< Display a warning message\\n\\n\\tvoid error(const char *Fmt, ...);\\t\\t\\t\\t\\t\\t//!< Display an error message\\n\",\n \"file_path\": \"mxflib/debug.h\",\n \"rank\": 5,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\t//! Load dictionary from the specified legacy format XML definitions with a default symbol space\\n\\n\\t/*! \\\\return 0 if all OK\\n\\n\\t * \\\\return -1 on error\\n\\n\\t */\\n\\n\\tint LoadLegacyDictionary(const char *DictFile, SymbolSpacePtr DefaultSymbolSpace, bool FastFail = false);\\n\\n\\n\\n\\t//! Load dictionary from the specified legacy format XML definitions with a default symbol space\\n\\n\\t/*! \\\\return 0 if all OK\\n\\n\\t * \\\\return -1 on error\\n\\n\\t */\\n\\n\\tinline int LoadLegacyDictionary(std::string DictFile, SymbolSpacePtr DefaultSymbolSpace, bool FastFail = false)\\n\\n\\t{\\n\\n\\t\\treturn LoadLegacyDictionary(DictFile.c_str(), DefaultSymbolSpace, FastFail );\\n\",\n \"file_path\": \"mxflib/legacytypes.h\",\n \"rank\": 6,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\ttypedef UInt8 Uint8;\\n\\n\\ttypedef UInt16 Uint16;\\n\\n\\ttypedef UInt32 Uint32;\\n\\n\\ttypedef UInt64 Uint64;\\n\\n\\tinline std::string Uint64toString(Uint64 Val) { return UInt64toString(Val); }\\n\",\n \"file_path\": \"mxflib/system.h\",\n \"rank\": 7,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib {\\n\\n\\n\\n\\t//! types of XML output format\\n\\n\\tenum XML_Type_t {\\n\\n\\t\\tXML_Type_None,\\n\\n\\t\\tXML_Type_Default,\\n\\n\\t\\tXML_Type_AAFx,\\n\\n\\t\\tXML_Type_AAF_XML,\\t// pre-std RegXML per AAFSDK 1.1.4\\n\\n\\t\\tXML_Type_MXFixer,\\n\\n\\t\\tXML_Type_RegXML,\\t// SMPTE 2001 once it is approved\\n\\n\\t\\tXML_Type_SMPTE_434\\n\\n\\t};\\n\\n\\n\\n\\t//! XML output options struct\\n\\n\\ttypedef struct _XML_options_t {\\n\\n\\n\\n\\t\\tXML_Type_t XMLType;\\n\\n\\n\\n\\t} XML_options_t;\\n\\n\\n\\n\\t//! Dump an MDObject\\n\\n\\tvoid DumpObject( MDObjectPtr Object, std::string PrefixString, bool bare = false );\\n\\n\\n\",\n \"file_path\": \"mxflib/dumpobject.h\",\n \"rank\": 8,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\t/*\\n\\n\\t** PutUxx() - Put unsigned xx-bit integer\\n\\n\\t*/\\n\\n\\tinline void PutU8(UInt8 x, unsigned char *dest) { *dest=(x); }\\n\\n\\tinline void PutU16(UInt16 Data, unsigned char *Dest) { PutU8(Data >> 8, Dest); PutU8(Data & 0xff, &Dest[1]); }\\n\\n\\tinline void PutU32(UInt32 Data, unsigned char *Dest) { PutU16(Data >> 16, Dest); PutU16(Data & 0xffff, &Dest[2]); }\\n\\n\\tinline void PutU64(UInt64 Data, unsigned char *Dest) { PutU32((UInt32)(Data >> 32), Dest); \\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t PutU32((UInt32)Data & 0xffffffff, &Dest[4]); }\\n\\n\\n\\n\\t/*\\n\\n\\t** PutIxx() - Signed versions of PutUxx()\\n\\n\\t*/\\n\\n\\tinline void PutI8(Int8 x, unsigned char *dest) { PutU8((UInt8)x,dest); }\\n\\n\\tinline void PutI16(Int16 x, unsigned char *dest) { PutU16((UInt16)x,dest); }\\n\\n\\tinline void PutI32(Int32 x, unsigned char *dest) { PutU32((UInt32)x,dest); }\\n\\n\\tinline void PutI64(Int64 x, unsigned char *dest) { PutU64((UInt64)x,dest); }\\n\\n\\n\\n\\t/*\\n\\n\\t** GetUxx() - Get unsigned xx-bit integer\\n\\n\\t*/\\n\\n\\tinline UInt8 GetU8(const unsigned char *src) { return (UInt8) *src; }\\n\\n\\tinline UInt16 GetU16(const unsigned char *src) { return (GetU8(src) << 8) | GetU8(&src[1]); }\\n\\n\\tinline UInt32 GetU32(const unsigned char *src) { return (GetU16(src) << 16) | GetU16(&src[2]); }\\n\\n\\tinline UInt64 GetU64(const unsigned char *src) { return (((UInt64)GetU32(src)) << 32) | (GetU32(&src[4])); }\\n\\n\\n\\n\\t/*\\n\\n\\t** GetIxx() - Signed versions of GetUxx()\\n\\n\\t*/\\n\\n\\tinline Int8 GetI8(const unsigned char *src) { return (Int8)GetU8(src); }\\n\\n\\tinline Int16 GetI16(const unsigned char *src) { return (Int16)GetU16(src); }\\n\\n\\tinline Int32 GetI32(const unsigned char *src) { return (Int32)GetU32(src); }\\n\\n\\tinline Int64 GetI64(const unsigned char *src) { return (Int64)GetU64(src); }\\n\\n\\n\\n\\t/*\\n\\n\\t** PutUxx_LE() - Put LITTLE ENDIAN unsigned xx-bit integer\\n\\n\\t*/\\n\\n\\tinline void PutU8_LE(UInt8 x, unsigned char *dest) { *dest=(x); }\\n\\n\\tinline void PutU16_LE(UInt16 Data, unsigned char *Dest) { PutU8_LE(Data & 0xff, Dest); PutU8_LE(Data >> 8, &Dest[1]); }\\n\\n\\tinline void PutU32_LE(UInt32 Data, unsigned char *Dest) { PutU16_LE(Data & 0xffff, Dest); PutU16_LE(Data >> 16, &Dest[2]); }\\n\\n\\tinline void PutU64_LE(UInt64 Data, unsigned char *Dest) { PutU32_LE((UInt32)(Data & 0xffffffff), Dest); \\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t PutU32_LE((UInt32)(Data >> 32), &Dest[4]); }\\n\\n\\n\\n\\t/*\\n\\n\\t** PutIxx_LE() - Signed versions of PutUxx_LE()\\n\\n\\t*/\\n\\n\\tinline void PutI8_LE(Int8 x, unsigned char *dest) { PutU8_LE((UInt8)x,dest); }\\n\\n\\tinline void PutI16_LE(Int16 x, unsigned char *dest) { PutU16_LE((UInt16)x,dest); }\\n\\n\\tinline void PutI32_LE(Int32 x, unsigned char *dest) { PutU32_LE((UInt32)x,dest); }\\n\\n\\tinline void PutI64_LE(Int64 x, unsigned char *dest) { PutU64_LE((UInt64)x,dest); }\\n\\n\\n\\n\\t/*\\n\\n\\t** GetUxx_LE() - Get LITTLE ENDIAN unsigned xx-bit integer\\n\\n\\t*/\\n\\n\\tinline UInt8 GetU8_LE(const unsigned char *src) { return (UInt8) *src; }\\n\\n\\tinline UInt16 GetU16_LE(const unsigned char *src) { return GetU8_LE(src) | (GetU8_LE(&src[1]) << 8); }\\n\\n\\tinline UInt32 GetU32_LE(const unsigned char *src) { return GetU16_LE(src) | (GetU16_LE(&src[2]) << 16); }\\n\\n\\tinline UInt64 GetU64_LE(const unsigned char *src) { return GetU32_LE(src) | ((UInt64)(GetU32_LE(&src[4])) << 32); }\\n\\n\\n\\n\\t/*\\n\\n\\t** GetIxx_LE() - Signed versions of GetUxx_LE()\\n\\n\\t*/\\n\\n\\tinline Int8 GetI8_LE(const unsigned char *src) { return (Int8)GetU8_LE(src); }\\n\\n\\tinline Int16 GetI16_LE(const unsigned char *src) { return (Int16)GetU16_LE(src); }\\n\\n\\tinline Int32 GetI32_LE(const unsigned char *src) { return (Int32)GetU32_LE(src); }\\n\\n\\tinline Int64 GetI64_LE(const unsigned char *src) { return (Int64)GetU64_LE(src); }\\n\\n\\n\",\n \"file_path\": \"mxflib/endian.h\",\n \"rank\": 9,\n \"score\": 86356.08929983043\n },\n {\n \"content\": \"\\tnamespace mxflib\\n\\n\\t{\\n\\n\\t\\tconst UInt8 AS_12_ShimName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x01 };\\n\\n\\t\\tconst UL AS_12_ShimName_UL(AS_12_ShimName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AS_12_Slate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x02 };\\n\\n\\t\\tconst UL AS_12_Slate_UL(AS_12_Slate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS_AS_12_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMS_AS_12_UL(DMS_AS_12_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS_AS_12_AdID_Slate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL DMS_AS_12_AdID_Slate_UL(DMS_AS_12_AdID_Slate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMS_AS_12_Framework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL DMS_AS_12_Framework_UL(DMS_AS_12_Framework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AS_12_DescriptiveObject_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0c, 0x01, 0x02, 0x00 };\\n\\n\\t\\tconst UL AS_12_DescriptiveObject_UL(AS_12_DescriptiveObject_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ad_title_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x03, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL ad_title_UL(ad_title_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 adid_code_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x02, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL adid_code_UL(adid_code_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 adid_prefix_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x01, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL adid_prefix_UL(adid_prefix_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 advertiser_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x06, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL advertiser_UL(advertiser_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 agency_office_location_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x07, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL agency_office_location_UL(agency_office_location_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 brand_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x04, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL brand_UL(brand_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 length_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x08, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL length_UL(length_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 product_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x0d, 0x0d, 0x0d, 0x01, 0x05, 0x00, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL product_UL(product_UL_Data);\\n\\n\\n\",\n \"file_path\": \"mxflib/dict_DMS_AS_03.h\",\n \"rank\": 10,\n \"score\": 84981.41102193357\n },\n {\n \"content\": \"using namespace std;\\n\",\n \"file_path\": \"mxflib/dumpobject.h\",\n \"rank\": 11,\n \"score\": 81110.09081996424\n },\n {\n \"content\": \"namespace mxflib\\n\\n{\\n\\n\\t// Operational Pattern Labels\\n\\n\\t// ==========================\\n\\n\\t// DRAGONS: These are often just the degenerate labels - Qualifiers need to be filled in later!\\n\\n\\n\\n\\t// OP-Atom - #### DRAGONS: Qualifiers need work later!\\n\\n\\t// Note: pre mxflib 0.5.3, byte 8 version was erroneously = 01\\n\\n\\tconst UInt8 OPAtom_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\tconst UL OPAtomUL(OPAtom_Data);\\n\\n\\n\\n\\tconst UInt8 OPAtom_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x02, 0x0d, 0x01, 0x02, 0x01, 0x10, 0x00, 0x00, 0x00 };\\n\\n\\tconst UL OPAtom_UL(OPAtom_UL_Data);\\n\\n\\n\\n\\t// OP1a - #### DRAGONS: Qualifiers may need work!\\n\\n\\tconst UInt8 OP1a_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\tconst UL OP1aUL(OP1a_Data);\\n\\n\\n\\n\\t// OP1b - #### DRAGONS: Qualifiers need work!\\n\\n\\tconst UInt8 OP1b_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x01, 0x02, 0x05, 0x00 };\\n\\n\\tconst UL OP1bUL(OP1b_Data);\\n\\n\\n\\n\\t// OP2a - #### DRAGONS: Qualifiers need work!\\n\\n\\tconst UInt8 OP2a_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01, 0x00 };\\n\\n\\tconst UL OP2aUL(OP2a_Data);\\n\\n\\n\\n\\t// OP2b - #### DRAGONS: Qualifiers need work!\\n\\n\\tconst UInt8 OP2b_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x02, 0x01, 0x02, 0x02, 0x05, 0x00 };\\n\\n\\tconst UL OP2bUL(OP2b_Data);\\n\",\n \"file_path\": \"libprocesswrap/opmap.h\",\n \"rank\": 12,\n \"score\": 80455.43522530445\n },\n {\n \"content\": \"\\t//! Version for VBI usage of ANCVBISource\\n\\n\\tclass VBISource : public ANCVBISource\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tVBISource(EssenceSource *Master = NULL) : ANCVBISource(Master) {};\\n\\n\\n\\n\\t\\t//! Get the GCEssenceType to use when wrapping this essence in a Generic Container\\n\\n\\t\\tvirtual UInt8 GetGCElementType(void) { return 0x01; }\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\t//! Get the wrapping UL to use\\n\\n\\t\\tvirtual ULPtr GetWrappingUL(void)\\n\\n\\t\\t{\\n\\n\\t\\t\\tconst UInt8 WrappingUL[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x09, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0d, 0x00, 0x00 };\\n\\n\\t\\t\\treturn new UL(WrappingUL);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\t//! Smart pointer to ANCVBISource\\n\\n\\ttypedef SmartPtr<ANCVBISource> ANCVBISourcePtr;\\n\\n\\n\\n\\t//! Alias for ANC usage of ANCVBISourcePtr\\n\\n\\ttypedef ANCVBISourcePtr ANCSourcePtr;\\n\\n\\n\\n\\t//! Alias for VBI usage of ANCVBISourcePtr\\n\\n\\ttypedef ANCVBISourcePtr VBISourcePtr;\\n\\n\\n\\n\\n\",\n \"file_path\": \"mxflib/vbi.h\",\n \"rank\": 13,\n \"score\": 80216.26160409968\n },\n {\n \"content\": \"\\t//! Version for ANC usage of ANCVBISource\\n\\n\\tclass ANCSource : public ANCVBISource\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tANCSource(EssenceSource *Master = NULL) : ANCVBISource(Master) {};\\n\\n\\n\\n\\t\\t//! Get the GCEssenceType to use when wrapping this essence in a Generic Container\\n\\n\\t\\tvirtual UInt8 GetGCElementType(void) { return 0x02; }\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\t//! Get the wrapping UL to use\\n\\n\\t\\tvirtual ULPtr GetWrappingUL(void)\\n\\n\\t\\t{\\n\\n\\t\\t\\tconst UInt8 WrappingUL[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x09, 0x0d, 0x01, 0x03, 0x01, 0x02, 0x0e, 0x00, 0x00 };\\n\\n\\t\\t\\treturn new UL(WrappingUL);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/vbi.h\",\n \"rank\": 14,\n \"score\": 80216.26160409968\n },\n {\n \"content\": \"\\t//! Class for essence source that supplies system items\\n\\n\\tclass SystemSource : public EssenceSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tEssenceSourceParent Master;\\t\\t\\t\\t\\t\\t\\t\\t//!< The master stream for this essence\\n\\n\\t\\tGCStreamID SMPackID;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Stream ID of the system metadata pack\\n\\n\\t\\tGCStreamID PMPackID;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Stream ID of the package metadata pack\\n\\n\\t\\tUInt16 ContinuityCount;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Continuity count as per SMPTE 385M\\n\\n\\t\\tint FPS;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Integer frame rate value (25 or 30)\\n\\n\\t\\tbool Rate1001;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< True if FSP is a (n*1000) / 1001 rate\\n\\n\\t\\tUInt8 EssenceLabel[16];\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< The essence container label\\n\\n\\t\\tbool DropFrame;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< True if timecode is using drop-frame counting\\n\\n\\t\\tUInt8 EssenceBitmap;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Bitmap flags for essence items, bit 1 = 1 if data, bit 2 = 1 if sound, bit 3 = 1 if picture\\n\\n\\t\\tBodyStream *Stream;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Our parent stream\\n\\n\\t\\tDataChunk CreationDate;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< A pre-formatted 17-byte chunk holding the creation date/time, or an empty chunk if not set\\n\\n\\t\\tDataChunk TimecodeData;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< A pre-formatted 17-byte chunk holding the timecode, or an empty chunk if not set\\n\\n\\t\\tDataChunk UMIDData;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< A pre-formatted chunk holding the UMID data for the Package Item, or an empty chunk if not set\\n\\n\\t\\tDataChunk KLVData;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< A pre-formatted chunk holding the KLV metadata for the Package Item, or an empty chunk if not set\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tSystemSource(EssenceSource *MasterSource, const UL &WrappingUL) : EssenceSource()\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 15,\n \"score\": 80216.1963906149\n },\n {\n \"content\": \"\\tclass SourceClip;\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 16,\n \"score\": 78617.61180730443\n },\n {\n \"content\": \"\\tclass EssenceSource;\\n\\n\\n\\n\\t//! Return the MXF version as the year of the main MXF specification document\\n\\n\\t/*! /ret 2004 if we are writing files as per SMPTE 377M-2004\\n\\n\\t *! /ret 2009 if we are writing files as per SMPTE 377-1-2009\\n\\n\\t */\\n\\n\\tint MXFVersion(void);\\n\\n\\n\\n\\t//! Set the MXF version as the year of the main MXF specification document\\n\\n\\t/*! Use 2004 if we are writing files as per SMPTE 377M-2004\\n\\n\\t *! Use 2009 if we are writing files as per SMPTE 377-1-2009\\n\\n\\t */\\n\\n\\tvoid SetMXFVersion(int Year);\\n\\n\\n\\n\\t// Declare the global null-ul which is 16 zero bytes\\n\\n\\textern const UL Null_UL;\\n\\n//_atoi64 is s wondows only - rewrite to linux version\\n\\n#ifndef _WIN32\\n\\n#define _atoi64 atoll\\n\\n#endif\\n\",\n \"file_path\": \"mxflib/helper.h\",\n \"rank\": 17,\n \"score\": 78617.61180730443\n },\n {\n \"content\": \"\\tMXFLIB_DICTIONARY_END\\n\\n\\n\\n\\n\\n\\t// Define ULs for the global keys in this dictionary\\n\\n\\tnamespace AS_11\\n\\n\\t{\\n\\n\\t\\tconst UInt8 AS11CoreFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL AS11CoreFramework_UL(AS11CoreFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AS11CoreSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL AS11CoreSchemeLabel_UL(AS11CoreSchemeLabel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AS11SegmentationFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x00 };\\n\\n\\t\\tconst UL AS11SegmentationFramework_UL(AS11SegmentationFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AS11SegmentationSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x00, 0x00 };\\n\\n\\t\\tconst UL AS11SegmentationSchemeLabel_UL(AS11SegmentationSchemeLabel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioComments_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x14, 0x00 };\\n\\n\\t\\tconst UL AudioComments_UL(AudioComments_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioDescriptionPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x19, 0x00 };\\n\\n\\t\\tconst UL AudioDescriptionPresent_UL(AudioDescriptionPresent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioDescriptionType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1a, 0x00 };\\n\\n\\t\\tconst UL AudioDescriptionType_UL(AudioDescriptionType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioLoudnessStandard_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x13, 0x00 };\\n\\n\\t\\tconst UL AudioLoudnessStandard_UL(AudioLoudnessStandard_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AudioTrackLayout_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x05 };\\n\\n\\t\\tconst UL AudioTrackLayout_UL(AudioTrackLayout_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 AFD_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x05, 0x01, 0x0b, 0x01, 0x01, 0x05 };\\n\\n\\t\\tconst UL AFD_UL(AFD_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedCaptionsLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x09 };\\n\\n\\t\\tconst UL ClosedCaptionsLanguage_UL(ClosedCaptionsLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedCaptionsPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x07 };\\n\\n\\t\\tconst UL ClosedCaptionsPresent_UL(ClosedCaptionsPresent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ClosedCaptionsType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x08 };\\n\\n\\t\\tconst UL ClosedCaptionsType_UL(ClosedCaptionsType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CompletionDate_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x20, 0x00 };\\n\\n\\t\\tconst UL CompletionDate_UL(CompletionDate_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContactEmail_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x24, 0x00 };\\n\\n\\t\\tconst UL ContactEmail_UL(ContactEmail_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ContactTelephoneNo_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x25, 0x00 };\\n\\n\\t\\tconst UL ContactTelephoneNo_UL(ContactTelephoneNo_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 CopyrightYear_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x04, 0x00 };\\n\\n\\t\\tconst UL CopyrightYear_UL(CopyrightYear_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 DMSegmentationFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL DMSegmentationFramework_UL(DMSegmentationFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Distributor_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x08, 0x00 };\\n\\n\\t\\tconst UL Distributor_UL(Distributor_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 EpisodeTitleNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x03 };\\n\\n\\t\\tconst UL EpisodeTitleNumber_UL(EpisodeTitleNumber_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FPAManufacturer_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0e, 0x00 };\\n\\n\\t\\tconst UL FPAManufacturer_UL(FPAManufacturer_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FPAPass_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x00 };\\n\\n\\t\\tconst UL FPAPass_UL(FPAPass_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 FPAVersion_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0f, 0x00 };\\n\\n\\t\\tconst UL FPAVersion_UL(FPAVersion_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Genre_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x07, 0x00 };\\n\\n\\t\\tconst UL Genre_UL(Genre_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 IdentClockStart_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x16, 0x00 };\\n\\n\\t\\tconst UL IdentClockStart_UL(IdentClockStart_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 LineUpStart_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x15, 0x00 };\\n\\n\\t\\tconst UL LineUpStart_UL(LineUpStart_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenCaptionsLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1d, 0x00 };\\n\\n\\t\\tconst UL OpenCaptionsLanguage_UL(OpenCaptionsLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenCaptionsPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1b, 0x00 };\\n\\n\\t\\tconst UL OpenCaptionsPresent_UL(OpenCaptionsPresent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OpenCaptionsType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1c, 0x00 };\\n\\n\\t\\tconst UL OpenCaptionsType_UL(OpenCaptionsType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Originator_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x03, 0x00 };\\n\\n\\t\\tconst UL Originator_UL(Originator_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OtherIdentifier_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x05, 0x00 };\\n\\n\\t\\tconst UL OtherIdentifier_UL(OtherIdentifier_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 OtherIdentifierType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x06, 0x00 };\\n\\n\\t\\tconst UL OtherIdentifierType_UL(OtherIdentifierType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PartNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x01 };\\n\\n\\t\\tconst UL PartNumber_UL(PartNumber_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PartTotal_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x02, 0x01, 0x02 };\\n\\n\\t\\tconst UL PartTotal_UL(PartTotal_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PictureRatio_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x09, 0x00 };\\n\\n\\t\\tconst UL PictureRatio_UL(PictureRatio_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 PrimaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x06 };\\n\\n\\t\\tconst UL PrimaryAudioLanguage_UL(PrimaryAudioLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductPlacement_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0c, 0x00 };\\n\\n\\t\\tconst UL ProductPlacement_UL(ProductPlacement_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProductionNumber_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00 };\\n\\n\\t\\tconst UL ProductionNumber_UL(ProductionNumber_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProgrammeHasText_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x22, 0x00 };\\n\\n\\t\\tconst UL ProgrammeHasText_UL(ProgrammeHasText_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProgrammeTextLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x23, 0x00 };\\n\\n\\t\\tconst UL ProgrammeTextLanguage_UL(ProgrammeTextLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ProgrammeTitle_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x02 };\\n\\n\\t\\tconst UL ProgrammeTitle_UL(ProgrammeTitle_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SecondaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x11, 0x00 };\\n\\n\\t\\tconst UL SecondaryAudioLanguage_UL(SecondaryAudioLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SeriesTitle_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x01 };\\n\\n\\t\\tconst UL SeriesTitle_UL(SeriesTitle_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ShimName_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x01, 0x07, 0x01, 0x0b, 0x01, 0x01, 0x04 };\\n\\n\\t\\tconst UL ShimName_UL(ShimName_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SignLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1f, 0x00 };\\n\\n\\t\\tconst UL SignLanguage_UL(SignLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 SigningPresent_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x1e, 0x00 };\\n\\n\\t\\tconst UL SigningPresent_UL(SigningPresent_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 Synopsis_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x02, 0x00 };\\n\\n\\t\\tconst UL Synopsis_UL(Synopsis_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TertiaryAudioLanguage_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x12, 0x00 };\\n\\n\\t\\tconst UL TertiaryAudioLanguage_UL(TertiaryAudioLanguage_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TextlessElementsExist_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x21, 0x00 };\\n\\n\\t\\tconst UL TextlessElementsExist_UL(TextlessElementsExist_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ThreeD_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0a, 0x00 };\\n\\n\\t\\tconst UL ThreeD_UL(ThreeD_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 ThreeDType_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x0b, 0x00 };\\n\\n\\t\\tconst UL ThreeDType_UL(ThreeDType_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TotalNumberOfParts_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x17, 0x00 };\\n\\n\\t\\tconst UL TotalNumberOfParts_UL(TotalNumberOfParts_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 TotalProgrammeDuration_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00 };\\n\\n\\t\\tconst UL TotalProgrammeDuration_UL(TotalProgrammeDuration_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UKDPPFramework_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x02, 0x53, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x00, 0x00 };\\n\\n\\t\\tconst UL UKDPPFramework_UL(UKDPPFramework_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 UKDPPSchemeLabel_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x04, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x00, 0x00, 0x00 };\\n\\n\\t\\tconst UL UKDPPSchemeLabel_UL(UKDPPSchemeLabel_UL_Data);\\n\\n\\n\\n\\t\\tconst UInt8 VideoComments_UL_Data[16] = { 0x06, 0x0e, 0x2b, 0x34, 0x01, 0x01, 0x01, 0x01, 0x0d, 0x0c, 0x01, 0x01, 0x01, 0x01, 0x10, 0x00 };\\n\\n\\t\\tconst UL VideoComments_UL(VideoComments_UL_Data);\\n\\n\\n\",\n \"file_path\": \"mxflib/dict_as11.h\",\n \"rank\": 18,\n \"score\": 77456.04504559484\n },\n {\n \"content\": \"\\t//! An essence source for sub-streams that slave from a master stream\\n\\n\\tclass EssenceSubSource : public EssenceSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tEssenceSourceParent MasterSource;\\t\\t//!< The EssenceSource for the master source\\n\\n\\t\\tWrappingOptionPtr SelectedWrapping;\\t\\t//!< The selected wrapping options\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t//! Base constructor\\n\\n\\t\\tEssenceSubSource(EssenceSource *Master = NULL) : MasterSource(Master) {};\\n\\n\\n\\n\\t\\t//! Virtual destructor to allow polymorphism\\n\\n\\t\\tvirtual ~EssenceSubSource() {};\\n\\n\\n\\n\\t\\t//! Set a new master after construction (useful if the master source is not known at construction time) \\n\\n\\t\\tvoid SetMaster(EssenceSource *Master)\\n\\n\\t\\t{\\n\\n\\t\\t\\tMasterSource = Master;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t//! Get a pointer to the current master source, this may be NULL if it is not yet defined\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 19,\n \"score\": 76900.55598803768\n },\n {\n \"content\": \"\\t//! Essence source class to be used as the output of AudioDemux objects\\n\\n\\tclass AudioDemuxSource : public EssenceSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tAudioDemuxParent Parent;\\t\\t\\t//!< The parent demux object\\n\\n\\t\\tint Channel;\\t\\t\\t\\t\\t\\t//!< The number of our first channel (zero being the first in the outer source)\\n\\n\\t\\tint ChannelCount;\\t\\t\\t\\t\\t//!< The number of channels to read at a time (e.g. ChannelCount = 2 give a stereo pair)\\n\\n\\t\\tbool Eoi;\\t\\t\\t\\t\\t\\t\\t//!< True if the last GetEssenceData() call completed a wrapping item\\n\\n\\n\\n\\t\\tLength BytesPerEditUnit;\\t\\t\\t//!< The size of an edit unit, if constant, else zero. Set to -1 when not known\\n\\n\\t\\tUInt32 BPEUKAGSize;\\t\\t\\t\\t\\t//!< The KAGSize used to calculate BytesPerEditUnit\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tAudioDemuxSource();\\t\\t\\t\\t\\t//!< Prevent default construction\\n\\n\\t\\tAudioDemuxSource(AudioDemux&);\\t\\t//!< Prevent copy construction\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t/*! \\\\param Channel The number of the first channel to read with the new source (zero being the first in the outer source)\\n\\n\\t\\t * \\\\param ChannelCount The number of channels to read at a time (e.g. ChannelCount = 2 give a stereo pair)\\n\\n\\t\\t */\\n\\n\\t\\tAudioDemuxSource(AudioDemux *Parent, unsigned int Channel, unsigned int ChannelCount = 1) \\n\",\n \"file_path\": \"mxflib/audiomux.h\",\n \"rank\": 20,\n \"score\": 76900.24200014865\n },\n {\n \"content\": \"\\t\\t//! Essence Source that manages a sequence of essence sources from a list of file patterns\\n\\n\\t\\tclass SequentialEssenceSource : public EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tprotected:\\n\\n\\t\\t\\tEssenceSourcePtr CurrentSource;\\t\\t\\t\\t//!< An EssenceSource for the current source file\\n\\n\\t\\t\\tFileParserPtr Outer;\\t\\t\\t\\t\\t\\t//!< The outer file parser which is owned by us to prevent it being released until be are done\\n\\n\\t\\t\\tLength PreviousLength;\\t\\t\\t\\t\\t\\t//!< The total size of all previously read essence sources for this set\\n\\n\\t\\t\\tbool VBRIndexMode;\\t\\t\\t\\t\\t\\t\\t//!< Are we needing to use VBRIndexMode for this essence?\\n\\n\\t\\t\\t\\n\\n\\t\\t\\t//! Option pair for OptionList\\n\\n\\t\\t\\ttypedef std::pair<std::string, Int64> OptionPair;\\n\\n\\t\\t\\t\\n\\n\\t\\t\\t//! List of all options set for this source\\n\\n\\t\\t\\tstd::list<OptionPair> OptionList;\\n\\n\\n\\n\\t\\t\\t//! Prevent default construction\\n\\n\\t\\t\\tSequentialEssenceSource();\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct a SequentialEssenceSource\\n\\n\\t\\t\\tSequentialEssenceSource(FileParser *Outer) : Outer(Outer), PreviousLength(0), VBRIndexMode(false) {}\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 21,\n \"score\": 76895.58375280364\n },\n {\n \"content\": \"\\t//! Holds data relating to a DMSourceClip\\n\\n\\tclass DMSourceClip : public SourceClip\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\t//! Protected constructor used to create from an existing MDObject\\n\\n\\t\\tDMSourceClip(MDObjectPtr BaseObject) : SourceClip(BaseObject) {}\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tDMSourceClip(std::string BaseType) : SourceClip(BaseType) {};\\n\\n\\t\\tDMSourceClip(MDOTypePtr BaseType) : SourceClip(BaseType) {};\\n\\n\\t\\tDMSourceClip(const UL &BaseUL) : SourceClip(BaseUL) {};\\n\\n\\t\\tDMSourceClip(ULPtr &BaseUL) : SourceClip(BaseUL) {};\\n\\n\\n\\n\\t\\t//! Return the containing \\\"DMSourceClip\\\" object for this MDObject\\n\\n\\t\\t/*! \\\\return NULL if MDObject is not contained in a SourceClip object\\n\\n\\t\\t */\\n\\n\\t\\tstatic DMSourceClipPtr GetDMSourceClip(MDObjectPtr Object);\\n\\n\\n\\n\\t\\t//! Parse an existing MDObject into a DMSourceClip object\\n\\n\\t\\tstatic DMSourceClipPtr Parse(MDObjectPtr BaseObject);\\n\\n\\t};\\n\\n}\\n\\n\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 22,\n \"score\": 76894.75852668207\n },\n {\n \"content\": \"\\t//! Class that holds the ANC or VBI data for a frame and supplies it as an EssenceSource\\n\\n\\tclass ANCVBISource : public EssenceSubSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tANCVBILineSourceList Sources;\\t\\t//!< List of line sources used to build lines\\n\\n\\n\\n\\t\\tANCVBILineMap Lines;\\t\\t\\t\\t//!< Map of lines built for this frame\\n\\n\\n\\n\\t\\tDataChunkList BufferedData;\\t\\t\\t//!< List of data items prepared and ready to be supplied in response to GetEssenceData() - next to be supplied is the head\\n\\n\\n\\n\\t\\tsize_t BufferOffset;\\t\\t\\t\\t//!< An offset into the current data buffer if we are returning a partial chunk in GetEssenceData()\\n\\n\\n\\n\\t\\tPosition CurrentPosition;\\t\\t\\t//!< Our current position. This is relative to the start of the stream, so the first edit unit is always 0\\n\\n\\n\\n\\t\\tint F2Offset;\\t\\t\\t\\t\\t\\t//!< The offset to add to field 2 line numbers (0 if no field 2, -1 if unknown)\\n\\n\\n\\n\\t\\tPosition EndAtPosition;\\t\\t\\t\\t//!< The position at which we end (0 for slave from master, -1 for not yet set)\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t//! Base constructor\\n\\n\\t\\tANCVBISource(EssenceSource *Master = NULL) : EssenceSubSource(Master), BufferOffset(0), CurrentPosition(0), F2Offset(-1), EndAtPosition(-1) {};\\n\",\n \"file_path\": \"mxflib/vbi.h\",\n \"rank\": 23,\n \"score\": 76894.57129089406\n },\n {\n \"content\": \"\\t\\tclass ESP_EssenceSource : public EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tprotected:\\n\\n\\t\\t\\tEssenceSubParserPtr Caller;\\n\\n\\t\\t\\tFileHandle File;\\n\\n\\t\\t\\tUInt32 Stream;\\n\\n\\t\\t\\tUInt64 RequestedCount;\\n\\n\\t\\t\\tIndexTablePtr Index;\\n\\n\\t\\t\\tDataChunkPtr RemainingData;\\n\\n\\t\\t\\tbool AtEndOfData;\\n\\n\\t\\t\\tbool Started;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tCaller = TheCaller;\\n\\n\\t\\t\\t\\tFile = InFile;\\n\\n\\t\\t\\t\\tStream = UseStream;\\n\\n\\t\\t\\t\\tRequestedCount = Count;\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 24,\n \"score\": 76888.94732715066\n },\n {\n \"content\": \"\\tclass RangedEssenceSource : public EssenceSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tEssenceSourcePtr Base;\\t\\t\\t\\t\\t\\t\\t\\t//!< The source being filtered\\n\\n\\t\\tPosition CurrentPosition;\\t\\t\\t\\t\\t\\t\\t//!< The current position, stream relative not range relative\\n\\n\\t\\tPosition RequestedStart;\\t\\t\\t\\t\\t\\t\\t//!< The requested first edit unit\\n\\n\\t\\tPosition RequestedEnd;\\t\\t\\t\\t\\t\\t\\t\\t//!< The requested last edit unit, or -1 if using RequestedDuration\\n\\n\\t\\tLength RequestedDuration;\\t\\t\\t\\t\\t\\t\\t//!< The requested duration, or -1 if using RequestedEnd\\n\\n\\n\\n\\t\\tbool Started;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Set true once we have skipped the edit units before any pre-charge\\n\\n\\t\\tbool Ending;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Set true once beyond the end of the range, but not necessarily done with the overrun\\n\\n\\t\\tbool Ended;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Set true once the overrun is done\\n\\n\\n\\n\\t\\tPosition PreChargeStart;\\t\\t\\t\\t\\t\\t\\t//!< The first edit unit in any pre-charge\\n\\n\\t\\tDataChunkList PreCharge;\\t\\t\\t\\t\\t\\t\\t//!< Buffers of pre-charge essence\\n\\n\\n\\n\\t\\tDataChunkPtr FirstData;\\t\\t\\t\\t\\t\\t\\t\\t//!< The first edit unit following any pre-charge (as we will need to read it to check the pre-charge size)\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\t//! Prevent a default constructor\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 25,\n \"score\": 76888.94732715066\n },\n {\n \"content\": \"\\t//! Class for holding a description of an essence stream \\n\\n\\tclass EssenceStreamDescriptor;\\n\\n\\n\\n\\t//! A smart pointer to a EssenceStreamDescriptor object\\n\\n\\ttypedef SmartPtr<EssenceStreamDescriptor> EssenceStreamDescriptorPtr;\\n\\n\\n\\n\\t//! A list of smart pointers to EssenceStreamDescriptor objects\\n\\n\\ttypedef std::list<EssenceStreamDescriptorPtr> EssenceStreamDescriptorList;\\n\\n\\n\\n\\t/*! \\\\page SubStreamNotes Notes on Sub-Streams\\n\\n\\t * \\\\section SubStreams1 Sub-Streams Introduction\\n\\n\\t * Certain essence streams may have intimate data related to the essence that is linked as a substream.\\n\\n\\t * \\\\section SubParserSubStreams Sub-Streams in EssenceSubParsers\\n\\n\\t * An EssenceSubParser may produce a main EssenceSource with sub-streams which are EssenceSources whose \\n\\n\\t * data is extracted during the parsing that produces the main source's data. These SubStreams are indicated\\n\\n\\t * by members of the EssenceStreamDescriptor::SubStreams properties of members of the EssenceStreamDescriptorList\\n\\n\\t * returned by a call to EssenceSubParserBase::IdentifyEssence(). This in turn gets propogated to the \\n\\n\\t * EssenceParser::WrapingConfig::SubStreams properties of members of the EssenceParser::WrapingConfigList\\n\\n\\t * returned by a call to EssenceParser::ListWrappingOptions().\\n\\n\\t *\\n\\n\\t * The value of EssenceStreamDescriptor::ID, and hence EssenceParser::WrapingConfig::Stream, will differ\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 26,\n \"score\": 73923.4727817756\n },\n {\n \"content\": \"\\t// Forward declare the demux output source class\\n\\n\\tclass AudioDemuxSource;\\n\\n\\n\\n\\t// A Smart pointer to an AudioDemuxSource object\\n\\n\\ttypedef SmartPtr<AudioDemuxSource> AudioDemuxSourcePtr;\\n\\n\\n\\n\\t// A parent pointer to an AudioDemuxSource object\\n\\n\\ttypedef ParentPtr<AudioDemuxSource> AudioDemuxSourceParent;\\n\\n\\n\\n\\n\",\n \"file_path\": \"mxflib/audiomux.h\",\n \"rank\": 27,\n \"score\": 73901.68874945595\n },\n {\n \"content\": \"\\tclass DMSourceClip;\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 28,\n \"score\": 73895.87754992454\n },\n {\n \"content\": \"\\t//! Simple AFD line source\\n\\n\\tclass SimpleAFDSource : public ANCVBILineSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tUInt8 CurrentAFD;\\t\\t\\t\\t\\t\\t\\t\\t//!< Current value of the AFD, will insert this value each frame\\n\\n\\t\\tint FieldNum;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Field number in which to insert this AFD\\n\\n\\t\\tint LineNum;\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Line number in field to insert this AFD\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t//! Construct from binary value\\n\\n\\t\\tSimpleAFDSource(UInt8 AFDValue, int Field, int Line) : CurrentAFD(AFDValue), FieldNum(Field), LineNum(Line) {};\\n\\n\\n\\n\\t\\t//! Construct from text value\\n\\n\\t\\tSimpleAFDSource(std::string AFDText, int Field, int Line) : FieldNum(Field), LineNum(Line) \\n\\n\\t\\t{\\n\\n\\t\\t\\tCurrentAFD = TextToAFD(AFDText);\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\t//! Allow polymorphic destructors\\n\\n\\t\\tvirtual ~SimpleAFDSource() {};\\n\\n\\n\",\n \"file_path\": \"mxflib/vbi.h\",\n \"rank\": 29,\n \"score\": 73844.95933130838\n },\n {\n \"content\": \"\\tclass EssenceSource : public RefCount<EssenceSource>\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\t//! Holds the stream ID for this essence stream when added to a GCWriter\\n\\n\\t\\t/*! This value is persisted here between calls to a GCWriter via BodyWriter or similar.\\n\\n\\t\\t * Set to -1 if no stream ID yet set.\\n\\n\\t\\t */\\n\\n\\t\\tGCStreamID StreamID;\\n\\n\\t\\t\\n\\n\\t\\t//! Index manager to use if we can index the essence\\n\\n\\t\\tIndexManagerPtr IndexMan;\\n\\n\\n\\n\\t\\t//! Sub-stream ID to use for our index data if we can index the essence\\n\\n\\t\\tint IndexStreamID;\\n\\n\\n\\n\\t\\t//! If the default essence key has been overridden for this source it is stored here\\n\\n\\t\\tDataChunkPtr SpecifiedKey;\\n\\n\\n\\n\\t\\t//! True if the default essence key has been overridden with a key that does not use GC track number mechanism\\n\\n\\t\\tbool NonGC;\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 30,\n \"score\": 73839.01622453978\n },\n {\n \"content\": \"\\t//! A smart pointer to a SourceClip object (with operator[] overload)\\n\\n\\tclass SourceClipPtr : public SmartPtr<SourceClip>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! Build a NULL pointer\\n\\n\\t\\tSourceClipPtr() : SmartPtr<SourceClip>() {}\\n\\n\\n\\n\\t\\t//! Build a pointer to an existing object\\n\\n\\t\\t/*! \\\\note The IRefCount has to be to a Component because that is what SourceClip is derived from */\\n\\n\\t\\tSourceClipPtr(IRefCount<Component> * ptr) : SmartPtr<SourceClip>((IRefCount<SourceClip> *)ptr) {}\\n\\n\\n\\n\\t\\t//! Child access operators that overcome dereferencing problems with SmartPtrs\\n\\n\\t\\tMDObjectPtr operator[](const char *ChildName);\\n\\n\\t\\tMDObjectPtr operator[](MDOTypePtr ChildType);\\n\\n\\t\\tMDObjectPtr operator[](const UL &ChildType);\\n\\n\\t\\tMDObjectPtr operator[](ULPtr &ChildType);\\n\\n\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 31,\n \"score\": 71033.52882985433\n },\n {\n \"content\": \"\\tclass RangedEssenceSubSource : public EssenceSubSource\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tEssenceSourcePtr Base;\\t\\t\\t\\t\\t\\t\\t\\t//!< The source being filtered\\n\\n\\t\\tPosition RequestedStart;\\t\\t\\t\\t\\t\\t\\t//!< The requested first edit unit\\n\\n\\t\\tPosition RequestedEnd;\\t\\t\\t\\t\\t\\t\\t\\t//!< The requested last edit unit, or -1 if using RequestedDuration\\n\\n\\t\\tLength RequestedDuration;\\t\\t\\t\\t\\t\\t\\t//!< The requested duration, or -1 if using RequestedEnd\\n\\n\\n\\n\\t\\tbool Started;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Set true once we are ready to start reading\\n\\n\\t\\tbool Ended;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Set true once the range is done\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\t//! Prevent a default constructor\\n\\n\\t\\tRangedEssenceSubSource();\\n\\n\\n\\n\\t\\t//! Prevent copy construction\\n\\n\\t\\tRangedEssenceSubSource(const RangedEssenceSource &);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t// Base constructor\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 32,\n \"score\": 71027.78141228095\n },\n {\n \"content\": \"using namespace mxflib;\\n\",\n \"file_path\": \"libprocesswrap/opmap.h\",\n \"rank\": 33,\n \"score\": 69731.78750782346\n },\n {\n \"content\": \"using namespace mxflib;\\n\",\n \"file_path\": \"libprocesswrap/process.h\",\n \"rank\": 34,\n \"score\": 69731.78750782346\n },\n {\n \"content\": \"\\t//! Holds data relating to a SourceClip\\n\\n\\tclass SourceClip : public Component\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\n\\n\\t\\t//! Common construction code\\n\\n\\t\\tvoid Init(void)\\n\\n\\t\\t{\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t//! Protected constructor used to create from an existing MDObject\\n\\n\\t\\tSourceClip(MDObjectPtr BaseObject) : Component(BaseObject) { Init(); }\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tSourceClip(std::string BaseType) : Component(BaseType) { Init(); };\\n\\n\\t\\tSourceClip(MDOTypePtr BaseType) : Component(BaseType) { Init(); };\\n\\n\\t\\tSourceClip(const UL &BaseUL) : Component(BaseUL) { Init(); };\\n\\n\\t\\tSourceClip(ULPtr &BaseUL) : Component(BaseUL) { Init(); };\\n\\n\\n\\n\\n\\n\\t\\t//! Make a link to a specified track\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 35,\n \"score\": 69715.05568676494\n },\n {\n \"content\": \"\\tclass EssenceStreamDescriptor : public RefCount<EssenceStreamDescriptor>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! Construct with any optional items cleared\\n\\n\\t\\tEssenceStreamDescriptor() : StartTimecode(0) {}\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tUInt32 ID;\\t\\t\\t\\t\\t\\t\\t\\t//!< ID for this essence stream\\n\\n\\t\\tstd::string Description;\\t\\t\\t\\t//!< Description of this essence stream\\n\\n\\t\\tUUID SourceFormat;\\t\\t\\t\\t\\t\\t//!< A UUID (or byte-swapped UL) identifying the source format\\n\\n\\t\\tMDObjectPtr Descriptor;\\t\\t\\t\\t\\t//!< Pointer to an actual essence descriptor for this stream\\n\\n\\t\\tEssenceStreamDescriptorList SubStreams;\\t//!< A list of sub-streams that can be derived from this stream. See \\\\ref SubStreamNotes\\n\\n\\t\\tPosition StartTimecode;\\t\\t\\t\\t\\t//!< The starting timecode of this essence, if known, or zero\\n\\n\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 36,\n \"score\": 68457.42446379681\n },\n {\n \"content\": \"\\t//! Superclass for objects that supply data to be wrapped by an ANCVBISource\\n\\n\\tclass ANCVBILineSource : public RefCount<ANCVBILineSource>\\n\\n\\t{\\n\\n\\tprotected:\\n\\n\\t\\tEssenceSourceParent Parent;\\t\\t\\t\\t\\t\\t//!< The ANCVBISource that owns this line source\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t//! Get the field number for the supplied ANC/VBI line\\n\\n\\t\\tvirtual int GetField(void) = 0;\\n\\n\\n\\n\\t\\t//! Get the line number within the field for the supplied ANC/VBI line\\n\\n\\t\\tvirtual int GetLineNumber(void) = 0;\\n\\n\\n\\n\\t\\t//! Get the SMPTE 436M wrapping type for this line\\n\\n\\t\\tvirtual ANCWrappingType GetWrappingType(void) = 0;\\n\\n\\n\\n\\t\\t//! Get the SMPTE 436M sample coding for this line\\n\\n\\t\\tvirtual ANCSampleCoding GetSampleCoding(void) = 0;\\n\\n\\n\\n\\t\\t//! Get the next line of data to wrap\\n\\n\\t\\tvirtual DataChunkPtr GetLineData(void) = 0;\\n\",\n \"file_path\": \"mxflib/vbi.h\",\n \"rank\": 37,\n \"score\": 68433.37769034416\n },\n {\n \"content\": \"\\t//! A smart pointer to a DMSourceClip object (with operator[] overload)\\n\\n\\tclass DMSourceClipPtr : public SmartPtr<DMSourceClip>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! Build a NULL pointer\\n\\n\\t\\tDMSourceClipPtr() : SmartPtr<DMSourceClip>() {}\\n\\n\\n\\n\\t\\t//! Build a pointer to an existing object\\n\\n\\t\\t/*! \\\\note The IRefCount has to be to a Component because that is what DMSourceClip is derived from */\\n\\n\\t\\tDMSourceClipPtr(IRefCount<Component> * ptr) : SmartPtr<DMSourceClip>((IRefCount<DMSourceClip> *)ptr) {}\\n\\n\\n\\n\\t\\t//! Child access operators that overcome dereferencing problems with SmartPtrs\\n\\n\\t\\tMDObjectPtr operator[](const char *ChildName);\\n\\n\\t\\tMDObjectPtr operator[](MDOTypePtr ChildType);\\n\\n\\t\\tMDObjectPtr operator[](const UL &ChildType);\\n\\n\\t\\tMDObjectPtr operator[](ULPtr &ChildType);\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/metadata.h\",\n \"rank\": 38,\n \"score\": 66020.82385365084\n },\n {\n \"content\": \"\\tbool UseIndex\\t;\\t\\t\\t\\t\\t\\t//!< Write complete index tables\\n\",\n \"file_path\": \"libprocesswrap/process.h\",\n \"rank\": 39,\n \"score\": 65999.51548227791\n },\n {\n \"content\": \"\\tbool IncludeSubstreams;\\t\\t\\t\\t\\t//!< Should sub-streams also be wrapped\\n\",\n \"file_path\": \"libprocesswrap/process.h\",\n \"rank\": 40,\n \"score\": 65999.51548227791\n },\n {\n \"content\": \"using namespace mxflib;\\n\",\n \"file_path\": \"libprocesswrap/process_utils.h\",\n \"rank\": 41,\n \"score\": 65992.84893587037\n },\n {\n \"content\": \"using namespace mxflib;\\n\",\n \"file_path\": \"libprocesswrap/process_metadata.h\",\n \"rank\": 42,\n \"score\": 65992.84893587037\n },\n {\n \"content\": \"\\t//! List of pairs of essence parser pointers with associated file descriptors\\n\\n\\tclass ParserDescriptorList : public RefCount<ParserDescriptorList>, public std::list<ParserDescriptorPair> {};\\n\\n\\ttypedef SmartPtr<ParserDescriptorList> ParserDescriptorListPtr;\\n\\n\\n\\n\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 43,\n \"score\": 64596.353533565074\n },\n {\n \"content\": \"\\t// Forware declare MDObjectPtr and EssenceSource\\n\\n\\tclass MDObjectPtr;\\n\",\n \"file_path\": \"mxflib/helper.h\",\n \"rank\": 44,\n \"score\": 63912.761412228494\n },\n {\n \"content\": \"\\tclass MDObjectPtr;\\n\\n}\\n\\n\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\\n\\t//! Soft limit for strings returned by MDTraits\\n\\n\\t/*! \\\\note This is a soft limit in that it is not enforced strictly.\\n\\n\\t * It is possible for string values to be returned that are longer than this value, but where\\n\\n\\t *\\t\\t the string is built by several passes around a loop that loop should exit once this value\\n\\n\\t *\\t\\t has been reached\\n\\n\\t *\\n\\n * TODO: Apply this limit to everywhere it is required!!\\n\\n\\t */\\n\\n\\textern UInt32 MDTraits_StringLimit;\\n\\n\\n\\n\\t//! Set the string size soft limit\\n\\n\\tinline void SetStringLimit(UInt32 StringLimit) { MDTraits_StringLimit = StringLimit; }\\n\\n\\n\\n\\t//! Get the current string size soft limit\\n\",\n \"file_path\": \"mxflib/mdtraits.h\",\n \"rank\": 45,\n \"score\": 63907.01399465511\n },\n {\n \"content\": \"\\tclass MDObjectPtr;\\n\",\n \"file_path\": \"mxflib/typeif.h\",\n \"rank\": 46,\n \"score\": 63907.01399465511\n },\n {\n \"content\": \"\\t\\t//! Class for EssenceSource objects for parsing/sourcing <Type> essence\\n\\n\\t\\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tprotected:\\n\\n\\t\\t\\tsize_t BytesRemaining;\\t\\t\\t\\t\\t\\t\\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\\n\\n\\t\\t\\t\\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tBytesRemaining = 0;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the size of the essence data in bytes\\n\\n\\t\\t\\t/*! \\\\note There is intentionally no support for an \\\"unknown\\\" response \\n\\n\\t\\t\\t */\\n\\n\\t\\t\\tvirtual size_t GetEssenceDataSize(void) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tTEMPLATE_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, TEMPLATE_EssenceSubParser);\\n\\n\\t\\t\\t\\treturn pCaller->ReadInternal(File, Stream, RequestedCount);\\n\",\n \"file_path\": \"mxflib/esp_template.h\",\n \"rank\": 47,\n \"score\": 61682.55573922708\n },\n {\n \"content\": \"\\t\\t//! Class for EssenceSource objects for parsing/sourcing <Type> essence\\n\\n\\t\\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\\n\\n\\t\\t\\t\\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the size of the essence data in bytes\\n\\n\\t\\t\\t/*! \\\\note There is intentionally no support for an \\\"unknown\\\" response \\n\\n\\t\\t\\t */\\n\\n\\t\\t\\tvirtual size_t GetEssenceDataSize(void) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tJP2K_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, JP2K_EssenceSubParser);\\n\\n\\t\\t\\t\\treturn pCaller->ReadInternal(File, Stream, RequestedCount);\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the next \\\"installment\\\" of essence data\\n\\n\\t\\t\\t/*! \\\\return Pointer to a data chunk holding the next data or a NULL pointer when no more remains\\n\",\n \"file_path\": \"mxflib/esp_jp2k.h\",\n \"rank\": 48,\n \"score\": 61682.55573922708\n },\n {\n \"content\": \"\\t\\t//! Class for EssenceSource objects for parsing/sourcing MPEG-VES essence\\n\\n\\t\\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tprotected:\\n\\n\\t\\t\\tsize_t BytesRemaining;\\t\\t\\t\\t\\t\\t\\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1)\\n\\n\\t\\t\\t\\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tBytesRemaining = 0;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the size of the essence data in bytes\\n\\n\\t\\t\\t/*! \\\\note There is intentionally no support for an \\\"unknown\\\" response \\n\\n\\t\\t\\t */\\n\\n\\t\\t\\tvirtual size_t GetEssenceDataSize(void) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tMPEG2_VES_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, MPEG2_VES_EssenceSubParser);\\n\\n\\t\\t\\t\\t\\n\",\n \"file_path\": \"mxflib/esp_mpeg2ves.h\",\n \"rank\": 49,\n \"score\": 61682.51341797262\n },\n {\n \"content\": \"\\t\\t//! Class for EssenceSource objects for parsing/sourcing DV-DIF essence\\n\\n\\t\\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\\n\\n\\t\\t\\t\\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tDV_DIF_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, DV_DIF_EssenceSubParser);\\n\\n\\n\\n\\t\\t\\t\\tif(pCaller->SelectedWrapping->ThisWrapType == WrappingOption::Clip) RequestedCount = 0;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the size of the essence data in bytes\\n\\n\\t\\t\\t/*! \\\\note There is intentionally no support for an \\\"unknown\\\" response \\n\\n\\t\\t\\t */\\n\\n\\t\\t\\tvirtual size_t GetEssenceDataSize(void) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tDV_DIF_EssenceSubParser *pCaller = SmartPtr_Cast(Caller, DV_DIF_EssenceSubParser);\\n\\n\\t\\t\\t\\treturn pCaller->ReadInternal(File, Stream, RequestedCount/*, Index*/);\\n\\n\\t\\t\\t};\\n\",\n \"file_path\": \"mxflib/esp_dvdif.h\",\n \"rank\": 50,\n \"score\": 61682.51341797262\n },\n {\n \"content\": \"\\t\\t//! Class for EssenceSource objects for parsing/sourcing MPEG-VES essence\\n\\n\\t\\tclass ESP_EssenceSource : public EssenceSubParserBase::ESP_EssenceSource\\n\\n\\t\\t{\\n\\n\\t\\tprotected:\\n\\n\\t\\t\\tsize_t BytesRemaining;\\t\\t\\t\\t\\t\\t\\t//!< The number of bytes remaining in a multi-part GetEssenceData, or zero if not part read\\n\\n\\n\\n\\t\\t\\tbool PaddingEnabled;\\t\\t\\t\\t\\t\\t\\t//!< Is padding after the end of the essence stream enabled? Used when audio input is less than video\\n\\n\\t\\t\\tDataChunkPtr PaddingChunk;\\t\\t\\t\\t\\t\\t//!< A chunk containing padding bytes (if required) for use in GetPadding()\\n\\n\\t\\t\\tInt64 ExtraSamples;\\t\\t\\t\\t\\t\\t\\t //!< Number of extra samples to output after end of frame\\n\\n\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t//! Construct and initialise for essence parsing/sourcing\\n\\n\\t\\t\\tESP_EssenceSource(EssenceSubParserPtr TheCaller, FileHandle InFile, UInt32 UseStream, UInt64 Count = 1/*, IndexTablePtr UseIndex = NULL*/)\\n\\n\\t\\t\\t\\t: EssenceSubParserBase::ESP_EssenceSource(TheCaller, InFile, UseStream, Count/*, UseIndex*/) \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tBytesRemaining = 0;\\n\\n\\t\\t\\t\\tPaddingEnabled = false;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\t//! Get the size of the essence data in bytes\\n\",\n \"file_path\": \"mxflib/esp_wavepcm.h\",\n \"rank\": 51,\n \"score\": 61682.51341797262\n },\n {\n \"content\": \"\\t// Extended implementations\\n\\n\\tclass MDTraits_BasicInt : public MDTraits\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! A unique name for this trait\\n\\n\\t\\tvirtual std::string Name() const { return \\\"mxflib::MDTraits_BasicInt\\\"; };\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual void SetInt64(MDObject *Object, Int64 Val);\\n\\n\\t\\tvirtual void SetUInt(MDObject *Object, UInt32 Val);\\n\\n\\t\\tvirtual void SetUInt64(MDObject *Object, UInt64 Val);\\n\\n\\t\\tvirtual void SetString(MDObject *Object, std::string Val);\\n\\n\\t\\tvirtual Int64 GetInt64(const MDObject *Object) const;\\n\\n\\t\\tvirtual UInt64 GetUInt64(const MDObject *Object) const;\\n\\n\\t\\tvirtual std::string GetString(const MDObject *Object) const;\\n\\n\\n\\n //Overridden to avoid partial overriden virtual function issues with ICC\\n\\n virtual std::string GetString(const MDObject *Object, OutputFormatEnum Format) const { return GetString(Object); }\\n\\n\\n\\n\\t\\tvirtual size_t ReadValue(MDObject *Object, const UInt8 *Buffer, size_t Size, int Count=0);\\n\\n\\t};\\n\\n\\n\\n\\t//! Special unsigned integer ReadValue\\n\\n\\tsize_t ReadValueUInt(MDObject *Object, const UInt8 *Buffer, size_t Size, int Count=0);\\n\\n\\n\",\n \"file_path\": \"mxflib/mdtraits.h\",\n \"rank\": 52,\n \"score\": 59604.26416957685\n },\n {\n \"content\": \"\\tclass MDTraits_Int16 : public MDTraits_BasicInt\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! A unique name for this trait\\n\\n\\t\\tvirtual std::string Name() const { return \\\"mxflib::MDTraits_Int16\\\"; };\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual void SetInt(MDObject *Object, Int32 Val);\\n\\n\\t\\tvirtual Int32 GetInt(const MDObject *Object) const;\\n\\n\\t\\tvirtual UInt32 GetUInt(const MDObject *Object) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/mdtraits.h\",\n \"rank\": 53,\n \"score\": 56851.20020699433\n },\n {\n \"content\": \"\\tclass MDTraits_Int32 : public MDTraits_BasicInt\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! A unique name for this trait\\n\\n\\t\\tvirtual std::string Name() const { return \\\"mxflib::MDTraits_Int32\\\"; };\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual void SetInt(MDObject *Object, Int32 Val);\\n\\n\\t\\tvirtual Int32 GetInt(const MDObject *Object) const;\\n\\n\\t\\tvirtual UInt32 GetUInt(const MDObject *Object) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/mdtraits.h\",\n \"rank\": 54,\n \"score\": 56851.20020699433\n },\n {\n \"content\": \"\\tclass MDTraits_Int8 : public MDTraits_BasicInt\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! A unique name for this trait\\n\\n\\t\\tvirtual std::string Name() const { return \\\"mxflib::MDTraits_Int8\\\"; };\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tvirtual void SetInt(MDObject *Object, Int32 Val);\\n\\n\\t\\tvirtual Int32 GetInt(const MDObject *Object) const;\\n\\n\\t\\tvirtual UInt32 GetUInt(const MDObject *Object) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/mdtraits.h\",\n \"rank\": 55,\n \"score\": 56851.20020699433\n },\n {\n \"content\": \"struct tm mxflib::StringToTm(std::string String)\\n\\n{\\n\\n\\tstruct tm Time;\\n\\n\\tTime.tm_isdst = 0;\\n\\n\\n\\n\\tif(String.length() < 18)\\n\\n\\t{\\n\\n\\t\\tTime.tm_year = 0;\\n\\n\\t\\tTime.tm_mon = 0;\\n\\n\\t\\tTime.tm_mday = 0;\\n\\n\\t\\tTime.tm_hour = 0;\\n\\n\\t\\tTime.tm_min = 0;\\n\\n\\t\\tTime.tm_sec = 0;\\n\\n\\t\\treturn Time;\\n\\n\\t}\\n\\n\\n\\n\\tTime.tm_year = atoi(&String.c_str()[0]) - 1970;\\n\\n\\tTime.tm_mon = atoi(&String.c_str()[5]) - 1;\\n\\n\\tTime.tm_mday = atoi(&String.c_str()[8]);\\n\\n\\tTime.tm_hour = atoi(&String.c_str()[11]);\\n\",\n \"file_path\": \"mxflib/helper.cpp\",\n \"rank\": 56,\n \"score\": 52681.55245362313\n },\n {\n \"content\": \"\\tclass BodyStream : public RefCount<BodyStream>, public EssenceSourceList\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\t//! Define the action required next for this stream\\n\\n\\t\\tenum StateType\\n\\n\\t\\t{\\n\\n\\t\\t\\tBodyStreamStart = 0,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< This stream has not yet done anything - state unknown\\n\\n\\t\\t\\tBodyStreamHeadIndex,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write a \\\"header\\\" index table - if required in an isolated partition following the header\\n\\n\\t\\t\\tBodyStreamPreBodyIndex,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write an isolated index table before the next body partition\\n\\n\\t\\t\\tBodyStreamBodyWithIndex,\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write a body partition with an index table\\n\\n\\t\\t\\tBodyStreamBodyNoIndex,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write a body partition without index table\\n\\n\\t\\t\\tBodyStreamPostBodyIndex,\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write an isolated index table after a body partition\\n\\n\\t\\t\\tBodyStreamFootIndex,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< Next action: Write a \\\"footer\\\" index table - if required in an isolated partition before the footer\\n\\n\\t\\t\\tBodyStreamDone\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< All done - no more actions required\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\t//! The index table type or types of this stream\\n\\n\\t\\tenum IndexType\\n\\n\\t\\t{\\n\\n\\t\\t\\tStreamIndexNone = 0,\\t\\t\\t\\t\\t\\t\\t\\t\\t//!< No index table will be written\\n\",\n \"file_path\": \"mxflib/essence.h\",\n \"rank\": 57,\n \"score\": 49913.59438482755\n },\n {\n \"content\": \"\\tMXFLIB_TYPE_END\\n\\n\\n\\n\\t// Types definitions converted from file ./dict.xml\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 58,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\t\\tMXFLIB_DICTIONARY_CLASSES(DictData_Classes_10)\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 59,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\t\\tMXFLIB_CLASS_SET_END\\n\\n\\tMXFLIB_CLASS_END\\n\\n\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 60,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\t\\tMXFLIB_DICTIONARY_TYPES(DictData_Types_8)\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 61,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\t\\tMXFLIB_DICTIONARY_CLASSES(DictData_Classes_8)\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 62,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\tMXFLIB_TYPE_END\\n\\n\\n\\n\\t// Class definitions converted from file ./dict.xml\\n\",\n \"file_path\": \"mxflib/dict.h\",\n \"rank\": 63,\n \"score\": 45684.801582741486\n },\n {\n \"content\": \"\\t//! A smart pointer to an MDObject object (with operator[] overloads)\\n\\n\\tclass MDObjectPtr : public SmartPtr<MDObject>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tMDObjectPtr() : SmartPtr<MDObject>() {};\\n\\n\\t\\tMDObjectPtr(IRefCount<MDObject> * ptr) : SmartPtr<MDObject>(ptr) {};\\n\\n\\t\\tMDObjectPtr(MDObjectParent ptr);\\n\\n\\n\\n\\t\\t//! Child access operators that overcome dereferencing problems with SmartPtrs\\n\\n\\t\\tMDObjectPtr operator[](const char *ChildName) const;\\n\\n\\t\\tMDObjectPtr operator[](const MDOTypePtr &ChildType) const;\\n\\n\\t\\tMDObjectPtr operator[](const MDTypePtr &ChildType) const;\\n\\n\\t\\tMDObjectPtr operator[](int Index) const;\\n\\n\\t\\tMDObjectPtr operator[](const UL &ChildType) const;\\n\\n\\t\\tMDObjectPtr operator[](const ULPtr &ChildType) const;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mxflib/forward.h\",\n \"rank\": 64,\n \"score\": 45138.35083437733\n },\n {\n \"content\": \"\\tMXFLIB_TYPE_END\\n\\n\\n\\n\\t// Types definitions converted from file C:\\\\dev\\\\mxflib\\\\dict_as11.xml\\n\",\n \"file_path\": \"mxflib/dict_as11.h\",\n \"rank\": 65,\n \"score\": 44451.244470523605\n },\n {\n \"content\": \"\\t\\tMXFLIB_CLASS_SET_END\\n\\n\\tMXFLIB_CLASS_END\\n\\n\\n\",\n \"file_path\": \"mxflib/dict_as11.h\",\n \"rank\": 66,\n \"score\": 44451.244470523605\n },\n {\n \"content\": \"\\tMXFLIB_DICTIONARY_START(AS11)\\n\",\n \"file_path\": \"mxflib/dict_as11.h\",\n \"rank\": 67,\n \"score\": 44451.244470523605\n },\n {\n \"content\": \"\\t\\tMXFLIB_TYPE_ENUM_END\\n\\n\\tMXFLIB_TYPE_END\\n\\n\\n\",\n \"file_path\": \"mxflib/dict_as11.h\",\n \"rank\": 68,\n \"score\": 44451.244470523605\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n// Define the features bitmap - turn on those features set by compile time switch\\n\\nUInt64 mxflib::Features = MXFLIB_FEATURE_DEFAULT & MXFLIB_FEATURE_MASK;\\n\\n\\n\\n\\n\\nnamespace\\n\\n{\\n\\n\\t//! The version year of the MXF specification being used to write files. Returned by MXFVersion() and set by SetMXFVersion()\\n\\n\\tint MXFVersionYear = 2004;\\n\\n\\n\",\n \"file_path\": \"mxflib/helper.cpp\",\n \"rank\": 69,\n \"score\": 36.449243272925585\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"testmxfsplit.h\\\"\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"libmxfsplit.h\\\"\\n\\n#include \\\"containerinfo.h\\\"\\n\\n\\n\\n//! very basic usage assumes all Descriptors wanted\\n\\nbool Wanted( DescriptorPtr d ){ return true; }\\n\\n\\n\\n//! Simple test of Processor-based splitting\\n\\nint Simple( const char *file, const unsigned firstFrame, const unsigned nFrames, const char ProcSink /*='\\\\0'*/ )\\n\",\n \"file_path\": \"libmxfsplit/testmxfsplit.cpp\",\n \"rank\": 70,\n \"score\": 33.82557317315029\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n#include \\\"dumpobject.h\\\"\\n\\n\\n\\n#include \\\"utility/utility.h\\\"\\n\\nusing namespace utility;\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\\nusing namespace std;\\n\\n\\n\\nnamespace mxflib {\\n\\n\\n\",\n \"file_path\": \"mxflib/dumpobject.cpp\",\n \"rank\": 71,\n \"score\": 31.958112786446378\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"libmxfsplit.h\\\"\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"containerinfo.h\\\"\\n\\n\\n\\n//! Initialize SplitProcessor\\n\\nint SplitProcessor::Initialize()\\n\\n{\\n\\n\\tint Ret = 0;\\n\\n\\n\\n\\t_ContainerInfo = ContainerInfo::CreateAndBuild(_File);\\n\",\n \"file_path\": \"libmxfsplit/libmxfsplit.cpp\",\n \"rank\": 72,\n \"score\": 31.605117030177887\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n#ifndef _LIBMXFSPLIT_H_\\n\\n#define _LIBMXFSPLIT_H_\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"containerinfo.h\\\"\\n\\n#include \\\"basesink.h\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\ntypedef MDObjectPtr DescriptorPtr;\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\\n\\t//! SplitProcessor - singleton class to do all processing of MXF file splitting\\n\",\n \"file_path\": \"libmxfsplit/libmxfsplit.h\",\n \"rank\": 73,\n \"score\": 31.420824721353483\n },\n {\n \"content\": \"#include \\\"DotFile.h\\\"\\n\\n#include <mxflib/mxflib.h>\\n\\n\\n\\n#include <vector>\\n\\n#include <cassert>\\n\\n#include <stdarg.h>\\n\\n\\n\\n\\n\\n#ifdef COMPILED_DICT\\n\\n#include <mxflib/dict.h>\\n\\n#endif\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace dot;\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n// Debug flag for KLVLib\\n\\nint Verbose = 0;\\n\\n\\n\",\n \"file_path\": \"mxf2dot/mxf2dot.cpp\",\n \"rank\": 74,\n \"score\": 31.256964811172637\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n\\n\\n\\n\\n#include <string.h>\\t\\t/* strcpy */\\n\\n\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n#include \\\"sopsax.h\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n/* Local Prototypes */\\n\\nstatic int sopSkipToClose(FILE *xmlFile);\\n\",\n \"file_path\": \"mxflib/sopsax.cpp\",\n \"rank\": 75,\n \"score\": 31.189863623602072\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\\n\\n\\nusing namespace std;\\n\\n\\n\\n\\n\\n\\n\\nnamespace\\n\\n{\\n\",\n \"file_path\": \"mxflib/metadict.cpp\",\n \"rank\": 76,\n \"score\": 31.1639638406016\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\\n#include <string>\\n\\nusing namespace std;\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n#include \\\"process.h\\\"\\n\\n#include \\\"process_utils.h\\\"\\n\\n\\n\\n\\n\",\n \"file_path\": \"libprocesswrap/process.cpp\",\n \"rank\": 77,\n \"score\": 30.474614319973153\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"process_utils.h\\\"\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\\n#include <string>\\n\\n\\n\\nusing namespace std;\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"libprocesswrap/process.h\\\"\\n\\n\\n\",\n \"file_path\": \"libprocesswrap/process_utils.cpp\",\n \"rank\": 78,\n \"score\": 30.341821430295212\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"process_metadata.h\\\"\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\\n#include <string>\\n\\nusing namespace std;\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n// Include the timecode class\\n\\n#include \\\"utility/timecode.h\\\"\\n\\n\\n\",\n \"file_path\": \"libprocesswrap/process_metadata.cpp\",\n \"rank\": 79,\n \"score\": 30.21552679282955\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"parseoptions.h\\\"\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\nusing namespace std;\\n\\n\\n\\n#include \\\"mxflib/system.h\\\" // for stricmp/strcasecmp\\n\\n\\n\\n#include \\\"libprocesswrap/process.h\\\"\\n\\n\\n\\n#define KXS\\t\\t\\t\\t\\t\\\"kxs\\\"\\n\\n#define KXS_Used\\t\\t\\t\\\"kxu\\\"\\n\\n#define KXS_Loaded\\t\\t\\t\\\"kxl\\\"\\n\",\n \"file_path\": \"mxfwrap/parseoptions.cpp\",\n \"rank\": 80,\n \"score\": 29.805578894637097\n },\n {\n \"content\": \" * 1. The origin of this software must not be misrepresented; you must\\n\\n * not claim that you wrote the original software. If you use this\\n\\n * software in a product, you must include an acknowledgment of the\\n\\n * authorship in the product documentation.\\n\\n * \\n\\n * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n \\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <stdarg.h>\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n//! Static flag to say if dark metadata sets that appear to be valid KLV 2x2 sets should be parsed\\n\",\n \"file_path\": \"mxflib/mdobject.cpp\",\n \"rank\": 81,\n \"score\": 29.769496698259506\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n \\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <stdarg.h>\\n\\n\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n// Allow us simple access to deftypes specials\\n\\nusing namespace mxflib_deftypes;\\n\\n\\n\\n\\n\\n/* XML parsing functions - with file scope */\\n\\nnamespace\\n\",\n \"file_path\": \"mxflib/legacytypes.cpp\",\n \"rank\": 82,\n \"score\": 29.50570239884339\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <math.h>\\t// For \\\"floor\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <mxflib/esp_template.h>\\n\\n\\n\\n\\n\\n//! Local definitions\\n\\nnamespace\\n\\n{\\n\\n\\t//! Modified UUID for <Source Type>\\n\",\n \"file_path\": \"mxflib/esp_template.cpp\",\n \"rank\": 83,\n \"score\": 29.38867445930807\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <math.h>\\t// For \\\"floor\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <mxflib/esp_wavepcm.h>\\n\\n\\n\\n\\n\\n\\n\\n//! Local definitions\\n\\nnamespace\\n\\n{\\n\",\n \"file_path\": \"mxflib/esp_wavepcm.cpp\",\n \"rank\": 84,\n \"score\": 29.349967532773842\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n#ifndef _BASESINK_H_\\n\\n#define _BASESINK_H_\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"IPartial.h\\\"\\n\\n#include \\\"streamfile.h\\\"\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\",\n \"file_path\": \"libmxfsplit/basesink.h\",\n \"rank\": 85,\n \"score\": 29.051372793288046\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <math.h>\\t// For \\\"floor\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <mxflib/esp_dvdif.h>\\n\\n\\n\\n\\n\\n//! Local definitions\\n\\nnamespace\\n\\n{\\n\\n\\t//! Modified UUID for raw DV\\n\",\n \"file_path\": \"mxflib/esp_dvdif.cpp\",\n \"rank\": 86,\n \"score\": 28.759439663559426\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include <mxflib/mxflib.h>\\n\\n\\n\\n#include <math.h>\\t// For \\\"floor\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <mxflib/esp_mpeg2ves.h>\\n\\n\\n\\n\\n\\n//! Local definitions\\n\\nnamespace\\n\\n{\\n\\n\\t//! Modified UUID for MPEG2-VES\\n\",\n \"file_path\": \"mxflib/esp_mpeg2ves.cpp\",\n \"rank\": 87,\n \"score\": 28.759439663559426\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n\\n\\n#include \\\"timecode.h\\\"\\n\\n\\n\\n#ifndef EXCLUDE_MXFLIB_H\\n\\nusing namespace mxflib;\\n\\n#endif\\n\\n\\n\\n\\t// construct from string\\n\\n\\t// note that defaults to 1000 fps - intentionally\\n\\n\\t// MUST call SetFPS() before persisting\\n\\n\\tTimecode_t::Timecode_t( const char* arg, unsigned fps /* = defaultfps */, bool drop /*= false*/ ) : _start(0),_valid(false),_fps(fps),_drop(drop),_text(NULL)\\n\\n\\t{\\n\\n\\t\\tif((!arg) || !strlen(arg)) return;\\n\",\n \"file_path\": \"utility/timecode.cpp\",\n \"rank\": 88,\n \"score\": 28.702441135122225\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <ios>\\n\\n#include <sstream>\\n\\n\\n\\n// Use mxflib by default in library source\\n\\nusing namespace mxflib;\\n\\n\\n\\n// Standard library includes\\n\\n//#include <stdexcept>\\n\\n\\n\\n//! Soft limit for strings returned by MDTraits - Defaults to 10k\\n\\n/*! \\\\note This is a soft limit in that it is not enforced strictly.\\n\",\n \"file_path\": \"mxflib/mdtraits.cpp\",\n \"rank\": 89,\n \"score\": 28.48310028624482\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <math.h>\\t// For \\\"floor\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <mxflib/esp_jp2k.h>\\n\\n\\n\\n\\n\\n//! Local definitions\\n\\nnamespace\\n\\n{\\n\\n\\tconst char *PictureEssenceCoding_Base = \\\"060e2b34.04010107.04010202.03010100\\\";\\n\",\n \"file_path\": \"mxflib/esp_jp2k.cpp\",\n \"rank\": 90,\n \"score\": 28.47392565521818\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"libprocesswrap/process.h\\\"\\n\\n\\n\\n\\n\\n\\n\\n#include \\\"parseoptions.h\\\"\\n\\n\\n\\n\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <iostream>\\n\",\n \"file_path\": \"mxfwrap/mxfwrap.cpp\",\n \"rank\": 91,\n \"score\": 28.4438328446601\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <stdlib.h>\\n\\n\\n\\n\\n\\n// Include the AS-DCP crypto header\\n\\n#include \\\"crypto_asdcp.h\\\"\\n\\n\\n\\n#include \\\"mxflib/dict.h\\\"\\n\\n\\n\",\n \"file_path\": \"mxfcrypt/mxfcrypt.cpp\",\n \"rank\": 92,\n \"score\": 28.23023422159863\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n \\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n\\n\\n#include <stdarg.h>\\n\\n\\n\\n/* Allow us to use std::numeric_limits<>::max(), which includes removing any \\\"max\\\" macro! */\\n\\n#ifdef max\\n\\n#undef max\\n\\n#endif\\n\\n#include <limits>\\n\\n/******************************************************************************************/\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\",\n \"file_path\": \"mxflib/rxiparser.cpp\",\n \"rank\": 93,\n \"score\": 28.025461462236272\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"utility/osprintf.h\\\"\\n\\n\\n\\n// include the autogenerated dictionary\\n\\n#include \\\"mxflib/dict.h\\\"\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <stdlib.h>\\n\\n#include <iostream>\\n\\n#include <map>\\n\\n#include <stdarg.h>\\n\",\n \"file_path\": \"mxfsplit/mxfsplit.cpp\",\n \"rank\": 94,\n \"score\": 27.8810799356323\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\n#include <cstddef>\\n\\n\\n\\n\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n//! Template for all GC essence item keys\\n\\n/*! DRAGONS: Version number is hard coded as 0 - must be overwritten */\\n\\n\\n\\nnamespace\\n\\n{\\n\",\n \"file_path\": \"mxflib/essence.cpp\",\n \"rank\": 95,\n \"score\": 27.599134880439173\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n\\n\\n#include <mxflib/mxflib.h>\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n/* List of all essence sub-parser header files */\\n\\n/***********************************************/\\n\\n\\n\\n#include <mxflib/esp_mpeg2ves.h>\\n\\n#include <mxflib/esp_wavepcm.h>\\n\\n#include <mxflib/esp_dvdif.h>\\n\\n#include <mxflib/esp_jp2k.h>\\n\",\n \"file_path\": \"mxflib/esp.cpp\",\n \"rank\": 96,\n \"score\": 27.564960593189276\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n#ifndef _CONTAINERINFO_H_\\n\\n#define _CONTAINERINFO_H_\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\\n\\t//! Map of Descriptors indexed by Track Number\\n\\n\\ttypedef std::map<UInt32, MDObjectPtr> TrackDescriptorMap;\\n\\n\\n\\n\\t//! Map of EssenceSinks indexed by Track Number\\n\\n\\ttypedef std::map<UInt32, EssenceSinkPtr> EssenceSinkMap;\\n\\n\\n\\n\\t//! Structure holding information about the essence in each Container\\n\",\n \"file_path\": \"libmxfsplit/containerinfo.h\",\n \"rank\": 97,\n \"score\": 27.564820187638173\n },\n {\n \"content\": \" * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n\\n\\n#include <mxflib/mxflib.h>\\n\\n\\n\\nusing namespace mxflib;\\n\\n\\n\\n\\n\\n#ifdef COMPILED_DICT\\n\\nbool UseCompiledDict = true;\\n\\n// include the autogenerated dictionary\\n\\n#include \\\"mxflib/dict.h\\\"\\n\\n#else // COMPILED_DICT\\n\\nbool UseCompiledDict = false;\\n\\nMXFLIB_DICTIONARY_START(DictData)\\n\\nMXFLIB_DICTIONARY_END\\n\\n#endif // COMPILED_DICT\\n\\n\\n\\n// Include the bootstrap dictionary\\n\",\n \"file_path\": \"mxfdump/mxfdump.cpp\",\n \"rank\": 98,\n \"score\": 27.55070170195469\n },\n {\n \"content\": \" * 2. Altered source versions must be plainly marked as such, and must\\n\\n * not be misrepresented as being the original software.\\n\\n * \\n\\n * 3. This notice may not be removed or altered from any source\\n\\n * distribution.\\n\\n */\\n\\n#ifndef _AUDIOSINK_H_\\n\\n#define _AUDIOSINK_H_\\n\\n\\n\\n#include \\\"mxflib/mxflib.h\\\"\\n\\nusing namespace mxflib;\\n\\n\\n\\n#include \\\"streamfile.h\\\"\\n\\n\\n\\nnamespace mxflib\\n\\n{\\n\\n\\t//! EssenceSink that writes a wave file to the currently open file\\n\",\n \"file_path\": \"libmxfsplit/audiosink.h\",\n \"rank\": 99,\n \"score\": 27.536829092147634\n }\n]","isConversational":false}}},{"rowIdx":390,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/ftk/mesh/lattice_partitioner.hh"},"repo_name":{"kind":"string","value":"hguo/FTT"},"commit":{"kind":"string","value":"f1d5387d6353cf2bd165c51fc717eb5d6b2675ef"},"file_code":{"kind":"string","value":"#ifndef _FTK_LATTICE_PARTITIONER_HH\n#define _FTK_LATTICE_PARTITIONER_HH\n\n#include <ftk/mesh/lattice.hh>\n\nnamespace ftk {\n\nstruct lattice_partitioner {\n lattice_partitioner(const lattice& l_) : l(l_) {}\n \n friend std::ostream& operator<<(std::ostream& os, const lattice_partitioner&);\n\n size_t nd() const {return l.nd();}\n size_t np() const {return cores.size();}\n\npublic: \n void partition(size_t np); \n void partition(size_t np, \n const std::vector<size_t> &given); \n void partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost); \n void partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost_low, \n const std::vector<size_t> &ghost_high); \n\n const lattice& get_core(size_t i) const {return cores[i];}\n const lattice& get_ext(size_t i) const {return extents[i];}\n\n size_t partition_id(const std::vector<size_t> &p) const;\n \n lattice add_ghost(const lattice& b, \n const std::vector<size_t>&, \n const std::vector<size_t>&) const;\n\nprivate:\n void partition(std::vector<std::vector<size_t>> prime_factors_dims);\n\n template<typename uint = size_t>\n static std::vector<uint> prime_factorization(uint n);\n\nprotected:\n const lattice &l;\n\n std::vector<lattice> cores, extents; \n};\n\ntemplate<typename uint>\ninline std::vector<uint> lattice_partitioner::prime_factorization(uint n) {\n std::vector<uint> factors;\n\n while (n % 2 == 0) { \n factors.push_back(2); \n n = n/2; \n } \n\n for (int i = 3; i <= sqrt(n); i += 2) {\n while (n % i == 0) {\n factors.push_back(i); \n n = n / i; \n }\n }\n\n if(n > 1) {\n factors.push_back(n); \n }\n\n std::reverse(factors.begin(), factors.end());\n return factors;\n}\n\ninline bool is_vector_zero(const std::vector<size_t> vec) {\n if(vec.size() == 0 || (vec.size() == 1 && vec[0] == 0)) {\n return true; \n }\n\n return false; \n}\n\ninline void lattice_partitioner::partition(size_t np) {\n std::vector<size_t> vector_zero(0, nd());\n partition(np, vector_zero, vector_zero, vector_zero);\n}\n\ninline void lattice_partitioner::partition(size_t np, const std::vector<size_t> &given) {\n std::vector<size_t> vector_zero(0, nd());\n partition(np, given, vector_zero, vector_zero); \n}\n\ninline void lattice_partitioner::partition(size_t np, const std::vector<size_t> &given, const std::vector<size_t> &ghost)\n{\n partition(np, given, ghost, ghost); \n}\n\ninline void lattice_partitioner::partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost_low, \n const std::vector<size_t> &ghost_high)\n{\n if(np <= 0) {\n return ;\n }\n\n int ndim = l.nd_cuttable(); \n\n \n \n \n \n \n\n std::vector<std::vector<size_t>> prime_factors_dims(ndim, std::vector<size_t>()); \n\n if(!is_vector_zero(given)) {\n bool has_zero = false; \n \n for(size_t nslice: given) {\n if(nslice != 0) {\n if(np % nslice != 0) { \n return ;\n }\n\n np /= nslice; \n } else {\n has_zero = true; \n }\n }\n\n if(!has_zero && np > 1) { \n return ; \n }\n\n for(auto i = 0; i < given.size(); ++i) {\n size_t nslice = given[i]; \n if(nslice > 1) {\n std::vector<size_t> prime_factors_dim = prime_factorization(nslice);\n prime_factors_dims[i] = prime_factors_dim; \n }\n }\n }\n \n \n if(np > 1) {\n std::vector<size_t> prime_factors_all = prime_factorization(np);\n\n int curr = 0;\n for(size_t& prime : prime_factors_all) {\n while(!is_vector_zero(given) && given[curr] != 0) { \n curr = (curr + 1) % ndim; \n }\n prime_factors_dims[curr].push_back(prime); \n curr = (curr + 1) % ndim; \n }\n }\n\n partition(prime_factors_dims); \n\n if (cores.size() == 0) return;\n\n \n for(const auto& core : cores) {\n#if 0\n auto starts = core.starts(), \n sizes = core.sizes();\n\n for(int d = 0; d < ndim; ++d) {\n \n {\n size_t offset = starts[d] - l.start(d); \n if(ghost_low[d] < offset) {\n offset = ghost_low[d]; \n }\n\n starts[d] -= offset; \n sizes[d] += offset;\n }\n\n \n {\n size_t offset = (l.start(d) + l.size(d)) - (starts[d] + sizes[d]); \n if(ghost_high[d] < offset) {\n offset = ghost_high[d]; \n }\n\n sizes[d] += offset;\n }\n }\n#endif\n\n \n lattice ext = add_ghost(core, ghost_low, ghost_high);\n extents.push_back(ext);\n }\n}\n\ninline void lattice_partitioner::partition(std::vector<std::vector<size_t>> prime_factors_dims)\n{\n int ndim = l.nd_cuttable(); \n\n std::queue<lattice> lattice_queue; \n lattice_queue.push(l);\n\n for(int curr = 0; curr < ndim; ++curr) { \n for(size_t& nslice : prime_factors_dims[curr]) {\n int n = lattice_queue.size();\n\n for (int j = 0; j < n; ++j) {\n auto p = lattice_queue.front();\n\n if(p.size(curr) < nslice) { \n return ; \n }\n size_t ns = p.size(curr) / nslice; \n\n std::vector<size_t> starts(p.starts()); \n std::vector<size_t> sizes(p.sizes()); \n sizes[curr] = ns;\n for(int k = 0; k < nslice - 1; ++k) {\n lattice_queue.push(lattice(starts, sizes));\n starts[curr] += ns;\n }\n\n sizes[curr] = p.size(curr) - ns * (nslice - 1);\n lattice_queue.push(lattice(starts, sizes));\n\n lattice_queue.pop();\n }\n }\n }\n\n \n while (!lattice_queue.empty()) {\n\n lattice core = lattice_queue.front(); \n \n\n lattice ghost(core.starts(), core.sizes()); \n \n\n cores.push_back(core);\n \n \n lattice_queue.pop();\n }\n}\n\n \n\n \n\n \n\n \ninline std::ostream& operator<<(std::ostream& os, const lattice_partitioner& partitioner)\n{\n os << \"lattice.nd=\" << partitioner.nd() << \", np=\" << partitioner.np() << std::endl;\n for (auto i = 0; i < partitioner.np(); i ++) {\n os << \"--\" << \"id=\" << i <<\", \"\n << \"core: \" << partitioner.cores[i] << \"; \"\n << \"ext: \" << partitioner.extents[i];\n if (i < partitioner.np() - 1) os << std::endl;\n }\n \n return os;\n}\n \ninline lattice lattice_partitioner::add_ghost(const lattice& b, \n const std::vector<size_t>& ghost_low, \n const std::vector<size_t>& ghost_high) const\n{\n if (ghost_low.empty() || ghost_high.empty()) return b;\n\n auto starts = b.starts(), \n sizes = b.sizes();\n\n for(int d = 0; d < l.nd_cuttable(); ++d) {\n \n {\n size_t offset = starts[d] - l.start(d); \n if(ghost_low[d] < offset) {\n offset = ghost_low[d]; \n }\n\n starts[d] -= offset; \n sizes[d] += offset;\n }\n\n \n {\n size_t offset = (l.start(d) + l.size(d)) - (starts[d] + sizes[d]); \n if(ghost_high[d] < offset) {\n offset = ghost_high[d]; \n }\n\n sizes[d] += offset;\n }\n }\n\n return lattice(starts, sizes);\n}\n\n};\n\n#endif\n"},"prefix":{"kind":"string","value":"#ifndef _FTK_LATTICE_PARTITIONER_HH\n#define _FTK_LATTICE_PARTITIONER_HH\n\n#include <ftk/mesh/lattice.hh>\n\nnamespace ftk {\n\nstruct lattice_partitioner {\n lattice_partitioner(const lattice& l_) : l(l_) {}\n \n friend std::ostream& operator<<(std::ostream& os, const lattice_partitioner&);\n\n size_t nd() const {return l.nd();}\n size_t np() const {return cores.size();}\n\npublic: \n void partition(size_t np); \n void partition(size_t np, \n const std::vector<size_t> &given); \n void partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost); \n void partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost_low, \n const std::vector<size_t> &ghost_high); \n\n const lattice& get_core(size_t i) const {return cores[i];}\n const lattice& get_ext(size_t i) const {return extents[i];}\n\n size_t partition_id(const std::vector<size_t> &p) const;\n \n lattice add_ghost(const lattice& b, \n const std::vector<size_t>&, \n const std::vector<size_t>&) const;\n\nprivate:\n void partition(std::vector<std::vector<size_t>> prime_factors_dims);\n\n template<typename uint = size_t>\n static std::vector<uint> prime_factorization(uint n);\n\nprotected:\n const lattice &l;\n\n std::vector<lattice> cores, extents; \n};\n\ntemplate<typename uint>\ninline std::vector<uint> lattice_partitioner::prime_factorization(uint n) {\n std::vector<uint> factors;\n\n while (n % 2 == 0) { \n factors.push_back(2); \n n = n/2; \n } \n\n for (int i = 3; i <= sqrt(n); i += 2) {\n while (n % i == 0) {\n factors.push_back(i); \n n = n / i; \n }\n }\n\n if(n > 1) {\n factors.push_back(n); \n }\n\n std::reverse(factors.begin(), factors.end());"},"suffix":{"kind":"string","value":" (curr + 1) % ndim; \n }\n }\n\n partition(prime_factors_dims); \n\n if (cores.size() == 0) return;\n\n \n for(const auto& core : cores) {\n#if 0\n auto starts = core.starts(), \n sizes = core.sizes();\n\n for(int d = 0; d < ndim; ++d) {\n \n {\n size_t offset = starts[d] - l.start(d); \n if(ghost_low[d] < offset) {\n offset = ghost_low[d]; \n }\n\n starts[d] -= offset; \n sizes[d] += offset;\n }\n\n \n {\n size_t offset = (l.start(d) + l.size(d)) - (starts[d] + sizes[d]); \n if(ghost_high[d] < offset) {\n offset = ghost_high[d]; \n }\n\n sizes[d] += offset;\n }\n }\n#endif\n\n \n lattice ext = add_ghost(core, ghost_low, ghost_high);\n extents.push_back(ext);\n }\n}\n\ninline void lattice_partitioner::partition(std::vector<std::vector<size_t>> prime_factors_dims)\n{\n int ndim = l.nd_cuttable(); \n\n std::queue<lattice> lattice_queue; \n lattice_queue.push(l);\n\n for(int curr = 0; curr < ndim; ++curr) { \n for(size_t& nslice : prime_factors_dims[curr]) {\n int n = lattice_queue.size();\n\n for (int j = 0; j < n; ++j) {\n auto p = lattice_queue.front();\n\n if(p.size(curr) < nslice) { \n return ; \n }\n size_t ns = p.size(curr) / nslice; \n\n std::vector<size_t> starts(p.starts()); \n std::vector<size_t> sizes(p.sizes()); \n sizes[curr] = ns;\n for(int k = 0; k < nslice - 1; ++k) {\n lattice_queue.push(lattice(starts, sizes));\n starts[curr] += ns;\n }\n\n sizes[curr] = p.size(curr) - ns * (nslice - 1);\n lattice_queue.push(lattice(starts, sizes));\n\n lattice_queue.pop();\n }\n }\n }\n\n \n while (!lattice_queue.empty()) {\n\n lattice core = lattice_queue.front(); \n \n\n lattice ghost(core.starts(), core.sizes()); \n \n\n cores.push_back(core);\n \n \n lattice_queue.pop();\n }\n}\n\n \n\n \n\n \n\n \ninline std::ostream& operator<<(std::ostream& os, const lattice_partitioner& partitioner)\n{\n os << \"lattice.nd=\" << partitioner.nd() << \", np=\" << partitioner.np() << std::endl;\n for (auto i = 0; i < partitioner.np(); i ++) {\n os << \"--\" << \"id=\" << i <<\", \"\n << \"core: \" << partitioner.cores[i] << \"; \"\n << \"ext: \" << partitioner.extents[i];\n if (i < partitioner.np() - 1) os << std::endl;\n }\n \n return os;\n}\n \ninline lattice lattice_partitioner::add_ghost(const lattice& b, \n const std::vector<size_t>& ghost_low, \n const std::vector<size_t>& ghost_high) const\n{\n if (ghost_low.empty() || ghost_high.empty()) return b;\n\n auto starts = b.starts(), \n sizes = b.sizes();\n\n for(int d = 0; d < l.nd_cuttable(); ++d) {\n \n {\n size_t offset = starts[d] - l.start(d); \n if(ghost_low[d] < offset) {\n offset = ghost_low[d]; \n }\n\n starts[d] -= offset; \n sizes[d] += offset;\n }\n\n \n {\n size_t offset = (l.start(d) + l.size(d)) - (starts[d] + sizes[d]); \n if(ghost_high[d] < offset) {\n offset = ghost_high[d]; \n }\n\n sizes[d] += offset;\n }\n }\n\n return lattice(starts, sizes);\n}\n\n};\n\n#endif\n"},"middle":{"kind":"string","value":"\n return factors;\n}\n\ninline bool is_vector_zero(const std::vector<size_t> vec) {\n if(vec.size() == 0 || (vec.size() == 1 && vec[0] == 0)) {\n return true; \n }\n\n return false; \n}\n\ninline void lattice_partitioner::partition(size_t np) {\n std::vector<size_t> vector_zero(0, nd());\n partition(np, vector_zero, vector_zero, vector_zero);\n}\n\ninline void lattice_partitioner::partition(size_t np, const std::vector<size_t> &given) {\n std::vector<size_t> vector_zero(0, nd());\n partition(np, given, vector_zero, vector_zero); \n}\n\ninline void lattice_partitioner::partition(size_t np, const std::vector<size_t> &given, const std::vector<size_t> &ghost)\n{\n partition(np, given, ghost, ghost); \n}\n\ninline void lattice_partitioner::partition(size_t np, \n const std::vector<size_t> &given, \n const std::vector<size_t> &ghost_low, \n const std::vector<size_t> &ghost_high)\n{\n if(np <= 0) {\n return ;\n }\n\n int ndim = l.nd_cuttable(); \n\n \n \n \n \n \n\n std::vector<std::vector<size_t>> prime_factors_dims(ndim, std::vector<size_t>()); \n\n if(!is_vector_zero(given)) {\n bool has_zero = false; \n \n for(size_t nslice: given) {\n if(nslice != 0) {\n if(np % nslice != 0) { \n return ;\n }\n\n np /= nslice; \n } else {\n has_zero = true; \n }\n }\n\n if(!has_zero && np > 1) { \n return ; \n }\n\n for(auto i = 0; i < given.size(); ++i) {\n size_t nslice = given[i]; \n if(nslice > 1) {\n std::vector<size_t> prime_factors_dim = prime_factorization(nslice);\n prime_factors_dims[i] = prime_factors_dim; \n }\n }\n }\n \n \n if(np > 1) {\n std::vector<size_t> prime_factors_all = prime_factorization(np);\n\n int curr = 0;\n for(size_t& prime : prime_factors_all) {\n while(!is_vector_zero(given) && given[curr] != 0) { \n curr = (curr + 1) % ndim; \n }\n prime_factors_dims[curr].push_back(prime); \n curr ="},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct formatter<void*, Char> : formatter<const void*, Char> {\n\n template <typename FormatContext>\n\n auto format(void* val, FormatContext& ctx) -> decltype(ctx.out()) {\n\n return formatter<const void*, Char>::format(val, ctx);\n\n }\n\n};\n\n\n\ntemplate <typename Char, size_t N>\n","file_path":"include/ftk/external/diy/fmt/format.h","rank":0,"score":275478.4127111879},{"content":"struct static_const\n\n{\n\n static constexpr T value{};\n\n};\n\n\n\ntemplate<typename T>\n\nconstexpr T static_const<T>::value;\n\n} // namespace detail\n\n} // namespace nlohmann\n\n\n\n// #include <nlohmann/detail/meta/type_traits.hpp>\n\n\n\n\n\n#include <limits> // numeric_limits\n\n#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type\n\n#include <utility> // declval\n\n\n\n// #include <nlohmann/detail/boolean_operators.hpp>\n\n\n\n// #include <nlohmann/detail/iterators/iterator_traits.hpp>\n","file_path":"include/ftk/external/json.hh","rank":1,"score":270002.3350678477},{"content":"struct function_traits<const T&&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":2,"score":244117.9108136032},{"content":"struct function_traits<const T&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":3,"score":244117.9108136032},{"content":"struct FMT_DEPRECATED convert_to_int\n\n : bool_constant<!std::is_arithmetic<T>::value &&\n\n std::is_convertible<T, int>::value> {};\n\n\n\nnamespace internal {\n\n\n\n// Specifies if T has an enabled formatter specialization. A type can be\n\n// formattable even if it doesn't have a formatter e.g. via a conversion.\n\ntemplate <typename T, typename Context>\n\nusing has_formatter =\n\n std::is_constructible<typename Context::template formatter_type<T>>;\n\n\n\n/** A contiguous memory buffer with an optional growing ability. */\n\ntemplate <typename T> class buffer {\n\n private:\n\n buffer(const buffer&) = delete;\n\n void operator=(const buffer&) = delete;\n\n\n\n T* ptr_;\n\n std::size_t size_;\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":4,"score":243862.8403661732},{"content":"struct feature_curve_set_t : public std::multimap<int, feature_curve_t>\n\n{\n\n int add(const feature_curve_t&);\n\n void add(const feature_curve_t&, int label);\n\n std::vector<int> add(const std::vector<feature_curve_t>&);\n\n\n\n std::list<feature_curve_t> to_list() const;\n\n void from_list(const std::list<feature_curve_t>&);\n\n\n\n // std::vector<int> split(int);\n\n void split_all();\n\n \n\n void foreach(std::function<void(const feature_curve_t&)> f) const {for (const auto& kv : *this) f(kv.second);}\n\n void foreach(std::function<void(feature_curve_t&)> f) {for (auto& kv : *this) f(kv.second);}\n\n void foreach(std::function<void(int, const feature_curve_t&)> f) const {for (const auto& kv : *this) f(kv.first, kv.second);}\n\n void foreach(std::function<void(int, feature_curve_t&)> f) {for (auto& kv : *this) f(kv.first, kv.second);}\n\n\n\n void filter(std::function<bool(const feature_curve_t&)> f);\n\n\n\n std::vector<feature_point_t> slice(int t) const;\n","file_path":"include/ftk/features/feature_curve_set.hh","rank":5,"score":239483.4874555793},{"content":"struct lattice {\n\n friend class lattice_partitioner;\n\n template <typename T> friend class ndarray;\n\n\n\n lattice() {}\n\n lattice(int n);\n\n lattice(int n, const int *dims);\n\n lattice(const std::vector<size_t> &starts, const std::vector<size_t> &sizes) {reshape(starts, sizes);}\n\n lattice(const std::vector<size_t> &sizes) {reshape(sizes);}\n\n\n\n lattice(const diy::DiscreteBounds& b);\n\n diy::DiscreteBounds to_diy_bounds() const;\n\n\n\n friend std::ostream& operator<<(std::ostream& os, const lattice&);\n\n\n\n size_t nd() const {return sizes_.size();}\n\n size_t nd_cuttable() const {return unlimited_time() ? nd() - 1 : nd();}\n\n size_t start(size_t i) const {return starts_[i];}\n\n size_t size(size_t i) const {return sizes_[i];}\n\n size_t upper_bound(size_t i) const {return starts_[i] + sizes_[i] - 1;}\n","file_path":"include/ftk/mesh/lattice.hh","rank":6,"score":239412.66999667895},{"content":"struct function_traits<const volatile T&&> : public function_traits<T> {};\n\n\n\n\n\n#define FORWARD_RES_8QR485JMSBT \\\n\n typename std::conditional< \\\n\n std::is_lvalue_reference<R>::value, \\\n\n T&, \\\n\n typename std::remove_reference<T>::type&& \\\n\n >::type\n\n\n\n/**\n\n.. function:: auto utils::forward_like<Like, T>(T&& t) noexcept\n\n\n\n Forward the reference *t* like the type of *Like*. That means, if *Like* is\n\n an lvalue (reference), this function will return an lvalue reference of *t*.\n\n Otherwise, if *Like* is an rvalue, this function will return an rvalue\n\n reference of *t*.\n\n\n\n This is mainly used to propagate the expression category (lvalue/rvalue) of\n\n a member of *Like*, generalizing ``std::forward``.\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":7,"score":234463.7372208183},{"content":"struct function_traits<const volatile T&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":8,"score":234463.7372208183},{"content":"struct filter : public object {\n\n filter(diy::mpi::communicator comm) : object(comm) {\n\n nthreads = default_nthreads();\n\n }\n\n\n\n virtual void update() = 0;\n\n virtual void reset() {};\n\n\n\n void use_thread_backend(const std::string& backend);\n\n void use_thread_backend(int i) { thread_backend = i; }\n\n\n\n void use_accelerator(const std::string& acc);\n\n void use_accelerator(int i) {\n\n xl = i;\n\n#if 0\n\n if (xl == FTK_THREAD_OPENMP || xl == FTK_XL_SYCL || xl == FTK_XL_KOKKOS_CUDA) {\n\n warn(\"Accelerator not available. Using FTK_XL_NONE.\");\n\n xl = FTK_XL_NONE;\n\n }\n\n#endif\n","file_path":"include/ftk/filters/filter.hh","rank":9,"score":231624.74558363826},{"content":"struct tracker : public filter\n\n{\n\n tracker(diy::mpi::communicator comm) : filter(comm) {} // , master(comm) {}\n\n virtual ~tracker() {}\n\n \n\n // virtual int cpdims() const = 0; // featutre dimension\n\n \n\n void set_start_timestep(int t) { start_timestep = t;}\n\n void set_end_timestep(int t) { end_timestep = t; }\n\n \n\n virtual void set_current_timestep(int t) {current_timestep = t;}\n\n int get_current_timestep() const {return current_timestep;}\n\n \n\n void set_input_array_partial(bool b) {is_input_array_partial = b;}\n\n void set_use_default_domain_partition(bool b) {use_default_domain_partition = true;}\n\n\n\n static int str2tracker(const std::string&);\n\n\n\npublic:\n\n virtual void initialize() = 0;\n","file_path":"include/ftk/filters/tracker.hh","rank":10,"score":231624.74558363826},{"content":"struct ndarray : public ndarray_base {\n\n friend class diy::Serialization<ndarray<T>>;\n\n\n\n int type() const;\n\n\n\n unsigned int hash() const;\n\n\n\n ndarray() {}\n\n ndarray(const std::vector<size_t> &dims) {reshape(dims);}\n\n ndarray(const std::vector<size_t> &dims, T val) {reshape(dims, val);}\n\n ndarray(const lattice& l) {reshape(l.sizes());}\n\n ndarray(const T *a, const std::vector<size_t> &shape);\n\n \n\n template <typename T1> ndarray(const ndarray<T1>& array1) { from_array<T1>(array1); }\n\n ndarray(const ndarray<T>& a) { dims = a.dims; s = a.s; ncd = a.ncd; tv = a.tv; p = a.p; }\n\n \n\n template <typename T1> ndarray<T>& operator=(const ndarray<T1>& array1) { from_array<T1>(array1); return *this; }\n\n ndarray<T>& operator=(const ndarray<T>& a) { dims = a.dims; s = a.s; ncd = a.ncd; tv = a.tv; p = a.p; return *this; }\n\n\n\n std::ostream& print(std::ostream& os) const;\n","file_path":"include/ftk/ndarray.hh","rank":11,"score":231624.74558363826},{"content":"struct function_traits<ReturnType(ClassType::*)(Args...) const>\n\n : public function_traits<ReturnType(Args...)>\n\n{\n\n typedef const ClassType& owner_type;\n\n};\n\n\n\ntemplate <typename ClassType, typename ReturnType, typename... Args>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":12,"score":228839.68936066466},{"content":"struct ndarray_writer : public object {\n\n void configure(const json& j_);\n\n // JSON specificications:\n\n // required fields: \n\n // - nd, number. dimensionality of the data\n\n // - filename, string, e.g. \"tornado-%04d.nc\". Should be able to expand to file names with sprintf(3)\n\n // - format (nc|vti|float32|float64)\n\n // format-specific fields: \n\n // - nc (NetCDF), serial\n\n // - variable (required), string or array of strings. Possible to use the same\n\n // specification in the input stream config. Will be converted to array of \n\n // strings internally. Will write one or multiple variables.\n\n // - dimensions (optional), array of strings; by default use [\"x\", \"y\"] and \n\n // [\"x\", \"y\", \"z\"] for 2D and 3D data, respectively\n\n // - unlimited_time (optional, by default true), bool. If true, include time \n\n // in dimensions, e.g. (time,z,y,x), in netcdf. \n\n // - vti (vtkImageData w/ vtkXMLImageDataWriter)\n\n // - variable (required), string or array of strings. Possible to use the same\n\n // specification in the input stream config. \n\n // - string: write one single variable, assuming the data is single-component\n","file_path":"include/ftk/ndarray/writer.hh","rank":14,"score":226227.42489461444},{"content":"struct ndarray_stream : public object {\n\n ndarray_stream(diy::mpi::communicator comm = MPI_COMM_WORLD);\n\n ndarray_stream(const std::string adios2_config_filename, // = \"adios2.xml\",\n\n const std::string adios2_io_name, // = \"SimulationOutput\",\n\n diy::mpi::communicator comm); // = MPI_COMM_WORLD);\n\n ~ndarray_stream();\n\n\n\n void configure(const json& j) {set_input_source_json(j);}\n\n // JSON specifications:\n\n // required fields: \n\n // - type, string. Must be one of \"synthetic\" and \"file\". This field may be ommited\n\n // if `format' is given.\n\n // - name (required if type is synthetic), string. Must be one of the follows: \"woven\", \n\n // \"double_gyre\", \"merger_2d\".\n\n // optional fields:\n\n // - filenames (required if type is file), string. The list of filenames will be \n\n // determined by glob(3)\n\n // - mesh_filename (required for unstructured mesh, must be in vtu format in the \n\n // current version), string.\n\n // - format (required if type is file and format is float32/float64), string. If not \n","file_path":"include/ftk/ndarray/stream.hh","rank":15,"score":226227.42489461444},{"content":"struct xgc_tracker : public tracker {\n\n xgc_tracker(diy::mpi::communicator comm,\n\n std::shared_ptr<simplicial_xgc_3d_mesh<>> mx);\n\n\n\n void reset() { field_data_snapshots.clear(); }\n\n\n\n void set_use_roi(bool b) { use_roi = b; }\n\n\n\npublic:\n\n std::shared_ptr<simplicial_unstructured_2d_mesh<>> get_m2() { return m2; }\n\n void initialize_ff_mesh(const std::string& filename) { mf3.reset(new simplicial_xgc_3dff_mesh<>(m2, m3->get_nphi(), m3->get_iphi(), m3->get_vphi()) ); mf3->initialize_ff_mesh(filename); }\n\n\n\npublic:\n\n virtual void push_field_data_snapshot(std::shared_ptr<ndarray_group>);\n\n virtual void push_field_data_snapshot(const ndarray<double> &scalar);\n\n virtual void push_field_data_snapshot(\n\n const ndarray<double> &scalar, \n\n const ndarray<double> &vector,\n\n const ndarray<double> &jacobian);\n\n \n","file_path":"include/ftk/filters/xgc_tracker.hh","rank":16,"score":221148.19272714184},{"content":"struct xgc_stream : public object {\n\n static std::shared_ptr<xgc_stream> new_xgc_stream(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD);\n\n xgc_stream(const std::string& path_, diy::mpi::communicator comm = MPI_COMM_WORLD) : path(path_), object(comm) {}\n\n \n\n void set_start_timestep(int s) { start_timestep = s; }\n\n void set_ntimesteps(int n) { ntimesteps = n; }\n\n void set_vphi(int v) { vphi = v; }\n\n\n\n void set_enable_initialize_smoothing_kernel(bool b) { enable_initialize_smoothing_kernel = b; }\n\n void set_enable_initialize_interpolants(bool b) { enable_initialize_interpolants = b; }\n\n\n\n void initialize();\n\n void probe_nphi_iphi();\n\n\n\n void set_smoothing_kernel_size(double s) { smoothing_kernel_size = s; }\n\n void set_smoothing_kernel_filename(const std::string f) { smoothing_kernel_filename = f; }\n\n void set_interpolant_filename(const std::string f) { interpolant_filename = f; }\n\n\n\n void set_callback(std::function<void(int, std::shared_ptr<ndarray_group>)> f) { callback = f; }\n\n\n","file_path":"include/ftk/io/xgc_stream.hh","rank":17,"score":221148.19272714184},{"content":"struct json_interface : public object {\n\n // json options (WIP):\n\n // - feature, string, required: possible values include\n\n // critical_point|cp: 2D/3D critical points\n\n // critical_line|cl: 3D critical line (intersections of two isosurfaces)\n\n // isosurface|iso: 3D isosurface\n\n // tdgl_vortex|tdgl: magnetic flux vortices in 3D time-dependent Ginzburg-Landau (TDGL) simulations\n\n // sujudi_haimes|sh: Sujudi-Haimes vortices in 3D vector fields\n\n // levy_degani_seginer|lds: Levy-Degani-Seginer vortices in 3D vector fields\n\n // connected_component|cc: 2D/3D connected components\n\n // xgc_blob_filament_2d: 2D XGC blob filaments defined by local extrema\n\n // xgc_blob_filament: 3D XGX blob filaments defined by local extrema\n\n // xgc_blob_threshold: 3D XGC blob filaments defined by levelsets\n\n // - input, json, see ndarray/stream.hh for details\n\n // // - writeback, json, optional: write input data back to files; see ndarray/writer.hh for details\n\n // - archive, json, optional:\n\n // - discrete, string, optional: file name to load/store discrete feature points w/o tracking\n\n // - traced, string, optional: file name to load/store traced features\n\n // - output, json, required:\n\n // - type, string, by default \"traced\": intersections, traced, sliced, or intercepted\n","file_path":"include/ftk/filters/json_interface.hh","rank":18,"score":221148.19272714184},{"content":"struct mpas_stream : public object {\n\n mpas_stream(const std::string& path, diy::mpi::communicator comm=MPI_COMM_WORLD);\n\n\n\n};\n\n\n\n}\n\n\n\n#endif\n","file_path":"include/ftk/io/mpas_stream.hh","rank":19,"score":221148.19272714184},{"content":"struct function_traits<ReturnType(ClassType::*)(Args...) const volatile>\n\n : public function_traits<ReturnType(Args...)>\n\n{\n\n typedef const volatile ClassType& owner_type;\n\n};\n\n\n\ntemplate <typename FunctionType>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":20,"score":220156.28346334162},{"content":"struct monostate {};\n\n\n\n// An enable_if helper to be used in template parameters which results in much\n\n// shorter symbols: https://godbolt.org/z/sWw4vP. Extra parentheses are needed\n\n// to workaround a bug in MSVC 2019 (see #1140 and #1186).\n\n#define FMT_ENABLE_IF(...) enable_if_t<(__VA_ARGS__), int> = 0\n\n\n\nnamespace internal {\n\n\n\n// A workaround for gcc 4.8 to make void_t work in a SFINAE context.\n\ntemplate <typename... Ts> struct void_t_impl { using type = void; };\n\n\n\n#if defined(FMT_USE_STRING_VIEW)\n\ntemplate <typename Char> using std_string_view = std::basic_string_view<Char>;\n\n#elif defined(FMT_USE_EXPERIMENTAL_STRING_VIEW)\n\ntemplate <typename Char>\n\nusing std_string_view = std::experimental::basic_string_view<Char>;\n\n#else\n\ntemplate <typename T> struct std_string_view {};\n\n#endif\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":21,"score":219870.7871491524},{"content":"struct formatter {\n\n // A deleted default constructor indicates a disabled formatter.\n\n formatter() = delete;\n\n};\n\n\n\ntemplate <typename T, typename Char, typename Enable = void>\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":22,"score":219870.78714915237},{"content":"struct view {};\n\ntemplate <bool...> struct bool_pack;\n\ntemplate <bool... Args>\n\nusing all_true =\n\n std::is_same<bool_pack<Args..., true>, bool_pack<true, Args...>>;\n\n\n\ntemplate <typename... Args, typename S, typename Char = char_t<S>>\n\ninline format_arg_store<buffer_context<Char>, remove_reference_t<Args>...>\n\nmake_args_checked(const S& format_str,\n\n const remove_reference_t<Args>&... args) {\n\n static_assert(all_true<(!std::is_base_of<view, remove_reference_t<Args>>() ||\n\n !std::is_reference<Args>())...>::value,\n\n \"passing views as lvalues is disallowed\");\n\n check_format_string<remove_const_t<remove_reference_t<Args>>...>(format_str);\n\n return {args...};\n\n}\n\n\n\ntemplate <typename Char>\n\nstd::basic_string<Char> vformat(basic_string_view<Char> format_str,\n\n basic_format_args<buffer_context<Char>> args);\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":23,"score":219870.78714915237},{"content":"struct is_sax_static_asserts\n\n{\n\n private:\n\n static_assert(is_basic_json<BasicJsonType>::value,\n\n \"BasicJsonType must be of type basic_json<...>\");\n\n\n\n using number_integer_t = typename BasicJsonType::number_integer_t;\n\n using number_unsigned_t = typename BasicJsonType::number_unsigned_t;\n\n using number_float_t = typename BasicJsonType::number_float_t;\n\n using string_t = typename BasicJsonType::string_t;\n\n using exception_t = typename BasicJsonType::exception;\n\n\n\n public:\n\n static_assert(is_detected_exact<bool, null_function_t, SAX>::value,\n\n \"Missing/invalid function: bool null()\");\n\n static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,\n\n \"Missing/invalid function: bool boolean(bool)\");\n\n static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,\n\n \"Missing/invalid function: bool boolean(bool)\");\n\n static_assert(\n","file_path":"include/ftk/external/json.hh","rank":24,"score":214181.48873858034},{"content":"struct fixed_integer {\n\n fixed_integer() {for (int i = 0; i < N; i ++) num[i] = 0;}\n\n fixed_integer(const std::string& str);\n\n fixed_integer(const fixed_integer& x) {\n\n for (int i = 0; i < N; i ++) \n\n num[i] = x.num[i];\n\n }\n\n fixed_integer(int x) {I[0] = x;}\n\n\n\n fixed_integer& operator=(const fixed_integer& x) {\n\n for (int i = 0; i < N; i ++)\n\n num[i] = x.num[i];\n\n return *this;\n\n }\n\n fixed_integer& operator=(int x) {\n\n for (int i = 1; i < N; i ++)\n\n num[i] = 0;\n\n num[0] = x;\n\n return *this;\n\n }\n","file_path":"include/ftk/numeric/fixed_int.hh","rank":25,"score":214178.0641676684},{"content":"// A base class for compile-time strings. It is defined in the fmt namespace to\n\n// make formatting functions visible via ADL, e.g. format(fmt(\"{}\"), 42).\n\nstruct compile_string {};\n\n\n\ntemplate <typename S>\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":26,"score":214131.92893787267},{"content":"struct fallback_formatter {\n\n fallback_formatter() = delete;\n\n};\n\n\n\n// Specifies if T has an enabled fallback_formatter specialization.\n\ntemplate <typename T, typename Context>\n\nusing has_fallback_formatter =\n\n std::is_constructible<fallback_formatter<T, typename Context::char_type>>;\n\n\n\ntemplate <typename Char> struct named_arg_base;\n\ntemplate <typename T, typename Char> struct named_arg;\n\n\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":27,"score":214120.77106610767},{"content":"struct error_handler {\n\n FMT_CONSTEXPR error_handler() {}\n\n FMT_CONSTEXPR error_handler(const error_handler&) {}\n\n\n\n // This function is intentionally not constexpr to give a compile-time error.\n\n FMT_NORETURN FMT_API void on_error(const char* message);\n\n};\n\n} // namespace internal\n\n\n\n/** String's character type. */\n\ntemplate <typename S> using char_t = typename internal::char_t_impl<S>::type;\n\n\n\n// Parsing context consisting of a format string range being parsed and an\n\n// argument counter for automatic indexing.\n\ntemplate <typename Char, typename ErrorHandler = internal::error_handler>\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":28,"score":214120.77106610767},{"content":"struct connected_component_tracker : public tracker\n\n{\n\n connected_component_tracker(diy::mpi::communicator comm) : tracker(comm) {}\n\n virtual ~connected_component_tracker() {};\n\n\n\n virtual bool advance_timestep();\n\n virtual void update_timestep();\n\n void update() {};\n\n void finalize();\n\n\n\n virtual void push_labeled_data_snapshot(const std::vector<LabelIdType>& labels);\n\n const std::vector<LabelIdType>& get_last_labeled_data_snapshot() const {return labeled_data_snapshots.back();}\n\n \n\n template <typename ContainerType>\n\n void push_unlabeled_data_snapshot(const std::vector<LabelIdType>& labels, std::function<ContainerType(LabelIdType)> neighbors);\n\n\n\n bool pop_snapshot();\n\n\n\n const ftk::tracking_graph<>& get_tracking_graph() const {return tg;}\n\n\n","file_path":"include/ftk/filters/connected_component_tracker.hh","rank":29,"score":211837.7755177343},{"content":"struct simplicial_unstructured_mesh : public object { \n\n simplicial_unstructured_mesh() {}\n\n\n\n // dimensionality of the mesh\n\n virtual int nd() const = 0;\n\n\n\n // numer of d-dimensional elements\n\n virtual size_t n(int d) const = 0;\n\n\n\npublic: // io\n\n void from_legacy_vtk_file(const std::string& filename);\n\n void from_vtk_unstructured_grid_file(const std::string &filename);\n\n void to_vtk_unstructured_grid_file(const std::string &filename) const;\n\n\n\n void scalar_to_vtk_unstructured_grid_data_file(const std::string& filename, const std::string& varname, const ndarray<F>&) const;\n\n void vector_to_vtk_unstructured_grid_data_file(const std::string& filename, const std::string& varname, const ndarray<F>&) const;\n\n#if FTK_HAVE_VTK\n\n vtkSmartPointer<vtkUnstructuredGrid> scalar_to_vtk_unstructured_grid_data(const std::string& varname, const ndarray<F>&) const;\n\n vtkSmartPointer<vtkUnstructuredGrid> vector_to_vtk_unstructured_grid_data(const std::string& varname, const ndarray<F>&) const;\n\n // vtkSmartPointer<vtkUnstructuredGrid> scalars_to_vtk_unstructured_grid_data(\n","file_path":"include/ftk/mesh/simplicial_unstructured_mesh.hh","rank":30,"score":211837.7755177343},{"content":"#if 0\n\nstruct data_stream_synthetic : public data_stream {\n\n void set_input_source(const std::string&) {} // nothing todo\n\n\n\n void advance_timestep() {\n\n data_group *g = data_group::create();\n\n const ndarray<double>& array = synthesize_timestep(current_timestep);\n\n g->set(default_variable_name(), array);\n\n push_timestep(g);\n\n }\n\n\n\n void set_input_parameters(const std::map<std::string, std::string>& param) {\n\n data_stream::set_input_parameters(param);\n\n if (param.find(str_dw) != param.end()) DW = std::stoi(param.at(str_dw));\n\n if (param.find(str_dh) != param.end()) DH = std::stoi(param.at(str_dh));\n\n if (param.find(str_dd) != param.end()) DD = std::stoi(param.at(str_dd));\n\n if (param.find(str_dt) != param.end()) n_timesteps = std::stoi(param.at(str_dt));\n\n if (param.find(str_time_scale) != param.end()) time_scale = stod(param.at(str_time_scale));\n\n }\n\n\n\n virtual std::string default_variable_name() const {return std::string();};\n\n\n\n virtual ndarray<double> synthesize_timestep(int t) = 0;\n\n\n\nprotected:\n\n size_t DW = 32, DH = 32, DD = 32;\n\n double time_scale = 1.0;\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":31,"score":211837.7755177343},{"content":"struct data_stream_files : public data_stream {\n\n void set_input_source(const std::string& pattern) {\n\n filenames = ndarray<float>::glob(pattern);\n\n if (n_timesteps == 0) n_timesteps = filenames.size();\n\n else filenames.resize(n_timesteps);\n\n }\n\n\n\n void set_input_filenames(const std::vector<std::string>& f) {filenames = f;}\n\n\n\n void load_timestep(int k);\n\n\n\n void advance_timestep();\n\n\n\nprotected:\n\n std::vector<std::string> filenames;\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":32,"score":211837.7755177343},{"content":"struct simplicial_regular_mesh : public object {\n\n friend class simplicial_regular_mesh_element;\n\n typedef simplicial_regular_mesh_element iterator;\n\n\n\n simplicial_regular_mesh(int n) : nd_(n), lattice_(n) {\n\n for (int i = 0; i < n; i ++) {\n\n lb_.push_back(0);\n\n ub_.push_back(0);\n\n }\n\n\n\n initialize_subdivision();\n\n\n\n lattice_.reshape(lb_, sizes()); \n\n }\n\n\n\n simplicial_regular_mesh(const lattice l) : simplicial_regular_mesh(l.nd()) {\n\n set_lb_ub(l);\n\n }\n\n\n\n#if 0\n","file_path":"include/ftk/mesh/simplicial_regular_mesh.hh","rank":33,"score":211837.7755177343},{"content":"// this is an abstract class, not for users\n\nstruct contour_tracker_regular : public contour_tracker, public regular_tracker {\n\n contour_tracker_regular(diy::mpi::communicator comm, int nd/*2 or 3*/) : contour_tracker(comm), regular_tracker(comm, nd), tracker(comm) {}\n\n virtual ~contour_tracker_regular() {}\n\n\n\n void reset();\n\n\n\nprotected:\n\n typedef simplicial_regular_mesh_element element_t;\n\n \n\n std::map<element_t, feature_point_t> intersections;\n\n std::set<element_t> related_cells;\n\n\n\nprotected:\n\n void build_isovolumes();\n\n\n\npublic: // cp io\n\n const std::map<element_t, feature_point_t>& get_discrete_intersections() const {return intersections;}\n\n std::vector<feature_point_t> get_intersections() const;\n\n};\n\n\n","file_path":"include/ftk/filters/contour_tracker_regular.hh","rank":34,"score":211598.8056706593},{"content":"struct unstructured_2d_tracker : public virtual tracker {\n\n unstructured_2d_tracker(diy::mpi::communicator comm, const simplicial_unstructured_extruded_2d_mesh<> &m) : \n\n m(simplicial_unstructured_extruded_2d_mesh<>(m)), tracker(comm) {}\n\n virtual ~unstructured_2d_tracker() {}\n\n\n\npublic:\n\n void initialize() {}\n\n\n\nprotected:\n\n const simplicial_unstructured_extruded_2d_mesh<> m;\n\n};\n\n\n\n}\n\n\n\n#endif\n","file_path":"include/ftk/filters/unstructured_2d_tracker.hh","rank":35,"score":210161.59371114278},{"content":"//! Enables communication within a group during a reduction.\n\n//! DIY creates the ReduceProxy for you in diy::reduce()\n\n//! and provides a reference to ReduceProxy each time the user's reduction function is called\n\nstruct ReduceProxy: public Master::Proxy\n\n{\n\n typedef std::vector<int> GIDVector;\n\n\n\n ReduceProxy(const Master::Proxy& proxy, //!< parent proxy\n\n void* block, //!< diy block\n\n unsigned round, //!< current round\n\n const Assigner& assigner, //!< assigner\n\n const GIDVector& incoming_gids, //!< incoming gids in this group\n\n const GIDVector& outgoing_gids): //!< outgoing gids in this group\n\n Master::Proxy(proxy),\n\n block_(block),\n\n round_(round),\n\n assigner_(assigner)\n\n {\n\n // setup in_link\n\n for (unsigned i = 0; i < incoming_gids.size(); ++i)\n\n {\n\n BlockID nbr;\n\n nbr.gid = incoming_gids[i];\n","file_path":"include/ftk/external/diy/reduce.hpp","rank":36,"score":210161.59371114278},{"content":"struct unstructured_3d_tracker : public virtual tracker {\n\n unstructured_3d_tracker(diy::mpi::communicator comm, const simplicial_unstructured_extruded_3d_mesh<> &m) : \n\n m(simplicial_unstructured_extruded_3d_mesh<>(m)), tracker(comm) {}\n\n virtual ~unstructured_3d_tracker() {}\n\n\n\npublic:\n\n void initialize() {}\n\n\n\nprotected:\n\n const simplicial_unstructured_extruded_3d_mesh<> m;\n\n};\n\n\n\n}\n\n\n\n#endif\n","file_path":"include/ftk/filters/unstructured_3d_tracker.hh","rank":37,"score":210161.59371114278},{"content":"struct contour_tracker : public virtual tracker {\n\n contour_tracker(diy::mpi::communicator comm) : tracker(comm) {}\n\n\n\n virtual void update() {}; \n\n void reset() {\n\n field_data_snapshots.clear();\n\n // traced_contours.clear();\n\n }\n\n \n\n void set_scalar_components(const std::vector<std::string>& c);\n\n int get_num_scalar_components() const {return scalar_components.size();}\n\n\n\n double get_threshold() const { return threshold; }\n\n void set_threshold(double t) {threshold = t;}\n\n\n\npublic:\n\n virtual bool advance_timestep();\n\n\n\npublic: // inputs\n\n bool pop_field_data_snapshot();\n","file_path":"include/ftk/filters/contour_tracker.hh","rank":38,"score":210161.59371114278},{"content":"struct regular_tracker : public virtual tracker {\n\n regular_tracker(diy::mpi::communicator comm, int nd/*2 or 3*/) : tracker(comm), m(nd+1) {}\n\n virtual ~regular_tracker() {}\n\n \n\npublic:\n\n void set_domain(const lattice& l) {domain = l;} // spatial domain\n\n void set_array_domain(const lattice& l) {array_domain = l;}\n\n\n\n void set_local_domain(const lattice&); // rank-specific \"core\" region of the block\n\n void set_local_array_domain(const lattice&); // rank-specific \"ext\" region of the block\n\n\n\n void initialize();\n\n\n\n lattice get_local_array_domain() const { return local_array_domain; }\n\n \n\npublic: // physics coordinates\n\n // void set_coordinates(const ndarray<double>& coords_) {coords = coords_; use_explicit_coords = true;}\n\n std::array<double, 3> get_coords(const std::vector<int>&) const;\n\n\n\n void set_coords_bounds(const std::vector<double>& bounds) { bounds_coords = bounds; mode_phys_coords = REGULAR_COORDS_BOUNDS; }\n","file_path":"include/ftk/filters/regular_tracker.hh","rank":39,"score":210161.59371114275},{"content":"struct data_stream_vti : public data_stream_files {\n\n void initialize() {\n\n\n\n }\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":40,"score":207560.67061998916},{"content":"struct xgc_stream_h5 : public xgc_stream\n\n{\n\n xgc_stream_h5(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD) : xgc_stream(path, comm) {}\n\n \n\n std::string postfix() const { return \".h5\"; }\n\n \n\n std::shared_ptr<ndarray_group> request_step(int step) { return NULL; } // TODO\n\n\n\n bool read_oneddiag();\n\n bool advance_timestep();\n\n};\n\n\n\ninline bool xgc_stream_h5::read_oneddiag()\n\n{\n\n const auto f = oneddiag_filename();\n\n ndarray<double> etemp_par, etemp_per;\n\n \n\n steps.read_h5(f, \"steps\");\n\n time.read_h5(f, \"time\");\n\n etemp_par.read_h5(f, \"e_parallel_mean_en_avg\");\n","file_path":"include/ftk/io/xgc_stream_h5.hpp","rank":41,"score":207560.67061998916},{"content":"struct data_stream_pnc : public data_stream_files {\n\n\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":42,"score":207560.67061998916},{"content":"struct data_stream_raw : public data_stream_files {\n\n void initialize() {}\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":43,"score":207560.67061998916},{"content":"struct xgc_stream_adios2 : public xgc_stream\n\n{\n\n xgc_stream_adios2(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD) : xgc_stream(path, comm) {}\n\n \n\n std::string postfix() const { return \".bp\"; }\n\n\n\n std::shared_ptr<ndarray_group> request_step(int step);\n\n\n\n bool read_units();\n\n\n\n bool read_oneddiag();\n\n bool advance_timestep();\n\n};\n\n\n\ninline bool xgc_stream_adios2::read_units()\n\n{\n\n xgc_units_t u;\n\n bool succ = true;\n\n\n\n if (!u.read(units_filename())) \n","file_path":"include/ftk/io/xgc_stream_adios2.hpp","rank":44,"score":207560.67061998916},{"content":"struct RegularSwapPartners: public RegularPartners\n\n{\n\n typedef RegularPartners Parent;\n\n\n\n // contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\n\n // contiguous is useful when data needs to be united;\n\n // round-robin is useful for vector-\"halving\"\n\n template<class Decomposer>\n\n RegularSwapPartners(const Decomposer& decomposer, //!< domain decomposition\n\n int k, //!< target k value\n\n bool contiguous = true //!< distance halving (true) or doubling (false)\n\n ):\n\n Parent(decomposer, k, contiguous) {}\n\n RegularSwapPartners(const DivisionVector& divs, //!< explicit division vector\n\n const KVSVector& kvs, //!< explicit k vector\n\n bool contiguous = true //!< distance halving (true) or doubling (false)\n\n ):\n\n Parent(divs, kvs, contiguous) {}\n\n\n\n bool active(int, int, const Master&) const { return true; } // in swap-reduce every block is always active\n\n\n\n void incoming(int round, int gid, std::vector<int>& partners, const Master&) const { Parent::fill(round - 1, gid, partners); }\n\n void outgoing(int round, int gid, std::vector<int>& partners, const Master&) const { Parent::fill(round, gid, partners); }\n\n};\n\n\n\n} // diy\n\n\n\n#endif\n","file_path":"include/ftk/external/diy/partners/swap.hpp","rank":45,"score":207560.67061998916},{"content":"struct data_stream_nc : public data_stream_files {\n\n\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":46,"score":207560.67061998916},{"content":"struct RegularMergePartners: public RegularPartners\n\n{\n\n typedef RegularPartners Parent;\n\n\n\n // contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\n\n // contiguous is useful when data needs to be united;\n\n // round-robin is useful for vector-\"halving\"\n\n template<class Decomposer>\n\n RegularMergePartners(const Decomposer& decomposer, //!< domain decomposition\n\n int k, //!< target k value\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(decomposer, k, contiguous) {}\n\n RegularMergePartners(const DivisionVector& divs, //!< explicit division vector\n\n const KVSVector& kvs, //!< explicit k vector\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(divs, kvs, contiguous) {}\n\n\n\n inline bool active(int round, int gid, const Master&) const;\n","file_path":"include/ftk/external/diy/partners/merge.hpp","rank":47,"score":207560.67061998916},{"content":"struct Block : public ftk::distributed_union_find_exchange<std::string> {\n\n Block(): nchanges(0), distributed_union_find_exchange() { \n\n \n\n }\n\n\n\n // add an element\n\n void add(std::string ele) {\n\n distributed_union_find_exchange::add(ele); \n\n this->ele2gid[ele] = -1;\n\n }\n\n\n\n void add_related_element(std::string ele, std::string related_ele) {\n\n this->related_elements[ele].push_back(related_ele); \n\n this->ele2gid[related_ele] = -1; \n\n }\n\n\n\npublic: \n\n // map element id to ids of its related elements\n\n // Can be optimized by ordered the related elements, put related elements on process first and ordered decreingly by ids\n\n std::map<std::string, std::vector<std::string>> related_elements; \n\n std::map<std::string, int> ele2gid; \n\n\n\n int nchanges; // # of processed unions per round = valid unions (united unions) + passing unions\n\n};\n\n\n\n// ==========================================================\n\n\n","file_path":"include/ftk/basic/legacy/distributed_union_find_deprecated.hh","rank":48,"score":206448.90304668123},{"content":"// DIY Block for distributed union-find\n\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\n\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), temporary_root_2_gids(), nonlocal_temporary_roots_2_grandparents(), ele2gid(), distributed_union_find() { \n\n \n\n }\n\n\n\n // add an element\n\n void add(std::string ele) {\n\n this->nchanges += 1;\n\n\n\n if(this->has(ele)) {\n\n std::cout<<\"This ele has been added. \"<<ele<<std::endl; \n\n } else {\n\n distributed_union_find::add(ele); \n\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \n\n this->has_sent_gparent_query[ele] = false;\n\n }\n\n }\n\n\n\n void erase_element(std::string ele) {\n\n this->nchanges += 1;\n","file_path":"include/ftk/basic/legacy/distributed_union_find.hh","rank":49,"score":206448.90304668123},{"content":"struct RegularBroadcastPartners: public RegularMergePartners\n\n{\n\n typedef RegularMergePartners Parent; //!< base class merge reduction\n\n\n\n //! contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\n\n //! contiguous is useful when data needs to be united;\n\n //! round-robin is useful for vector-\"halving\"\n\n template<class Decomposer>\n\n RegularBroadcastPartners(const Decomposer& decomposer, //!< domain decomposition\n\n int k, //!< target k value\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(decomposer, k, contiguous) {}\n\n RegularBroadcastPartners(const DivisionVector& divs,//!< explicit division vector\n\n const KVSVector& kvs, //!< explicit k vector\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(divs, kvs, contiguous) {}\n\n\n\n //! returns total number of rounds\n","file_path":"include/ftk/external/diy/partners/broadcast.hpp","rank":50,"score":203509.0564796531},{"content":"struct contour_tracker_3d_regular : public contour_tracker_regular {\n\n contour_tracker_3d_regular(diy::mpi::communicator comm) : contour_tracker_regular(comm, 3), tracker(comm) {}\n\n virtual ~contour_tracker_3d_regular() {}\n\n\n\n // int cpdims() const { return 3; }\n\n\n\n void finalize();\n\n void reset();\n\n\n\n void update_timestep();\n\n\n\npublic:\n\n const feature_volume_t& get_isovolume() { return isovolume; }\n\n\n\nprotected:\n\n void build_isovolume();\n\n\n\nprotected:\n\n void write_isovolume_vtu(const std::string& filename) const;\n\n#if FTK_HAVE_VTK\n","file_path":"include/ftk/filters/contour_tracker_3d_regular.hh","rank":51,"score":203509.0564796531},{"content":"struct feature_flow_tracer_regular_distributed : public filter {\n\n\n\nprivate:\n\n};\n\n\n\n}\n\n\n\n#endif\n","file_path":"include/ftk/filters/feature_flow_tracer.hh","rank":52,"score":203509.0564796531},{"content":"struct data_stream_synthetic_woven : public data_stream_synthetic {\n\n ndarray<double> synthesize_timestep(int t) {\n\n return synthetic_woven_2D(DW, DH, t*time_scale);\n\n };\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":53,"score":203509.0564796531},{"content":"struct contour_tracker_2d_regular : public contour_tracker_regular {\n\n contour_tracker_2d_regular(diy::mpi::communicator comm) : \n\n contour_tracker_regular(comm, 2),\n\n tracker(comm)\n\n {}\n\n virtual ~contour_tracker_2d_regular() {}\n\n\n\n // int cpdims() const { return 2; }\n\n\n\n void finalize();\n\n void reset();\n\n\n\n void update_timestep();\n\n\n\n const feature_surface_t& get_surfaces() const { return surfaces; }\n\n\n\npublic:\n\n void write_isovolume_vtu(const std::string& filename) const;\n\n#if FTK_HAVE_VTK\n\n vtkSmartPointer<vtkPolyData> get_isovolume_vtp() const;\n","file_path":"include/ftk/filters/contour_tracker_2d_regular.hh","rank":54,"score":203509.0564796531},{"content":"struct RegularAllReducePartners: public RegularMergePartners\n\n{\n\n typedef RegularMergePartners Parent; //!< base class merge reduction\n\n\n\n //! contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\n\n //! contiguous is useful when data needs to be united;\n\n //! round-robin is useful for vector-\"halving\"\n\n template<class Decomposer>\n\n RegularAllReducePartners(const Decomposer& decomposer, //!< domain decomposition\n\n int k, //!< target k value\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(decomposer, k, contiguous) {}\n\n RegularAllReducePartners(const DivisionVector& divs,//!< explicit division vector\n\n const KVSVector& kvs, //!< explicit k vector\n\n bool contiguous = true //!< distance doubling (true) or halving (false)\n\n ):\n\n Parent(divs, kvs, contiguous) {}\n\n\n\n //! returns total number of rounds\n","file_path":"include/ftk/external/diy/partners/all-reduce.hpp","rank":55,"score":203509.0564796531},{"content":"// this is an abstract class, not for users\n\nstruct critical_point_tracker_regular : public critical_point_tracker, public regular_tracker {\n\n critical_point_tracker_regular(diy::mpi::communicator comm, int nd) : critical_point_tracker(comm), regular_tracker(comm, nd), tracker(comm) {}\n\n virtual ~critical_point_tracker_regular() {}\n\n\n\nprotected:\n\n typedef simplicial_regular_mesh_element element_t;\n\n \n\n std::map<element_t, feature_point_t> discrete_critical_points;\n\n std::vector<std::set<element_t>> connected_components;\n\n\n\npublic: // cp io\n\n const std::map<element_t, feature_point_t>& get_discrete_critical_points() const {return discrete_critical_points;}\n\n\n\n std::vector<feature_point_t> get_critical_points() const;\n\n // void put_critical_points(const std::vector<feature_point_t>&);\n\n};\n\n\n\n/////\n\n////\n\ninline std::vector<feature_point_t> critical_point_tracker_regular::get_critical_points() const\n","file_path":"include/ftk/filters/critical_point_tracker_regular.hh","rank":56,"score":201711.61360899865},{"content":"struct critical_point_tracker_2d_unstructured : public critical_point_tracker, public unstructured_2d_tracker\n\n{\n\n // critical_point_tracker_2d_unstructured(const simplicial_unstructured_extruded_2d_mesh<>& m) : m(m) {}\n\n // critical_point_tracker_2d_unstructured() {}\n\n critical_point_tracker_2d_unstructured(diy::mpi::communicator comm, const simplicial_unstructured_2d_mesh<>& m) : \n\n critical_point_tracker(comm), unstructured_2d_tracker(comm, m), tracker(comm) {}\n\n virtual ~critical_point_tracker_2d_unstructured() {};\n\n \n\n int cpdims() const { return 3; }\n\n // int cpdims() const { return m.ncoords() - 1; }\n\n\n\n void initialize() {}\n\n void finalize();\n\n void reset() {}\n\n\n\n void update_timestep();\n\n\n\npublic:\n\n std::vector<feature_point_t> get_critical_points() const;\n\n void put_critical_points(const std::vector<feature_point_t>&);\n","file_path":"include/ftk/filters/critical_point_tracker_2d_unstructured.hh","rank":57,"score":201711.61360899865},{"content":"// we define critical lines as intersections of two isosurfaces in 3D\n\nstruct critical_line_tracker : public virtual tracker {\n\n critical_line_tracker(diy::mpi::communicator comm) : tracker(comm) {}\n\n\n\n // int cpdims() const { return 3; }\n\n \n\n virtual void update() {}; \n\n void reset() {\n\n field_data_snapshots.clear();\n\n }\n\n \n\npublic:\n\n bool advance_timestep();\n\n\n\npublic:\n\n bool pop_field_data_snapshot();\n\n virtual void push_field_data_snapshot(const ndarray<float> &uv);\n\n \n\nprotected:\n\n struct field_data_snapshot_t {\n\n ndarray<float> uv; // shape is (2, width, height, depth)\n","file_path":"include/ftk/filters/critical_line_tracker.hh","rank":58,"score":201368.69426347443},{"content":"struct critical_point_tracker : public virtual tracker {\n\n critical_point_tracker(diy::mpi::communicator comm) : tracker(comm) {}\n\n\n\n virtual void update() {}; \n\n void reset() {\n\n field_data_snapshots.clear();\n\n traced_critical_points.clear();\n\n }\n\n\n\n void set_enable_robust_detection(bool b) { enable_robust_detection = b; }\n\n void set_enable_computing_degrees(bool b) { enable_computing_degrees = b; }\n\n void set_enable_streaming_trajectories(bool b) { enable_streaming_trajectories = b; }\n\n void set_enable_discarding_interval_points(bool b) { enable_discarding_interval_points = b; }\n\n void set_enable_discarding_degenerate_points(bool b) { enable_discarding_degenerate_points = b; }\n\n void set_enable_ignoring_degenerate_points(bool b) { enable_ignoring_degenerate_points = b; }\n\n\n\n void set_type_filter(unsigned int);\n\n\n\n void set_scalar_field_source(int s) {scalar_field_source = s;}\n\n void set_vector_field_source(int s) {vector_field_source = s;}\n","file_path":"include/ftk/filters/critical_point_tracker.hh","rank":59,"score":201362.5299534425},{"content":"struct tdgl_vortex_tracker : public virtual tracker {\n\n tdgl_vortex_tracker(diy::mpi::communicator comm) : tracker(comm) {}\n\n\n\n int cpdims() const { return 3; }\n\n \n\n virtual void update() {}; \n\n void reset() {\n\n field_data_snapshots.clear();\n\n }\n\n \n\npublic:\n\n bool advance_timestep();\n\n\n\npublic:\n\n bool pop_field_data_snapshot();\n\n void push_field_data_snapshot(\n\n const tdgl_metadata_t &meta,\n\n const ndarray<float> &rho, \n\n const ndarray<float> &phi, \n\n const ndarray<float> &re, \n","file_path":"include/ftk/filters/tdgl_vortex_tracker.hh","rank":60,"score":201362.5299534425},{"content":"struct Grid: public GridRef<C,D>\n\n{\n\n public:\n\n typedef GridRef<C,D> Parent;\n\n typedef typename Parent::Value Value;\n\n typedef typename Parent::Index Index;\n\n typedef typename Parent::Vertex Vertex;\n\n typedef Parent Reference;\n\n\n\n template<class U>\n\n struct rebind { typedef Grid<U,D> type; };\n\n\n\n public:\n\n Grid():\n\n Parent(new C[0], Vertex::zero()) {}\n\n template<class Int>\n\n Grid(const Point<Int, D>& shape, bool c_order = true):\n\n Parent(new C[size(shape)], shape, c_order)\n\n {}\n\n\n","file_path":"include/ftk/external/diy/grid.hpp","rank":61,"score":200720.84557116285},{"content":"// DIY Block for distributed union-find\n\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\n\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), ele2gid(), distributed_union_find() { \n\n \n\n }\n\n\n\n // add an element\n\n void add(std::string ele) {\n\n this->nchanges += 1;\n\n\n\n if(this->has(ele)) {\n\n std::cout<<\"This ele has been added. \"<<ele<<std::endl; \n\n } else {\n\n distributed_union_find::add(ele); \n\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \n\n }\n\n }\n\n\n\n void erase_element(std::string ele) {\n\n this->nchanges += 1;\n\n\n","file_path":"include/ftk/basic/legacy/distributed_union_find_test_backup.hh","rank":62,"score":200280.30290210337},{"content":"// DIY Block for distributed union-find\n\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\n\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), ele2gid(), distributed_union_find() { \n\n \n\n }\n\n\n\n // add an element\n\n void add(std::string ele) {\n\n this->nchanges += 1;\n\n\n\n if(this->has(ele)) {\n\n std::cout<<\"This ele has been added. \"<<ele<<std::endl; \n\n } else {\n\n distributed_union_find::add(ele); \n\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \n\n }\n\n }\n\n\n\n void erase_element(std::string ele) {\n\n this->nchanges += 1;\n\n\n","file_path":"include/ftk/basic/legacy/distributed_union_find_storing_children.hh","rank":63,"score":200280.30290210337},{"content":"struct data_stream_synthetic_double_gyre : public data_stream_synthetic {\n\n ndarray<double> synthesize_timestep(int t) {\n\n return synthetic_double_gyre(DW, DH, t * time_scale);\n\n };\n\n};\n\n\n","file_path":"include/ftk/io/data_stream.hh","rank":64,"score":199665.55912774935},{"content":"struct xgc_blob_filament_tracker : public xgc_tracker {\n\n xgc_blob_filament_tracker(diy::mpi::communicator comm,\n\n std::shared_ptr<simplicial_xgc_3d_mesh<>> mx);\n\n virtual ~xgc_blob_filament_tracker();\n\n\n\n // xgc_blob_filament_tracker(diy::mpi::communicator comm, \n\n // std::shared_ptr<simplicial_unstructured_2d_mesh<>> m2, \n\n // int nphi_, int iphi_);\n\n\n\n // int cpdims() const { return 3; }\n\n \n\n void initialize();\n\n void reset() {\n\n field_data_snapshots.clear();\n\n }\n\n void update() {}\n\n void finalize();\n\n\n\npublic:\n\n void update_timestep();\n","file_path":"include/ftk/filters/xgc_blob_filament_tracker.hh","rank":65,"score":199665.5591277494},{"content":"struct xgc_blob_threshold_tracker : public xgc_tracker {\n\n xgc_blob_threshold_tracker(diy::mpi::communicator comm, \n\n std::shared_ptr<simplicial_xgc_3d_mesh<>> m3) : xgc_tracker(comm, m3) {}\n\n virtual ~xgc_blob_threshold_tracker() {}\n\n \n\n void set_threshold(double t) { threshold = t; }\n\n\n\n // int cpdims() const { return 0; }\n\n \n\n void initialize() {}\n\n void update() {}\n\n void finalize();\n\n\n\n void update_timestep();\n\n\n\n void push_field_data_snapshot(const ndarray<double> &scalar);\n\n\n\npublic:\n\n ndarray<int> get_sliced(int t) const;\n\n void write_sliced(int t, const std::string& pattern) const;\n","file_path":"include/ftk/filters/xgc_blob_threshold_tracker.hh","rank":66,"score":199665.5591277494},{"content":"struct feature_curve_t : public std::vector<feature_point_t>\n\n{\n\n feature_curve_t() {}\n\n feature_curve_t(const feature_curve_t&);\n\n feature_curve_t& operator=(const feature_curve_t&);\n\n\n\n void relabel(int i); // assign id for traj and each point in the traj\n\n void update_statistics();\n\n void derive_velocity(); // (const std::vector<double> &dog_kernel); // assuming the traj contains only ordinal points (dt=1)\n\n\n\n std::vector<feature_curve_t> split() const; // split to consistent subtrajs\n\n std::vector<int/*idx in original traj*/> to_ordinals() const;\n\n std::vector<int/*idx in original traj*/> select(std::function<bool(const feature_point_t&)> f);\n\n\n\n void rotate(); //! if the traj is a loop and the type is inconsistent, rotate the traj before splitting\n\n void reorder(); //! reorder by timestep\n\n void adjust_time(); //! assuming traj has only one single branch and is organized in ascending order, ensure that the time increases monotonously\n\n\n\n void smooth_ordinal_types(const int half_window_size=2); // make types of ordinal points robust to noises\n\n void smooth_interval_types(); //! make types in intervals consistent\n","file_path":"include/ftk/features/feature_curve.hh","rank":67,"score":196443.7406734177},{"content":" class StaticAssigner: public Assigner\n\n {\n\n public:\n\n /**\n\n * \\ingroup Assignment\n\n * \\brief Intermediate type to express assignment that cannot change; adds `local_gids` query method\n\n */\n\n using Assigner::Assigner;\n\n\n\n //! gets the local gids for a given process rank\n\n virtual void local_gids(int rank, std::vector<int>& gids) const =0;\n\n };\n\n\n","file_path":"include/ftk/external/diy/assigner.hpp","rank":68,"score":194579.13244805645},{"content":"struct critical_point_tracker_2d_regular : public critical_point_tracker_regular {\n\n critical_point_tracker_2d_regular(diy::mpi::communicator comm) : \n\n critical_point_tracker_regular(comm, 2),\n\n tracker(comm)\n\n {}\n\n virtual ~critical_point_tracker_2d_regular() {}\n\n\n\n int cpdims() const { return 2; }\n\n\n\n void finalize();\n\n void reset();\n\n\n\n void update_timestep();\n\n\n\n void push_scalar_field_snapshot(const ndarray<double>&);\n\n void push_vector_field_snapshot(const ndarray<double>&);\n\n\n\nprotected:\n\n typedef simplicial_regular_mesh_element element_t;\n\n \n","file_path":"include/ftk/filters/critical_point_tracker_2d_regular.hh","rank":69,"score":192541.90727723652},{"content":"struct sujudi_haimes_tracker_3d_regular : public critical_line_tracker_3d_regular \n\n{\n\n sujudi_haimes_tracker_3d_regular(diy::mpi::communicator comm) : \n\n critical_line_tracker_3d_regular(comm), \n\n critical_line_tracker(comm),\n\n regular_tracker(comm, 3), \n\n tracker(comm) {}\n\n virtual ~sujudi_haimes_tracker_3d_regular() {};\n\n\n\nprotected:\n\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\n\n\n\n void simplex_residue_J(\n\n const std::vector<std::vector<int>>& vertices,\n\n float residues[3], float Js[3][3][3]) const;\n\n\n\n void push_field_data_snapshot(const ndarray<float>& data);\n\n\n\n std::vector<std::string> varnames() const { return {\"residue\", \"discJ\"}; }\n\n};\n","file_path":"include/ftk/filters/sujudi_haimes_tracker_3d_regular.hh","rank":70,"score":192541.90727723652},{"content":"struct critical_point_tracker_3d_regular : public critical_point_tracker_regular {\n\n critical_point_tracker_3d_regular(diy::mpi::communicator comm) : critical_point_tracker_regular(comm, 3), tracker(comm) {}\n\n virtual ~critical_point_tracker_3d_regular() {}\n\n \n\n // int cpdims() const { return 3; }\n\n\n\n void finalize();\n\n\n\n void update_timestep();\n\n \n\n void push_scalar_field_snapshot(const ndarray<double>&);\n\n void push_vector_field_snapshot(const ndarray<double>&);\n\n \n\nprotected:\n\n typedef simplicial_regular_mesh_element element_t;\n\n\n\nprotected:\n\n bool check_simplex(const element_t& s, feature_point_t& cp);\n\n void trace_intersections();\n\n void trace_connected_components();\n","file_path":"include/ftk/filters/critical_point_tracker_3d_regular.hh","rank":71,"score":192541.90727723652},{"content":"struct ridge_valley_tracker_3d_regular : public sujudi_haimes_tracker_3d_regular \n\n{\n\n ridge_valley_tracker_3d_regular(diy::mpi::communicator comm) : \n\n sujudi_haimes_tracker_3d_regular(comm),\n\n critical_line_tracker(comm),\n\n regular_tracker(comm, 3), \n\n tracker(comm) {}\n\n virtual ~ridge_valley_tracker_3d_regular() {};\n\n\n\nprotected:\n\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\n\n void push_field_data_snapshot(const ndarray<float>& data);\n\n \n\n void simplex_scalars(\n\n const std::vector<std::vector<int>>& vertices,\n\n float scalars[3]) const;\n\n\n\n std::vector<std::string> varnames() const { return {\"residue\", \"discJ\", \"scalar\"}; }\n\n};\n\n\n","file_path":"include/ftk/filters/ridge_valley_tracker_3d_regular.hh","rank":72,"score":192541.90727723652},{"content":"struct function_traits<T&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":73,"score":192392.12653308164},{"content":"struct function_traits<T&&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":74,"score":192392.12653308164},{"content":"struct point_locator_2d_quad : public point_locator_2d<I, F> {\n\n point_locator_2d_quad(const simplicial_unstructured_2d_mesh<I, F> &m) \n\n : point_locator_2d<I, F>(m) { initialize(); }\n\n virtual ~point_locator_2d_quad();\n\n\n\n void initialize();\n\n // I locate(const F x[], F mu[]) const { return locate_point_recursive(x, root, mu); }\n\n I locate(const F x[], F mu[]) const { return locate_point_nonrecursive(x, mu); }\n\n\n\n std::vector<bvh2d_node_t<I, F>> to_bvh() const;\n\n\n\nprotected:\n\n struct quad_node {\n\n quad_node *parent = NULL;\n\n quad_node *children[4] = {NULL};\n\n AABB<F> aabb;\n\n std::vector<AABB<F>> elements; // valid only for leaf nodes\n\n\n\n ~quad_node();\n\n bool is_leaf() const { return elements.size() > 0; }\n","file_path":"include/ftk/mesh/point_locator_2d_quad.hh","rank":75,"score":192392.12653308164},{"content":" class ContiguousAssigner: public StaticAssigner\n\n {\n\n public:\n\n /**\n\n * \\ingroup Assignment\n\n * \\brief Assigns blocks to processes in contiguous gid (block global id) order\n\n */\n\n using StaticAssigner::StaticAssigner;\n\n\n\n using StaticAssigner::size;\n\n using StaticAssigner::nblocks;\n\n\n\n int rank(int gid) const override\n\n {\n\n int div = nblocks() / size();\n\n int mod = nblocks() % size();\n\n int r = gid / (div + 1);\n\n if (r < mod)\n\n {\n\n return r;\n\n } else\n\n {\n\n return mod + (gid - (div + 1)*mod)/div;\n\n }\n\n }\n\n inline\n\n void local_gids(int rank, std::vector<int>& gids) const override;\n\n };\n\n\n","file_path":"include/ftk/external/diy/assigner.hpp","rank":76,"score":189783.6907323662},{"content":"struct simplicial_unstructured_extruded_2d_mesh : public object { // extruded from \n\n simplicial_unstructured_extruded_2d_mesh(const simplicial_unstructured_2d_mesh<I, F>& m_) : m(m_) {extrude();}\n\n\n\n size_t n(int d) const;\n\n size_t n_ordinal(int d) const { return m.n(d); }\n\n size_t n_interval(int d) const;\n\n\n\n bool is_ordinal(int d, I i) const {\n\n I k = mod(i, n(d));\n\n return k < n_ordinal(d);\n\n }\n\n\n\n I flat_vertex_id(I i) const { return mod(i, m.n(0)); }\n\n I flat_vertex_time(I i) const { return i / m.n(0); }\n\n I extruded_vertex_id(I i, bool t=true) { return t ? i + m.n(0) : i; }\n\n\n\n int face_type(I i) const; // legacy\n\n int simplex_type(int d, I i) const;\n\n\n\n int get_triangle_chi(I i) const;\n","file_path":"include/ftk/mesh/simplicial_unstructured_extruded_2d_mesh.hh","rank":77,"score":188548.6291811779},{"content":"struct simplicial_unstructured_extruded_3d_mesh : public object { // extruded from \n\n simplicial_unstructured_extruded_3d_mesh(const simplicial_unstructured_3d_mesh<I, F>& m_) : m(m_) {extrude();}\n\n\n\n size_t n(int d) const;\n\n size_t n_ordinal(int d) const { if (d == 4) return m.n(3)*4; else return m.n(d); }\n\n size_t n_interval(int d) const;\n\n\n\n bool is_ordinal(int d, I i) const {\n\n I k = mod(i, n(d));\n\n return k < n_ordinal(d);\n\n }\n\n\n\n I flat_vertex_id(I i) const { return mod(i, m.n(0)); }\n\n I flat_vertex_time(I i) const { return std::floor((double)i / n(0)); } // return i / m.n(0); }\n\n I extruded_vertex_id(I i, bool t=true) { return t ? i + m.n(0) : i; }\n\n\n\n int tet_type(I i) const { return simplex_type(3, i); }\n\n int simplex_type(int d, I i) const;\n\n\n\npublic: // element iteration\n","file_path":"include/ftk/mesh/simplicial_unstructured_extruded_3d_mesh.hh","rank":78,"score":188548.62918117794},{"content":"struct simplicial_xgc_3d_mesh : public simplicial_unstructured_3d_mesh<I, F> {\n\n simplicial_xgc_3d_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_); // nphi and iphi must be specified before using\n\n simplicial_xgc_3d_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_, int nphi, int iphi=1, int vphi=1);\n\n // simplicial_xgc_3d_mesh(const std::string& mesh_filename);\n\n\n\n std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> get_m2() const {return m2;}\n\n\n\n virtual size_t n(int d) const;\n\n size_t np() const {return nphi * iphi * vphi;} // number of poloidal planes, incl. virtual planes defined by vphi\n\n\n\n bool probe_nphi_iphi(const std::string& filename);\n\n void set_nphi_iphi(int n, int i) {nphi = n; iphi = i;}\n\n void set_vphi(int v) { vphi = v; }\n\n\n\n int get_nphi() const {return nphi;}\n\n int get_iphi() const {return iphi;}\n\n int get_vphi() const {return vphi;}\n\n\n\n bool is_poloidal(int p) const { return p % vphi == 0; }\n\n bool is_poloidal(int d, I i) const { return m3->is_ordinal(d, i); }\n","file_path":"include/ftk/mesh/simplicial_xgc_3d_mesh.hh","rank":79,"score":188548.62918117794},{"content":"struct feature_point_set_t : public std::list<feature_point_t>\n\n{\n\n#if FTK_HAVE_VTK\n\n vtkSmartPointer<vtkPolyData> to_vtp(\n\n const std::vector<std::string>& scalar_components) const;\n\n#endif\n\n};\n\n\n\n#if FTK_HAVE_VTK\n\nvtkSmartPointer<vtkPolyData> feature_point_set_t::to_vtp(\n\n const std::vector<std::string>& scalar_components) const\n\n{\n\n vtkSmartPointer<vtkPolyData> poly = vtkPolyData::New();\n\n vtkSmartPointer<vtkPoints> points = vtkPoints::New();\n\n vtkSmartPointer<vtkCellArray> vertices = vtkCellArray::New();\n\n \n\n vtkIdType pid[1];\n\n for (const auto &cp : *this) {\n\n double p[3] = {cp.x[0], cp.x[1], cp.x[2]}; \n\n pid[0] = points->InsertNextPoint(p);\n","file_path":"include/ftk/features/feature_point_set.hh","rank":80,"score":188548.6291811779},{"content":"struct simplicial_unstructured_3d_mesh : public simplicial_unstructured_mesh<I, F> {\n\n friend class diy::Serialization<simplicial_unstructured_3d_mesh<I, F>>;\n\n \n\n simplicial_unstructured_3d_mesh() {}\n\n\n\n simplicial_unstructured_3d_mesh(\n\n const std::vector<F>& coords, \n\n const std::vector<I>& tetrahedra);\n\n\n\n int nd() const {return 3;}\n\n virtual size_t n(int d) const;\n\n \n\n void build_smoothing_kernel(F sigma);\n\n void smooth_scalar_gradient_jacobian(\n\n const ndarray<F>& f, \n\n const F sigma,\n\n ndarray<F>& fs, // smoothed scalar field\n\n ndarray<F>& g, // smoothed gradient field\n\n ndarray<F>& j // smoothed jacobian field\n\n ) const; \n","file_path":"include/ftk/mesh/simplicial_unstructured_3d_mesh.hh","rank":81,"score":188548.6291811779},{"content":"struct simplicial_xgc_2d_mesh : public simplicial_unstructured_2d_mesh<I, F> {\n\n simplicial_xgc_2d_mesh(\n\n const ndarray<F>& coords, \n\n const ndarray<I>& triangles,\n\n const ndarray<F>& psi,\n\n const ndarray<I>& nextnodes);\n\n \n\n simplicial_xgc_2d_mesh(\n\n const ndarray<F>& coords, \n\n const ndarray<I>& triangles) : simplicial_unstructured_2d_mesh<I, F>(coords, triangles) {}\n\n\n\n void initialize_point_locator();\n\n void initialize_roi(double psin_min = 0.9, double psin_max = 1.05, \n\n double theta_min_deg = -60.0, double theta_max_deg = 60.0);\n\n\n\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_file(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\n\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_h5(const std::string& filename);\n\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_bp(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\n\n\n\n void read_oneddiag(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\n","file_path":"include/ftk/mesh/simplicial_xgc_2d_mesh.hh","rank":82,"score":188548.6291811779},{"content":"struct simplicial_mpas_2d_mesh : public simplicial_unstructured_2d_mesh<I, F> {\n\n simplicial_mpas_2d_mesh(\n\n const ndarray<F>& coords, \n\n const ndarray<I>& triangles) : simplicial_unstructured_2d_mesh<I, F>(coords, triangles) {}\n\n\n\n // int ncoords() const { return 3; }\n\n\n\n static std::shared_ptr<simplicial_mpas_2d_mesh<I, F>> from_file(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\n\n};\n\n\n\n// inline simplicial_mpas_2d_mesh::simplicial_mpas_2d_mesh(const mpas_mesh& mm) :\n\n\n\ntemplate <typename I, typename F>\n\nstd::shared_ptr<simplicial_mpas_2d_mesh<I, F>> simplicial_mpas_2d_mesh<I, F>::from_file(\n\n const std::string& filename, \n\n diy::mpi::communicator comm)\n\n{\n\n#if FTK_HAVE_NETCDF\n\n int ncid;\n\n NC_SAFE_CALL( nc_open(filename.c_str(), NC_NOWRITE, &ncid) );\n","file_path":"include/ftk/mesh/simplicial_mpas_2d_mesh.hh","rank":83,"score":188548.6291811779},{"content":"struct critical_line_tracker_3d_regular : public virtual critical_line_tracker, public virtual regular_tracker\n\n{\n\n critical_line_tracker_3d_regular(diy::mpi::communicator comm) : critical_line_tracker(comm), regular_tracker(comm, 3), tracker(comm) {}\n\n virtual ~critical_line_tracker_3d_regular() {}\n\n\n\n void finalize();\n\n void reset();\n\n\n\n void update_timestep();\n\n\n\npublic:\n\n void build_vortex_surfaces();\n\n\n\n void read_surfaces(const std::string& filename, std::string format=\"auto\");\n\n\n\n void write_intersections(const std::string& filename) const;\n\n void write_sliced(const std::string& pattern) const;\n\n void write_surfaces(const std::string& filename, std::string format=\"auto\") const;\n\n#if FTK_HAVE_VTK\n\n vtkSmartPointer<vtkPolyData> get_intersections_vtp() const;\n","file_path":"include/ftk/filters/critical_line_tracker_3d_regular.hh","rank":84,"score":187586.58315122855},{"content":"struct tdgl_vortex_tracker_3d_regular : public virtual tdgl_vortex_tracker, public virtual regular_tracker\n\n{\n\n tdgl_vortex_tracker_3d_regular(diy::mpi::communicator comm) : tdgl_vortex_tracker(comm), regular_tracker(comm, 3), tracker(comm) {}\n\n virtual ~tdgl_vortex_tracker_3d_regular() {}\n\n\n\n void finalize();\n\n void reset();\n\n\n\n void update_timestep();\n\n\n\npublic:\n\n void build_vortex_surfaces();\n\n\n\n void read_surfaces(const std::string& filename, std::string format=\"auto\");\n\n\n\n void write_intersections(const std::string& filename) const;\n\n void write_sliced(const std::string& pattern) const;\n\n void write_surfaces(const std::string& filename, std::string format=\"auto\") const;\n\n#if FTK_HAVE_VTK\n\n vtkSmartPointer<vtkPolyData> get_intersections_vtp() const;\n","file_path":"include/ftk/filters/tdgl_vortex_tracker_3d_regular.hh","rank":85,"score":187586.58315122855},{"content":"struct diyfp // f * 2^e\n\n{\n\n static constexpr int kPrecision = 64; // = q\n\n\n\n std::uint64_t f = 0;\n\n int e = 0;\n\n\n\n constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {}\n\n\n\n /*!\n\n @brief returns x - y\n\n @pre x.e == y.e and x.f >= y.f\n\n */\n\n static diyfp sub(const diyfp& x, const diyfp& y) noexcept\n\n {\n\n assert(x.e == y.e);\n\n assert(x.f >= y.f);\n\n\n\n return {x.f - y.f, x.e};\n\n }\n","file_path":"include/ftk/external/json.hh","rank":86,"score":186165.48364938895},{"content":"struct levy_degani_seginer_tracker_3d_regular : public critical_line_tracker_3d_regular \n\n{\n\n levy_degani_seginer_tracker_3d_regular(diy::mpi::communicator comm) : \n\n critical_line_tracker_3d_regular(comm), \n\n critical_line_tracker(comm),\n\n regular_tracker(comm, 3), \n\n tracker(comm) {}\n\n virtual ~levy_degani_seginer_tracker_3d_regular() {};\n\n\n\nprotected:\n\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\n\n\n\n void simplex_residue_vorts(\n\n const std::vector<std::vector<int>>& vertices,\n\n float residues[3], float vorts[3][3]) const;\n\n\n\n void push_field_data_snapshot(const ndarray<float>& data);\n\n\n\n std::vector<std::string> varnames() const { return {\"residue\", \"vortmag\"}; }\n\n};\n","file_path":"include/ftk/filters/levy_degani_seginer_tracker_3d_regular.hh","rank":87,"score":186081.9089972477},{"content":" class RoundRobinAssigner: public StaticAssigner\n\n {\n\n public:\n\n /**\n\n * \\ingroup Assignment\n\n * \\brief Assigns blocks to processes in cyclic or round-robin gid (block global id) order\n\n */\n\n using StaticAssigner::StaticAssigner;\n\n\n\n using StaticAssigner::size;\n\n using StaticAssigner::nblocks;\n\n\n\n int rank(int gid) const override { return gid % size(); }\n\n inline\n\n void local_gids(int rank, std::vector<int>& gids) const override;\n\n };\n\n\n","file_path":"include/ftk/external/diy/assigner.hpp","rank":88,"score":185255.1371622713},{"content":"struct function_traits<ReturnType(*)(Args...)>\n\n : public function_traits<ReturnType(Args...)>\n\n{};\n\n\n\ntemplate <typename ClassType, typename ReturnType, typename... Args>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":89,"score":184948.612786814},{"content":"struct function_traits<ReturnType(Args...)>\n\n{\n\n /**\n\n .. type:: type result_type\n\n\n\n The type returned by calling an instance of the function object type *F*.\n\n */\n\n typedef ReturnType result_type;\n\n\n\n /**\n\n .. type:: type function_type\n\n\n\n The function type (``R(T...)``).\n\n */\n\n typedef ReturnType function_type(Args...);\n\n\n\n /**\n\n .. type:: type member_function_type<OwnerType>\n\n\n\n The member function type for an *OwnerType* (``R(OwnerType::*)(T...)``).\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":90,"score":184948.612786814},{"content":"struct function_traits<volatile T&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":91,"score":184550.14245891082},{"content":"struct function_traits<volatile T&&> : public function_traits<T> {};\n\ntemplate <typename T>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":92,"score":184550.14245891082},{"content":"struct simplicial_xgc_3dff_mesh : public simplicial_xgc_3d_mesh<I, F> {\n\n simplicial_xgc_3dff_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_, int nphi, int iphi=1, int vphi=1) \n\n : simplicial_xgc_3d_mesh<I, F>(m2_, nphi, iphi, vphi) {}\n\n\n\n void initialize_ff_mesh() {}; // TODO\n\n void initialize_ff_mesh(const std::string& filename);\n\n void read_ff_mesh(const std::string& filename) { um = simplicial_unstructured_3d_mesh<I, F>::from_file(filename); }\n\n void write_ff_mesh(const std::string& filename) const { um->to_file(filename); }\n\n\n\npublic: // reimpl\n\n size_t n(int d) const;\n\n\n\n void get_simplex(int d, I i, I verts[]) const;\n\n bool find_simplex(int d, const I v[], I &i) const { return false; } // TODO\n\n\n\nprotected:\n\n std::shared_ptr<simplicial_unstructured_3d_mesh<I, F>> um; // the \"unit\" 3D mesh between poloidal planes\n\n};\n\n\n\n///////////////////\n","file_path":"include/ftk/mesh/simplicial_xgc_3dff_mesh.hh","rank":93,"score":181424.97733066507},{"content":"struct function_traits<MEM_FN_SYMBOL_XX0SL7G4Z0J<R(C::*)(A...) const>>\n\n : public function_traits<R(const C*, A...)>\n\n{};\n\ntemplate <typename R, typename C, typename... A>\n","file_path":"include/ftk/external/diy/detail/traits.hpp","rank":94,"score":181368.92219256973},{"content":"// It is a separate type rather than an alias to make symbols readable.\n\nstruct format_args : basic_format_args<format_context> {\n\n template <typename... Args>\n\n format_args(Args&&... args)\n\n : basic_format_args<format_context>(std::forward<Args>(args)...) {}\n\n};\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":95,"score":180615.5125566115},{"content":"struct wformat_args : basic_format_args<wformat_context> {\n\n template <typename... Args>\n\n wformat_args(Args&&... args)\n\n : basic_format_args<wformat_context>(std::forward<Args>(args)...) {}\n\n};\n\n\n\ntemplate <typename Container> struct is_contiguous : std::false_type {};\n\n\n\ntemplate <typename Char>\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":96,"score":180615.5125566115},{"content":"struct is_contiguous_back_insert_iterator : std::false_type {};\n\ntemplate <typename Container>\n","file_path":"include/ftk/external/diy/fmt/core.h","rank":97,"score":180615.5125566115},{"content":"struct object {\n\n object() {}\n\n object(diy::mpi::communicator c) {comm = c;}\n\n\n\n void set_communicator(const diy::mpi::communicator comm_) {comm = comm_;}\n\n void set_root_proc(int p) {root_proc = p;}\n\n int get_root_proc() const {return root_proc;}\n\n bool is_root_proc() const {return root_proc == comm.rank();}\n\n\n\n static void set_affinity(int cpu) {\n\n#if !defined(_MSC_VER) && !defined(__APPLE__)\n\n cpu_set_t cpu_set;\n\n CPU_ZERO(&cpu_set);\n\n CPU_SET(cpu, &cpu_set);\n\n\n\n pthread_t thread = pthread_self();\n\n pthread_setaffinity_np(thread, sizeof(cpu_set_t), &cpu_set);\n\n // fprintf(stderr, \"cpu=%d\\n\", cpu);\n\n#endif\n\n }\n","file_path":"include/ftk/object.hh","rank":98,"score":179096.8093001128},{"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":"include/ftk/external/json.hh","rank":99,"score":178875.67468895108}],"string":"[\n {\n \"content\": \"struct formatter<void*, Char> : formatter<const void*, Char> {\\n\\n template <typename FormatContext>\\n\\n auto format(void* val, FormatContext& ctx) -> decltype(ctx.out()) {\\n\\n return formatter<const void*, Char>::format(val, ctx);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename Char, size_t N>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/format.h\",\n \"rank\": 0,\n \"score\": 275478.4127111879\n },\n {\n \"content\": \"struct static_const\\n\\n{\\n\\n static constexpr T value{};\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nconstexpr T static_const<T>::value;\\n\\n} // namespace detail\\n\\n} // namespace nlohmann\\n\\n\\n\\n// #include <nlohmann/detail/meta/type_traits.hpp>\\n\\n\\n\\n\\n\\n#include <limits> // numeric_limits\\n\\n#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type\\n\\n#include <utility> // declval\\n\\n\\n\\n// #include <nlohmann/detail/boolean_operators.hpp>\\n\\n\\n\\n// #include <nlohmann/detail/iterators/iterator_traits.hpp>\\n\",\n \"file_path\": \"include/ftk/external/json.hh\",\n \"rank\": 1,\n \"score\": 270002.3350678477\n },\n {\n \"content\": \"struct function_traits<const T&&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 2,\n \"score\": 244117.9108136032\n },\n {\n \"content\": \"struct function_traits<const T&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 3,\n \"score\": 244117.9108136032\n },\n {\n \"content\": \"struct FMT_DEPRECATED convert_to_int\\n\\n : bool_constant<!std::is_arithmetic<T>::value &&\\n\\n std::is_convertible<T, int>::value> {};\\n\\n\\n\\nnamespace internal {\\n\\n\\n\\n// Specifies if T has an enabled formatter specialization. A type can be\\n\\n// formattable even if it doesn't have a formatter e.g. via a conversion.\\n\\ntemplate <typename T, typename Context>\\n\\nusing has_formatter =\\n\\n std::is_constructible<typename Context::template formatter_type<T>>;\\n\\n\\n\\n/** A contiguous memory buffer with an optional growing ability. */\\n\\ntemplate <typename T> class buffer {\\n\\n private:\\n\\n buffer(const buffer&) = delete;\\n\\n void operator=(const buffer&) = delete;\\n\\n\\n\\n T* ptr_;\\n\\n std::size_t size_;\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 4,\n \"score\": 243862.8403661732\n },\n {\n \"content\": \"struct feature_curve_set_t : public std::multimap<int, feature_curve_t>\\n\\n{\\n\\n int add(const feature_curve_t&);\\n\\n void add(const feature_curve_t&, int label);\\n\\n std::vector<int> add(const std::vector<feature_curve_t>&);\\n\\n\\n\\n std::list<feature_curve_t> to_list() const;\\n\\n void from_list(const std::list<feature_curve_t>&);\\n\\n\\n\\n // std::vector<int> split(int);\\n\\n void split_all();\\n\\n \\n\\n void foreach(std::function<void(const feature_curve_t&)> f) const {for (const auto& kv : *this) f(kv.second);}\\n\\n void foreach(std::function<void(feature_curve_t&)> f) {for (auto& kv : *this) f(kv.second);}\\n\\n void foreach(std::function<void(int, const feature_curve_t&)> f) const {for (const auto& kv : *this) f(kv.first, kv.second);}\\n\\n void foreach(std::function<void(int, feature_curve_t&)> f) {for (auto& kv : *this) f(kv.first, kv.second);}\\n\\n\\n\\n void filter(std::function<bool(const feature_curve_t&)> f);\\n\\n\\n\\n std::vector<feature_point_t> slice(int t) const;\\n\",\n \"file_path\": \"include/ftk/features/feature_curve_set.hh\",\n \"rank\": 5,\n \"score\": 239483.4874555793\n },\n {\n \"content\": \"struct lattice {\\n\\n friend class lattice_partitioner;\\n\\n template <typename T> friend class ndarray;\\n\\n\\n\\n lattice() {}\\n\\n lattice(int n);\\n\\n lattice(int n, const int *dims);\\n\\n lattice(const std::vector<size_t> &starts, const std::vector<size_t> &sizes) {reshape(starts, sizes);}\\n\\n lattice(const std::vector<size_t> &sizes) {reshape(sizes);}\\n\\n\\n\\n lattice(const diy::DiscreteBounds& b);\\n\\n diy::DiscreteBounds to_diy_bounds() const;\\n\\n\\n\\n friend std::ostream& operator<<(std::ostream& os, const lattice&);\\n\\n\\n\\n size_t nd() const {return sizes_.size();}\\n\\n size_t nd_cuttable() const {return unlimited_time() ? nd() - 1 : nd();}\\n\\n size_t start(size_t i) const {return starts_[i];}\\n\\n size_t size(size_t i) const {return sizes_[i];}\\n\\n size_t upper_bound(size_t i) const {return starts_[i] + sizes_[i] - 1;}\\n\",\n \"file_path\": \"include/ftk/mesh/lattice.hh\",\n \"rank\": 6,\n \"score\": 239412.66999667895\n },\n {\n \"content\": \"struct function_traits<const volatile T&&> : public function_traits<T> {};\\n\\n\\n\\n\\n\\n#define FORWARD_RES_8QR485JMSBT \\\\\\n\\n typename std::conditional< \\\\\\n\\n std::is_lvalue_reference<R>::value, \\\\\\n\\n T&, \\\\\\n\\n typename std::remove_reference<T>::type&& \\\\\\n\\n >::type\\n\\n\\n\\n/**\\n\\n.. function:: auto utils::forward_like<Like, T>(T&& t) noexcept\\n\\n\\n\\n Forward the reference *t* like the type of *Like*. That means, if *Like* is\\n\\n an lvalue (reference), this function will return an lvalue reference of *t*.\\n\\n Otherwise, if *Like* is an rvalue, this function will return an rvalue\\n\\n reference of *t*.\\n\\n\\n\\n This is mainly used to propagate the expression category (lvalue/rvalue) of\\n\\n a member of *Like*, generalizing ``std::forward``.\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 7,\n \"score\": 234463.7372208183\n },\n {\n \"content\": \"struct function_traits<const volatile T&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 8,\n \"score\": 234463.7372208183\n },\n {\n \"content\": \"struct filter : public object {\\n\\n filter(diy::mpi::communicator comm) : object(comm) {\\n\\n nthreads = default_nthreads();\\n\\n }\\n\\n\\n\\n virtual void update() = 0;\\n\\n virtual void reset() {};\\n\\n\\n\\n void use_thread_backend(const std::string& backend);\\n\\n void use_thread_backend(int i) { thread_backend = i; }\\n\\n\\n\\n void use_accelerator(const std::string& acc);\\n\\n void use_accelerator(int i) {\\n\\n xl = i;\\n\\n#if 0\\n\\n if (xl == FTK_THREAD_OPENMP || xl == FTK_XL_SYCL || xl == FTK_XL_KOKKOS_CUDA) {\\n\\n warn(\\\"Accelerator not available. Using FTK_XL_NONE.\\\");\\n\\n xl = FTK_XL_NONE;\\n\\n }\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/filters/filter.hh\",\n \"rank\": 9,\n \"score\": 231624.74558363826\n },\n {\n \"content\": \"struct tracker : public filter\\n\\n{\\n\\n tracker(diy::mpi::communicator comm) : filter(comm) {} // , master(comm) {}\\n\\n virtual ~tracker() {}\\n\\n \\n\\n // virtual int cpdims() const = 0; // featutre dimension\\n\\n \\n\\n void set_start_timestep(int t) { start_timestep = t;}\\n\\n void set_end_timestep(int t) { end_timestep = t; }\\n\\n \\n\\n virtual void set_current_timestep(int t) {current_timestep = t;}\\n\\n int get_current_timestep() const {return current_timestep;}\\n\\n \\n\\n void set_input_array_partial(bool b) {is_input_array_partial = b;}\\n\\n void set_use_default_domain_partition(bool b) {use_default_domain_partition = true;}\\n\\n\\n\\n static int str2tracker(const std::string&);\\n\\n\\n\\npublic:\\n\\n virtual void initialize() = 0;\\n\",\n \"file_path\": \"include/ftk/filters/tracker.hh\",\n \"rank\": 10,\n \"score\": 231624.74558363826\n },\n {\n \"content\": \"struct ndarray : public ndarray_base {\\n\\n friend class diy::Serialization<ndarray<T>>;\\n\\n\\n\\n int type() const;\\n\\n\\n\\n unsigned int hash() const;\\n\\n\\n\\n ndarray() {}\\n\\n ndarray(const std::vector<size_t> &dims) {reshape(dims);}\\n\\n ndarray(const std::vector<size_t> &dims, T val) {reshape(dims, val);}\\n\\n ndarray(const lattice& l) {reshape(l.sizes());}\\n\\n ndarray(const T *a, const std::vector<size_t> &shape);\\n\\n \\n\\n template <typename T1> ndarray(const ndarray<T1>& array1) { from_array<T1>(array1); }\\n\\n ndarray(const ndarray<T>& a) { dims = a.dims; s = a.s; ncd = a.ncd; tv = a.tv; p = a.p; }\\n\\n \\n\\n template <typename T1> ndarray<T>& operator=(const ndarray<T1>& array1) { from_array<T1>(array1); return *this; }\\n\\n ndarray<T>& operator=(const ndarray<T>& a) { dims = a.dims; s = a.s; ncd = a.ncd; tv = a.tv; p = a.p; return *this; }\\n\\n\\n\\n std::ostream& print(std::ostream& os) const;\\n\",\n \"file_path\": \"include/ftk/ndarray.hh\",\n \"rank\": 11,\n \"score\": 231624.74558363826\n },\n {\n \"content\": \"struct function_traits<ReturnType(ClassType::*)(Args...) const>\\n\\n : public function_traits<ReturnType(Args...)>\\n\\n{\\n\\n typedef const ClassType& owner_type;\\n\\n};\\n\\n\\n\\ntemplate <typename ClassType, typename ReturnType, typename... Args>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 12,\n \"score\": 228839.68936066466\n },\n {\n \"content\": \"struct ndarray_writer : public object {\\n\\n void configure(const json& j_);\\n\\n // JSON specificications:\\n\\n // required fields: \\n\\n // - nd, number. dimensionality of the data\\n\\n // - filename, string, e.g. \\\"tornado-%04d.nc\\\". Should be able to expand to file names with sprintf(3)\\n\\n // - format (nc|vti|float32|float64)\\n\\n // format-specific fields: \\n\\n // - nc (NetCDF), serial\\n\\n // - variable (required), string or array of strings. Possible to use the same\\n\\n // specification in the input stream config. Will be converted to array of \\n\\n // strings internally. Will write one or multiple variables.\\n\\n // - dimensions (optional), array of strings; by default use [\\\"x\\\", \\\"y\\\"] and \\n\\n // [\\\"x\\\", \\\"y\\\", \\\"z\\\"] for 2D and 3D data, respectively\\n\\n // - unlimited_time (optional, by default true), bool. If true, include time \\n\\n // in dimensions, e.g. (time,z,y,x), in netcdf. \\n\\n // - vti (vtkImageData w/ vtkXMLImageDataWriter)\\n\\n // - variable (required), string or array of strings. Possible to use the same\\n\\n // specification in the input stream config. \\n\\n // - string: write one single variable, assuming the data is single-component\\n\",\n \"file_path\": \"include/ftk/ndarray/writer.hh\",\n \"rank\": 14,\n \"score\": 226227.42489461444\n },\n {\n \"content\": \"struct ndarray_stream : public object {\\n\\n ndarray_stream(diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\\n ndarray_stream(const std::string adios2_config_filename, // = \\\"adios2.xml\\\",\\n\\n const std::string adios2_io_name, // = \\\"SimulationOutput\\\",\\n\\n diy::mpi::communicator comm); // = MPI_COMM_WORLD);\\n\\n ~ndarray_stream();\\n\\n\\n\\n void configure(const json& j) {set_input_source_json(j);}\\n\\n // JSON specifications:\\n\\n // required fields: \\n\\n // - type, string. Must be one of \\\"synthetic\\\" and \\\"file\\\". This field may be ommited\\n\\n // if `format' is given.\\n\\n // - name (required if type is synthetic), string. Must be one of the follows: \\\"woven\\\", \\n\\n // \\\"double_gyre\\\", \\\"merger_2d\\\".\\n\\n // optional fields:\\n\\n // - filenames (required if type is file), string. The list of filenames will be \\n\\n // determined by glob(3)\\n\\n // - mesh_filename (required for unstructured mesh, must be in vtu format in the \\n\\n // current version), string.\\n\\n // - format (required if type is file and format is float32/float64), string. If not \\n\",\n \"file_path\": \"include/ftk/ndarray/stream.hh\",\n \"rank\": 15,\n \"score\": 226227.42489461444\n },\n {\n \"content\": \"struct xgc_tracker : public tracker {\\n\\n xgc_tracker(diy::mpi::communicator comm,\\n\\n std::shared_ptr<simplicial_xgc_3d_mesh<>> mx);\\n\\n\\n\\n void reset() { field_data_snapshots.clear(); }\\n\\n\\n\\n void set_use_roi(bool b) { use_roi = b; }\\n\\n\\n\\npublic:\\n\\n std::shared_ptr<simplicial_unstructured_2d_mesh<>> get_m2() { return m2; }\\n\\n void initialize_ff_mesh(const std::string& filename) { mf3.reset(new simplicial_xgc_3dff_mesh<>(m2, m3->get_nphi(), m3->get_iphi(), m3->get_vphi()) ); mf3->initialize_ff_mesh(filename); }\\n\\n\\n\\npublic:\\n\\n virtual void push_field_data_snapshot(std::shared_ptr<ndarray_group>);\\n\\n virtual void push_field_data_snapshot(const ndarray<double> &scalar);\\n\\n virtual void push_field_data_snapshot(\\n\\n const ndarray<double> &scalar, \\n\\n const ndarray<double> &vector,\\n\\n const ndarray<double> &jacobian);\\n\\n \\n\",\n \"file_path\": \"include/ftk/filters/xgc_tracker.hh\",\n \"rank\": 16,\n \"score\": 221148.19272714184\n },\n {\n \"content\": \"struct xgc_stream : public object {\\n\\n static std::shared_ptr<xgc_stream> new_xgc_stream(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\\n xgc_stream(const std::string& path_, diy::mpi::communicator comm = MPI_COMM_WORLD) : path(path_), object(comm) {}\\n\\n \\n\\n void set_start_timestep(int s) { start_timestep = s; }\\n\\n void set_ntimesteps(int n) { ntimesteps = n; }\\n\\n void set_vphi(int v) { vphi = v; }\\n\\n\\n\\n void set_enable_initialize_smoothing_kernel(bool b) { enable_initialize_smoothing_kernel = b; }\\n\\n void set_enable_initialize_interpolants(bool b) { enable_initialize_interpolants = b; }\\n\\n\\n\\n void initialize();\\n\\n void probe_nphi_iphi();\\n\\n\\n\\n void set_smoothing_kernel_size(double s) { smoothing_kernel_size = s; }\\n\\n void set_smoothing_kernel_filename(const std::string f) { smoothing_kernel_filename = f; }\\n\\n void set_interpolant_filename(const std::string f) { interpolant_filename = f; }\\n\\n\\n\\n void set_callback(std::function<void(int, std::shared_ptr<ndarray_group>)> f) { callback = f; }\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/xgc_stream.hh\",\n \"rank\": 17,\n \"score\": 221148.19272714184\n },\n {\n \"content\": \"struct json_interface : public object {\\n\\n // json options (WIP):\\n\\n // - feature, string, required: possible values include\\n\\n // critical_point|cp: 2D/3D critical points\\n\\n // critical_line|cl: 3D critical line (intersections of two isosurfaces)\\n\\n // isosurface|iso: 3D isosurface\\n\\n // tdgl_vortex|tdgl: magnetic flux vortices in 3D time-dependent Ginzburg-Landau (TDGL) simulations\\n\\n // sujudi_haimes|sh: Sujudi-Haimes vortices in 3D vector fields\\n\\n // levy_degani_seginer|lds: Levy-Degani-Seginer vortices in 3D vector fields\\n\\n // connected_component|cc: 2D/3D connected components\\n\\n // xgc_blob_filament_2d: 2D XGC blob filaments defined by local extrema\\n\\n // xgc_blob_filament: 3D XGX blob filaments defined by local extrema\\n\\n // xgc_blob_threshold: 3D XGC blob filaments defined by levelsets\\n\\n // - input, json, see ndarray/stream.hh for details\\n\\n // // - writeback, json, optional: write input data back to files; see ndarray/writer.hh for details\\n\\n // - archive, json, optional:\\n\\n // - discrete, string, optional: file name to load/store discrete feature points w/o tracking\\n\\n // - traced, string, optional: file name to load/store traced features\\n\\n // - output, json, required:\\n\\n // - type, string, by default \\\"traced\\\": intersections, traced, sliced, or intercepted\\n\",\n \"file_path\": \"include/ftk/filters/json_interface.hh\",\n \"rank\": 18,\n \"score\": 221148.19272714184\n },\n {\n \"content\": \"struct mpas_stream : public object {\\n\\n mpas_stream(const std::string& path, diy::mpi::communicator comm=MPI_COMM_WORLD);\\n\\n\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/io/mpas_stream.hh\",\n \"rank\": 19,\n \"score\": 221148.19272714184\n },\n {\n \"content\": \"struct function_traits<ReturnType(ClassType::*)(Args...) const volatile>\\n\\n : public function_traits<ReturnType(Args...)>\\n\\n{\\n\\n typedef const volatile ClassType& owner_type;\\n\\n};\\n\\n\\n\\ntemplate <typename FunctionType>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 20,\n \"score\": 220156.28346334162\n },\n {\n \"content\": \"struct monostate {};\\n\\n\\n\\n// An enable_if helper to be used in template parameters which results in much\\n\\n// shorter symbols: https://godbolt.org/z/sWw4vP. Extra parentheses are needed\\n\\n// to workaround a bug in MSVC 2019 (see #1140 and #1186).\\n\\n#define FMT_ENABLE_IF(...) enable_if_t<(__VA_ARGS__), int> = 0\\n\\n\\n\\nnamespace internal {\\n\\n\\n\\n// A workaround for gcc 4.8 to make void_t work in a SFINAE context.\\n\\ntemplate <typename... Ts> struct void_t_impl { using type = void; };\\n\\n\\n\\n#if defined(FMT_USE_STRING_VIEW)\\n\\ntemplate <typename Char> using std_string_view = std::basic_string_view<Char>;\\n\\n#elif defined(FMT_USE_EXPERIMENTAL_STRING_VIEW)\\n\\ntemplate <typename Char>\\n\\nusing std_string_view = std::experimental::basic_string_view<Char>;\\n\\n#else\\n\\ntemplate <typename T> struct std_string_view {};\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 21,\n \"score\": 219870.7871491524\n },\n {\n \"content\": \"struct formatter {\\n\\n // A deleted default constructor indicates a disabled formatter.\\n\\n formatter() = delete;\\n\\n};\\n\\n\\n\\ntemplate <typename T, typename Char, typename Enable = void>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 22,\n \"score\": 219870.78714915237\n },\n {\n \"content\": \"struct view {};\\n\\ntemplate <bool...> struct bool_pack;\\n\\ntemplate <bool... Args>\\n\\nusing all_true =\\n\\n std::is_same<bool_pack<Args..., true>, bool_pack<true, Args...>>;\\n\\n\\n\\ntemplate <typename... Args, typename S, typename Char = char_t<S>>\\n\\ninline format_arg_store<buffer_context<Char>, remove_reference_t<Args>...>\\n\\nmake_args_checked(const S& format_str,\\n\\n const remove_reference_t<Args>&... args) {\\n\\n static_assert(all_true<(!std::is_base_of<view, remove_reference_t<Args>>() ||\\n\\n !std::is_reference<Args>())...>::value,\\n\\n \\\"passing views as lvalues is disallowed\\\");\\n\\n check_format_string<remove_const_t<remove_reference_t<Args>>...>(format_str);\\n\\n return {args...};\\n\\n}\\n\\n\\n\\ntemplate <typename Char>\\n\\nstd::basic_string<Char> vformat(basic_string_view<Char> format_str,\\n\\n basic_format_args<buffer_context<Char>> args);\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 23,\n \"score\": 219870.78714915237\n },\n {\n \"content\": \"struct is_sax_static_asserts\\n\\n{\\n\\n private:\\n\\n static_assert(is_basic_json<BasicJsonType>::value,\\n\\n \\\"BasicJsonType must be of type basic_json<...>\\\");\\n\\n\\n\\n using number_integer_t = typename BasicJsonType::number_integer_t;\\n\\n using number_unsigned_t = typename BasicJsonType::number_unsigned_t;\\n\\n using number_float_t = typename BasicJsonType::number_float_t;\\n\\n using string_t = typename BasicJsonType::string_t;\\n\\n using exception_t = typename BasicJsonType::exception;\\n\\n\\n\\n public:\\n\\n static_assert(is_detected_exact<bool, null_function_t, SAX>::value,\\n\\n \\\"Missing/invalid function: bool null()\\\");\\n\\n static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,\\n\\n \\\"Missing/invalid function: bool boolean(bool)\\\");\\n\\n static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,\\n\\n \\\"Missing/invalid function: bool boolean(bool)\\\");\\n\\n static_assert(\\n\",\n \"file_path\": \"include/ftk/external/json.hh\",\n \"rank\": 24,\n \"score\": 214181.48873858034\n },\n {\n \"content\": \"struct fixed_integer {\\n\\n fixed_integer() {for (int i = 0; i < N; i ++) num[i] = 0;}\\n\\n fixed_integer(const std::string& str);\\n\\n fixed_integer(const fixed_integer& x) {\\n\\n for (int i = 0; i < N; i ++) \\n\\n num[i] = x.num[i];\\n\\n }\\n\\n fixed_integer(int x) {I[0] = x;}\\n\\n\\n\\n fixed_integer& operator=(const fixed_integer& x) {\\n\\n for (int i = 0; i < N; i ++)\\n\\n num[i] = x.num[i];\\n\\n return *this;\\n\\n }\\n\\n fixed_integer& operator=(int x) {\\n\\n for (int i = 1; i < N; i ++)\\n\\n num[i] = 0;\\n\\n num[0] = x;\\n\\n return *this;\\n\\n }\\n\",\n \"file_path\": \"include/ftk/numeric/fixed_int.hh\",\n \"rank\": 25,\n \"score\": 214178.0641676684\n },\n {\n \"content\": \"// A base class for compile-time strings. It is defined in the fmt namespace to\\n\\n// make formatting functions visible via ADL, e.g. format(fmt(\\\"{}\\\"), 42).\\n\\nstruct compile_string {};\\n\\n\\n\\ntemplate <typename S>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 26,\n \"score\": 214131.92893787267\n },\n {\n \"content\": \"struct fallback_formatter {\\n\\n fallback_formatter() = delete;\\n\\n};\\n\\n\\n\\n// Specifies if T has an enabled fallback_formatter specialization.\\n\\ntemplate <typename T, typename Context>\\n\\nusing has_fallback_formatter =\\n\\n std::is_constructible<fallback_formatter<T, typename Context::char_type>>;\\n\\n\\n\\ntemplate <typename Char> struct named_arg_base;\\n\\ntemplate <typename T, typename Char> struct named_arg;\\n\\n\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 27,\n \"score\": 214120.77106610767\n },\n {\n \"content\": \"struct error_handler {\\n\\n FMT_CONSTEXPR error_handler() {}\\n\\n FMT_CONSTEXPR error_handler(const error_handler&) {}\\n\\n\\n\\n // This function is intentionally not constexpr to give a compile-time error.\\n\\n FMT_NORETURN FMT_API void on_error(const char* message);\\n\\n};\\n\\n} // namespace internal\\n\\n\\n\\n/** String's character type. */\\n\\ntemplate <typename S> using char_t = typename internal::char_t_impl<S>::type;\\n\\n\\n\\n// Parsing context consisting of a format string range being parsed and an\\n\\n// argument counter for automatic indexing.\\n\\ntemplate <typename Char, typename ErrorHandler = internal::error_handler>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 28,\n \"score\": 214120.77106610767\n },\n {\n \"content\": \"struct connected_component_tracker : public tracker\\n\\n{\\n\\n connected_component_tracker(diy::mpi::communicator comm) : tracker(comm) {}\\n\\n virtual ~connected_component_tracker() {};\\n\\n\\n\\n virtual bool advance_timestep();\\n\\n virtual void update_timestep();\\n\\n void update() {};\\n\\n void finalize();\\n\\n\\n\\n virtual void push_labeled_data_snapshot(const std::vector<LabelIdType>& labels);\\n\\n const std::vector<LabelIdType>& get_last_labeled_data_snapshot() const {return labeled_data_snapshots.back();}\\n\\n \\n\\n template <typename ContainerType>\\n\\n void push_unlabeled_data_snapshot(const std::vector<LabelIdType>& labels, std::function<ContainerType(LabelIdType)> neighbors);\\n\\n\\n\\n bool pop_snapshot();\\n\\n\\n\\n const ftk::tracking_graph<>& get_tracking_graph() const {return tg;}\\n\\n\\n\",\n \"file_path\": \"include/ftk/filters/connected_component_tracker.hh\",\n \"rank\": 29,\n \"score\": 211837.7755177343\n },\n {\n \"content\": \"struct simplicial_unstructured_mesh : public object { \\n\\n simplicial_unstructured_mesh() {}\\n\\n\\n\\n // dimensionality of the mesh\\n\\n virtual int nd() const = 0;\\n\\n\\n\\n // numer of d-dimensional elements\\n\\n virtual size_t n(int d) const = 0;\\n\\n\\n\\npublic: // io\\n\\n void from_legacy_vtk_file(const std::string& filename);\\n\\n void from_vtk_unstructured_grid_file(const std::string &filename);\\n\\n void to_vtk_unstructured_grid_file(const std::string &filename) const;\\n\\n\\n\\n void scalar_to_vtk_unstructured_grid_data_file(const std::string& filename, const std::string& varname, const ndarray<F>&) const;\\n\\n void vector_to_vtk_unstructured_grid_data_file(const std::string& filename, const std::string& varname, const ndarray<F>&) const;\\n\\n#if FTK_HAVE_VTK\\n\\n vtkSmartPointer<vtkUnstructuredGrid> scalar_to_vtk_unstructured_grid_data(const std::string& varname, const ndarray<F>&) const;\\n\\n vtkSmartPointer<vtkUnstructuredGrid> vector_to_vtk_unstructured_grid_data(const std::string& varname, const ndarray<F>&) const;\\n\\n // vtkSmartPointer<vtkUnstructuredGrid> scalars_to_vtk_unstructured_grid_data(\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_unstructured_mesh.hh\",\n \"rank\": 30,\n \"score\": 211837.7755177343\n },\n {\n \"content\": \"#if 0\\n\\nstruct data_stream_synthetic : public data_stream {\\n\\n void set_input_source(const std::string&) {} // nothing todo\\n\\n\\n\\n void advance_timestep() {\\n\\n data_group *g = data_group::create();\\n\\n const ndarray<double>& array = synthesize_timestep(current_timestep);\\n\\n g->set(default_variable_name(), array);\\n\\n push_timestep(g);\\n\\n }\\n\\n\\n\\n void set_input_parameters(const std::map<std::string, std::string>& param) {\\n\\n data_stream::set_input_parameters(param);\\n\\n if (param.find(str_dw) != param.end()) DW = std::stoi(param.at(str_dw));\\n\\n if (param.find(str_dh) != param.end()) DH = std::stoi(param.at(str_dh));\\n\\n if (param.find(str_dd) != param.end()) DD = std::stoi(param.at(str_dd));\\n\\n if (param.find(str_dt) != param.end()) n_timesteps = std::stoi(param.at(str_dt));\\n\\n if (param.find(str_time_scale) != param.end()) time_scale = stod(param.at(str_time_scale));\\n\\n }\\n\\n\\n\\n virtual std::string default_variable_name() const {return std::string();};\\n\\n\\n\\n virtual ndarray<double> synthesize_timestep(int t) = 0;\\n\\n\\n\\nprotected:\\n\\n size_t DW = 32, DH = 32, DD = 32;\\n\\n double time_scale = 1.0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 31,\n \"score\": 211837.7755177343\n },\n {\n \"content\": \"struct data_stream_files : public data_stream {\\n\\n void set_input_source(const std::string& pattern) {\\n\\n filenames = ndarray<float>::glob(pattern);\\n\\n if (n_timesteps == 0) n_timesteps = filenames.size();\\n\\n else filenames.resize(n_timesteps);\\n\\n }\\n\\n\\n\\n void set_input_filenames(const std::vector<std::string>& f) {filenames = f;}\\n\\n\\n\\n void load_timestep(int k);\\n\\n\\n\\n void advance_timestep();\\n\\n\\n\\nprotected:\\n\\n std::vector<std::string> filenames;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 32,\n \"score\": 211837.7755177343\n },\n {\n \"content\": \"struct simplicial_regular_mesh : public object {\\n\\n friend class simplicial_regular_mesh_element;\\n\\n typedef simplicial_regular_mesh_element iterator;\\n\\n\\n\\n simplicial_regular_mesh(int n) : nd_(n), lattice_(n) {\\n\\n for (int i = 0; i < n; i ++) {\\n\\n lb_.push_back(0);\\n\\n ub_.push_back(0);\\n\\n }\\n\\n\\n\\n initialize_subdivision();\\n\\n\\n\\n lattice_.reshape(lb_, sizes()); \\n\\n }\\n\\n\\n\\n simplicial_regular_mesh(const lattice l) : simplicial_regular_mesh(l.nd()) {\\n\\n set_lb_ub(l);\\n\\n }\\n\\n\\n\\n#if 0\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_regular_mesh.hh\",\n \"rank\": 33,\n \"score\": 211837.7755177343\n },\n {\n \"content\": \"// this is an abstract class, not for users\\n\\nstruct contour_tracker_regular : public contour_tracker, public regular_tracker {\\n\\n contour_tracker_regular(diy::mpi::communicator comm, int nd/*2 or 3*/) : contour_tracker(comm), regular_tracker(comm, nd), tracker(comm) {}\\n\\n virtual ~contour_tracker_regular() {}\\n\\n\\n\\n void reset();\\n\\n\\n\\nprotected:\\n\\n typedef simplicial_regular_mesh_element element_t;\\n\\n \\n\\n std::map<element_t, feature_point_t> intersections;\\n\\n std::set<element_t> related_cells;\\n\\n\\n\\nprotected:\\n\\n void build_isovolumes();\\n\\n\\n\\npublic: // cp io\\n\\n const std::map<element_t, feature_point_t>& get_discrete_intersections() const {return intersections;}\\n\\n std::vector<feature_point_t> get_intersections() const;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/filters/contour_tracker_regular.hh\",\n \"rank\": 34,\n \"score\": 211598.8056706593\n },\n {\n \"content\": \"struct unstructured_2d_tracker : public virtual tracker {\\n\\n unstructured_2d_tracker(diy::mpi::communicator comm, const simplicial_unstructured_extruded_2d_mesh<> &m) : \\n\\n m(simplicial_unstructured_extruded_2d_mesh<>(m)), tracker(comm) {}\\n\\n virtual ~unstructured_2d_tracker() {}\\n\\n\\n\\npublic:\\n\\n void initialize() {}\\n\\n\\n\\nprotected:\\n\\n const simplicial_unstructured_extruded_2d_mesh<> m;\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/filters/unstructured_2d_tracker.hh\",\n \"rank\": 35,\n \"score\": 210161.59371114278\n },\n {\n \"content\": \"//! Enables communication within a group during a reduction.\\n\\n//! DIY creates the ReduceProxy for you in diy::reduce()\\n\\n//! and provides a reference to ReduceProxy each time the user's reduction function is called\\n\\nstruct ReduceProxy: public Master::Proxy\\n\\n{\\n\\n typedef std::vector<int> GIDVector;\\n\\n\\n\\n ReduceProxy(const Master::Proxy& proxy, //!< parent proxy\\n\\n void* block, //!< diy block\\n\\n unsigned round, //!< current round\\n\\n const Assigner& assigner, //!< assigner\\n\\n const GIDVector& incoming_gids, //!< incoming gids in this group\\n\\n const GIDVector& outgoing_gids): //!< outgoing gids in this group\\n\\n Master::Proxy(proxy),\\n\\n block_(block),\\n\\n round_(round),\\n\\n assigner_(assigner)\\n\\n {\\n\\n // setup in_link\\n\\n for (unsigned i = 0; i < incoming_gids.size(); ++i)\\n\\n {\\n\\n BlockID nbr;\\n\\n nbr.gid = incoming_gids[i];\\n\",\n \"file_path\": \"include/ftk/external/diy/reduce.hpp\",\n \"rank\": 36,\n \"score\": 210161.59371114278\n },\n {\n \"content\": \"struct unstructured_3d_tracker : public virtual tracker {\\n\\n unstructured_3d_tracker(diy::mpi::communicator comm, const simplicial_unstructured_extruded_3d_mesh<> &m) : \\n\\n m(simplicial_unstructured_extruded_3d_mesh<>(m)), tracker(comm) {}\\n\\n virtual ~unstructured_3d_tracker() {}\\n\\n\\n\\npublic:\\n\\n void initialize() {}\\n\\n\\n\\nprotected:\\n\\n const simplicial_unstructured_extruded_3d_mesh<> m;\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/filters/unstructured_3d_tracker.hh\",\n \"rank\": 37,\n \"score\": 210161.59371114278\n },\n {\n \"content\": \"struct contour_tracker : public virtual tracker {\\n\\n contour_tracker(diy::mpi::communicator comm) : tracker(comm) {}\\n\\n\\n\\n virtual void update() {}; \\n\\n void reset() {\\n\\n field_data_snapshots.clear();\\n\\n // traced_contours.clear();\\n\\n }\\n\\n \\n\\n void set_scalar_components(const std::vector<std::string>& c);\\n\\n int get_num_scalar_components() const {return scalar_components.size();}\\n\\n\\n\\n double get_threshold() const { return threshold; }\\n\\n void set_threshold(double t) {threshold = t;}\\n\\n\\n\\npublic:\\n\\n virtual bool advance_timestep();\\n\\n\\n\\npublic: // inputs\\n\\n bool pop_field_data_snapshot();\\n\",\n \"file_path\": \"include/ftk/filters/contour_tracker.hh\",\n \"rank\": 38,\n \"score\": 210161.59371114278\n },\n {\n \"content\": \"struct regular_tracker : public virtual tracker {\\n\\n regular_tracker(diy::mpi::communicator comm, int nd/*2 or 3*/) : tracker(comm), m(nd+1) {}\\n\\n virtual ~regular_tracker() {}\\n\\n \\n\\npublic:\\n\\n void set_domain(const lattice& l) {domain = l;} // spatial domain\\n\\n void set_array_domain(const lattice& l) {array_domain = l;}\\n\\n\\n\\n void set_local_domain(const lattice&); // rank-specific \\\"core\\\" region of the block\\n\\n void set_local_array_domain(const lattice&); // rank-specific \\\"ext\\\" region of the block\\n\\n\\n\\n void initialize();\\n\\n\\n\\n lattice get_local_array_domain() const { return local_array_domain; }\\n\\n \\n\\npublic: // physics coordinates\\n\\n // void set_coordinates(const ndarray<double>& coords_) {coords = coords_; use_explicit_coords = true;}\\n\\n std::array<double, 3> get_coords(const std::vector<int>&) const;\\n\\n\\n\\n void set_coords_bounds(const std::vector<double>& bounds) { bounds_coords = bounds; mode_phys_coords = REGULAR_COORDS_BOUNDS; }\\n\",\n \"file_path\": \"include/ftk/filters/regular_tracker.hh\",\n \"rank\": 39,\n \"score\": 210161.59371114275\n },\n {\n \"content\": \"struct data_stream_vti : public data_stream_files {\\n\\n void initialize() {\\n\\n\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 40,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct xgc_stream_h5 : public xgc_stream\\n\\n{\\n\\n xgc_stream_h5(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD) : xgc_stream(path, comm) {}\\n\\n \\n\\n std::string postfix() const { return \\\".h5\\\"; }\\n\\n \\n\\n std::shared_ptr<ndarray_group> request_step(int step) { return NULL; } // TODO\\n\\n\\n\\n bool read_oneddiag();\\n\\n bool advance_timestep();\\n\\n};\\n\\n\\n\\ninline bool xgc_stream_h5::read_oneddiag()\\n\\n{\\n\\n const auto f = oneddiag_filename();\\n\\n ndarray<double> etemp_par, etemp_per;\\n\\n \\n\\n steps.read_h5(f, \\\"steps\\\");\\n\\n time.read_h5(f, \\\"time\\\");\\n\\n etemp_par.read_h5(f, \\\"e_parallel_mean_en_avg\\\");\\n\",\n \"file_path\": \"include/ftk/io/xgc_stream_h5.hpp\",\n \"rank\": 41,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct data_stream_pnc : public data_stream_files {\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 42,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct data_stream_raw : public data_stream_files {\\n\\n void initialize() {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 43,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct xgc_stream_adios2 : public xgc_stream\\n\\n{\\n\\n xgc_stream_adios2(const std::string& path, diy::mpi::communicator comm = MPI_COMM_WORLD) : xgc_stream(path, comm) {}\\n\\n \\n\\n std::string postfix() const { return \\\".bp\\\"; }\\n\\n\\n\\n std::shared_ptr<ndarray_group> request_step(int step);\\n\\n\\n\\n bool read_units();\\n\\n\\n\\n bool read_oneddiag();\\n\\n bool advance_timestep();\\n\\n};\\n\\n\\n\\ninline bool xgc_stream_adios2::read_units()\\n\\n{\\n\\n xgc_units_t u;\\n\\n bool succ = true;\\n\\n\\n\\n if (!u.read(units_filename())) \\n\",\n \"file_path\": \"include/ftk/io/xgc_stream_adios2.hpp\",\n \"rank\": 44,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct RegularSwapPartners: public RegularPartners\\n\\n{\\n\\n typedef RegularPartners Parent;\\n\\n\\n\\n // contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\\n\\n // contiguous is useful when data needs to be united;\\n\\n // round-robin is useful for vector-\\\"halving\\\"\\n\\n template<class Decomposer>\\n\\n RegularSwapPartners(const Decomposer& decomposer, //!< domain decomposition\\n\\n int k, //!< target k value\\n\\n bool contiguous = true //!< distance halving (true) or doubling (false)\\n\\n ):\\n\\n Parent(decomposer, k, contiguous) {}\\n\\n RegularSwapPartners(const DivisionVector& divs, //!< explicit division vector\\n\\n const KVSVector& kvs, //!< explicit k vector\\n\\n bool contiguous = true //!< distance halving (true) or doubling (false)\\n\\n ):\\n\\n Parent(divs, kvs, contiguous) {}\\n\\n\\n\\n bool active(int, int, const Master&) const { return true; } // in swap-reduce every block is always active\\n\\n\\n\\n void incoming(int round, int gid, std::vector<int>& partners, const Master&) const { Parent::fill(round - 1, gid, partners); }\\n\\n void outgoing(int round, int gid, std::vector<int>& partners, const Master&) const { Parent::fill(round, gid, partners); }\\n\\n};\\n\\n\\n\\n} // diy\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/external/diy/partners/swap.hpp\",\n \"rank\": 45,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct data_stream_nc : public data_stream_files {\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 46,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct RegularMergePartners: public RegularPartners\\n\\n{\\n\\n typedef RegularPartners Parent;\\n\\n\\n\\n // contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\\n\\n // contiguous is useful when data needs to be united;\\n\\n // round-robin is useful for vector-\\\"halving\\\"\\n\\n template<class Decomposer>\\n\\n RegularMergePartners(const Decomposer& decomposer, //!< domain decomposition\\n\\n int k, //!< target k value\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(decomposer, k, contiguous) {}\\n\\n RegularMergePartners(const DivisionVector& divs, //!< explicit division vector\\n\\n const KVSVector& kvs, //!< explicit k vector\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(divs, kvs, contiguous) {}\\n\\n\\n\\n inline bool active(int round, int gid, const Master&) const;\\n\",\n \"file_path\": \"include/ftk/external/diy/partners/merge.hpp\",\n \"rank\": 47,\n \"score\": 207560.67061998916\n },\n {\n \"content\": \"struct Block : public ftk::distributed_union_find_exchange<std::string> {\\n\\n Block(): nchanges(0), distributed_union_find_exchange() { \\n\\n \\n\\n }\\n\\n\\n\\n // add an element\\n\\n void add(std::string ele) {\\n\\n distributed_union_find_exchange::add(ele); \\n\\n this->ele2gid[ele] = -1;\\n\\n }\\n\\n\\n\\n void add_related_element(std::string ele, std::string related_ele) {\\n\\n this->related_elements[ele].push_back(related_ele); \\n\\n this->ele2gid[related_ele] = -1; \\n\\n }\\n\\n\\n\\npublic: \\n\\n // map element id to ids of its related elements\\n\\n // Can be optimized by ordered the related elements, put related elements on process first and ordered decreingly by ids\\n\\n std::map<std::string, std::vector<std::string>> related_elements; \\n\\n std::map<std::string, int> ele2gid; \\n\\n\\n\\n int nchanges; // # of processed unions per round = valid unions (united unions) + passing unions\\n\\n};\\n\\n\\n\\n// ==========================================================\\n\\n\\n\",\n \"file_path\": \"include/ftk/basic/legacy/distributed_union_find_deprecated.hh\",\n \"rank\": 48,\n \"score\": 206448.90304668123\n },\n {\n \"content\": \"// DIY Block for distributed union-find\\n\\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\\n\\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), temporary_root_2_gids(), nonlocal_temporary_roots_2_grandparents(), ele2gid(), distributed_union_find() { \\n\\n \\n\\n }\\n\\n\\n\\n // add an element\\n\\n void add(std::string ele) {\\n\\n this->nchanges += 1;\\n\\n\\n\\n if(this->has(ele)) {\\n\\n std::cout<<\\\"This ele has been added. \\\"<<ele<<std::endl; \\n\\n } else {\\n\\n distributed_union_find::add(ele); \\n\\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \\n\\n this->has_sent_gparent_query[ele] = false;\\n\\n }\\n\\n }\\n\\n\\n\\n void erase_element(std::string ele) {\\n\\n this->nchanges += 1;\\n\",\n \"file_path\": \"include/ftk/basic/legacy/distributed_union_find.hh\",\n \"rank\": 49,\n \"score\": 206448.90304668123\n },\n {\n \"content\": \"struct RegularBroadcastPartners: public RegularMergePartners\\n\\n{\\n\\n typedef RegularMergePartners Parent; //!< base class merge reduction\\n\\n\\n\\n //! contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\\n\\n //! contiguous is useful when data needs to be united;\\n\\n //! round-robin is useful for vector-\\\"halving\\\"\\n\\n template<class Decomposer>\\n\\n RegularBroadcastPartners(const Decomposer& decomposer, //!< domain decomposition\\n\\n int k, //!< target k value\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(decomposer, k, contiguous) {}\\n\\n RegularBroadcastPartners(const DivisionVector& divs,//!< explicit division vector\\n\\n const KVSVector& kvs, //!< explicit k vector\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(divs, kvs, contiguous) {}\\n\\n\\n\\n //! returns total number of rounds\\n\",\n \"file_path\": \"include/ftk/external/diy/partners/broadcast.hpp\",\n \"rank\": 50,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"struct contour_tracker_3d_regular : public contour_tracker_regular {\\n\\n contour_tracker_3d_regular(diy::mpi::communicator comm) : contour_tracker_regular(comm, 3), tracker(comm) {}\\n\\n virtual ~contour_tracker_3d_regular() {}\\n\\n\\n\\n // int cpdims() const { return 3; }\\n\\n\\n\\n void finalize();\\n\\n void reset();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\npublic:\\n\\n const feature_volume_t& get_isovolume() { return isovolume; }\\n\\n\\n\\nprotected:\\n\\n void build_isovolume();\\n\\n\\n\\nprotected:\\n\\n void write_isovolume_vtu(const std::string& filename) const;\\n\\n#if FTK_HAVE_VTK\\n\",\n \"file_path\": \"include/ftk/filters/contour_tracker_3d_regular.hh\",\n \"rank\": 51,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"struct feature_flow_tracer_regular_distributed : public filter {\\n\\n\\n\\nprivate:\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/ftk/filters/feature_flow_tracer.hh\",\n \"rank\": 52,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"struct data_stream_synthetic_woven : public data_stream_synthetic {\\n\\n ndarray<double> synthesize_timestep(int t) {\\n\\n return synthetic_woven_2D(DW, DH, t*time_scale);\\n\\n };\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 53,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"struct contour_tracker_2d_regular : public contour_tracker_regular {\\n\\n contour_tracker_2d_regular(diy::mpi::communicator comm) : \\n\\n contour_tracker_regular(comm, 2),\\n\\n tracker(comm)\\n\\n {}\\n\\n virtual ~contour_tracker_2d_regular() {}\\n\\n\\n\\n // int cpdims() const { return 2; }\\n\\n\\n\\n void finalize();\\n\\n void reset();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\n const feature_surface_t& get_surfaces() const { return surfaces; }\\n\\n\\n\\npublic:\\n\\n void write_isovolume_vtu(const std::string& filename) const;\\n\\n#if FTK_HAVE_VTK\\n\\n vtkSmartPointer<vtkPolyData> get_isovolume_vtp() const;\\n\",\n \"file_path\": \"include/ftk/filters/contour_tracker_2d_regular.hh\",\n \"rank\": 54,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"struct RegularAllReducePartners: public RegularMergePartners\\n\\n{\\n\\n typedef RegularMergePartners Parent; //!< base class merge reduction\\n\\n\\n\\n //! contiguous parameter indicates whether to match partners contiguously or in a round-robin fashion;\\n\\n //! contiguous is useful when data needs to be united;\\n\\n //! round-robin is useful for vector-\\\"halving\\\"\\n\\n template<class Decomposer>\\n\\n RegularAllReducePartners(const Decomposer& decomposer, //!< domain decomposition\\n\\n int k, //!< target k value\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(decomposer, k, contiguous) {}\\n\\n RegularAllReducePartners(const DivisionVector& divs,//!< explicit division vector\\n\\n const KVSVector& kvs, //!< explicit k vector\\n\\n bool contiguous = true //!< distance doubling (true) or halving (false)\\n\\n ):\\n\\n Parent(divs, kvs, contiguous) {}\\n\\n\\n\\n //! returns total number of rounds\\n\",\n \"file_path\": \"include/ftk/external/diy/partners/all-reduce.hpp\",\n \"rank\": 55,\n \"score\": 203509.0564796531\n },\n {\n \"content\": \"// this is an abstract class, not for users\\n\\nstruct critical_point_tracker_regular : public critical_point_tracker, public regular_tracker {\\n\\n critical_point_tracker_regular(diy::mpi::communicator comm, int nd) : critical_point_tracker(comm), regular_tracker(comm, nd), tracker(comm) {}\\n\\n virtual ~critical_point_tracker_regular() {}\\n\\n\\n\\nprotected:\\n\\n typedef simplicial_regular_mesh_element element_t;\\n\\n \\n\\n std::map<element_t, feature_point_t> discrete_critical_points;\\n\\n std::vector<std::set<element_t>> connected_components;\\n\\n\\n\\npublic: // cp io\\n\\n const std::map<element_t, feature_point_t>& get_discrete_critical_points() const {return discrete_critical_points;}\\n\\n\\n\\n std::vector<feature_point_t> get_critical_points() const;\\n\\n // void put_critical_points(const std::vector<feature_point_t>&);\\n\\n};\\n\\n\\n\\n/////\\n\\n////\\n\\ninline std::vector<feature_point_t> critical_point_tracker_regular::get_critical_points() const\\n\",\n \"file_path\": \"include/ftk/filters/critical_point_tracker_regular.hh\",\n \"rank\": 56,\n \"score\": 201711.61360899865\n },\n {\n \"content\": \"struct critical_point_tracker_2d_unstructured : public critical_point_tracker, public unstructured_2d_tracker\\n\\n{\\n\\n // critical_point_tracker_2d_unstructured(const simplicial_unstructured_extruded_2d_mesh<>& m) : m(m) {}\\n\\n // critical_point_tracker_2d_unstructured() {}\\n\\n critical_point_tracker_2d_unstructured(diy::mpi::communicator comm, const simplicial_unstructured_2d_mesh<>& m) : \\n\\n critical_point_tracker(comm), unstructured_2d_tracker(comm, m), tracker(comm) {}\\n\\n virtual ~critical_point_tracker_2d_unstructured() {};\\n\\n \\n\\n int cpdims() const { return 3; }\\n\\n // int cpdims() const { return m.ncoords() - 1; }\\n\\n\\n\\n void initialize() {}\\n\\n void finalize();\\n\\n void reset() {}\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\npublic:\\n\\n std::vector<feature_point_t> get_critical_points() const;\\n\\n void put_critical_points(const std::vector<feature_point_t>&);\\n\",\n \"file_path\": \"include/ftk/filters/critical_point_tracker_2d_unstructured.hh\",\n \"rank\": 57,\n \"score\": 201711.61360899865\n },\n {\n \"content\": \"// we define critical lines as intersections of two isosurfaces in 3D\\n\\nstruct critical_line_tracker : public virtual tracker {\\n\\n critical_line_tracker(diy::mpi::communicator comm) : tracker(comm) {}\\n\\n\\n\\n // int cpdims() const { return 3; }\\n\\n \\n\\n virtual void update() {}; \\n\\n void reset() {\\n\\n field_data_snapshots.clear();\\n\\n }\\n\\n \\n\\npublic:\\n\\n bool advance_timestep();\\n\\n\\n\\npublic:\\n\\n bool pop_field_data_snapshot();\\n\\n virtual void push_field_data_snapshot(const ndarray<float> &uv);\\n\\n \\n\\nprotected:\\n\\n struct field_data_snapshot_t {\\n\\n ndarray<float> uv; // shape is (2, width, height, depth)\\n\",\n \"file_path\": \"include/ftk/filters/critical_line_tracker.hh\",\n \"rank\": 58,\n \"score\": 201368.69426347443\n },\n {\n \"content\": \"struct critical_point_tracker : public virtual tracker {\\n\\n critical_point_tracker(diy::mpi::communicator comm) : tracker(comm) {}\\n\\n\\n\\n virtual void update() {}; \\n\\n void reset() {\\n\\n field_data_snapshots.clear();\\n\\n traced_critical_points.clear();\\n\\n }\\n\\n\\n\\n void set_enable_robust_detection(bool b) { enable_robust_detection = b; }\\n\\n void set_enable_computing_degrees(bool b) { enable_computing_degrees = b; }\\n\\n void set_enable_streaming_trajectories(bool b) { enable_streaming_trajectories = b; }\\n\\n void set_enable_discarding_interval_points(bool b) { enable_discarding_interval_points = b; }\\n\\n void set_enable_discarding_degenerate_points(bool b) { enable_discarding_degenerate_points = b; }\\n\\n void set_enable_ignoring_degenerate_points(bool b) { enable_ignoring_degenerate_points = b; }\\n\\n\\n\\n void set_type_filter(unsigned int);\\n\\n\\n\\n void set_scalar_field_source(int s) {scalar_field_source = s;}\\n\\n void set_vector_field_source(int s) {vector_field_source = s;}\\n\",\n \"file_path\": \"include/ftk/filters/critical_point_tracker.hh\",\n \"rank\": 59,\n \"score\": 201362.5299534425\n },\n {\n \"content\": \"struct tdgl_vortex_tracker : public virtual tracker {\\n\\n tdgl_vortex_tracker(diy::mpi::communicator comm) : tracker(comm) {}\\n\\n\\n\\n int cpdims() const { return 3; }\\n\\n \\n\\n virtual void update() {}; \\n\\n void reset() {\\n\\n field_data_snapshots.clear();\\n\\n }\\n\\n \\n\\npublic:\\n\\n bool advance_timestep();\\n\\n\\n\\npublic:\\n\\n bool pop_field_data_snapshot();\\n\\n void push_field_data_snapshot(\\n\\n const tdgl_metadata_t &meta,\\n\\n const ndarray<float> &rho, \\n\\n const ndarray<float> &phi, \\n\\n const ndarray<float> &re, \\n\",\n \"file_path\": \"include/ftk/filters/tdgl_vortex_tracker.hh\",\n \"rank\": 60,\n \"score\": 201362.5299534425\n },\n {\n \"content\": \"struct Grid: public GridRef<C,D>\\n\\n{\\n\\n public:\\n\\n typedef GridRef<C,D> Parent;\\n\\n typedef typename Parent::Value Value;\\n\\n typedef typename Parent::Index Index;\\n\\n typedef typename Parent::Vertex Vertex;\\n\\n typedef Parent Reference;\\n\\n\\n\\n template<class U>\\n\\n struct rebind { typedef Grid<U,D> type; };\\n\\n\\n\\n public:\\n\\n Grid():\\n\\n Parent(new C[0], Vertex::zero()) {}\\n\\n template<class Int>\\n\\n Grid(const Point<Int, D>& shape, bool c_order = true):\\n\\n Parent(new C[size(shape)], shape, c_order)\\n\\n {}\\n\\n\\n\",\n \"file_path\": \"include/ftk/external/diy/grid.hpp\",\n \"rank\": 61,\n \"score\": 200720.84557116285\n },\n {\n \"content\": \"// DIY Block for distributed union-find\\n\\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\\n\\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), ele2gid(), distributed_union_find() { \\n\\n \\n\\n }\\n\\n\\n\\n // add an element\\n\\n void add(std::string ele) {\\n\\n this->nchanges += 1;\\n\\n\\n\\n if(this->has(ele)) {\\n\\n std::cout<<\\\"This ele has been added. \\\"<<ele<<std::endl; \\n\\n } else {\\n\\n distributed_union_find::add(ele); \\n\\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \\n\\n }\\n\\n }\\n\\n\\n\\n void erase_element(std::string ele) {\\n\\n this->nchanges += 1;\\n\\n\\n\",\n \"file_path\": \"include/ftk/basic/legacy/distributed_union_find_test_backup.hh\",\n \"rank\": 62,\n \"score\": 200280.30290210337\n },\n {\n \"content\": \"// DIY Block for distributed union-find\\n\\nstruct Block_Union_Find : public ftk::distributed_union_find<std::string> {\\n\\n Block_Union_Find(): nchanges(0), related_elements(), all_related_elements(), ele2gid(), distributed_union_find() { \\n\\n \\n\\n }\\n\\n\\n\\n // add an element\\n\\n void add(std::string ele) {\\n\\n this->nchanges += 1;\\n\\n\\n\\n if(this->has(ele)) {\\n\\n std::cout<<\\\"This ele has been added. \\\"<<ele<<std::endl; \\n\\n } else {\\n\\n distributed_union_find::add(ele); \\n\\n this->related_elements.insert(std::make_pair(ele, std::set<std::string>())); \\n\\n }\\n\\n }\\n\\n\\n\\n void erase_element(std::string ele) {\\n\\n this->nchanges += 1;\\n\\n\\n\",\n \"file_path\": \"include/ftk/basic/legacy/distributed_union_find_storing_children.hh\",\n \"rank\": 63,\n \"score\": 200280.30290210337\n },\n {\n \"content\": \"struct data_stream_synthetic_double_gyre : public data_stream_synthetic {\\n\\n ndarray<double> synthesize_timestep(int t) {\\n\\n return synthetic_double_gyre(DW, DH, t * time_scale);\\n\\n };\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/io/data_stream.hh\",\n \"rank\": 64,\n \"score\": 199665.55912774935\n },\n {\n \"content\": \"struct xgc_blob_filament_tracker : public xgc_tracker {\\n\\n xgc_blob_filament_tracker(diy::mpi::communicator comm,\\n\\n std::shared_ptr<simplicial_xgc_3d_mesh<>> mx);\\n\\n virtual ~xgc_blob_filament_tracker();\\n\\n\\n\\n // xgc_blob_filament_tracker(diy::mpi::communicator comm, \\n\\n // std::shared_ptr<simplicial_unstructured_2d_mesh<>> m2, \\n\\n // int nphi_, int iphi_);\\n\\n\\n\\n // int cpdims() const { return 3; }\\n\\n \\n\\n void initialize();\\n\\n void reset() {\\n\\n field_data_snapshots.clear();\\n\\n }\\n\\n void update() {}\\n\\n void finalize();\\n\\n\\n\\npublic:\\n\\n void update_timestep();\\n\",\n \"file_path\": \"include/ftk/filters/xgc_blob_filament_tracker.hh\",\n \"rank\": 65,\n \"score\": 199665.5591277494\n },\n {\n \"content\": \"struct xgc_blob_threshold_tracker : public xgc_tracker {\\n\\n xgc_blob_threshold_tracker(diy::mpi::communicator comm, \\n\\n std::shared_ptr<simplicial_xgc_3d_mesh<>> m3) : xgc_tracker(comm, m3) {}\\n\\n virtual ~xgc_blob_threshold_tracker() {}\\n\\n \\n\\n void set_threshold(double t) { threshold = t; }\\n\\n\\n\\n // int cpdims() const { return 0; }\\n\\n \\n\\n void initialize() {}\\n\\n void update() {}\\n\\n void finalize();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\n void push_field_data_snapshot(const ndarray<double> &scalar);\\n\\n\\n\\npublic:\\n\\n ndarray<int> get_sliced(int t) const;\\n\\n void write_sliced(int t, const std::string& pattern) const;\\n\",\n \"file_path\": \"include/ftk/filters/xgc_blob_threshold_tracker.hh\",\n \"rank\": 66,\n \"score\": 199665.5591277494\n },\n {\n \"content\": \"struct feature_curve_t : public std::vector<feature_point_t>\\n\\n{\\n\\n feature_curve_t() {}\\n\\n feature_curve_t(const feature_curve_t&);\\n\\n feature_curve_t& operator=(const feature_curve_t&);\\n\\n\\n\\n void relabel(int i); // assign id for traj and each point in the traj\\n\\n void update_statistics();\\n\\n void derive_velocity(); // (const std::vector<double> &dog_kernel); // assuming the traj contains only ordinal points (dt=1)\\n\\n\\n\\n std::vector<feature_curve_t> split() const; // split to consistent subtrajs\\n\\n std::vector<int/*idx in original traj*/> to_ordinals() const;\\n\\n std::vector<int/*idx in original traj*/> select(std::function<bool(const feature_point_t&)> f);\\n\\n\\n\\n void rotate(); //! if the traj is a loop and the type is inconsistent, rotate the traj before splitting\\n\\n void reorder(); //! reorder by timestep\\n\\n void adjust_time(); //! assuming traj has only one single branch and is organized in ascending order, ensure that the time increases monotonously\\n\\n\\n\\n void smooth_ordinal_types(const int half_window_size=2); // make types of ordinal points robust to noises\\n\\n void smooth_interval_types(); //! make types in intervals consistent\\n\",\n \"file_path\": \"include/ftk/features/feature_curve.hh\",\n \"rank\": 67,\n \"score\": 196443.7406734177\n },\n {\n \"content\": \" class StaticAssigner: public Assigner\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * \\\\ingroup Assignment\\n\\n * \\\\brief Intermediate type to express assignment that cannot change; adds `local_gids` query method\\n\\n */\\n\\n using Assigner::Assigner;\\n\\n\\n\\n //! gets the local gids for a given process rank\\n\\n virtual void local_gids(int rank, std::vector<int>& gids) const =0;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"include/ftk/external/diy/assigner.hpp\",\n \"rank\": 68,\n \"score\": 194579.13244805645\n },\n {\n \"content\": \"struct critical_point_tracker_2d_regular : public critical_point_tracker_regular {\\n\\n critical_point_tracker_2d_regular(diy::mpi::communicator comm) : \\n\\n critical_point_tracker_regular(comm, 2),\\n\\n tracker(comm)\\n\\n {}\\n\\n virtual ~critical_point_tracker_2d_regular() {}\\n\\n\\n\\n int cpdims() const { return 2; }\\n\\n\\n\\n void finalize();\\n\\n void reset();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\n void push_scalar_field_snapshot(const ndarray<double>&);\\n\\n void push_vector_field_snapshot(const ndarray<double>&);\\n\\n\\n\\nprotected:\\n\\n typedef simplicial_regular_mesh_element element_t;\\n\\n \\n\",\n \"file_path\": \"include/ftk/filters/critical_point_tracker_2d_regular.hh\",\n \"rank\": 69,\n \"score\": 192541.90727723652\n },\n {\n \"content\": \"struct sujudi_haimes_tracker_3d_regular : public critical_line_tracker_3d_regular \\n\\n{\\n\\n sujudi_haimes_tracker_3d_regular(diy::mpi::communicator comm) : \\n\\n critical_line_tracker_3d_regular(comm), \\n\\n critical_line_tracker(comm),\\n\\n regular_tracker(comm, 3), \\n\\n tracker(comm) {}\\n\\n virtual ~sujudi_haimes_tracker_3d_regular() {};\\n\\n\\n\\nprotected:\\n\\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\\n\\n\\n\\n void simplex_residue_J(\\n\\n const std::vector<std::vector<int>>& vertices,\\n\\n float residues[3], float Js[3][3][3]) const;\\n\\n\\n\\n void push_field_data_snapshot(const ndarray<float>& data);\\n\\n\\n\\n std::vector<std::string> varnames() const { return {\\\"residue\\\", \\\"discJ\\\"}; }\\n\\n};\\n\",\n \"file_path\": \"include/ftk/filters/sujudi_haimes_tracker_3d_regular.hh\",\n \"rank\": 70,\n \"score\": 192541.90727723652\n },\n {\n \"content\": \"struct critical_point_tracker_3d_regular : public critical_point_tracker_regular {\\n\\n critical_point_tracker_3d_regular(diy::mpi::communicator comm) : critical_point_tracker_regular(comm, 3), tracker(comm) {}\\n\\n virtual ~critical_point_tracker_3d_regular() {}\\n\\n \\n\\n // int cpdims() const { return 3; }\\n\\n\\n\\n void finalize();\\n\\n\\n\\n void update_timestep();\\n\\n \\n\\n void push_scalar_field_snapshot(const ndarray<double>&);\\n\\n void push_vector_field_snapshot(const ndarray<double>&);\\n\\n \\n\\nprotected:\\n\\n typedef simplicial_regular_mesh_element element_t;\\n\\n\\n\\nprotected:\\n\\n bool check_simplex(const element_t& s, feature_point_t& cp);\\n\\n void trace_intersections();\\n\\n void trace_connected_components();\\n\",\n \"file_path\": \"include/ftk/filters/critical_point_tracker_3d_regular.hh\",\n \"rank\": 71,\n \"score\": 192541.90727723652\n },\n {\n \"content\": \"struct ridge_valley_tracker_3d_regular : public sujudi_haimes_tracker_3d_regular \\n\\n{\\n\\n ridge_valley_tracker_3d_regular(diy::mpi::communicator comm) : \\n\\n sujudi_haimes_tracker_3d_regular(comm),\\n\\n critical_line_tracker(comm),\\n\\n regular_tracker(comm, 3), \\n\\n tracker(comm) {}\\n\\n virtual ~ridge_valley_tracker_3d_regular() {};\\n\\n\\n\\nprotected:\\n\\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\\n\\n void push_field_data_snapshot(const ndarray<float>& data);\\n\\n \\n\\n void simplex_scalars(\\n\\n const std::vector<std::vector<int>>& vertices,\\n\\n float scalars[3]) const;\\n\\n\\n\\n std::vector<std::string> varnames() const { return {\\\"residue\\\", \\\"discJ\\\", \\\"scalar\\\"}; }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/ftk/filters/ridge_valley_tracker_3d_regular.hh\",\n \"rank\": 72,\n \"score\": 192541.90727723652\n },\n {\n \"content\": \"struct function_traits<T&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 73,\n \"score\": 192392.12653308164\n },\n {\n \"content\": \"struct function_traits<T&&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 74,\n \"score\": 192392.12653308164\n },\n {\n \"content\": \"struct point_locator_2d_quad : public point_locator_2d<I, F> {\\n\\n point_locator_2d_quad(const simplicial_unstructured_2d_mesh<I, F> &m) \\n\\n : point_locator_2d<I, F>(m) { initialize(); }\\n\\n virtual ~point_locator_2d_quad();\\n\\n\\n\\n void initialize();\\n\\n // I locate(const F x[], F mu[]) const { return locate_point_recursive(x, root, mu); }\\n\\n I locate(const F x[], F mu[]) const { return locate_point_nonrecursive(x, mu); }\\n\\n\\n\\n std::vector<bvh2d_node_t<I, F>> to_bvh() const;\\n\\n\\n\\nprotected:\\n\\n struct quad_node {\\n\\n quad_node *parent = NULL;\\n\\n quad_node *children[4] = {NULL};\\n\\n AABB<F> aabb;\\n\\n std::vector<AABB<F>> elements; // valid only for leaf nodes\\n\\n\\n\\n ~quad_node();\\n\\n bool is_leaf() const { return elements.size() > 0; }\\n\",\n \"file_path\": \"include/ftk/mesh/point_locator_2d_quad.hh\",\n \"rank\": 75,\n \"score\": 192392.12653308164\n },\n {\n \"content\": \" class ContiguousAssigner: public StaticAssigner\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * \\\\ingroup Assignment\\n\\n * \\\\brief Assigns blocks to processes in contiguous gid (block global id) order\\n\\n */\\n\\n using StaticAssigner::StaticAssigner;\\n\\n\\n\\n using StaticAssigner::size;\\n\\n using StaticAssigner::nblocks;\\n\\n\\n\\n int rank(int gid) const override\\n\\n {\\n\\n int div = nblocks() / size();\\n\\n int mod = nblocks() % size();\\n\\n int r = gid / (div + 1);\\n\\n if (r < mod)\\n\\n {\\n\\n return r;\\n\\n } else\\n\\n {\\n\\n return mod + (gid - (div + 1)*mod)/div;\\n\\n }\\n\\n }\\n\\n inline\\n\\n void local_gids(int rank, std::vector<int>& gids) const override;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"include/ftk/external/diy/assigner.hpp\",\n \"rank\": 76,\n \"score\": 189783.6907323662\n },\n {\n \"content\": \"struct simplicial_unstructured_extruded_2d_mesh : public object { // extruded from \\n\\n simplicial_unstructured_extruded_2d_mesh(const simplicial_unstructured_2d_mesh<I, F>& m_) : m(m_) {extrude();}\\n\\n\\n\\n size_t n(int d) const;\\n\\n size_t n_ordinal(int d) const { return m.n(d); }\\n\\n size_t n_interval(int d) const;\\n\\n\\n\\n bool is_ordinal(int d, I i) const {\\n\\n I k = mod(i, n(d));\\n\\n return k < n_ordinal(d);\\n\\n }\\n\\n\\n\\n I flat_vertex_id(I i) const { return mod(i, m.n(0)); }\\n\\n I flat_vertex_time(I i) const { return i / m.n(0); }\\n\\n I extruded_vertex_id(I i, bool t=true) { return t ? i + m.n(0) : i; }\\n\\n\\n\\n int face_type(I i) const; // legacy\\n\\n int simplex_type(int d, I i) const;\\n\\n\\n\\n int get_triangle_chi(I i) const;\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_unstructured_extruded_2d_mesh.hh\",\n \"rank\": 77,\n \"score\": 188548.6291811779\n },\n {\n \"content\": \"struct simplicial_unstructured_extruded_3d_mesh : public object { // extruded from \\n\\n simplicial_unstructured_extruded_3d_mesh(const simplicial_unstructured_3d_mesh<I, F>& m_) : m(m_) {extrude();}\\n\\n\\n\\n size_t n(int d) const;\\n\\n size_t n_ordinal(int d) const { if (d == 4) return m.n(3)*4; else return m.n(d); }\\n\\n size_t n_interval(int d) const;\\n\\n\\n\\n bool is_ordinal(int d, I i) const {\\n\\n I k = mod(i, n(d));\\n\\n return k < n_ordinal(d);\\n\\n }\\n\\n\\n\\n I flat_vertex_id(I i) const { return mod(i, m.n(0)); }\\n\\n I flat_vertex_time(I i) const { return std::floor((double)i / n(0)); } // return i / m.n(0); }\\n\\n I extruded_vertex_id(I i, bool t=true) { return t ? i + m.n(0) : i; }\\n\\n\\n\\n int tet_type(I i) const { return simplex_type(3, i); }\\n\\n int simplex_type(int d, I i) const;\\n\\n\\n\\npublic: // element iteration\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_unstructured_extruded_3d_mesh.hh\",\n \"rank\": 78,\n \"score\": 188548.62918117794\n },\n {\n \"content\": \"struct simplicial_xgc_3d_mesh : public simplicial_unstructured_3d_mesh<I, F> {\\n\\n simplicial_xgc_3d_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_); // nphi and iphi must be specified before using\\n\\n simplicial_xgc_3d_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_, int nphi, int iphi=1, int vphi=1);\\n\\n // simplicial_xgc_3d_mesh(const std::string& mesh_filename);\\n\\n\\n\\n std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> get_m2() const {return m2;}\\n\\n\\n\\n virtual size_t n(int d) const;\\n\\n size_t np() const {return nphi * iphi * vphi;} // number of poloidal planes, incl. virtual planes defined by vphi\\n\\n\\n\\n bool probe_nphi_iphi(const std::string& filename);\\n\\n void set_nphi_iphi(int n, int i) {nphi = n; iphi = i;}\\n\\n void set_vphi(int v) { vphi = v; }\\n\\n\\n\\n int get_nphi() const {return nphi;}\\n\\n int get_iphi() const {return iphi;}\\n\\n int get_vphi() const {return vphi;}\\n\\n\\n\\n bool is_poloidal(int p) const { return p % vphi == 0; }\\n\\n bool is_poloidal(int d, I i) const { return m3->is_ordinal(d, i); }\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_xgc_3d_mesh.hh\",\n \"rank\": 79,\n \"score\": 188548.62918117794\n },\n {\n \"content\": \"struct feature_point_set_t : public std::list<feature_point_t>\\n\\n{\\n\\n#if FTK_HAVE_VTK\\n\\n vtkSmartPointer<vtkPolyData> to_vtp(\\n\\n const std::vector<std::string>& scalar_components) const;\\n\\n#endif\\n\\n};\\n\\n\\n\\n#if FTK_HAVE_VTK\\n\\nvtkSmartPointer<vtkPolyData> feature_point_set_t::to_vtp(\\n\\n const std::vector<std::string>& scalar_components) const\\n\\n{\\n\\n vtkSmartPointer<vtkPolyData> poly = vtkPolyData::New();\\n\\n vtkSmartPointer<vtkPoints> points = vtkPoints::New();\\n\\n vtkSmartPointer<vtkCellArray> vertices = vtkCellArray::New();\\n\\n \\n\\n vtkIdType pid[1];\\n\\n for (const auto &cp : *this) {\\n\\n double p[3] = {cp.x[0], cp.x[1], cp.x[2]}; \\n\\n pid[0] = points->InsertNextPoint(p);\\n\",\n \"file_path\": \"include/ftk/features/feature_point_set.hh\",\n \"rank\": 80,\n \"score\": 188548.6291811779\n },\n {\n \"content\": \"struct simplicial_unstructured_3d_mesh : public simplicial_unstructured_mesh<I, F> {\\n\\n friend class diy::Serialization<simplicial_unstructured_3d_mesh<I, F>>;\\n\\n \\n\\n simplicial_unstructured_3d_mesh() {}\\n\\n\\n\\n simplicial_unstructured_3d_mesh(\\n\\n const std::vector<F>& coords, \\n\\n const std::vector<I>& tetrahedra);\\n\\n\\n\\n int nd() const {return 3;}\\n\\n virtual size_t n(int d) const;\\n\\n \\n\\n void build_smoothing_kernel(F sigma);\\n\\n void smooth_scalar_gradient_jacobian(\\n\\n const ndarray<F>& f, \\n\\n const F sigma,\\n\\n ndarray<F>& fs, // smoothed scalar field\\n\\n ndarray<F>& g, // smoothed gradient field\\n\\n ndarray<F>& j // smoothed jacobian field\\n\\n ) const; \\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_unstructured_3d_mesh.hh\",\n \"rank\": 81,\n \"score\": 188548.6291811779\n },\n {\n \"content\": \"struct simplicial_xgc_2d_mesh : public simplicial_unstructured_2d_mesh<I, F> {\\n\\n simplicial_xgc_2d_mesh(\\n\\n const ndarray<F>& coords, \\n\\n const ndarray<I>& triangles,\\n\\n const ndarray<F>& psi,\\n\\n const ndarray<I>& nextnodes);\\n\\n \\n\\n simplicial_xgc_2d_mesh(\\n\\n const ndarray<F>& coords, \\n\\n const ndarray<I>& triangles) : simplicial_unstructured_2d_mesh<I, F>(coords, triangles) {}\\n\\n\\n\\n void initialize_point_locator();\\n\\n void initialize_roi(double psin_min = 0.9, double psin_max = 1.05, \\n\\n double theta_min_deg = -60.0, double theta_max_deg = 60.0);\\n\\n\\n\\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_file(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_h5(const std::string& filename);\\n\\n static std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> from_xgc_mesh_bp(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\\n\\n\\n void read_oneddiag(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_xgc_2d_mesh.hh\",\n \"rank\": 82,\n \"score\": 188548.6291811779\n },\n {\n \"content\": \"struct simplicial_mpas_2d_mesh : public simplicial_unstructured_2d_mesh<I, F> {\\n\\n simplicial_mpas_2d_mesh(\\n\\n const ndarray<F>& coords, \\n\\n const ndarray<I>& triangles) : simplicial_unstructured_2d_mesh<I, F>(coords, triangles) {}\\n\\n\\n\\n // int ncoords() const { return 3; }\\n\\n\\n\\n static std::shared_ptr<simplicial_mpas_2d_mesh<I, F>> from_file(const std::string& filename, diy::mpi::communicator comm = MPI_COMM_WORLD);\\n\\n};\\n\\n\\n\\n// inline simplicial_mpas_2d_mesh::simplicial_mpas_2d_mesh(const mpas_mesh& mm) :\\n\\n\\n\\ntemplate <typename I, typename F>\\n\\nstd::shared_ptr<simplicial_mpas_2d_mesh<I, F>> simplicial_mpas_2d_mesh<I, F>::from_file(\\n\\n const std::string& filename, \\n\\n diy::mpi::communicator comm)\\n\\n{\\n\\n#if FTK_HAVE_NETCDF\\n\\n int ncid;\\n\\n NC_SAFE_CALL( nc_open(filename.c_str(), NC_NOWRITE, &ncid) );\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_mpas_2d_mesh.hh\",\n \"rank\": 83,\n \"score\": 188548.6291811779\n },\n {\n \"content\": \"struct critical_line_tracker_3d_regular : public virtual critical_line_tracker, public virtual regular_tracker\\n\\n{\\n\\n critical_line_tracker_3d_regular(diy::mpi::communicator comm) : critical_line_tracker(comm), regular_tracker(comm, 3), tracker(comm) {}\\n\\n virtual ~critical_line_tracker_3d_regular() {}\\n\\n\\n\\n void finalize();\\n\\n void reset();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\npublic:\\n\\n void build_vortex_surfaces();\\n\\n\\n\\n void read_surfaces(const std::string& filename, std::string format=\\\"auto\\\");\\n\\n\\n\\n void write_intersections(const std::string& filename) const;\\n\\n void write_sliced(const std::string& pattern) const;\\n\\n void write_surfaces(const std::string& filename, std::string format=\\\"auto\\\") const;\\n\\n#if FTK_HAVE_VTK\\n\\n vtkSmartPointer<vtkPolyData> get_intersections_vtp() const;\\n\",\n \"file_path\": \"include/ftk/filters/critical_line_tracker_3d_regular.hh\",\n \"rank\": 84,\n \"score\": 187586.58315122855\n },\n {\n \"content\": \"struct tdgl_vortex_tracker_3d_regular : public virtual tdgl_vortex_tracker, public virtual regular_tracker\\n\\n{\\n\\n tdgl_vortex_tracker_3d_regular(diy::mpi::communicator comm) : tdgl_vortex_tracker(comm), regular_tracker(comm, 3), tracker(comm) {}\\n\\n virtual ~tdgl_vortex_tracker_3d_regular() {}\\n\\n\\n\\n void finalize();\\n\\n void reset();\\n\\n\\n\\n void update_timestep();\\n\\n\\n\\npublic:\\n\\n void build_vortex_surfaces();\\n\\n\\n\\n void read_surfaces(const std::string& filename, std::string format=\\\"auto\\\");\\n\\n\\n\\n void write_intersections(const std::string& filename) const;\\n\\n void write_sliced(const std::string& pattern) const;\\n\\n void write_surfaces(const std::string& filename, std::string format=\\\"auto\\\") const;\\n\\n#if FTK_HAVE_VTK\\n\\n vtkSmartPointer<vtkPolyData> get_intersections_vtp() const;\\n\",\n \"file_path\": \"include/ftk/filters/tdgl_vortex_tracker_3d_regular.hh\",\n \"rank\": 85,\n \"score\": 187586.58315122855\n },\n {\n \"content\": \"struct diyfp // f * 2^e\\n\\n{\\n\\n static constexpr int kPrecision = 64; // = q\\n\\n\\n\\n std::uint64_t f = 0;\\n\\n int e = 0;\\n\\n\\n\\n constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {}\\n\\n\\n\\n /*!\\n\\n @brief returns x - y\\n\\n @pre x.e == y.e and x.f >= y.f\\n\\n */\\n\\n static diyfp sub(const diyfp& x, const diyfp& y) noexcept\\n\\n {\\n\\n assert(x.e == y.e);\\n\\n assert(x.f >= y.f);\\n\\n\\n\\n return {x.f - y.f, x.e};\\n\\n }\\n\",\n \"file_path\": \"include/ftk/external/json.hh\",\n \"rank\": 86,\n \"score\": 186165.48364938895\n },\n {\n \"content\": \"struct levy_degani_seginer_tracker_3d_regular : public critical_line_tracker_3d_regular \\n\\n{\\n\\n levy_degani_seginer_tracker_3d_regular(diy::mpi::communicator comm) : \\n\\n critical_line_tracker_3d_regular(comm), \\n\\n critical_line_tracker(comm),\\n\\n regular_tracker(comm, 3), \\n\\n tracker(comm) {}\\n\\n virtual ~levy_degani_seginer_tracker_3d_regular() {};\\n\\n\\n\\nprotected:\\n\\n bool check_simplex(const element_t& s, feature_point_t& cp) const;\\n\\n\\n\\n void simplex_residue_vorts(\\n\\n const std::vector<std::vector<int>>& vertices,\\n\\n float residues[3], float vorts[3][3]) const;\\n\\n\\n\\n void push_field_data_snapshot(const ndarray<float>& data);\\n\\n\\n\\n std::vector<std::string> varnames() const { return {\\\"residue\\\", \\\"vortmag\\\"}; }\\n\\n};\\n\",\n \"file_path\": \"include/ftk/filters/levy_degani_seginer_tracker_3d_regular.hh\",\n \"rank\": 87,\n \"score\": 186081.9089972477\n },\n {\n \"content\": \" class RoundRobinAssigner: public StaticAssigner\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * \\\\ingroup Assignment\\n\\n * \\\\brief Assigns blocks to processes in cyclic or round-robin gid (block global id) order\\n\\n */\\n\\n using StaticAssigner::StaticAssigner;\\n\\n\\n\\n using StaticAssigner::size;\\n\\n using StaticAssigner::nblocks;\\n\\n\\n\\n int rank(int gid) const override { return gid % size(); }\\n\\n inline\\n\\n void local_gids(int rank, std::vector<int>& gids) const override;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"include/ftk/external/diy/assigner.hpp\",\n \"rank\": 88,\n \"score\": 185255.1371622713\n },\n {\n \"content\": \"struct function_traits<ReturnType(*)(Args...)>\\n\\n : public function_traits<ReturnType(Args...)>\\n\\n{};\\n\\n\\n\\ntemplate <typename ClassType, typename ReturnType, typename... Args>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 89,\n \"score\": 184948.612786814\n },\n {\n \"content\": \"struct function_traits<ReturnType(Args...)>\\n\\n{\\n\\n /**\\n\\n .. type:: type result_type\\n\\n\\n\\n The type returned by calling an instance of the function object type *F*.\\n\\n */\\n\\n typedef ReturnType result_type;\\n\\n\\n\\n /**\\n\\n .. type:: type function_type\\n\\n\\n\\n The function type (``R(T...)``).\\n\\n */\\n\\n typedef ReturnType function_type(Args...);\\n\\n\\n\\n /**\\n\\n .. type:: type member_function_type<OwnerType>\\n\\n\\n\\n The member function type for an *OwnerType* (``R(OwnerType::*)(T...)``).\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 90,\n \"score\": 184948.612786814\n },\n {\n \"content\": \"struct function_traits<volatile T&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 91,\n \"score\": 184550.14245891082\n },\n {\n \"content\": \"struct function_traits<volatile T&&> : public function_traits<T> {};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 92,\n \"score\": 184550.14245891082\n },\n {\n \"content\": \"struct simplicial_xgc_3dff_mesh : public simplicial_xgc_3d_mesh<I, F> {\\n\\n simplicial_xgc_3dff_mesh(std::shared_ptr<simplicial_xgc_2d_mesh<I, F>> m2_, int nphi, int iphi=1, int vphi=1) \\n\\n : simplicial_xgc_3d_mesh<I, F>(m2_, nphi, iphi, vphi) {}\\n\\n\\n\\n void initialize_ff_mesh() {}; // TODO\\n\\n void initialize_ff_mesh(const std::string& filename);\\n\\n void read_ff_mesh(const std::string& filename) { um = simplicial_unstructured_3d_mesh<I, F>::from_file(filename); }\\n\\n void write_ff_mesh(const std::string& filename) const { um->to_file(filename); }\\n\\n\\n\\npublic: // reimpl\\n\\n size_t n(int d) const;\\n\\n\\n\\n void get_simplex(int d, I i, I verts[]) const;\\n\\n bool find_simplex(int d, const I v[], I &i) const { return false; } // TODO\\n\\n\\n\\nprotected:\\n\\n std::shared_ptr<simplicial_unstructured_3d_mesh<I, F>> um; // the \\\"unit\\\" 3D mesh between poloidal planes\\n\\n};\\n\\n\\n\\n///////////////////\\n\",\n \"file_path\": \"include/ftk/mesh/simplicial_xgc_3dff_mesh.hh\",\n \"rank\": 93,\n \"score\": 181424.97733066507\n },\n {\n \"content\": \"struct function_traits<MEM_FN_SYMBOL_XX0SL7G4Z0J<R(C::*)(A...) const>>\\n\\n : public function_traits<R(const C*, A...)>\\n\\n{};\\n\\ntemplate <typename R, typename C, typename... A>\\n\",\n \"file_path\": \"include/ftk/external/diy/detail/traits.hpp\",\n \"rank\": 94,\n \"score\": 181368.92219256973\n },\n {\n \"content\": \"// It is a separate type rather than an alias to make symbols readable.\\n\\nstruct format_args : basic_format_args<format_context> {\\n\\n template <typename... Args>\\n\\n format_args(Args&&... args)\\n\\n : basic_format_args<format_context>(std::forward<Args>(args)...) {}\\n\\n};\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 95,\n \"score\": 180615.5125566115\n },\n {\n \"content\": \"struct wformat_args : basic_format_args<wformat_context> {\\n\\n template <typename... Args>\\n\\n wformat_args(Args&&... args)\\n\\n : basic_format_args<wformat_context>(std::forward<Args>(args)...) {}\\n\\n};\\n\\n\\n\\ntemplate <typename Container> struct is_contiguous : std::false_type {};\\n\\n\\n\\ntemplate <typename Char>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 96,\n \"score\": 180615.5125566115\n },\n {\n \"content\": \"struct is_contiguous_back_insert_iterator : std::false_type {};\\n\\ntemplate <typename Container>\\n\",\n \"file_path\": \"include/ftk/external/diy/fmt/core.h\",\n \"rank\": 97,\n \"score\": 180615.5125566115\n },\n {\n \"content\": \"struct object {\\n\\n object() {}\\n\\n object(diy::mpi::communicator c) {comm = c;}\\n\\n\\n\\n void set_communicator(const diy::mpi::communicator comm_) {comm = comm_;}\\n\\n void set_root_proc(int p) {root_proc = p;}\\n\\n int get_root_proc() const {return root_proc;}\\n\\n bool is_root_proc() const {return root_proc == comm.rank();}\\n\\n\\n\\n static void set_affinity(int cpu) {\\n\\n#if !defined(_MSC_VER) && !defined(__APPLE__)\\n\\n cpu_set_t cpu_set;\\n\\n CPU_ZERO(&cpu_set);\\n\\n CPU_SET(cpu, &cpu_set);\\n\\n\\n\\n pthread_t thread = pthread_self();\\n\\n pthread_setaffinity_np(thread, sizeof(cpu_set_t), &cpu_set);\\n\\n // fprintf(stderr, \\\"cpu=%d\\\\n\\\", cpu);\\n\\n#endif\\n\\n }\\n\",\n \"file_path\": \"include/ftk/object.hh\",\n \"rank\": 98,\n \"score\": 179096.8093001128\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\": \"include/ftk/external/json.hh\",\n \"rank\": 99,\n \"score\": 178875.67468895108\n }\n]","isConversational":false}}},{"rowIdx":391,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/menu.cpp"},"repo_name":{"kind":"string","value":"WMXZ-EU/basicSoundRecorder"},"commit":{"kind":"string","value":"3ff2fd5aad50dcd8c29580a05a9247f079a28cc3"},"file_code":{"kind":"string","value":"\n\n#include \"config.h\"\n#include \"filing.h\"\n#include \"utils.h\"\n#include \"mTime.h\"\n#include \"menu.h\"\n\n#define CONFIG_FILE \"/Config.txt\"\n#define LOCK_FILE \"/cVAS.lock\"\nextern SDClass sdx[];\nuint16_t store[16];\n\nextern int t_acq;\n\nvoid storeConfig(uint16_t *store, int ns)\n{ \n \n\n File configFile;\n char text[32];\n configFile=sdx[0].open(CONFIG_FILE,FILE_WRITE_BEGIN);\n for(int ii=0; ii<ns; ii++)\n { sprintf(text,\"%10d\\r\\n\",(int) store[ii]); configFile.write((uint8_t*)text,strlen(text)); }\n configFile.close();\n \n}\n\nvoid loadConfig(uint16_t *store, int ns)\n{\n \n\n File configFile;\n char text[32];\n if(!(configFile=sdx[0].open(CONFIG_FILE,FILE_READ))) { store[0]=0; return; } \n \n\n for(int ii=0; ii<ns; ii++)\n { if(configFile.readBytesUntil('\\n',text,32)<=0) { store[0]=0; return;} \n int x; sscanf(text, \"%d\",&x);\n store[ii]=(int16_t) x;\n }\n configFile.close();\n}\n\nvoid saveParameters(void)\n{\n store[0]= 1;\n store[2]= t_acq;\n\n storeConfig(store, 16);\n}\n\nvoid loadParameters(void)\n{\n loadConfig(store,16);\n if(store[0]==1)\n {\n t_acq=store[2];\n }\n}\n\nvoid printMenu(void)\n{\n Serial.println(\"\\n Menu\");\n Serial.println(\" ':h' : print help\");\n Serial.println(\" ':s' : start acquisition\");\n Serial.println(\" ':e' : stop acquisition\");\n Serial.println(\" ':w' : write parameters to microSD card\");\n Serial.println(\" ':l' : list disks\");\n Serial.println(\" ':r' : reset MTP\");\n Serial.println(\" ':b' : reboot CPU\");\n\n Serial.println();\n Serial.println(\" '?p' : show all parameters\");\n Serial.println(\" '?d' : get date\");\n Serial.println(\" '?t' : get time\");\n Serial.println(\" '?a' : get file duration (s)\");\n Serial.println();\n Serial.println(\" '!d yyyy/mm/dd<cr>' : set date\");\n Serial.println(\" '!t hh:mm:ss<cr>' : set time\");\n Serial.println(\" '!a val<cr>' : set file duration (s)\");\n Serial.println();\n}\n\nvoid printMenuEntries(void)\n{\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n Serial.println(\"CVAS_V3 Version: \" __DATE__ \" \" __TIME__ );\n Serial.printf(\"Teensy: %d: %06x\\n\",teensy,SerNum);\n Serial.printf(\"Date d = %04d/%02d/%02d\\n\",tmYearToCalendar(tm.Year), tm.Month, tm.Day); \n Serial.printf(\"Time t = %02d:%02d:%02d\\n\",tm.Hour, tm.Minute, tm.Second); \n Serial.printf(\"T_acq a = %d\\n\",t_acq); \n}\n\nint menuGetInt(int *val)\n{ char buffer[40];\n while(!Serial.available());\n int count = Serial.readBytesUntil('\\r',buffer,40);\n buffer[count]=0;\n\n return sscanf(buffer,\"%d\",val);\n}\n\nint menuGet3Int(int *val1, int *val2, int *val3)\n{ char buffer[40];\n while(!Serial.available());\n int count = Serial.readBytesUntil('\\r',buffer,40);\n buffer[count]=0;\n\n char c1,c2;\n return sscanf(buffer,\"%d%c%d%c%d\",val1,&c1,val2,&c2,val3);\n}\n\nvoid listDisks(void);\nvoid resetMTP(void) ;\nvoid dumpMTP(void) ;\n\n#if defined (KINETISK) \n#define CPU_RESTART \n#endif\n\nint16_t menu(void)\n{\n if(!Serial.available()) return 0;\n\n char ch=Serial.read();\n if(ch==':')\n { while(!Serial.available()) ; ch=Serial.read();\n\n if(ch=='s') { Serial.print(\"\\n\"); Serial.print(\"start\"); return +1;} \n else if(ch=='e') { Serial.print(\"\\n\"); Serial.print(\"stop\"); return -1;} \n else if(ch=='h') { printMenu(); return 0;} \n else if(ch=='w') { saveParameters(); return 0;} \n else if(ch=='l') { listDisks(); return 0;} \n else if(ch=='b') { Serial.print(\"\\n\"); Serial.print(\"rebooting CPU\"); Serial.flush(); delay(100); CPU_RESTART; return 0;} \n }\n else if(ch=='?') \n {\n while(!Serial.available()) ; ch=Serial.read();\n\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n if(ch=='p') { printMenuEntries(); return 0;} \n else if(ch=='d') { Serial.printf(\"%04d/%02d/%02d\\n\",tmYearToCalendar(tm.Year), tm.Month, tm.Day); return 0;} \n else if(ch=='t') { Serial.printf(\"%02d:%02d:%02d\\n\",tm.Hour, tm.Minute, tm.Second); return 0;} \n else if(ch=='a') { Serial.printf(\"%d\\n\",t_acq); return 0;} \n }\n else if(ch=='!') \n { \n while(!Serial.available()) ;\n ch=Serial.read();\n if(ch=='d') \n { int year,month,day;\n menuGet3Int(&year,&month,&day);\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n setRTCTime(tm.Hour, tm.Minute, tm.Second, day, month, year);\n return 0;\n } \n else if(ch=='t') \n { int hour,minutes,seconds;\n menuGet3Int(&hour,&minutes,&seconds);\n\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n setRTCTime(hour, minutes, seconds, tm.Day, tm.Month, tmYearToCalendar(tm.Year));\n return 0;\n } \n else if(ch=='a') { menuGetInt(&t_acq); return 0;} \n }\n return 0;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"config.h\"\n#include \"filing.h\"\n#include \"utils.h\"\n#include \"mTime.h\"\n#include \"menu.h\"\n\n#define CONFIG_FILE \"/Config.txt\"\n#define LOCK_FILE \"/cVAS.lock\"\nextern SDClass sdx[];\nuint16_t store[16];\n\nextern int t_acq;\n\nvoid storeConfig(uint16_t *store, int ns)\n{ \n \n\n File configFile;\n char text[32];\n configFile=sdx[0].open(CONFIG_FILE,FILE_WRITE_BEGIN);\n for(int ii=0; ii<ns; ii++)\n { sprintf(text,\"%10d\\r\\n\",(int) store[ii]); configFile.write((uint8_t*)text,strlen(text)); }\n configFile.close();\n \n}\n\nvoid loadConfig(uint16_t *store, int ns)\n{\n \n\n File configFile;\n char text[32];\n if(!(configFile=sdx[0].open(CONFIG_FILE,FILE_READ))) { store[0]=0; return; } \n \n\n for(int ii=0; ii<ns; ii++)\n { if(configFile.readBytesUntil('\\n',text,32)<=0) { store[0]=0; return;} \n int x; sscanf(text, \"%d\",&x);\n store[ii]=(int16_t) x;\n }\n configFile.close();\n}\n\nvoid saveParameters(void)\n{\n store[0]= 1;\n store[2]= t_acq;\n\n storeConfig(store, 16);\n}\n\nvoid loadParameters(void)\n{\n loadConfig(store,16);\n if(store[0]==1)\n {\n t_acq=store[2];\n }\n}\n\nvoid printMenu(void)\n{\n Serial.println(\"\\n Menu\");\n Serial.println(\" ':h' : print help\");\n Serial.println(\" ':s' : start acquisition\");\n Serial.println(\" ':e' : stop acquisition\");\n Serial.println(\" ':w' : write parameters to microSD card\");\n Serial.println(\" ':l' : list disks\");\n Serial.println(\" ':r' : reset MTP\");\n Serial.println(\" ':b' : reboot CPU\");\n\n Serial.println();\n Serial.println(\" '?p' : show all parameters\");\n Serial.println(\" '?d' : get date\");\n Serial.println(\" '?t' : get time\");\n Serial.println(\" '?a' : get file duration (s)\");\n Serial.println();\n Serial.println(\" '!d yyyy/mm/dd<cr>' : set date\");\n Serial.println(\" '!t hh:mm:ss<cr>' : set time\");\n Serial.println(\" '!a val<cr>' : set file duration (s)\");\n Serial.println();\n}\n\nvoid printMenuEntries(void)\n{\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n Serial.println(\"CVAS_V3 Version: \" __DATE__ \" \" __TIME__ );\n Serial.printf(\"Teensy: %d: %06x\\n\",teensy,SerNum);\n Serial.printf(\"Date d = %04d/%02d/%02d\\n\",tmYearToCalendar(tm.Year), tm.Month, tm.Day); \n Serial.printf(\"Time t = %02d:%02d:%02d\\n\",tm.Hour, tm.Minute, tm.Second); \n Serial.printf(\"T_acq a = %d\\n\",t_acq); \n}\n\nint menuGetInt(int *val)\n{ char buffer[40];\n while(!Serial.available());\n int count = Serial.readBytesUntil('\\r',buffer,40);\n buffer[count]=0;\n\n return sscanf(buffer,\"%d\",val);\n}\n\nint menuGet3Int(int *val1, int *val2, int *val3)\n{ char buffer[40];\n while(!Serial.available());\n int count = Serial.readBytesUntil('\\r',buffer,40);\n buffer[count]=0;\n\n char c1,c2;\n return sscanf(buffer,\"%d%c%d%c%d\",val1,&c1,val2,&c2,val3);\n}\n\nvoid listDisks(void);\nvoid resetMTP(void) ;\nvoid dumpMTP(void) ;\n\n#if defined (KINETISK) \n#define CPU_RESTART \n#endif\n\nint16_t menu(void)\n{\n if(!Serial.available()) return 0;\n\n char ch=Serial.read();\n if(ch==':')\n { while(!Serial.availabl"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"e()) ; ch=Serial.read();\n\n if(ch=='s') { Serial.print(\"\\n\"); Serial.print(\"start\"); return +1;} \n else if(ch=='e') { Serial.print(\"\\n\"); Serial.print(\"stop\"); return -1;} \n else if(ch=='h') { printMenu(); return 0;} \n else if(ch=='w') { saveParameters(); return 0;} \n else if(ch=='l') { listDisks(); return 0;} \n else if(ch=='b') { Serial.print(\"\\n\"); Serial.print(\"rebooting CPU\"); Serial.flush(); delay(100); CPU_RESTART; return 0;} \n }\n else if(ch=='?') \n {\n while(!Serial.available()) ; ch=Serial.read();\n\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n if(ch=='p') { printMenuEntries(); return 0;} \n else if(ch=='d') { Serial.printf(\"%04d/%02d/%02d\\n\",tmYearToCalendar(tm.Year), tm.Month, tm.Day); return 0;} \n else if(ch=='t') { Serial.printf(\"%02d:%02d:%02d\\n\",tm.Hour, tm.Minute, tm.Second); return 0;} \n else if(ch=='a') { Serial.printf(\"%d\\n\",t_acq); return 0;} \n }\n else if(ch=='!') \n { \n while(!Serial.available()) ;\n ch=Serial.read();\n if(ch=='d') \n { int year,month,day;\n menuGet3Int(&year,&month,&day);\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n\n setRTCTime(tm.Hour, tm.Minute, tm.Second, day, month, year);\n return 0;\n } \n else if(ch=='t') \n { int hour,minutes,seconds;\n menuGet3Int(&hour,&minutes,&seconds);\n\n tmElements_t tm;\n breakTime(rtc_get(), tm);\n setRTCTime(hour, minutes, seconds, tm.Day, tm.Month, tmYearToCalendar(tm.Year));\n return 0;\n } \n else if(ch=='a') { menuGetInt(&t_acq); return 0;} \n }\n return 0;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"void resetMTP(void) ;\n","file_path":"src/menu.h","rank":0,"score":67831.51723899825},{"content":"void listDisks(void);\n","file_path":"src/menu.h","rank":1,"score":67804.58596994064},{"content":" void listDisks(void);\n","file_path":"src/filing.h","rank":2,"score":67446.00704694324},{"content":" uint16_t getCount ();\n","file_path":"src/filing.h","rank":3,"score":67420.73567706192},{"content":"void setRTCTime(int hr,int min,int sec,int dy, int mnth, int yr);\n","file_path":"src/mTime.h","rank":4,"score":52022.566451270315},{"content":"int16_t menu(void);\n","file_path":"src/menu.h","rank":5,"score":51802.5010771718},{"content":"void storeConfig(uint16_t *store, int ns);\n","file_path":"src/menu.h","rank":6,"score":45077.89954362695},{"content":"void loadParameters(void);\n","file_path":"src/menu.h","rank":7,"score":45050.96827456933},{"content":"void dumpMTP(void) ;\n","file_path":"src/menu.h","rank":8,"score":45050.96827456933},{"content":"void saveParameters(void);\n","file_path":"src/menu.h","rank":9,"score":45050.96827456933},{"content":"uint32_t get_Lock(void);\n","file_path":"src/menu.h","rank":10,"score":45025.69690468803},{"content":"void setAGain(int8_t again);\n","file_path":"src/menu.h","rank":11,"score":45000.89082576827},{"content":"void set_Lock(uint32_t t_start);\n","file_path":"src/menu.h","rank":12,"score":45000.89082576827},{"content":" int16_t checkReboot(void);\n","file_path":"src/filing.h","rank":13,"score":44719.32062062954},{"content":" extern int t_acq;\n","file_path":"src/filing.h","rank":14,"score":42725.68492101255},{"content":"void breakTime(uint32_t timeInput, tmElements_t &tm);\n","file_path":"src/mTime.h","rank":15,"score":31003.089492490075},{"content":"uint32_t makeTime(const tmElements_t &tm);\n","file_path":"src/mTime.h","rank":16,"score":31003.089492490075},{"content":" } else {\n\n seconds += SECS_PER_DAY * monthDays[i-1]; //monthDay array starts from 0\n\n }\n\n }\n\n seconds+= (tm.Day-1) * SECS_PER_DAY;\n\n seconds+= tm.Hour * SECS_PER_HOUR;\n\n seconds+= tm.Minute * SECS_PER_MIN;\n\n seconds+= tm.Second;\n\n return seconds; \n\n}\n\n\n\nextern \"C\" void rtc_set(uint32_t tt);\n\n\n\nvoid setRTCTime(int hr,int min,int sec,int dy, int mnth, int yr){\n\n // year can be given as full four digit year or two digts (2010 or 10 for 2010); \n\n // it is converted to years since 1970\n\n if( yr > 99)\n\n yr = yr - 1970;\n\n else\n\n yr += 30; \n","file_path":"src/mTime.cpp","rank":26,"score":30738.586075565065},{"content":"\n\n/*============================================================================*/\t\n\n/* functions to convert to and from system time */\n\n/* These are for interfacing with time services and are not normally needed in a sketch */\n\n\n\nstatic const uint8_t monthDays[]={31,28,31,30,31,30,31,31,30,31,30,31}; // API starts months from 1, this array starts from 0\n\n \n\nvoid breakTime(uint32_t timeInput, tmElements_t &tm){\n\n// break the given time_t into time components\n\n// this is a more compact version of the C library localtime function\n\n// note that year is offset from 1970 !!!\n\n\n\n uint8_t year;\n\n uint8_t month, monthLength;\n\n uint32_t time;\n\n unsigned long days;\n\n\n\n time = (uint32_t)timeInput;\n\n tm.Second = time % 60;\n\n time /= 60; // now it is minutes\n","file_path":"src/mTime.cpp","rank":27,"score":30735.676758087233},{"content":"uint32_t makeTime(const tmElements_t &tm){ \n\n// assemble time elements into time_t \n\n// note year argument is offset from 1970 (see macros in time.h to convert to other formats)\n\n// previous version used full four digit year (or digits since 2000),i.e. 2009 was 2009 or 9\n\n \n\n int i;\n\n uint32_t seconds;\n\n\n\n // seconds from 1970 till 1 jan 00:00:00 of the given year\n\n seconds= tm.Year*(SECS_PER_DAY * 365);\n\n for (i = 0; i < tm.Year; i++) {\n\n if (LEAP_YEAR(i)) {\n\n seconds += SECS_PER_DAY; // add extra days for leap years\n\n }\n\n }\n\n \n\n // add days for this year, months start from 1\n\n for (i = 1; i < tm.Month; i++) {\n\n if ( (i == 2) && LEAP_YEAR(tm.Year)) { \n\n seconds += SECS_PER_DAY * 29;\n","file_path":"src/mTime.cpp","rank":28,"score":30734.382978445825},{"content":"#include \"config.h\"\n\n#include \"mTime.h\"\n\n\n\nint32_t day_ = 0;\n\nint16_t newDay(void)\n\n{ uint32_t tx=rtc_get();\n\n int32_t d_ = (int32_t)tx/SECS_PER_DAY; // use days since 1970 as measure\n\n if(day_== d_) return 0;\n\n day_ = d_;\n\n return 1;\n\n}\n\n\n\nint32_t hour_ = 0;\n\nint16_t newHour(void)\n\n{ uint32_t tx=rtc_get();\n\n int32_t h_ = (int32_t) tx/SECS_PER_HOUR; // use hours since 1970 as measures\n\n if(hour_== h_) return 0;\n\n hour_ = h_;\n\n return 1;\n\n}\n","file_path":"src/mTime.cpp","rank":29,"score":30732.874500418722},{"content":" tm.Minute = time % 60;\n\n time /= 60; // now it is hours\n\n tm.Hour = time % 24;\n\n time /= 24; // now it is days\n\n tm.Wday = ((time + 4) % 7) + 1; // Sunday is day 1 \n\n \n\n year = 0; \n\n days = 0;\n\n while((unsigned)(days += (LEAP_YEAR(year) ? 366 : 365)) <= time) {\n\n year++;\n\n }\n\n tm.Year = year; // year is offset from 1970 \n\n \n\n days -= LEAP_YEAR(year) ? 366 : 365;\n\n time -= days; // now it is days in this year, starting at 0\n\n \n\n days=0;\n\n month=0;\n\n monthLength=0;\n\n for (month=0; month<12; month++) {\n","file_path":"src/mTime.cpp","rank":30,"score":30732.21658385193},{"content":" \n\n tmElements_t tm;\n\n tm.Year = yr;\n\n tm.Month = mnth;\n\n tm.Day = dy;\n\n tm.Hour = hr;\n\n tm.Minute = min;\n\n tm.Second = sec;\n\n\n\n uint32_t tt = makeTime(tm);\n\n rtc_set(tt); // for RTC\n\n}\n","file_path":"src/mTime.cpp","rank":31,"score":30731.86088502321},{"content":" if (month==1) { // february\n\n if (LEAP_YEAR(year)) {\n\n monthLength=29;\n\n } else {\n\n monthLength=28;\n\n }\n\n } else {\n\n monthLength = monthDays[month];\n\n }\n\n \n\n if (time >= monthLength) {\n\n time -= monthLength;\n\n } else {\n\n break;\n\n }\n\n }\n\n tm.Month = month + 1; // jan is month 1 \n\n tm.Day = time + 1; // day of month\n\n}\n\n\n","file_path":"src/mTime.cpp","rank":32,"score":30729.52885853795},{"content":" }\n\n}\n\n\n\nvoid listDisks(void)\n\n{\n\n for(int ii=0;ii<nsd;ii++)\n\n {\n\n Serial.print(\"\\n\"); \n\n Serial.printf(\"Storage %d %d %s \",ii,cs[ii],sd_str[ii]);\n\n Serial.printf(\"%d %d\",sdx[ii].sdfs.freeClusterCount(),diskSize[ii]);\n\n }\n\n Serial.print(\"\\n\"); \n\n}\n\n\n\nint16_t checkReboot(void)\n\n{\n\n int ii=0;\n\n while((ii<nsd) && (diskSpace[ii]<MIN_SPACE)) ii++;\n\n if(ii<nsd) CPU_RESTART;\n\n return -1;\n","file_path":"src/filing.cpp","rank":33,"score":30289.859694696504},{"content":"void dateTime(uint16_t* date, uint16_t* time, uint8_t* ms10) \n\n{ \n\n tmElements_t tm;\n\n breakTime(rtc_get(), tm);\n\n\n\n *date = FS_DATE(tmYearToCalendar(tm.Year),tm.Month, tm.Day);\n\n *time = FS_TIME(tm.Hour, tm.Minute, tm.Second);\n\n *ms10 = tm.Second & 1 ? 100 : 0;\n\n}\n\n\n\nvoid storage_configure()\n\n{\n\n #if defined SD_SCK\n\n SPI.setMOSI(SD_MOSI);\n\n SPI.setMISO(SD_MISO);\n\n SPI.setSCK(SD_SCK);\n\n #endif\n\n\n\n // Set Time callback\n\n FsDateTime::callback = dateTime;\n","file_path":"src/filing.cpp","rank":34,"score":30283.11853913592},{"content":"\n\n //\n\n Serial.print(\"\\n\"); Serial.print(dirName);\n\n #if PRINT_LOGFILE>0\n\n log_start();\n\n if(logFile) {logFile.print(\"\\n\");logFile.print(dirName);}\n\n #endif\n\n return 1;\n\n }\n\n return 0;\n\n\n\n}\n\nstatic int16_t newFileName(char *fileName)\n\n{\n\n tmElements_t tm;\n\n breakTime(rtc_get(), tm);\n\n\tsprintf(fileName, \"%s_%02d%02d%02d.bin\", FilePrefix, tm.Hour, tm.Minute, tm.Second);\n\n //\n\n Serial.print(\"\\n\"); Serial.print(isd); Serial.print(\": \");Serial.print(fileName);\n\n #if PRINT_LOGFILE>0\n","file_path":"src/filing.cpp","rank":35,"score":30282.991337792006},{"content":"}\n\n\n\nstatic int isd=(nsd>1)?1:0; // fist SPI disk is #1 if there are more than one\n\nextern int32_t hour_; // to force newHour on new disk\n\n\n\nstatic SDClass *checkDiskSpace(void)\n\n{ static int isd_ = nsd;\n\n\n\n doTransactions(true);\n\n while((isd<nsd) && ((diskSize[isd]==0) \n\n || ((diskSpace[isd]=sdx[isd].sdfs.freeClusterCount()) < MIN_SPACE) )) isd++;\n\n doTransactions(false);\n\n if(isd<nsd) \n\n { sdx[isd].sdfs.chvol();\n\n Serial.println(); Serial.print(isd);\n\n Serial.print(\": \"); Serial.print(sdx[isd].sdfs.freeClusterCount());\n\n }\n\n //\n\n if(isd != isd_) hour_=0; // set hour_ to zero to trigger creation of directories in new disk\n\n isd_=isd;\n","file_path":"src/filing.cpp","rank":36,"score":30282.305240752034},{"content":" if(logFile) \n\n { logFile.print(\"\\n\"); logFile.print(isd); logFile.print(\": \"); logFile.print(fileName);}\n\n #endif\n\n return 1;\n\n}\n\n\n\n/* main data filing routine */\n\nint16_t saveData(int16_t status)\n\n{ static char dirName[80];\n\n static char fileName[80];\n\n static char header[512];\n\n static int dirFlag=0;\n\n\n\n if(status<CLOSED) return status; // we are stopped: don't do anything\n\n\n\n //fetch data from circular buffer\n\n if(pullData(diskBuffer,NDBL))\n\n { disk_count++;\n\n if(status==CLOSED) // file closed: should open\n\n { //doTransactions(true);\n","file_path":"src/filing.cpp","rank":37,"score":30282.00337455444},{"content":" uint64_t usedSize = sdx[ii].usedSize();\n\n\n\n Serial.printf(\"Storage %d %d %s \",ii,cs[ii],sd_str[ii]); \n\n Serial.print(totalSize); Serial.print(\" \"); Serial.println(usedSize);\n\n\n\n Serial.print(sdx[ii].sdfs.clusterCount()); Serial.print(\" \"); \n\n Serial.print(sdx[ii].sdfs.freeClusterCount()); Serial.print(\" \");\n\n\n\n clusterSize[ii] = sdx[ii].sdfs.bytesPerCluster()/512; // count sectors\n\n Serial.println(clusterSize[ii]) ;Serial.print(\" \");\n\n\n\n diskSpace[ii]=diskSize[ii]=sdx[ii].sdfs.freeClusterCount();\n\n Serial.println(diskSize[ii]) ;Serial.print(\" \");\n\n }\n\n else\n\n {\n\n diskSize[ii]=0;\n\n diskSpace[ii]=0;\n\n clusterSize[ii]=1;\n\n }\n","file_path":"src/filing.cpp","rank":38,"score":30281.89184879836},{"content":"\n\n uint16_t getCount () { return rawData.getCount(); }\n\n uint16_t pushData(uint32_t * src){ return rawData.push(src);}\n\n uint16_t pullData(uint32_t * dst, uint32_t ndbl) {return rawData.pull(dst,ndbl);}\n\n\n\n/****************************** Filing Utility *******************************************/\n\n\n\nextern int t_acq;\n\n\n\nFile file=NULL; // is used by saveData and saveNAD\n\nuint32_t disk_count=0;\n\nuint32_t diskBuffer[MAX_DISK_BUFFER];\n\n\n\nSDClass *msd; // storage of next free disk\n\n\n\nstatic int16_t makeHeader(char *header)\n\n{\n\n /**\n\n * @brief Make file header\n\n * @param header is pointer to header\n","file_path":"src/filing.cpp","rank":39,"score":30280.444336694716},{"content":" else\n\n {\n\n return MUST_REBOOT; // if file open fails: don't do anything\n\n }\n\n }\n\n //\n\n if(status==OPENED) // file is open: write first record (header)\n\n { makeHeader(header);\n\n if(file.write((const void*)header,512) < 512) return MUST_REBOOT; else status=2;\n\n }\n\n //\n\n if(status>=RUNNING) // file is open, header written: store data records\n\n { \n\n if(file.write((const void *)diskBuffer,4*MAX_DISK_BUFFER) < 4*MAX_DISK_BUFFER) return MUST_REBOOT;\n\n }\n\n }\n\n // following is done independent of data availability\n\n if(status==DOCLOSE) // should close file\n\n {\n\n // writes are done, so enable again transaction activations\n","file_path":"src/filing.cpp","rank":40,"score":30278.378326009337},{"content":" * \n\n */\n\n #define MAGIC \"WMXZ\"\n\n tmElements_t tm;\n\n breakTime(rtc_get(), tm);\n\n\n\n int nd=sprintf(header,\"%s%04d%02d%02d_%02d%02d%02d\",\n\n MAGIC,tmYearToCalendar(tm.Year),tm.Month,tm.Day,tm.Hour,tm.Minute,tm.Second);\n\n char *ptr = header+(nd+1);\n\n\n\n int32_t *iptr = (int32_t *) ptr;\n\n iptr[0] = 4; // SW version\n\n iptr[1] = (int32_t)SerNum; // serial number\n\n iptr[2] = fsamp;\n\n iptr[3] = NCHAN_ACQ;\n\n iptr[4] = t_acq;\n\n iptr[5] = 0;\n\n\n\n uint32_t *uptr = (uint32_t*) header;\n\n uptr[127] = 0x55555555;\n\n //\n\n return 1;\n\n}\n\n\n\nstatic uint32_t dummy_buffer[MAX_DISK_BUFFER];\n\n/******************************** SPI Interface *****************************************/\n","file_path":"src/filing.cpp","rank":41,"score":30278.295660088163},{"content":" if(isd==nsd) return (SDClass *) 0; else return &sdx[isd];\n\n}\n\n\n\nstatic int16_t newDirectory(char *dirName, int dirFlag)\n\n{ if(newHour())\n\n { \n\n tmElements_t tm;\n\n breakTime(rtc_get(), tm);\n\n if(!dirFlag)\n\n {\n\n sprintf(dirName, \"/%s%06x_%04d%02d%02d/%02d/\", \n\n DirPrefix,(unsigned int)SerNum,\n\n tmYearToCalendar(tm.Year),tm.Month, tm.Day, tm.Hour);\n\n }\n\n else\n\n {\n\n sprintf(dirName, \"/%s%06x_%04d%02d%02d/%02d_%02d/\", \n\n DirPrefix,(unsigned int)SerNum,\n\n tmYearToCalendar(tm.Year),tm.Month, tm.Day, tm.Hour,dirFlag);\n\n }\n","file_path":"src/filing.cpp","rank":42,"score":30278.054401788853},{"content":"\n\n// adjust to HW configuration\n\n// only build-in SD card T3.5/6 and T4.0/1\n\n const char *sd_str[]={\"sdio\"};\n\n const int cs[] = {BUILTIN_SDCARD};\n\n// only audio board\n\n// const char *sd_str[]={\"sd1\"};\n\n// const int cs[] = {10 };\n\n// general example\n\n// const char *sd_str[]={\"sdio\", \"sd1\",\"sd2\",\"sd3\",\"sd4\",\"sd5\",\"sd6\"};\n\n// const int cs[] = {BUILTIN_SDCARD, 34, 33, 35, 36, 37, 38 };\n\n\n\n const int nsd = sizeof(cs)/sizeof(int);\n\n\n\n SDClass sdx[nsd];\n\n uint32_t diskSize[nsd];\n\n uint32_t diskSpace[nsd];\n\n uint32_t clusterSize[nsd];\n\n\n\n// Call back for file timestamps. Only called for file create and sync(). needed by SDFat-beta\n","file_path":"src/filing.cpp","rank":43,"score":30276.296596098557},{"content":"\n\n for(int ii=0; ii<nsd; ii++)\n\n { Serial.println(ii);\n\n\n\n uint16_t status=0;\n\n if(cs[ii] == BUILTIN_SDCARD)\n\n {\n\n uint16_t tries=0;\n\n while(!sdx[ii].sdfs.begin(SdioConfig(FIFO_SDIO)) && tries<10)\n\n { Serial.print(tries); Serial.print(\" \"); tries++; delay(1000); } \n\n\n\n if(tries<10) \n\n {\n\n status=1;\n\n }\n\n else\n\n {\n\n Serial.println(\"No sdio storage\"); \n\n }\n\n }\n","file_path":"src/filing.cpp","rank":44,"score":30275.911674685984},{"content":"\n\n // Receive multiple bytes. \n\n // Replace this function if your board has multiple byte receive.\n\n uint8_t receive(uint8_t* buf, size_t count) \n\n { memset(buf, 0XFF, count); SPI.transfer(buf, count); return 0; }\n\n\n\n // Send multiple bytes.\n\n // Replace this function if your board has multiple byte send.\n\n void send(const uint8_t* buf, size_t count) \n\n { SPI.transfer((void *)buf, (void *) dummy_buffer, count); }\n\n\n\n // Save SPISettings for new max SCK frequency\n\n void setSckSpeed(uint32_t maxSck) { m_spiSettings = SPISettings(maxSck, MSBFIRST, SPI_MODE0); }\n\n\n\n private:\n\n SPISettings m_spiSettings;\n\n\n\n public:\n\n bool doTransactions=true;\n\n\n","file_path":"src/filing.cpp","rank":45,"score":30274.482924654567},{"content":" else if(cs[ii]<BUILTIN_SDCARD)\n\n { \n\n sdCsInit(cs[ii]);\n\n delay(100);\n\n uint16_t tries=0;\n\n while(!sdx[ii].sdfs.begin(SdSpiConfig(cs[ii], SHARED_SPI, SPI_SPEED, &mySpi)) && tries<10)\n\n { Serial.print(tries); Serial.print(\" \"); tries++; delay(1000); } \n\n\n\n if(tries<10) \n\n {\n\n status=1;\n\n }\n\n else\n\n {\n\n Serial.println(\"No spi storage\");\n\n }\n\n }\n\n if (status)\n\n {\n\n uint64_t totalSize = sdx[ii].totalSize();\n","file_path":"src/filing.cpp","rank":46,"score":30274.104009144176},{"content":"/**\n\n * @file filing.cpp\n\n * @author Walter Zimmer \n\n * @version 1.0\n\n *\n\n * @section LICENSE\n\n *\n\n * MIT\n\n * \n\n * @section DESCRIPTION\n\n *\n\n * contains filing interface\n\n */\n\n #include \"config.h\"\n\n #include \"mTime.h\"\n\n #include \"filing.h\"\n\n #include \"utils.h\"\n\n #include \"adc.h\"\n\n\n\n /**\n","file_path":"src/filing.cpp","rank":47,"score":30274.01379732683},{"content":"};\n\nMySpiClass mySpi;\n\n\n\nvoid doTransactions(bool val) {mySpi.doTransactions=val;}\n\n\n\nvoid sdCsInit(SdCsPin_t pin) { pinMode(pin, OUTPUT); digitalWriteFast(pin, HIGH);}\n\nvoid sdCsWrite(SdCsPin_t pin, bool level) { digitalWriteFast(pin, level); }\n\n\n\n#define SPI_SPEED SD_SCK_MHZ(33) // adjust to sd card \n\n#if USE_SDIO==2\n\n #define SD_CONFIG SdioConfig(FIFO_SDIO)\n\n #define SD_MOSI 11\n\n #define SD_MISO 12\n\n #define SD_SCK 13\n\n#endif\n\n#if defined(ARDUINO_TEENSY36)\n\n #define SD_MOSI 7\n\n #define SD_MISO 12\n\n #define SD_SCK 14\n\n#endif\n","file_path":"src/filing.cpp","rank":48,"score":30273.828464008424},{"content":" if(!(msd=checkDiskSpace())) return MUST_REBOOT;\n\n //\n\n if(newDirectory(dirName,dirFlag)) \n\n { if(!msd->sdfs.exists(dirName) && !msd->sdfs.mkdir(dirName)) dirFlag++; \n\n if(!msd->sdfs.chdir(dirName)) dirFlag++; else dirFlag=0;\n\n }\n\n //\n\n if(dirFlag>5) return MUST_REBOOT; // too many directory errors\n\n if(dirFlag>0) return CLOSED; // create new directory with different name\n\n\n\n if(newFileName(fileName))\n\n { \n\n file = msd->open(fileName, FILE_WRITE_BEGIN); \n\n if(file) \n\n status = OPENED; \n\n else \n\n { Serial.println(\"Failing open file\");\n\n return MUST_REBOOT; \n\n }\n\n } \n","file_path":"src/filing.cpp","rank":49,"score":30273.36025631045},{"content":" if(++r >= (MAXBUF/ndbl)) r=0;\n\n rear_ = r*ndbl;\n\n return 1;\n\n }\n\n uint16_t getCount () \n\n { \n\n /**\n\n * @brief get number of data blocks in storage\n\n * \n\n */\n\n if(front_ >= rear_) return front_ - rear_; return front_+ MAXBUF -rear_; \n\n }\n\n\n\n private: \n\n uint16_t front_, rear_;\n\n uint32_t *data_buffer;\n\n\n\n };\n\n\n\n Data rawData(data_buffer);\n","file_path":"src/filing.cpp","rank":50,"score":30270.340844255494},{"content":" file.flush();\n\n file.close();\n\n status = CLOSED;\n\n }\n\n if(status==MUSTSTOP) // should close file and stop\n\n { \n\n file.flush();\n\n file.close();\n\n status = STOPPED;\n\n }\n\n return status;\n\n}\n","file_path":"src/filing.cpp","rank":51,"score":30268.415901208456},{"content":" #else\n\n uint32_t data_buffer[MAXBUF*NBUF_ACQ];\n\n #endif\n\n\n\n #define MAX_DISK_BUFFER (NDBL*NBUF_ACQ)\n\n\n\n /**\n\n * @brief Data storage class\n\n * \n\n */\n","file_path":"src/filing.cpp","rank":52,"score":30267.747958978965},{"content":" if(f == rear_) return 0;\n\n\n\n uint32_t *ptr= data_buffer+f*NBUF_ACQ;\n\n memcpy(ptr,src,NBUF_ACQ*4);\n\n front_ = f;\n\n return 1;\n\n }\n\n\n\n uint16_t pull(uint32_t * dst, uint32_t ndbl)\n\n { \n\n /** \n\n * @brief pull data from storage\n\n * @param dst is pointer to data blocks\n\n * @param ndbl is number of data blocks\n\n */\n\n uint16_t r = (rear_/ndbl) ;\n\n if(r == (front_/ndbl)) return 0;\n\n\n\n uint32_t *ptr= data_buffer + r*ndbl*NBUF_ACQ;\n\n memcpy(dst,ptr,ndbl*NBUF_ACQ*4);\n","file_path":"src/filing.cpp","rank":53,"score":30264.931983553855},{"content":" * @brief Definitions\n\n * \n\n */\n\n\n\n #if defined(ARDUINO_TEENSY36)\n\n #define MAXBUF (160)\n\n #elif defined(ARDUINO_TEENSY40)\n\n #define MAXBUF (200)\n\n #elif defined(ARDUINO_TEENSY41)\n\n #define MAXBUF (200)\n\n #endif\n\n \n\n\n\n\n\n /**\n\n * @brief Circular Data Buffer\n\n * \n\n */ \n\n #if defined(ARDUINO_TEENSY41) && defined(USE_EXT_MEM)\n\n EXTMEM uint32_t data_buffer[MAXBUF*NBUF_ACQ];\n","file_path":"src/filing.cpp","rank":54,"score":30264.931983553855},{"content":" class Data\n\n {\n\n public:\n\n Data(uint32_t * buffer) \n\n { /**\n\n * @brief Constructor\n\n * @param buffer is pointer to data store\n\n * \n\n */\n\n data_buffer=buffer; front_=rear_=0;\n\n }\n\n\n\n uint16_t push(uint32_t * src)\n\n { \n\n /** \n\n * @brief push data to storage\n\n * @param src is pointer to data block\n\n */\n\n uint16_t f =front_ + 1;\n\n if(f >= MAXBUF) f=0;\n","file_path":"src/filing.cpp","rank":55,"score":28708.449767256796},{"content":"extern int32_t hour_ ;\n","file_path":"src/mTime.h","rank":56,"score":23181.85555233917},{"content":"extern int32_t day_ ;\n","file_path":"src/mTime.h","rank":57,"score":23181.85555233917},{"content":" uint8_t Hour; \n","file_path":"src/mTime.h","rank":58,"score":23181.85555233917},{"content":" uint8_t Wday; // day of week, sunday is day 1\n","file_path":"src/mTime.h","rank":59,"score":23181.85555233917},{"content":" uint8_t Year; // offset from 1970; \n","file_path":"src/mTime.h","rank":60,"score":23181.85555233917},{"content":" uint8_t Second; \n","file_path":"src/mTime.h","rank":61,"score":23181.85555233917},{"content":" uint8_t Month; \n","file_path":"src/mTime.h","rank":62,"score":23181.85555233917},{"content":" uint8_t Minute; \n","file_path":"src/mTime.h","rank":63,"score":23181.85555233917},{"content":" uint8_t Day;\n","file_path":"src/mTime.h","rank":64,"score":23181.85555233917},{"content":" void acq_start(void);\n","file_path":"src/acq.h","rank":65,"score":22753.61769537131},{"content":" void acq_stop(void);\n","file_path":"src/acq.h","rank":66,"score":22753.61769537131},{"content":" extern volatile uint32_t acq_count;\n","file_path":"src/acq.h","rank":67,"score":22753.61769537131},{"content":" void setAGain(int8_t again);\n","file_path":"src/adc.h","rank":68,"score":22703.540246570254},{"content":"void loadConfig(uint16_t *store, int ns);\n","file_path":"src/menu.h","rank":69,"score":22297.35057919802},{"content":"int16_t newDay(void);\n","file_path":"src/mTime.h","rank":70,"score":22270.778259889157},{"content":"int16_t newHour(void);\n","file_path":"src/mTime.h","rank":71,"score":22270.778259889157},{"content":" int16_t saveData(int16_t status);\n","file_path":"src/filing.h","rank":72,"score":21942.171597315817},{"content":"// following is from SdFat examples to allow transactions to be avoided between open and close\n\n//\n\n// This is a simple driver based on the the standard SPI.h library.\n\n// You can write a driver entirely independent of SPI.h.\n\n// It can be optimized for your board or a different SPI port can be used.\n\n// The driver must be derived from SdSpiBaseClass.\n\n// See: SdFat/src/SpiDriver/SdSpiBaseClass.h\n\nclass MySpiClass : public SdSpiBaseClass {\n\n /**\n\n * @brief SPI interface class\n\n * \n\n */\n\n\n\n public:\n\n // Initialize the SPI bus.\n\n void begin(SdSpiConfig config) { (void) config; SPI.begin(); }\n\n\n\n // Activate SPI hardware with correct speed and mode.\n\n void activate() { if(doTransactions) SPI.beginTransaction(m_spiSettings); }\n\n // Deactivate SPI hardware.\n\n void deactivate() { if(doTransactions) SPI.endTransaction(); }\n\n\n\n // Receive a byte.\n\n uint8_t receive() { return SPI.transfer(0XFF); }\n\n\n\n // Send a byte.\n\n void send(uint8_t data) { SPI.transfer(data); }\n","file_path":"src/filing.cpp","rank":73,"score":21940.692335417683},{"content":" #define FilePrefix \"F\"\n\n\n","file_path":"src/config.h","rank":74,"score":21938.771656200614},{"content":" void storage_configure();\n","file_path":"src/filing.h","rank":75,"score":21938.771656200614},{"content":" uint16_t pushData(uint32_t * src);\n","file_path":"src/filing.h","rank":76,"score":21938.771656200614},{"content":" uint16_t pullData(uint32_t * dst, uint32_t ndbl);\n","file_path":"src/filing.h","rank":77,"score":21938.771656200614},{"content":" void acq_stopClocks(void);\n","file_path":"src/acq.h","rank":78,"score":21893.186774117778},{"content":" void acq_startClocks(void);\n","file_path":"src/acq.h","rank":79,"score":21893.186774117778},{"content":"uint32_t getTeensySerial(void);\n","file_path":"src/utils.h","rank":80,"score":21868.871044274005},{"content":" w 98 0E 03 # Set U1 Ch4 mapped to slot 3 of SDOUT\n\n */\n\n\n\n void adc_init(void)\n\n {\n\n // reset ADC's \n\n pinMode(22,OUTPUT);\n\n digitalWriteFast(22,LOW); //SHDNZ\n\n delay(100);\n\n digitalWriteFast(22,HIGH); //SHDNZ\n\n\n\n /* ADDRESS L,L: 0x4C ; H,L: 0x4D; L,H: 0x4E; H,H: 0x4F */\n\n i2c_class i2c(&Wire1,100'000);\n\n\n\n // check existance of device\n\n for(int ii=0; ii<2; ii++)\n\n {\n\n if(i2c.exist(i2c_addr[ii]))\n\n Serial.printf(\"found %x\\n\",i2c_addr[ii]);\n\n else\n","file_path":"src/adc.cpp","rank":81,"score":21.96310494824983},{"content":" if(status==MUST_REBOOT) status=checkReboot(); // hapens only if microSD card write fails: reboot if space on disk\n\n\n\n // normal operation\n\n int16_t ch=menu(); // check if we have serial line command (0: no input; 1: start; -1: stop)\n\n\n\n if(ch>0 && status==STOPPED) // was stopped, should run now \n\n { \n\n status=CLOSED; acq_start(); adcStatus();\n\n } \n\n \n\n if(ch<0 && status>=CLOSED) // was running, should stop now\n\n { \n\n status=MUSTSTOP; acq_stop(); \n\n } \n\n\n\n if(status > CLOSED) // RUNNING\n\n {\n\n status = checkToCloseFile(status, (uint32_t) t_acq); // check if we reached file size or aquisition time\n\n }\n\n\n","file_path":"src/main.cpp","rank":82,"score":18.922587669806628},{"content":"/**\n\n * basicSoundRecorder\n\n*/\n\n#define START_MODE -1 // -1 wait for menu; 0 start with closed files\n\n\n\n#include \"config.h\"\n\n#include \"menu.h\"\n\n#include \"adc.h\"\n\n#include \"acq.h\"\n\n#include \"filing.h\"\n\n#include \"mTime.h\"\n\n\n\n#include \"utils.h\"\n\n\n\n/********************************* *********************************/\n\n// Function prototypes and variables\n\n\n\nuint32_t max_write=0;\n\nuint32_t max_count=0;\n\n\n","file_path":"src/main.cpp","rank":83,"score":16.795341238721264},{"content":" i2c_class i2c(&Wire1,100'000);\n\n for(int ii=0; ii<2; ii++)\n\n for(int jj=0; jj<4; jj++)\n\n {\n\n i2c.write(i2c_addr[ii],regs[jj]+1, again); // CH1_CFG1 (0dB gain)\n\n }\n\n }\n\n void adcStatus(void)\n\n {\n\n i2c_class i2c(&Wire1,100'000);\n\n for(int ii=0; ii<2; ii++)\n\n { Serial.print(\"\\n ADC 0x15: \"); Serial.print(i2c.read(i2c_addr[ii],0x15),HEX);\n\n }\n\n Serial.println();\n\n }\n\n bool adcEnable(void) { }\n\n#endif\n","file_path":"src/adc.cpp","rank":84,"score":15.845899112664636},{"content":"\n\n i2c.write(i2c_addr[ii],0x3B,0x00); // 0: 2.75V; 1: 2.5V; 2: 1.375V\n\n\n\n for(int jj=0; jj<4; jj++)\n\n { \n\n #if ATEST==1\n\n again=AG[ii][jj];\n\n #endif\n\n\n\n i2c.write(i2c_addr[ii],regs[jj]+0, 0x88); // CH1_CFG0 (Line in, 20 kOhm))\n\n i2c.write(i2c_addr[ii],regs[jj]+1, again); // CH1_CFG1 (0dB gain)\n\n i2c.write(i2c_addr[ii],regs[jj]+2, 201+dgain); // CH1_CFG2\n\n i2c.write(i2c_addr[ii],regs[jj]+3, 0x80); // CH1_CFG3 (0dB decimal gain correction: +/- 0.8 dB) \n\n i2c.write(i2c_addr[ii],regs[jj]+4, 0x00); // CH1_CFG4 (0bit)\n\n }\n\n }\n\n }\n\n\n\n void setAGain(int8_t again)\n\n {\n","file_path":"src/adc.cpp","rank":85,"score":14.058593679299685},{"content":" if(status >= CLOSED) // NOT STOPPED\n\n {\n\n uint32_t mc = getCount();\n\n if(mc>max_count) max_count=mc;\n\n //\n\n uint32_t to=millis();\n\n status = saveData(status); \n\n uint32_t dt=millis()-to;\n\n if(max_write<dt) max_write=dt;\n\n }\n\n\n\n static uint32_t t0;\n\n static uint32_t loop_count=0;\n\n if(millis()-t0>1000)\n\n {\n\n if(status>=CLOSED)\n\n {\n\n Serial.print(\"\\nLoop: \");\n\n Serial.print(status); Serial.print(\" \"); \n\n Serial.print(loop_count); Serial.print(\" : \"); \n","file_path":"src/main.cpp","rank":86,"score":13.449550312279348},{"content":" Serial.println(\"basic Sound Recorder Version: \" __DATE__ \" \" __TIME__ );\n\n SerNum = getTeensySerial();\n\n Serial.println((int32_t)SerNum,HEX);\n\n\n\n storage_configure();\n\n\n\n adc_init();\n\n acq_init(fsamp);\n\n adc_enable();\n\n\n\n #if START_MODE==CLOSED\n\n acq_start(); \n\n #endif\n\n\n\n Serial.println(\"End of Setup\");\n\n}\n\n\n\nvoid loop()\n\n{ static int16_t status=START_MODE; \n\n\n","file_path":"src/main.cpp","rank":87,"score":13.217402813383687},{"content":"#include \"core_pins.h\"\n\n#include \"config.h\"\n\n#include \"utils.h\"\n\n\n\nuint32_t SerNum;\n\n\n\n/* following from https://github.com/sstaub/TeensyID/blob/master/TeensyID.cpp */\n\n#if defined ARDUINO_TEENSY40 || defined ARDUINO_TEENSY41\n\n uint32_t getTeensySerial(void) \n\n {\n\n uint32_t num;\n\n num = HW_OCOTP_MAC0 & 0xFFFFFF;\n\n return num;\n\n }\n\n\n\n // from https://forum.pjrc.com/threads/33443-How-to-display-free-ram?p=275013&viewfull=1#post275013\n\n extern unsigned long _heap_start; \n\n extern unsigned long _heap_end;\n\n extern char *__brkval;\n\n\n","file_path":"src/utils.cpp","rank":88,"score":12.518123630448578},{"content":"uint32_t t_start;\n\n\n\n/* check if we should close file */\n\nint t_acq = 60; // close file on the minute\n\n\n\nint16_t checkToCloseFile(int16_t status, uint32_t t_acq)\n\n{ if((status == OPENED) || (status == RUNNING))\n\n { //\n\n static uint32_t to =0;\n\n uint32_t tx=rtc_get();\n\n tx %= t_acq;\n\n if(tx<to) status = DOCLOSE; // time wrapped, file must be closed\n\n to=tx;\n\n } \n\n return status;\n\n}\n\n\n\nvoid setup()\n\n{\n\n while(!Serial) continue;\n","file_path":"src/main.cpp","rank":89,"score":11.743796789683165},{"content":"// Wire.setSDA(18);\n\n// Wire.setSCL(19);\n\n Wire.setClock(100'000);\n\n\n\n for(int ii=0;ii<127;ii++)\n\n {\n\n Wire.beginTransmission(ii);\n\n uint8_t error = Wire.endTransmission();\n\n if(error) \n\n Serial.printf(\"I2C not found %x\\n\",ii); \n\n else \n\n Serial.printf(\"I2C found %x\\n\",ii); \n\n }\n\n while(1); \n\n}\n\n\n\nvoid test_wire1(void)\n\n{\n\n Wire1.begin();\n\n delay(100);\n","file_path":"src/i2c.cpp","rank":90,"score":11.642630494058054},{"content":" FTFL_FSTAT = FTFL_FSTAT_RDCOLERR | FTFL_FSTAT_ACCERR | FTFL_FSTAT_FPVIOL;\n\n *(uint32_t *)&FTFL_FCCOB3 = 0x41070000;\n\n FTFL_FSTAT = FTFL_FSTAT_CCIF;\n\n while (!(FTFL_FSTAT & FTFL_FSTAT_CCIF)) ; // wait\n\n num = *(uint32_t *)&FTFL_FCCOBB;\n\n kinetis_hsrun_enable();\n\n #endif\n\n __enable_irq();\n\n return num & 0xFFFFFF;\n\n }\n\n#endif\n\n\n\n#include \"usb_serial.h\"\n\nPrint *stdPrint = &Serial;\n\n\n\nextern \"C\"\n\n{\n\n int _write(int file, const void *buf, size_t len) {\n\n // https://forum.pjrc.com/threads/28473-Quick-Guide-Using-printf()-on-Teensy-ARM\n\n Print *out;\n","file_path":"src/utils.cpp","rank":91,"score":11.584033516078605},{"content":" if (Wire1.endTransmission(false) != 0) return 0;\n\n if (Wire1.requestFrom((int)addr, 1) < 1) return 0;\n\n val = Wire1.read();\n\n return val;\n\n}\n\n\n\nbool i2c1_write(uint8_t addr, uint8_t reg, uint8_t val)\n\n{\n\n Wire1.beginTransmission(addr);\n\n Wire1.write(reg);\n\n Wire1.write(val);\n\n return (Wire1.endTransmission() == 0);\n\n}\n\n*/\n\n\n\n#if 0\n\nvoid test_wire0(void)\n\n{\n\n Wire.begin();\n\n delay(100);\n","file_path":"src/i2c.cpp","rank":92,"score":11.500013115271589},{"content":" CS536X_GCTL_MODE(speed));\n\n val[1] = i2c.read(addr, CS536X_GCTL);\n\n\n\n val[2] = i2c.read(addr, CS536X_PDN);\n\n val[3] = i2c.read(addr, CS536X_nSDOUT);\n\n \n\n Serial.printf(\"CS536x: %x %x %x %x %x\\r\\n\",addr, val[0],val[1],val[2],val[3]);\n\n\n\n // i2c.write(addr, CS536X_nHPF, 0b01111111);\n\n // i2c.write(addr, CS536X_PDN, 0b00001000);\n\n // i2c.write(addr, CS536X_nSDOUT, 0b00001000);\n\n\n\n // i2c.write(addr, CS536X_MUTE, 0b11111110);\n\n }\n\n\n\n void setAGain(int8_t again) { }\n\n void adcStatus(void) { }\n\n bool adcEnable(void) { }\n\n\n\n#elif (ADC_MODEL == TLDV320ADC6140) || (ADC_MODEL == TLDV320ADC6140_2)\n","file_path":"src/adc.cpp","rank":93,"score":11.113602842244518},{"content":" int freeram() { return (char *)&_heap_end - __brkval; }\n\n\n\n #define CPU_RESTART_ADDR (uint32_t *)0xE000ED0C\n\n #define CPU_RESTART_VAL 0x5FA0004\n\n #define CPU_RESTART (*CPU_RESTART_ADDR = CPU_RESTART_VAL)\n\n\n\n#else\n\n uint32_t getTeensySerial(void) \n\n {\n\n uint32_t num = 0;\n\n __disable_irq();\n\n #if defined(HAS_KINETIS_FLASH_FTFA) || defined(HAS_KINETIS_FLASH_FTFL)\n\n FTFL_FSTAT = FTFL_FSTAT_RDCOLERR | FTFL_FSTAT_ACCERR | FTFL_FSTAT_FPVIOL;\n\n FTFL_FCCOB0 = 0x41;\n\n FTFL_FCCOB1 = 15;\n\n FTFL_FSTAT = FTFL_FSTAT_CCIF;\n\n while (!(FTFL_FSTAT & FTFL_FSTAT_CCIF)) ; // wait\n\n num = *(uint32_t *)&FTFL_FCCOB7;\n\n #elif defined(HAS_KINETIS_FLASH_FTFE)\n\n kinetis_hsrun_disable();\n","file_path":"src/utils.cpp","rank":94,"score":11.035085812111161},{"content":" void acq_startClocks(void)\n\n {\n\n SIM_SCGC6 |= SIM_SCGC6_I2S;\n\n SIM_SCGC7 |= SIM_SCGC7_DMA;\n\n SIM_SCGC6 |= SIM_SCGC6_DMAMUX;\n\n }\n\n\n\n void acq_start(void)\n\n {\n\n acq_startClocks();\n\n I2S0_RCSR |= I2S_RCSR_RE;\n\n }\n\n\n\n void acq_stop(void)\n\n {\n\n I2S0_RCSR &= ~I2S_RCSR_RE;\n\n acq_stopClocks();\n\n }\n\n\n\n void acq_init(int fsamp)\n","file_path":"src/acq.cpp","rank":95,"score":10.931760945540297},{"content":" Serial.print(acq_count); Serial.print(\" \");\n\n Serial.print(acq_miss); Serial.print(\" \");\n\n Serial.print(max_count); Serial.print(\" \");\n\n Serial.print(max_write);\n\n }\n\n loop_count=0;\n\n acq_count=0;\n\n acq_miss=0;\n\n max_count=0;\n\n max_write=0;\n\n t0=millis();\n\n }\n\n loop_count++;\n\n}","file_path":"src/main.cpp","rank":96,"score":10.857575792003276},{"content":" wire->setClock(speed);\n\n wire->setSCL(scl);\n\n wire->setSDA(sda);\n\n }\n\n\n\n uint8_t exist(uint8_t addr)\n\n {\n\n wire->beginTransmission(addr);\n\n return (wire->endTransmission()==0);\n\n }\n\n\n\n uint8_t read(uint8_t addr, uint8_t reg) \n\n { \n\n unsigned int val;\n\n wire->beginTransmission(addr);\n\n wire->write(reg);\n\n if (wire->endTransmission(false) != 0) return 0;\n\n if (wire->requestFrom((int)addr, 1) < 1) return 0;\n\n val = wire->read();\n\n return val;\n","file_path":"src/i2c.h","rank":97,"score":10.62070057380434},{"content":"#include \"i2c.h\"\n\n\n\n\n\n/*\n\nuint8_t i2c_exist(uint8_t addr)\n\n{\n\n Wire.beginTransmission(addr);\n\n return (Wire.endTransmission()==0);\n\n}\n\n\n\nuint8_t i2c_read(uint8_t addr, uint8_t reg)\n\n{\n\n unsigned int val;\n\n Wire.beginTransmission(addr);\n\n Wire.write(reg);\n\n if (Wire.endTransmission(false) != 0) return 0;\n\n if (Wire.requestFrom((int)addr, 1) < 1) return 0;\n\n val = Wire.read();\n\n return val;\n\n}\n","file_path":"src/i2c.cpp","rank":98,"score":10.05789944845505},{"content":" { Serial.printf(\"ADC I2C %x not found\\n\",i2c_addr[ii]); while(1) ;}\n\n\n\n i2c.write(i2c_addr[ii],0x02,0x81); // 1.8V AREG, not sleep\n\n\n\n i2c.write(i2c_addr[ii],0x02,0x81); // 1.8V AREG, not sleep\n\n i2c.write(i2c_addr[ii],0x07,(3<<4)); // TDM; 32 bit; default clock xmit on rising edge); zero fill\n\n// i2c.write(i2c_addr[ii],0x07,(3<<4) | (1<<1)); // 32 bit and TX-edge\n\n i2c.write(i2c_addr[ii],0x08,0x00); // TX_offset 0\n\n\n\n//// i2c.write(i2c_addr[ii],0x13,0<<6); // AUTO_CLK_TX\n\n// i2c.write(i2c_addr[ii],0x16,0x16, (0<<6 | 0<<3));\n\n\n\n for(int jj=0;jj<4;jj++)\n\n {\n\n i2c.write(i2c_addr[ii],0x0B+jj,chmap[ii][jj]); \n\n }\n\n\n\n i2c.write(i2c_addr[ii],0x73,chanMask[ii]); \n\n i2c.write(i2c_addr[ii],0x74,chanMask[ii]);\n\n i2c.write(i2c_addr[ii],0x75,0x60);\n","file_path":"src/adc.cpp","rank":99,"score":9.695365157669894}],"string":"[\n {\n \"content\": \"void resetMTP(void) ;\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 0,\n \"score\": 67831.51723899825\n },\n {\n \"content\": \"void listDisks(void);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 1,\n \"score\": 67804.58596994064\n },\n {\n \"content\": \" void listDisks(void);\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 2,\n \"score\": 67446.00704694324\n },\n {\n \"content\": \" uint16_t getCount ();\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 3,\n \"score\": 67420.73567706192\n },\n {\n \"content\": \"void setRTCTime(int hr,int min,int sec,int dy, int mnth, int yr);\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 4,\n \"score\": 52022.566451270315\n },\n {\n \"content\": \"int16_t menu(void);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 5,\n \"score\": 51802.5010771718\n },\n {\n \"content\": \"void storeConfig(uint16_t *store, int ns);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 6,\n \"score\": 45077.89954362695\n },\n {\n \"content\": \"void loadParameters(void);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 7,\n \"score\": 45050.96827456933\n },\n {\n \"content\": \"void dumpMTP(void) ;\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 8,\n \"score\": 45050.96827456933\n },\n {\n \"content\": \"void saveParameters(void);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 9,\n \"score\": 45050.96827456933\n },\n {\n \"content\": \"uint32_t get_Lock(void);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 10,\n \"score\": 45025.69690468803\n },\n {\n \"content\": \"void setAGain(int8_t again);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 11,\n \"score\": 45000.89082576827\n },\n {\n \"content\": \"void set_Lock(uint32_t t_start);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 12,\n \"score\": 45000.89082576827\n },\n {\n \"content\": \" int16_t checkReboot(void);\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 13,\n \"score\": 44719.32062062954\n },\n {\n \"content\": \" extern int t_acq;\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 14,\n \"score\": 42725.68492101255\n },\n {\n \"content\": \"void breakTime(uint32_t timeInput, tmElements_t &tm);\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 15,\n \"score\": 31003.089492490075\n },\n {\n \"content\": \"uint32_t makeTime(const tmElements_t &tm);\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 16,\n \"score\": 31003.089492490075\n },\n {\n \"content\": \" } else {\\n\\n seconds += SECS_PER_DAY * monthDays[i-1]; //monthDay array starts from 0\\n\\n }\\n\\n }\\n\\n seconds+= (tm.Day-1) * SECS_PER_DAY;\\n\\n seconds+= tm.Hour * SECS_PER_HOUR;\\n\\n seconds+= tm.Minute * SECS_PER_MIN;\\n\\n seconds+= tm.Second;\\n\\n return seconds; \\n\\n}\\n\\n\\n\\nextern \\\"C\\\" void rtc_set(uint32_t tt);\\n\\n\\n\\nvoid setRTCTime(int hr,int min,int sec,int dy, int mnth, int yr){\\n\\n // year can be given as full four digit year or two digts (2010 or 10 for 2010); \\n\\n // it is converted to years since 1970\\n\\n if( yr > 99)\\n\\n yr = yr - 1970;\\n\\n else\\n\\n yr += 30; \\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 26,\n \"score\": 30738.586075565065\n },\n {\n \"content\": \"\\n\\n/*============================================================================*/\\t\\n\\n/* functions to convert to and from system time */\\n\\n/* These are for interfacing with time services and are not normally needed in a sketch */\\n\\n\\n\\nstatic const uint8_t monthDays[]={31,28,31,30,31,30,31,31,30,31,30,31}; // API starts months from 1, this array starts from 0\\n\\n \\n\\nvoid breakTime(uint32_t timeInput, tmElements_t &tm){\\n\\n// break the given time_t into time components\\n\\n// this is a more compact version of the C library localtime function\\n\\n// note that year is offset from 1970 !!!\\n\\n\\n\\n uint8_t year;\\n\\n uint8_t month, monthLength;\\n\\n uint32_t time;\\n\\n unsigned long days;\\n\\n\\n\\n time = (uint32_t)timeInput;\\n\\n tm.Second = time % 60;\\n\\n time /= 60; // now it is minutes\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 27,\n \"score\": 30735.676758087233\n },\n {\n \"content\": \"uint32_t makeTime(const tmElements_t &tm){ \\n\\n// assemble time elements into time_t \\n\\n// note year argument is offset from 1970 (see macros in time.h to convert to other formats)\\n\\n// previous version used full four digit year (or digits since 2000),i.e. 2009 was 2009 or 9\\n\\n \\n\\n int i;\\n\\n uint32_t seconds;\\n\\n\\n\\n // seconds from 1970 till 1 jan 00:00:00 of the given year\\n\\n seconds= tm.Year*(SECS_PER_DAY * 365);\\n\\n for (i = 0; i < tm.Year; i++) {\\n\\n if (LEAP_YEAR(i)) {\\n\\n seconds += SECS_PER_DAY; // add extra days for leap years\\n\\n }\\n\\n }\\n\\n \\n\\n // add days for this year, months start from 1\\n\\n for (i = 1; i < tm.Month; i++) {\\n\\n if ( (i == 2) && LEAP_YEAR(tm.Year)) { \\n\\n seconds += SECS_PER_DAY * 29;\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 28,\n \"score\": 30734.382978445825\n },\n {\n \"content\": \"#include \\\"config.h\\\"\\n\\n#include \\\"mTime.h\\\"\\n\\n\\n\\nint32_t day_ = 0;\\n\\nint16_t newDay(void)\\n\\n{ uint32_t tx=rtc_get();\\n\\n int32_t d_ = (int32_t)tx/SECS_PER_DAY; // use days since 1970 as measure\\n\\n if(day_== d_) return 0;\\n\\n day_ = d_;\\n\\n return 1;\\n\\n}\\n\\n\\n\\nint32_t hour_ = 0;\\n\\nint16_t newHour(void)\\n\\n{ uint32_t tx=rtc_get();\\n\\n int32_t h_ = (int32_t) tx/SECS_PER_HOUR; // use hours since 1970 as measures\\n\\n if(hour_== h_) return 0;\\n\\n hour_ = h_;\\n\\n return 1;\\n\\n}\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 29,\n \"score\": 30732.874500418722\n },\n {\n \"content\": \" tm.Minute = time % 60;\\n\\n time /= 60; // now it is hours\\n\\n tm.Hour = time % 24;\\n\\n time /= 24; // now it is days\\n\\n tm.Wday = ((time + 4) % 7) + 1; // Sunday is day 1 \\n\\n \\n\\n year = 0; \\n\\n days = 0;\\n\\n while((unsigned)(days += (LEAP_YEAR(year) ? 366 : 365)) <= time) {\\n\\n year++;\\n\\n }\\n\\n tm.Year = year; // year is offset from 1970 \\n\\n \\n\\n days -= LEAP_YEAR(year) ? 366 : 365;\\n\\n time -= days; // now it is days in this year, starting at 0\\n\\n \\n\\n days=0;\\n\\n month=0;\\n\\n monthLength=0;\\n\\n for (month=0; month<12; month++) {\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 30,\n \"score\": 30732.21658385193\n },\n {\n \"content\": \" \\n\\n tmElements_t tm;\\n\\n tm.Year = yr;\\n\\n tm.Month = mnth;\\n\\n tm.Day = dy;\\n\\n tm.Hour = hr;\\n\\n tm.Minute = min;\\n\\n tm.Second = sec;\\n\\n\\n\\n uint32_t tt = makeTime(tm);\\n\\n rtc_set(tt); // for RTC\\n\\n}\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 31,\n \"score\": 30731.86088502321\n },\n {\n \"content\": \" if (month==1) { // february\\n\\n if (LEAP_YEAR(year)) {\\n\\n monthLength=29;\\n\\n } else {\\n\\n monthLength=28;\\n\\n }\\n\\n } else {\\n\\n monthLength = monthDays[month];\\n\\n }\\n\\n \\n\\n if (time >= monthLength) {\\n\\n time -= monthLength;\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\\n tm.Month = month + 1; // jan is month 1 \\n\\n tm.Day = time + 1; // day of month\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mTime.cpp\",\n \"rank\": 32,\n \"score\": 30729.52885853795\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nvoid listDisks(void)\\n\\n{\\n\\n for(int ii=0;ii<nsd;ii++)\\n\\n {\\n\\n Serial.print(\\\"\\\\n\\\"); \\n\\n Serial.printf(\\\"Storage %d %d %s \\\",ii,cs[ii],sd_str[ii]);\\n\\n Serial.printf(\\\"%d %d\\\",sdx[ii].sdfs.freeClusterCount(),diskSize[ii]);\\n\\n }\\n\\n Serial.print(\\\"\\\\n\\\"); \\n\\n}\\n\\n\\n\\nint16_t checkReboot(void)\\n\\n{\\n\\n int ii=0;\\n\\n while((ii<nsd) && (diskSpace[ii]<MIN_SPACE)) ii++;\\n\\n if(ii<nsd) CPU_RESTART;\\n\\n return -1;\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 33,\n \"score\": 30289.859694696504\n },\n {\n \"content\": \"void dateTime(uint16_t* date, uint16_t* time, uint8_t* ms10) \\n\\n{ \\n\\n tmElements_t tm;\\n\\n breakTime(rtc_get(), tm);\\n\\n\\n\\n *date = FS_DATE(tmYearToCalendar(tm.Year),tm.Month, tm.Day);\\n\\n *time = FS_TIME(tm.Hour, tm.Minute, tm.Second);\\n\\n *ms10 = tm.Second & 1 ? 100 : 0;\\n\\n}\\n\\n\\n\\nvoid storage_configure()\\n\\n{\\n\\n #if defined SD_SCK\\n\\n SPI.setMOSI(SD_MOSI);\\n\\n SPI.setMISO(SD_MISO);\\n\\n SPI.setSCK(SD_SCK);\\n\\n #endif\\n\\n\\n\\n // Set Time callback\\n\\n FsDateTime::callback = dateTime;\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 34,\n \"score\": 30283.11853913592\n },\n {\n \"content\": \"\\n\\n //\\n\\n Serial.print(\\\"\\\\n\\\"); Serial.print(dirName);\\n\\n #if PRINT_LOGFILE>0\\n\\n log_start();\\n\\n if(logFile) {logFile.print(\\\"\\\\n\\\");logFile.print(dirName);}\\n\\n #endif\\n\\n return 1;\\n\\n }\\n\\n return 0;\\n\\n\\n\\n}\\n\\nstatic int16_t newFileName(char *fileName)\\n\\n{\\n\\n tmElements_t tm;\\n\\n breakTime(rtc_get(), tm);\\n\\n\\tsprintf(fileName, \\\"%s_%02d%02d%02d.bin\\\", FilePrefix, tm.Hour, tm.Minute, tm.Second);\\n\\n //\\n\\n Serial.print(\\\"\\\\n\\\"); Serial.print(isd); Serial.print(\\\": \\\");Serial.print(fileName);\\n\\n #if PRINT_LOGFILE>0\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 35,\n \"score\": 30282.991337792006\n },\n {\n \"content\": \"}\\n\\n\\n\\nstatic int isd=(nsd>1)?1:0; // fist SPI disk is #1 if there are more than one\\n\\nextern int32_t hour_; // to force newHour on new disk\\n\\n\\n\\nstatic SDClass *checkDiskSpace(void)\\n\\n{ static int isd_ = nsd;\\n\\n\\n\\n doTransactions(true);\\n\\n while((isd<nsd) && ((diskSize[isd]==0) \\n\\n || ((diskSpace[isd]=sdx[isd].sdfs.freeClusterCount()) < MIN_SPACE) )) isd++;\\n\\n doTransactions(false);\\n\\n if(isd<nsd) \\n\\n { sdx[isd].sdfs.chvol();\\n\\n Serial.println(); Serial.print(isd);\\n\\n Serial.print(\\\": \\\"); Serial.print(sdx[isd].sdfs.freeClusterCount());\\n\\n }\\n\\n //\\n\\n if(isd != isd_) hour_=0; // set hour_ to zero to trigger creation of directories in new disk\\n\\n isd_=isd;\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 36,\n \"score\": 30282.305240752034\n },\n {\n \"content\": \" if(logFile) \\n\\n { logFile.print(\\\"\\\\n\\\"); logFile.print(isd); logFile.print(\\\": \\\"); logFile.print(fileName);}\\n\\n #endif\\n\\n return 1;\\n\\n}\\n\\n\\n\\n/* main data filing routine */\\n\\nint16_t saveData(int16_t status)\\n\\n{ static char dirName[80];\\n\\n static char fileName[80];\\n\\n static char header[512];\\n\\n static int dirFlag=0;\\n\\n\\n\\n if(status<CLOSED) return status; // we are stopped: don't do anything\\n\\n\\n\\n //fetch data from circular buffer\\n\\n if(pullData(diskBuffer,NDBL))\\n\\n { disk_count++;\\n\\n if(status==CLOSED) // file closed: should open\\n\\n { //doTransactions(true);\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 37,\n \"score\": 30282.00337455444\n },\n {\n \"content\": \" uint64_t usedSize = sdx[ii].usedSize();\\n\\n\\n\\n Serial.printf(\\\"Storage %d %d %s \\\",ii,cs[ii],sd_str[ii]); \\n\\n Serial.print(totalSize); Serial.print(\\\" \\\"); Serial.println(usedSize);\\n\\n\\n\\n Serial.print(sdx[ii].sdfs.clusterCount()); Serial.print(\\\" \\\"); \\n\\n Serial.print(sdx[ii].sdfs.freeClusterCount()); Serial.print(\\\" \\\");\\n\\n\\n\\n clusterSize[ii] = sdx[ii].sdfs.bytesPerCluster()/512; // count sectors\\n\\n Serial.println(clusterSize[ii]) ;Serial.print(\\\" \\\");\\n\\n\\n\\n diskSpace[ii]=diskSize[ii]=sdx[ii].sdfs.freeClusterCount();\\n\\n Serial.println(diskSize[ii]) ;Serial.print(\\\" \\\");\\n\\n }\\n\\n else\\n\\n {\\n\\n diskSize[ii]=0;\\n\\n diskSpace[ii]=0;\\n\\n clusterSize[ii]=1;\\n\\n }\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 38,\n \"score\": 30281.89184879836\n },\n {\n \"content\": \"\\n\\n uint16_t getCount () { return rawData.getCount(); }\\n\\n uint16_t pushData(uint32_t * src){ return rawData.push(src);}\\n\\n uint16_t pullData(uint32_t * dst, uint32_t ndbl) {return rawData.pull(dst,ndbl);}\\n\\n\\n\\n/****************************** Filing Utility *******************************************/\\n\\n\\n\\nextern int t_acq;\\n\\n\\n\\nFile file=NULL; // is used by saveData and saveNAD\\n\\nuint32_t disk_count=0;\\n\\nuint32_t diskBuffer[MAX_DISK_BUFFER];\\n\\n\\n\\nSDClass *msd; // storage of next free disk\\n\\n\\n\\nstatic int16_t makeHeader(char *header)\\n\\n{\\n\\n /**\\n\\n * @brief Make file header\\n\\n * @param header is pointer to header\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 39,\n \"score\": 30280.444336694716\n },\n {\n \"content\": \" else\\n\\n {\\n\\n return MUST_REBOOT; // if file open fails: don't do anything\\n\\n }\\n\\n }\\n\\n //\\n\\n if(status==OPENED) // file is open: write first record (header)\\n\\n { makeHeader(header);\\n\\n if(file.write((const void*)header,512) < 512) return MUST_REBOOT; else status=2;\\n\\n }\\n\\n //\\n\\n if(status>=RUNNING) // file is open, header written: store data records\\n\\n { \\n\\n if(file.write((const void *)diskBuffer,4*MAX_DISK_BUFFER) < 4*MAX_DISK_BUFFER) return MUST_REBOOT;\\n\\n }\\n\\n }\\n\\n // following is done independent of data availability\\n\\n if(status==DOCLOSE) // should close file\\n\\n {\\n\\n // writes are done, so enable again transaction activations\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 40,\n \"score\": 30278.378326009337\n },\n {\n \"content\": \" * \\n\\n */\\n\\n #define MAGIC \\\"WMXZ\\\"\\n\\n tmElements_t tm;\\n\\n breakTime(rtc_get(), tm);\\n\\n\\n\\n int nd=sprintf(header,\\\"%s%04d%02d%02d_%02d%02d%02d\\\",\\n\\n MAGIC,tmYearToCalendar(tm.Year),tm.Month,tm.Day,tm.Hour,tm.Minute,tm.Second);\\n\\n char *ptr = header+(nd+1);\\n\\n\\n\\n int32_t *iptr = (int32_t *) ptr;\\n\\n iptr[0] = 4; // SW version\\n\\n iptr[1] = (int32_t)SerNum; // serial number\\n\\n iptr[2] = fsamp;\\n\\n iptr[3] = NCHAN_ACQ;\\n\\n iptr[4] = t_acq;\\n\\n iptr[5] = 0;\\n\\n\\n\\n uint32_t *uptr = (uint32_t*) header;\\n\\n uptr[127] = 0x55555555;\\n\\n //\\n\\n return 1;\\n\\n}\\n\\n\\n\\nstatic uint32_t dummy_buffer[MAX_DISK_BUFFER];\\n\\n/******************************** SPI Interface *****************************************/\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 41,\n \"score\": 30278.295660088163\n },\n {\n \"content\": \" if(isd==nsd) return (SDClass *) 0; else return &sdx[isd];\\n\\n}\\n\\n\\n\\nstatic int16_t newDirectory(char *dirName, int dirFlag)\\n\\n{ if(newHour())\\n\\n { \\n\\n tmElements_t tm;\\n\\n breakTime(rtc_get(), tm);\\n\\n if(!dirFlag)\\n\\n {\\n\\n sprintf(dirName, \\\"/%s%06x_%04d%02d%02d/%02d/\\\", \\n\\n DirPrefix,(unsigned int)SerNum,\\n\\n tmYearToCalendar(tm.Year),tm.Month, tm.Day, tm.Hour);\\n\\n }\\n\\n else\\n\\n {\\n\\n sprintf(dirName, \\\"/%s%06x_%04d%02d%02d/%02d_%02d/\\\", \\n\\n DirPrefix,(unsigned int)SerNum,\\n\\n tmYearToCalendar(tm.Year),tm.Month, tm.Day, tm.Hour,dirFlag);\\n\\n }\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 42,\n \"score\": 30278.054401788853\n },\n {\n \"content\": \"\\n\\n// adjust to HW configuration\\n\\n// only build-in SD card T3.5/6 and T4.0/1\\n\\n const char *sd_str[]={\\\"sdio\\\"};\\n\\n const int cs[] = {BUILTIN_SDCARD};\\n\\n// only audio board\\n\\n// const char *sd_str[]={\\\"sd1\\\"};\\n\\n// const int cs[] = {10 };\\n\\n// general example\\n\\n// const char *sd_str[]={\\\"sdio\\\", \\\"sd1\\\",\\\"sd2\\\",\\\"sd3\\\",\\\"sd4\\\",\\\"sd5\\\",\\\"sd6\\\"};\\n\\n// const int cs[] = {BUILTIN_SDCARD, 34, 33, 35, 36, 37, 38 };\\n\\n\\n\\n const int nsd = sizeof(cs)/sizeof(int);\\n\\n\\n\\n SDClass sdx[nsd];\\n\\n uint32_t diskSize[nsd];\\n\\n uint32_t diskSpace[nsd];\\n\\n uint32_t clusterSize[nsd];\\n\\n\\n\\n// Call back for file timestamps. Only called for file create and sync(). needed by SDFat-beta\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 43,\n \"score\": 30276.296596098557\n },\n {\n \"content\": \"\\n\\n for(int ii=0; ii<nsd; ii++)\\n\\n { Serial.println(ii);\\n\\n\\n\\n uint16_t status=0;\\n\\n if(cs[ii] == BUILTIN_SDCARD)\\n\\n {\\n\\n uint16_t tries=0;\\n\\n while(!sdx[ii].sdfs.begin(SdioConfig(FIFO_SDIO)) && tries<10)\\n\\n { Serial.print(tries); Serial.print(\\\" \\\"); tries++; delay(1000); } \\n\\n\\n\\n if(tries<10) \\n\\n {\\n\\n status=1;\\n\\n }\\n\\n else\\n\\n {\\n\\n Serial.println(\\\"No sdio storage\\\"); \\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 44,\n \"score\": 30275.911674685984\n },\n {\n \"content\": \"\\n\\n // Receive multiple bytes. \\n\\n // Replace this function if your board has multiple byte receive.\\n\\n uint8_t receive(uint8_t* buf, size_t count) \\n\\n { memset(buf, 0XFF, count); SPI.transfer(buf, count); return 0; }\\n\\n\\n\\n // Send multiple bytes.\\n\\n // Replace this function if your board has multiple byte send.\\n\\n void send(const uint8_t* buf, size_t count) \\n\\n { SPI.transfer((void *)buf, (void *) dummy_buffer, count); }\\n\\n\\n\\n // Save SPISettings for new max SCK frequency\\n\\n void setSckSpeed(uint32_t maxSck) { m_spiSettings = SPISettings(maxSck, MSBFIRST, SPI_MODE0); }\\n\\n\\n\\n private:\\n\\n SPISettings m_spiSettings;\\n\\n\\n\\n public:\\n\\n bool doTransactions=true;\\n\\n\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 45,\n \"score\": 30274.482924654567\n },\n {\n \"content\": \" else if(cs[ii]<BUILTIN_SDCARD)\\n\\n { \\n\\n sdCsInit(cs[ii]);\\n\\n delay(100);\\n\\n uint16_t tries=0;\\n\\n while(!sdx[ii].sdfs.begin(SdSpiConfig(cs[ii], SHARED_SPI, SPI_SPEED, &mySpi)) && tries<10)\\n\\n { Serial.print(tries); Serial.print(\\\" \\\"); tries++; delay(1000); } \\n\\n\\n\\n if(tries<10) \\n\\n {\\n\\n status=1;\\n\\n }\\n\\n else\\n\\n {\\n\\n Serial.println(\\\"No spi storage\\\");\\n\\n }\\n\\n }\\n\\n if (status)\\n\\n {\\n\\n uint64_t totalSize = sdx[ii].totalSize();\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 46,\n \"score\": 30274.104009144176\n },\n {\n \"content\": \"/**\\n\\n * @file filing.cpp\\n\\n * @author Walter Zimmer \\n\\n * @version 1.0\\n\\n *\\n\\n * @section LICENSE\\n\\n *\\n\\n * MIT\\n\\n * \\n\\n * @section DESCRIPTION\\n\\n *\\n\\n * contains filing interface\\n\\n */\\n\\n #include \\\"config.h\\\"\\n\\n #include \\\"mTime.h\\\"\\n\\n #include \\\"filing.h\\\"\\n\\n #include \\\"utils.h\\\"\\n\\n #include \\\"adc.h\\\"\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 47,\n \"score\": 30274.01379732683\n },\n {\n \"content\": \"};\\n\\nMySpiClass mySpi;\\n\\n\\n\\nvoid doTransactions(bool val) {mySpi.doTransactions=val;}\\n\\n\\n\\nvoid sdCsInit(SdCsPin_t pin) { pinMode(pin, OUTPUT); digitalWriteFast(pin, HIGH);}\\n\\nvoid sdCsWrite(SdCsPin_t pin, bool level) { digitalWriteFast(pin, level); }\\n\\n\\n\\n#define SPI_SPEED SD_SCK_MHZ(33) // adjust to sd card \\n\\n#if USE_SDIO==2\\n\\n #define SD_CONFIG SdioConfig(FIFO_SDIO)\\n\\n #define SD_MOSI 11\\n\\n #define SD_MISO 12\\n\\n #define SD_SCK 13\\n\\n#endif\\n\\n#if defined(ARDUINO_TEENSY36)\\n\\n #define SD_MOSI 7\\n\\n #define SD_MISO 12\\n\\n #define SD_SCK 14\\n\\n#endif\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 48,\n \"score\": 30273.828464008424\n },\n {\n \"content\": \" if(!(msd=checkDiskSpace())) return MUST_REBOOT;\\n\\n //\\n\\n if(newDirectory(dirName,dirFlag)) \\n\\n { if(!msd->sdfs.exists(dirName) && !msd->sdfs.mkdir(dirName)) dirFlag++; \\n\\n if(!msd->sdfs.chdir(dirName)) dirFlag++; else dirFlag=0;\\n\\n }\\n\\n //\\n\\n if(dirFlag>5) return MUST_REBOOT; // too many directory errors\\n\\n if(dirFlag>0) return CLOSED; // create new directory with different name\\n\\n\\n\\n if(newFileName(fileName))\\n\\n { \\n\\n file = msd->open(fileName, FILE_WRITE_BEGIN); \\n\\n if(file) \\n\\n status = OPENED; \\n\\n else \\n\\n { Serial.println(\\\"Failing open file\\\");\\n\\n return MUST_REBOOT; \\n\\n }\\n\\n } \\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 49,\n \"score\": 30273.36025631045\n },\n {\n \"content\": \" if(++r >= (MAXBUF/ndbl)) r=0;\\n\\n rear_ = r*ndbl;\\n\\n return 1;\\n\\n }\\n\\n uint16_t getCount () \\n\\n { \\n\\n /**\\n\\n * @brief get number of data blocks in storage\\n\\n * \\n\\n */\\n\\n if(front_ >= rear_) return front_ - rear_; return front_+ MAXBUF -rear_; \\n\\n }\\n\\n\\n\\n private: \\n\\n uint16_t front_, rear_;\\n\\n uint32_t *data_buffer;\\n\\n\\n\\n };\\n\\n\\n\\n Data rawData(data_buffer);\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 50,\n \"score\": 30270.340844255494\n },\n {\n \"content\": \" file.flush();\\n\\n file.close();\\n\\n status = CLOSED;\\n\\n }\\n\\n if(status==MUSTSTOP) // should close file and stop\\n\\n { \\n\\n file.flush();\\n\\n file.close();\\n\\n status = STOPPED;\\n\\n }\\n\\n return status;\\n\\n}\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 51,\n \"score\": 30268.415901208456\n },\n {\n \"content\": \" #else\\n\\n uint32_t data_buffer[MAXBUF*NBUF_ACQ];\\n\\n #endif\\n\\n\\n\\n #define MAX_DISK_BUFFER (NDBL*NBUF_ACQ)\\n\\n\\n\\n /**\\n\\n * @brief Data storage class\\n\\n * \\n\\n */\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 52,\n \"score\": 30267.747958978965\n },\n {\n \"content\": \" if(f == rear_) return 0;\\n\\n\\n\\n uint32_t *ptr= data_buffer+f*NBUF_ACQ;\\n\\n memcpy(ptr,src,NBUF_ACQ*4);\\n\\n front_ = f;\\n\\n return 1;\\n\\n }\\n\\n\\n\\n uint16_t pull(uint32_t * dst, uint32_t ndbl)\\n\\n { \\n\\n /** \\n\\n * @brief pull data from storage\\n\\n * @param dst is pointer to data blocks\\n\\n * @param ndbl is number of data blocks\\n\\n */\\n\\n uint16_t r = (rear_/ndbl) ;\\n\\n if(r == (front_/ndbl)) return 0;\\n\\n\\n\\n uint32_t *ptr= data_buffer + r*ndbl*NBUF_ACQ;\\n\\n memcpy(dst,ptr,ndbl*NBUF_ACQ*4);\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 53,\n \"score\": 30264.931983553855\n },\n {\n \"content\": \" * @brief Definitions\\n\\n * \\n\\n */\\n\\n\\n\\n #if defined(ARDUINO_TEENSY36)\\n\\n #define MAXBUF (160)\\n\\n #elif defined(ARDUINO_TEENSY40)\\n\\n #define MAXBUF (200)\\n\\n #elif defined(ARDUINO_TEENSY41)\\n\\n #define MAXBUF (200)\\n\\n #endif\\n\\n \\n\\n\\n\\n\\n\\n /**\\n\\n * @brief Circular Data Buffer\\n\\n * \\n\\n */ \\n\\n #if defined(ARDUINO_TEENSY41) && defined(USE_EXT_MEM)\\n\\n EXTMEM uint32_t data_buffer[MAXBUF*NBUF_ACQ];\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 54,\n \"score\": 30264.931983553855\n },\n {\n \"content\": \" class Data\\n\\n {\\n\\n public:\\n\\n Data(uint32_t * buffer) \\n\\n { /**\\n\\n * @brief Constructor\\n\\n * @param buffer is pointer to data store\\n\\n * \\n\\n */\\n\\n data_buffer=buffer; front_=rear_=0;\\n\\n }\\n\\n\\n\\n uint16_t push(uint32_t * src)\\n\\n { \\n\\n /** \\n\\n * @brief push data to storage\\n\\n * @param src is pointer to data block\\n\\n */\\n\\n uint16_t f =front_ + 1;\\n\\n if(f >= MAXBUF) f=0;\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 55,\n \"score\": 28708.449767256796\n },\n {\n \"content\": \"extern int32_t hour_ ;\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 56,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \"extern int32_t day_ ;\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 57,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Hour; \\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 58,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Wday; // day of week, sunday is day 1\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 59,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Year; // offset from 1970; \\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 60,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Second; \\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 61,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Month; \\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 62,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Minute; \\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 63,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" uint8_t Day;\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 64,\n \"score\": 23181.85555233917\n },\n {\n \"content\": \" void acq_start(void);\\n\",\n \"file_path\": \"src/acq.h\",\n \"rank\": 65,\n \"score\": 22753.61769537131\n },\n {\n \"content\": \" void acq_stop(void);\\n\",\n \"file_path\": \"src/acq.h\",\n \"rank\": 66,\n \"score\": 22753.61769537131\n },\n {\n \"content\": \" extern volatile uint32_t acq_count;\\n\",\n \"file_path\": \"src/acq.h\",\n \"rank\": 67,\n \"score\": 22753.61769537131\n },\n {\n \"content\": \" void setAGain(int8_t again);\\n\",\n \"file_path\": \"src/adc.h\",\n \"rank\": 68,\n \"score\": 22703.540246570254\n },\n {\n \"content\": \"void loadConfig(uint16_t *store, int ns);\\n\",\n \"file_path\": \"src/menu.h\",\n \"rank\": 69,\n \"score\": 22297.35057919802\n },\n {\n \"content\": \"int16_t newDay(void);\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 70,\n \"score\": 22270.778259889157\n },\n {\n \"content\": \"int16_t newHour(void);\\n\",\n \"file_path\": \"src/mTime.h\",\n \"rank\": 71,\n \"score\": 22270.778259889157\n },\n {\n \"content\": \" int16_t saveData(int16_t status);\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 72,\n \"score\": 21942.171597315817\n },\n {\n \"content\": \"// following is from SdFat examples to allow transactions to be avoided between open and close\\n\\n//\\n\\n// This is a simple driver based on the the standard SPI.h library.\\n\\n// You can write a driver entirely independent of SPI.h.\\n\\n// It can be optimized for your board or a different SPI port can be used.\\n\\n// The driver must be derived from SdSpiBaseClass.\\n\\n// See: SdFat/src/SpiDriver/SdSpiBaseClass.h\\n\\nclass MySpiClass : public SdSpiBaseClass {\\n\\n /**\\n\\n * @brief SPI interface class\\n\\n * \\n\\n */\\n\\n\\n\\n public:\\n\\n // Initialize the SPI bus.\\n\\n void begin(SdSpiConfig config) { (void) config; SPI.begin(); }\\n\\n\\n\\n // Activate SPI hardware with correct speed and mode.\\n\\n void activate() { if(doTransactions) SPI.beginTransaction(m_spiSettings); }\\n\\n // Deactivate SPI hardware.\\n\\n void deactivate() { if(doTransactions) SPI.endTransaction(); }\\n\\n\\n\\n // Receive a byte.\\n\\n uint8_t receive() { return SPI.transfer(0XFF); }\\n\\n\\n\\n // Send a byte.\\n\\n void send(uint8_t data) { SPI.transfer(data); }\\n\",\n \"file_path\": \"src/filing.cpp\",\n \"rank\": 73,\n \"score\": 21940.692335417683\n },\n {\n \"content\": \" #define FilePrefix \\\"F\\\"\\n\\n\\n\",\n \"file_path\": \"src/config.h\",\n \"rank\": 74,\n \"score\": 21938.771656200614\n },\n {\n \"content\": \" void storage_configure();\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 75,\n \"score\": 21938.771656200614\n },\n {\n \"content\": \" uint16_t pushData(uint32_t * src);\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 76,\n \"score\": 21938.771656200614\n },\n {\n \"content\": \" uint16_t pullData(uint32_t * dst, uint32_t ndbl);\\n\",\n \"file_path\": \"src/filing.h\",\n \"rank\": 77,\n \"score\": 21938.771656200614\n },\n {\n \"content\": \" void acq_stopClocks(void);\\n\",\n \"file_path\": \"src/acq.h\",\n \"rank\": 78,\n \"score\": 21893.186774117778\n },\n {\n \"content\": \" void acq_startClocks(void);\\n\",\n \"file_path\": \"src/acq.h\",\n \"rank\": 79,\n \"score\": 21893.186774117778\n },\n {\n \"content\": \"uint32_t getTeensySerial(void);\\n\",\n \"file_path\": \"src/utils.h\",\n \"rank\": 80,\n \"score\": 21868.871044274005\n },\n {\n \"content\": \" w 98 0E 03 # Set U1 Ch4 mapped to slot 3 of SDOUT\\n\\n */\\n\\n\\n\\n void adc_init(void)\\n\\n {\\n\\n // reset ADC's \\n\\n pinMode(22,OUTPUT);\\n\\n digitalWriteFast(22,LOW); //SHDNZ\\n\\n delay(100);\\n\\n digitalWriteFast(22,HIGH); //SHDNZ\\n\\n\\n\\n /* ADDRESS L,L: 0x4C ; H,L: 0x4D; L,H: 0x4E; H,H: 0x4F */\\n\\n i2c_class i2c(&Wire1,100'000);\\n\\n\\n\\n // check existance of device\\n\\n for(int ii=0; ii<2; ii++)\\n\\n {\\n\\n if(i2c.exist(i2c_addr[ii]))\\n\\n Serial.printf(\\\"found %x\\\\n\\\",i2c_addr[ii]);\\n\\n else\\n\",\n \"file_path\": \"src/adc.cpp\",\n \"rank\": 81,\n \"score\": 21.96310494824983\n },\n {\n \"content\": \" if(status==MUST_REBOOT) status=checkReboot(); // hapens only if microSD card write fails: reboot if space on disk\\n\\n\\n\\n // normal operation\\n\\n int16_t ch=menu(); // check if we have serial line command (0: no input; 1: start; -1: stop)\\n\\n\\n\\n if(ch>0 && status==STOPPED) // was stopped, should run now \\n\\n { \\n\\n status=CLOSED; acq_start(); adcStatus();\\n\\n } \\n\\n \\n\\n if(ch<0 && status>=CLOSED) // was running, should stop now\\n\\n { \\n\\n status=MUSTSTOP; acq_stop(); \\n\\n } \\n\\n\\n\\n if(status > CLOSED) // RUNNING\\n\\n {\\n\\n status = checkToCloseFile(status, (uint32_t) t_acq); // check if we reached file size or aquisition time\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 82,\n \"score\": 18.922587669806628\n },\n {\n \"content\": \"/**\\n\\n * basicSoundRecorder\\n\\n*/\\n\\n#define START_MODE -1 // -1 wait for menu; 0 start with closed files\\n\\n\\n\\n#include \\\"config.h\\\"\\n\\n#include \\\"menu.h\\\"\\n\\n#include \\\"adc.h\\\"\\n\\n#include \\\"acq.h\\\"\\n\\n#include \\\"filing.h\\\"\\n\\n#include \\\"mTime.h\\\"\\n\\n\\n\\n#include \\\"utils.h\\\"\\n\\n\\n\\n/********************************* *********************************/\\n\\n// Function prototypes and variables\\n\\n\\n\\nuint32_t max_write=0;\\n\\nuint32_t max_count=0;\\n\\n\\n\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 83,\n \"score\": 16.795341238721264\n },\n {\n \"content\": \" i2c_class i2c(&Wire1,100'000);\\n\\n for(int ii=0; ii<2; ii++)\\n\\n for(int jj=0; jj<4; jj++)\\n\\n {\\n\\n i2c.write(i2c_addr[ii],regs[jj]+1, again); // CH1_CFG1 (0dB gain)\\n\\n }\\n\\n }\\n\\n void adcStatus(void)\\n\\n {\\n\\n i2c_class i2c(&Wire1,100'000);\\n\\n for(int ii=0; ii<2; ii++)\\n\\n { Serial.print(\\\"\\\\n ADC 0x15: \\\"); Serial.print(i2c.read(i2c_addr[ii],0x15),HEX);\\n\\n }\\n\\n Serial.println();\\n\\n }\\n\\n bool adcEnable(void) { }\\n\\n#endif\\n\",\n \"file_path\": \"src/adc.cpp\",\n \"rank\": 84,\n \"score\": 15.845899112664636\n },\n {\n \"content\": \"\\n\\n i2c.write(i2c_addr[ii],0x3B,0x00); // 0: 2.75V; 1: 2.5V; 2: 1.375V\\n\\n\\n\\n for(int jj=0; jj<4; jj++)\\n\\n { \\n\\n #if ATEST==1\\n\\n again=AG[ii][jj];\\n\\n #endif\\n\\n\\n\\n i2c.write(i2c_addr[ii],regs[jj]+0, 0x88); // CH1_CFG0 (Line in, 20 kOhm))\\n\\n i2c.write(i2c_addr[ii],regs[jj]+1, again); // CH1_CFG1 (0dB gain)\\n\\n i2c.write(i2c_addr[ii],regs[jj]+2, 201+dgain); // CH1_CFG2\\n\\n i2c.write(i2c_addr[ii],regs[jj]+3, 0x80); // CH1_CFG3 (0dB decimal gain correction: +/- 0.8 dB) \\n\\n i2c.write(i2c_addr[ii],regs[jj]+4, 0x00); // CH1_CFG4 (0bit)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n void setAGain(int8_t again)\\n\\n {\\n\",\n \"file_path\": \"src/adc.cpp\",\n \"rank\": 85,\n \"score\": 14.058593679299685\n },\n {\n \"content\": \" if(status >= CLOSED) // NOT STOPPED\\n\\n {\\n\\n uint32_t mc = getCount();\\n\\n if(mc>max_count) max_count=mc;\\n\\n //\\n\\n uint32_t to=millis();\\n\\n status = saveData(status); \\n\\n uint32_t dt=millis()-to;\\n\\n if(max_write<dt) max_write=dt;\\n\\n }\\n\\n\\n\\n static uint32_t t0;\\n\\n static uint32_t loop_count=0;\\n\\n if(millis()-t0>1000)\\n\\n {\\n\\n if(status>=CLOSED)\\n\\n {\\n\\n Serial.print(\\\"\\\\nLoop: \\\");\\n\\n Serial.print(status); Serial.print(\\\" \\\"); \\n\\n Serial.print(loop_count); Serial.print(\\\" : \\\"); \\n\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 86,\n \"score\": 13.449550312279348\n },\n {\n \"content\": \" Serial.println(\\\"basic Sound Recorder Version: \\\" __DATE__ \\\" \\\" __TIME__ );\\n\\n SerNum = getTeensySerial();\\n\\n Serial.println((int32_t)SerNum,HEX);\\n\\n\\n\\n storage_configure();\\n\\n\\n\\n adc_init();\\n\\n acq_init(fsamp);\\n\\n adc_enable();\\n\\n\\n\\n #if START_MODE==CLOSED\\n\\n acq_start(); \\n\\n #endif\\n\\n\\n\\n Serial.println(\\\"End of Setup\\\");\\n\\n}\\n\\n\\n\\nvoid loop()\\n\\n{ static int16_t status=START_MODE; \\n\\n\\n\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 87,\n \"score\": 13.217402813383687\n },\n {\n \"content\": \"#include \\\"core_pins.h\\\"\\n\\n#include \\\"config.h\\\"\\n\\n#include \\\"utils.h\\\"\\n\\n\\n\\nuint32_t SerNum;\\n\\n\\n\\n/* following from https://github.com/sstaub/TeensyID/blob/master/TeensyID.cpp */\\n\\n#if defined ARDUINO_TEENSY40 || defined ARDUINO_TEENSY41\\n\\n uint32_t getTeensySerial(void) \\n\\n {\\n\\n uint32_t num;\\n\\n num = HW_OCOTP_MAC0 & 0xFFFFFF;\\n\\n return num;\\n\\n }\\n\\n\\n\\n // from https://forum.pjrc.com/threads/33443-How-to-display-free-ram?p=275013&viewfull=1#post275013\\n\\n extern unsigned long _heap_start; \\n\\n extern unsigned long _heap_end;\\n\\n extern char *__brkval;\\n\\n\\n\",\n \"file_path\": \"src/utils.cpp\",\n \"rank\": 88,\n \"score\": 12.518123630448578\n },\n {\n \"content\": \"uint32_t t_start;\\n\\n\\n\\n/* check if we should close file */\\n\\nint t_acq = 60; // close file on the minute\\n\\n\\n\\nint16_t checkToCloseFile(int16_t status, uint32_t t_acq)\\n\\n{ if((status == OPENED) || (status == RUNNING))\\n\\n { //\\n\\n static uint32_t to =0;\\n\\n uint32_t tx=rtc_get();\\n\\n tx %= t_acq;\\n\\n if(tx<to) status = DOCLOSE; // time wrapped, file must be closed\\n\\n to=tx;\\n\\n } \\n\\n return status;\\n\\n}\\n\\n\\n\\nvoid setup()\\n\\n{\\n\\n while(!Serial) continue;\\n\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 89,\n \"score\": 11.743796789683165\n },\n {\n \"content\": \"// Wire.setSDA(18);\\n\\n// Wire.setSCL(19);\\n\\n Wire.setClock(100'000);\\n\\n\\n\\n for(int ii=0;ii<127;ii++)\\n\\n {\\n\\n Wire.beginTransmission(ii);\\n\\n uint8_t error = Wire.endTransmission();\\n\\n if(error) \\n\\n Serial.printf(\\\"I2C not found %x\\\\n\\\",ii); \\n\\n else \\n\\n Serial.printf(\\\"I2C found %x\\\\n\\\",ii); \\n\\n }\\n\\n while(1); \\n\\n}\\n\\n\\n\\nvoid test_wire1(void)\\n\\n{\\n\\n Wire1.begin();\\n\\n delay(100);\\n\",\n \"file_path\": \"src/i2c.cpp\",\n \"rank\": 90,\n \"score\": 11.642630494058054\n },\n {\n \"content\": \" FTFL_FSTAT = FTFL_FSTAT_RDCOLERR | FTFL_FSTAT_ACCERR | FTFL_FSTAT_FPVIOL;\\n\\n *(uint32_t *)&FTFL_FCCOB3 = 0x41070000;\\n\\n FTFL_FSTAT = FTFL_FSTAT_CCIF;\\n\\n while (!(FTFL_FSTAT & FTFL_FSTAT_CCIF)) ; // wait\\n\\n num = *(uint32_t *)&FTFL_FCCOBB;\\n\\n kinetis_hsrun_enable();\\n\\n #endif\\n\\n __enable_irq();\\n\\n return num & 0xFFFFFF;\\n\\n }\\n\\n#endif\\n\\n\\n\\n#include \\\"usb_serial.h\\\"\\n\\nPrint *stdPrint = &Serial;\\n\\n\\n\\nextern \\\"C\\\"\\n\\n{\\n\\n int _write(int file, const void *buf, size_t len) {\\n\\n // https://forum.pjrc.com/threads/28473-Quick-Guide-Using-printf()-on-Teensy-ARM\\n\\n Print *out;\\n\",\n \"file_path\": \"src/utils.cpp\",\n \"rank\": 91,\n \"score\": 11.584033516078605\n },\n {\n \"content\": \" if (Wire1.endTransmission(false) != 0) return 0;\\n\\n if (Wire1.requestFrom((int)addr, 1) < 1) return 0;\\n\\n val = Wire1.read();\\n\\n return val;\\n\\n}\\n\\n\\n\\nbool i2c1_write(uint8_t addr, uint8_t reg, uint8_t val)\\n\\n{\\n\\n Wire1.beginTransmission(addr);\\n\\n Wire1.write(reg);\\n\\n Wire1.write(val);\\n\\n return (Wire1.endTransmission() == 0);\\n\\n}\\n\\n*/\\n\\n\\n\\n#if 0\\n\\nvoid test_wire0(void)\\n\\n{\\n\\n Wire.begin();\\n\\n delay(100);\\n\",\n \"file_path\": \"src/i2c.cpp\",\n \"rank\": 92,\n \"score\": 11.500013115271589\n },\n {\n \"content\": \" CS536X_GCTL_MODE(speed));\\n\\n val[1] = i2c.read(addr, CS536X_GCTL);\\n\\n\\n\\n val[2] = i2c.read(addr, CS536X_PDN);\\n\\n val[3] = i2c.read(addr, CS536X_nSDOUT);\\n\\n \\n\\n Serial.printf(\\\"CS536x: %x %x %x %x %x\\\\r\\\\n\\\",addr, val[0],val[1],val[2],val[3]);\\n\\n\\n\\n // i2c.write(addr, CS536X_nHPF, 0b01111111);\\n\\n // i2c.write(addr, CS536X_PDN, 0b00001000);\\n\\n // i2c.write(addr, CS536X_nSDOUT, 0b00001000);\\n\\n\\n\\n // i2c.write(addr, CS536X_MUTE, 0b11111110);\\n\\n }\\n\\n\\n\\n void setAGain(int8_t again) { }\\n\\n void adcStatus(void) { }\\n\\n bool adcEnable(void) { }\\n\\n\\n\\n#elif (ADC_MODEL == TLDV320ADC6140) || (ADC_MODEL == TLDV320ADC6140_2)\\n\",\n \"file_path\": \"src/adc.cpp\",\n \"rank\": 93,\n \"score\": 11.113602842244518\n },\n {\n \"content\": \" int freeram() { return (char *)&_heap_end - __brkval; }\\n\\n\\n\\n #define CPU_RESTART_ADDR (uint32_t *)0xE000ED0C\\n\\n #define CPU_RESTART_VAL 0x5FA0004\\n\\n #define CPU_RESTART (*CPU_RESTART_ADDR = CPU_RESTART_VAL)\\n\\n\\n\\n#else\\n\\n uint32_t getTeensySerial(void) \\n\\n {\\n\\n uint32_t num = 0;\\n\\n __disable_irq();\\n\\n #if defined(HAS_KINETIS_FLASH_FTFA) || defined(HAS_KINETIS_FLASH_FTFL)\\n\\n FTFL_FSTAT = FTFL_FSTAT_RDCOLERR | FTFL_FSTAT_ACCERR | FTFL_FSTAT_FPVIOL;\\n\\n FTFL_FCCOB0 = 0x41;\\n\\n FTFL_FCCOB1 = 15;\\n\\n FTFL_FSTAT = FTFL_FSTAT_CCIF;\\n\\n while (!(FTFL_FSTAT & FTFL_FSTAT_CCIF)) ; // wait\\n\\n num = *(uint32_t *)&FTFL_FCCOB7;\\n\\n #elif defined(HAS_KINETIS_FLASH_FTFE)\\n\\n kinetis_hsrun_disable();\\n\",\n \"file_path\": \"src/utils.cpp\",\n \"rank\": 94,\n \"score\": 11.035085812111161\n },\n {\n \"content\": \" void acq_startClocks(void)\\n\\n {\\n\\n SIM_SCGC6 |= SIM_SCGC6_I2S;\\n\\n SIM_SCGC7 |= SIM_SCGC7_DMA;\\n\\n SIM_SCGC6 |= SIM_SCGC6_DMAMUX;\\n\\n }\\n\\n\\n\\n void acq_start(void)\\n\\n {\\n\\n acq_startClocks();\\n\\n I2S0_RCSR |= I2S_RCSR_RE;\\n\\n }\\n\\n\\n\\n void acq_stop(void)\\n\\n {\\n\\n I2S0_RCSR &= ~I2S_RCSR_RE;\\n\\n acq_stopClocks();\\n\\n }\\n\\n\\n\\n void acq_init(int fsamp)\\n\",\n \"file_path\": \"src/acq.cpp\",\n \"rank\": 95,\n \"score\": 10.931760945540297\n },\n {\n \"content\": \" Serial.print(acq_count); Serial.print(\\\" \\\");\\n\\n Serial.print(acq_miss); Serial.print(\\\" \\\");\\n\\n Serial.print(max_count); Serial.print(\\\" \\\");\\n\\n Serial.print(max_write);\\n\\n }\\n\\n loop_count=0;\\n\\n acq_count=0;\\n\\n acq_miss=0;\\n\\n max_count=0;\\n\\n max_write=0;\\n\\n t0=millis();\\n\\n }\\n\\n loop_count++;\\n\\n}\",\n \"file_path\": \"src/main.cpp\",\n \"rank\": 96,\n \"score\": 10.857575792003276\n },\n {\n \"content\": \" wire->setClock(speed);\\n\\n wire->setSCL(scl);\\n\\n wire->setSDA(sda);\\n\\n }\\n\\n\\n\\n uint8_t exist(uint8_t addr)\\n\\n {\\n\\n wire->beginTransmission(addr);\\n\\n return (wire->endTransmission()==0);\\n\\n }\\n\\n\\n\\n uint8_t read(uint8_t addr, uint8_t reg) \\n\\n { \\n\\n unsigned int val;\\n\\n wire->beginTransmission(addr);\\n\\n wire->write(reg);\\n\\n if (wire->endTransmission(false) != 0) return 0;\\n\\n if (wire->requestFrom((int)addr, 1) < 1) return 0;\\n\\n val = wire->read();\\n\\n return val;\\n\",\n \"file_path\": \"src/i2c.h\",\n \"rank\": 97,\n \"score\": 10.62070057380434\n },\n {\n \"content\": \"#include \\\"i2c.h\\\"\\n\\n\\n\\n\\n\\n/*\\n\\nuint8_t i2c_exist(uint8_t addr)\\n\\n{\\n\\n Wire.beginTransmission(addr);\\n\\n return (Wire.endTransmission()==0);\\n\\n}\\n\\n\\n\\nuint8_t i2c_read(uint8_t addr, uint8_t reg)\\n\\n{\\n\\n unsigned int val;\\n\\n Wire.beginTransmission(addr);\\n\\n Wire.write(reg);\\n\\n if (Wire.endTransmission(false) != 0) return 0;\\n\\n if (Wire.requestFrom((int)addr, 1) < 1) return 0;\\n\\n val = Wire.read();\\n\\n return val;\\n\\n}\\n\",\n \"file_path\": \"src/i2c.cpp\",\n \"rank\": 98,\n \"score\": 10.05789944845505\n },\n {\n \"content\": \" { Serial.printf(\\\"ADC I2C %x not found\\\\n\\\",i2c_addr[ii]); while(1) ;}\\n\\n\\n\\n i2c.write(i2c_addr[ii],0x02,0x81); // 1.8V AREG, not sleep\\n\\n\\n\\n i2c.write(i2c_addr[ii],0x02,0x81); // 1.8V AREG, not sleep\\n\\n i2c.write(i2c_addr[ii],0x07,(3<<4)); // TDM; 32 bit; default clock xmit on rising edge); zero fill\\n\\n// i2c.write(i2c_addr[ii],0x07,(3<<4) | (1<<1)); // 32 bit and TX-edge\\n\\n i2c.write(i2c_addr[ii],0x08,0x00); // TX_offset 0\\n\\n\\n\\n//// i2c.write(i2c_addr[ii],0x13,0<<6); // AUTO_CLK_TX\\n\\n// i2c.write(i2c_addr[ii],0x16,0x16, (0<<6 | 0<<3));\\n\\n\\n\\n for(int jj=0;jj<4;jj++)\\n\\n {\\n\\n i2c.write(i2c_addr[ii],0x0B+jj,chmap[ii][jj]); \\n\\n }\\n\\n\\n\\n i2c.write(i2c_addr[ii],0x73,chanMask[ii]); \\n\\n i2c.write(i2c_addr[ii],0x74,chanMask[ii]);\\n\\n i2c.write(i2c_addr[ii],0x75,0x60);\\n\",\n \"file_path\": \"src/adc.cpp\",\n \"rank\": 99,\n \"score\": 9.695365157669894\n }\n]","isConversational":false}}},{"rowIdx":392,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"alljoyn_c/samples/about/about_service.cc"},"repo_name":{"kind":"string","value":"liuxiang88/core-alljoyn"},"commit":{"kind":"string","value":"549c966482d9b89da84aa528117584e7049916cb"},"file_code":{"kind":"string","value":"\n\n#include <alljoyn_c/AboutData.h>\n#include <alljoyn_c/AboutListener.h>\n#include <alljoyn_c/AboutObj.h>\n#include <alljoyn_c/AboutObjectDescription.h>\n#include <alljoyn_c/AboutProxy.h>\n#include <alljoyn_c/BusAttachment.h>\n#include <alljoyn_c/Init.h>\n\n#include <alljoyn/BusAttachment.h>\n#include <alljoyn/BusListener.h>\n#include <alljoyn/BusObject.h>\n#include <alljoyn/AboutObj.h>\n\n#include <signal.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#define ArraySize(a) (sizeof(a) / sizeof(a[0]))\n\nusing namespace ajn;\n\nstatic volatile sig_atomic_t s_interrupt = QCC_FALSE;\n\nstatic void CDECL_CALL sig_int_handler(int sig)\n{\n QCC_UNUSED(sig);\n s_interrupt = QCC_TRUE;\n}\n\nstatic alljoyn_sessionport ASSIGNED_SESSION_PORT = 900;\nstatic const char INTERFACE_NAME[] = \"com.example.about.feature.interface.sample\";\n\nstatic void AJ_CALL sessionportlistener_sessionjoined_cb(const void* context,\n alljoyn_sessionport sessionPort,\n alljoyn_sessionid id,\n const char* joiner)\n{\n QCC_UNUSED(context);\n QCC_UNUSED(sessionPort);\n QCC_UNUSED(joiner);\n printf(\"Session Joined SessionId = %u\\n\", id);\n}\n\nstatic QCC_BOOL AJ_CALL sessionportlistener_acceptsessionjoiner_cb(const void* context,\n alljoyn_sessionport sessionPort,\n const char* joiner,\n const alljoyn_sessionopts opts)\n{\n QCC_UNUSED(context);\n QCC_UNUSED(joiner);\n QCC_UNUSED(opts);\n if (sessionPort != ASSIGNED_SESSION_PORT) {\n printf(\"Rejecting join attempt on unexpected session port %d\\n\", sessionPort);\n return QCC_FALSE;\n }\n return QCC_TRUE;\n}\n\nstatic alljoyn_sessionportlistener create_my_alljoyn_sessionportlistener()\n{\n alljoyn_sessionportlistener_callbacks* callbacks =\n (alljoyn_sessionportlistener_callbacks*)\n malloc(sizeof(alljoyn_sessionportlistener_callbacks));\n\n callbacks->accept_session_joiner = sessionportlistener_acceptsessionjoiner_cb;\n callbacks->session_joined = sessionportlistener_sessionjoined_cb;\n return alljoyn_sessionportlistener_create(callbacks, NULL);\n}\n\nstatic void AJ_CALL echo_cb(alljoyn_busobject object,\n const alljoyn_interfacedescription_member* member,\n alljoyn_message msg) {\n alljoyn_msgarg arg = alljoyn_message_getarg(msg, 0);\n QCC_UNUSED(member);\n printf(\"Echo method called %s\\n\", ((ajn::MsgArg*)arg)->v_string.str);\n\n QStatus status = alljoyn_busobject_methodreply_args(object, msg, arg, 1);\n if (status != ER_OK) {\n printf(\"Failed to created MethodReply.\\n\");\n }\n}\n\nstatic alljoyn_busobject create_my_alljoyn_busobject(alljoyn_busattachment bus,\n const char* path)\n{\n QStatus status = ER_FAIL;\n alljoyn_busobject result = NULL;\n result = alljoyn_busobject_create(path, QCC_FALSE, NULL, NULL);\n\n alljoyn_interfacedescription iface = alljoyn_busattachment_getinterface(bus, INTERFACE_NAME);\n QCC_ASSERT(iface != NULL);\n\n status = alljoyn_busobject_addinterface(result, iface);\n alljoyn_busobject_setannounceflag(result, iface, ANNOUNCED);\n if (status != ER_OK) {\n printf(\"Failed to add %s interface to the BusObject\\n\", INTERFACE_NAME);\n }\n\n alljoyn_interfacedescription_member echomember;\n alljoyn_interfacedescription_getmember(iface, \"Echo\", &echomember);\n const alljoyn_busobject_methodentry methodEntries[] = {\n { &echomember, echo_cb }\n };\n status =\n alljoyn_busobject_addmethodhandlers(result, methodEntries,\n sizeof(methodEntries) / sizeof(methodEntries[0]));\n\n return result;\n}\n\nint CDECL_CALL main(void)\n{\n \n signal(SIGINT, sig_int_handler);\n\n QStatus status = alljoyn_init();\n if (ER_OK != status) {\n printf(\"alljoyn_init failed (%s)\\n\", QCC_StatusText(status));\n return 1;\n }\n#ifdef ROUTER\n status = alljoyn_routerinit();\n if (ER_OK != status) {\n printf(\"alljoyn_routerinit failed (%s)\\n\", QCC_StatusText(status));\n alljoyn_shutdown();\n return 1;\n }\n#endif\n\n alljoyn_busattachment bus =\n alljoyn_busattachment_create(\"About Service Example\", QCC_TRUE);\n\n status = alljoyn_busattachment_start(bus);\n if (ER_OK == status) {\n printf(\"BusAttachment started.\\n\");\n } else {\n printf(\"FAILED to start BusAttachment (%s)\\n\",\n QCC_StatusText(status));\n return 1;\n }\n\n status = alljoyn_busattachment_connect(bus, NULL);\n if (ER_OK == status) {\n printf(\"BusAttachment connect succeeded. BusName %s\\n\",\n alljoyn_busattachment_getuniquename(bus));\n } else {\n printf(\"FAILED to connect to router node (%s)\\n\",\n QCC_StatusText(status));\n return 1;\n }\n\n alljoyn_sessionopts opts =\n alljoyn_sessionopts_create(ALLJOYN_TRAFFIC_TYPE_MESSAGES, QCC_FALSE,\n ALLJOYN_PROXIMITY_ANY,\n ALLJOYN_TRANSPORT_ANY);\n alljoyn_sessionport sessionPort = ASSIGNED_SESSION_PORT;\n alljoyn_sessionportlistener listener = create_my_alljoyn_sessionportlistener();\n status = alljoyn_busattachment_bindsessionport(bus, &sessionPort,\n opts, listener);\n if (ER_OK != status) {\n printf(\"Failed to BindSessionPort (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n \n alljoyn_aboutdata aboutData = alljoyn_aboutdata_create(\"en\");\n \n uint8_t appId[] = { 0x01, 0xB3, 0xBA, 0x14,\n 0x1E, 0x82, 0x11, 0xE4,\n 0x86, 0x51, 0xD1, 0x56,\n 0x1D, 0x5D, 0x46, 0xB0 };\n status = alljoyn_aboutdata_setappid(aboutData, appId, 16);\n status = alljoyn_aboutdata_setdevicename(aboutData, \"My Device Name\", \"en\");\n \n status = alljoyn_aboutdata_setdeviceid(aboutData,\n \"93c06771-c725-48c2-b1ff-6a2a59d445b8\");\n status = alljoyn_aboutdata_setappname(aboutData, \"Application\", \"en\");\n status = alljoyn_aboutdata_setmanufacturer(aboutData, \"Manufacturer\", \"en\");\n status = alljoyn_aboutdata_setmodelnumber(aboutData, \"123456\");\n status = alljoyn_aboutdata_setdescription(aboutData,\n \"A poetic description of this application\",\n \"en\");\n status = alljoyn_aboutdata_setdateofmanufacture(aboutData, \"2014-03-24\");\n status = alljoyn_aboutdata_setsoftwareversion(aboutData, \"0.1.2\");\n status = alljoyn_aboutdata_sethardwareversion(aboutData, \"0.0.1\");\n status = alljoyn_aboutdata_setsupporturl(aboutData, \"http://www.example.org\");\n\n \n status = alljoyn_aboutdata_setdevicename(aboutData,\n \"Mi dispositivo Nombre\", \"es\");\n status = alljoyn_aboutdata_setappname(aboutData, \"aplicación\", \"es\");\n status = alljoyn_aboutdata_setmanufacturer(aboutData, \"fabricante\", \"es\");\n status = alljoyn_aboutdata_setdescription(aboutData,\n \"Una descripción poética de esta aplicación\",\n \"es\");\n\n \n if (!alljoyn_aboutdata_isvalid(aboutData, \"en\")) {\n printf(\"failed to setup about data.\\n\");\n }\n\n char interface[256] = { 0 };\n\n#if defined(QCC_OS_GROUP_WINDOWS)\n _snprintf(\n#else\n snprintf(\n#endif\n interface, ArraySize(interface), \"<node>\" \\\n \"<interface name='%s'>\" \\\n \" <method name='Echo'>\" \\\n \" <arg name='out_arg' type='s' direction='in' />\" \\\n \" <arg name='return_arg' type='s' direction='out' />\" \\\n \" </method>\" \\\n \"</interface>\" \\\n \"</node>\", INTERFACE_NAME);\n interface[ArraySize(interface) - 1] = '\\0';\n\n printf(\"Interface = %s\\n\", interface);\n status = alljoyn_busattachment_createinterfacesfromxml(bus, interface);\n if (ER_OK != status) {\n printf(\"Failed to parse the xml interface definition (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n alljoyn_busobject busObject = create_my_alljoyn_busobject(bus,\n \"/example/path\");\n\n status = alljoyn_busattachment_registerbusobject(bus, busObject);\n if (ER_OK != status) {\n printf(\"Failed to register BusObject (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n \n alljoyn_aboutobj aboutObj = alljoyn_aboutobj_create(bus, UNANNOUNCED);\n \n status = alljoyn_aboutobj_announce(aboutObj, sessionPort, aboutData);\n if (ER_OK == status) {\n printf(\"AboutObj Announce Succeeded.\\n\");\n } else {\n printf(\"AboutObj Announce failed (%s)\\n\", QCC_StatusText(status));\n return 1;\n }\n\n \n if (ER_OK == status) {\n while (s_interrupt == QCC_FALSE) {\n#ifdef _WIN32\n Sleep(100);\n#else\n usleep(100 * 1000);\n#endif\n }\n }\n\n alljoyn_aboutobj_unannounce(aboutObj);\n alljoyn_sessionportlistener_destroy(listener);\n\n alljoyn_busattachment_stop(bus);\n alljoyn_busattachment_join(bus);\n\n alljoyn_sessionopts_destroy(opts);\n alljoyn_aboutdata_destroy(aboutData);\n alljoyn_busobject_destroy(busObject);\n alljoyn_aboutobj_destroy(aboutObj);\n\n alljoyn_busattachment_destroy(bus);\n\n#ifdef ROUTER\n alljoyn_routershutdown();\n#endif\n alljoyn_shutdown();\n return 0;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <alljoyn_c/AboutData.h>\n#include <alljoyn_c/AboutListener.h>\n#include <alljoyn_c/AboutObj.h>\n#include <alljoyn_c/AboutObjectDescription.h>\n#include <alljoyn_c/AboutProxy.h>\n#include <alljoyn_c/BusAttachment.h>\n#include <alljoyn_c/Init.h>\n\n#include <alljoyn/BusAttachment.h>\n#include <alljoyn/BusListener.h>\n#include <alljoyn/BusObject.h>\n#include <alljoyn/AboutObj.h>\n\n#include <signal.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#define ArraySize(a) (sizeof(a) / sizeof(a[0]))\n\nusing namespace ajn;\n\nstatic volatile sig_atomic_t s_interrupt = QCC_FALSE;\n\nstatic void CDECL_CALL sig_int_handler(int sig)\n{\n QCC_UNUSED(sig);\n s_interrupt = QCC_TRUE;\n}\n\nstatic alljoyn_sessionport ASSIGNED_SESSION_PORT = 900;\nstatic const char INTERFACE_NAME[] = \"com.example.about.feature.interface.sample\";\n\nstatic void AJ_CALL sessionportlistener_sessionjoined_cb(const void* context,\n alljoyn_sessionport sessionPort,\n alljoyn_sessionid id,\n const char* joiner)\n{\n QCC_UNUSED(context);\n QCC_UNUSED(sessionPort);\n QCC_UNUSED(joiner);\n printf(\"Session Joined SessionId = %u\\n\", id);\n}\n\nstatic QCC_BOOL AJ_CALL sessionportlistener_acceptsessionjoiner_cb(const void* context,\n alljoyn_sessionport sessionPort,\n const char* joiner,\n const alljoyn_sessionopts opts)\n{\n QCC_UNUSED(context);\n QCC_UNUSED(joiner);\n QCC_UNUSED(opts);\n if (sessionPort != ASSIGNED_SESSION_PORT) {\n printf(\"Rejecting join attempt on unexpected session port %d\\n\", sessionPort);\n return QCC_FALSE;\n }\n return QCC_TRUE;\n}\n\nstatic alljoyn_sessionportlistener create_my_alljoyn_sessionportlistener()\n{\n alljoyn_sessionportlistener_callbacks* callbacks =\n (alljoyn_sessionportlistener_callbacks*)\n malloc(sizeof(alljoyn_sessionportlistener_callbacks));\n\n callbacks->accept_session_joiner = sessionportlistener_acceptsessionjoiner_cb;\n callbacks->session_joined = sessionportlistener_sessionjoined_cb;\n return alljoyn_sessionportlistener_create(callbacks, NULL);\n}\n\nstatic void AJ_CALL echo_cb(alljoyn_busobject object,\n const alljoyn_interfacedescription_member* member,\n alljoyn_message msg) {\n alljoyn_msgarg arg = alljoyn_message_getarg(msg, 0);\n QCC_UNUSED(member);\n printf(\"Echo method called %s\\n\", ((ajn::MsgArg*)arg)->v_string.str);\n\n QStatus status = alljoyn_busobject_methodreply_args(object, msg, arg, 1);\n if (status != ER_OK) {\n printf(\"Failed to created MethodReply.\\n\");\n }\n}\n\nstatic alljoyn_busobject create_my_alljoyn_busobject(alljoyn_busattachment bus,\n const char* path)\n{\n QStatus status = ER_FAIL;\n alljoyn_busobject result = NULL;\n result = alljoyn_busobject_create(path, QCC_FALSE, NULL, NULL);\n\n alljoyn_interfacedescription iface = alljoyn_busattachment_getinterface(bus, INTERFACE_NAME);\n QCC_ASSERT(iface != NULL);\n\n status = alljoyn_busobject_addinterface(result, iface);\n alljoyn_busobject_setannounceflag(result, iface, ANNOUNCED);\n if (status != ER_OK) {\n printf(\"Failed to add %s interface to the BusObject\\n\", INTERFACE_NAME);\n }\n\n alljoyn_interfacedescription_member echomember;\n alljoyn_interfacedescription_getmember(iface, \"Echo\", &echomember);\n const alljoyn_busobject_methodentry methodEntries[] = {\n { &echomember, echo_cb }\n };\n status =\n alljoyn_busobject_addmethodhandlers(result, methodEntries,\n sizeof(methodEntries) / sizeof(methodEntries[0]));\n\n return result;\n}\n\nint CDECL_CALL main(void)\n{\n \n signal(SIGINT, sig_int_handler);\n\n QStatus status = alljoyn_init();\n if (ER_OK != status) {\n printf(\"alljoyn_init failed (%s)\\n\", QCC_StatusText(status));\n return 1;\n }\n#ifdef ROUTER\n status = alljoyn_routerinit();\n if (ER_OK != status) {\n printf(\"alljoyn_routerinit failed (%s)\\n\", QCC_StatusText(status));\n alljoyn_shutdown();\n return 1;\n }\n#endif\n\n alljoyn_busattachment bus =\n alljoyn_busattachment_create(\"About Service Example\", QCC_TRUE);\n\n status = alljoyn_busattachment_start(bus);\n if (ER_OK == status) {\n printf(\"BusAttachment started.\\n\");\n } else {\n printf(\"FAILED to start BusAttachment (%s)\\n\",\n QCC_StatusText(status));\n return 1;\n }\n\n status = alljoyn_busattachment_connect(bus, NULL);\n if (ER_OK == status) {\n printf(\"BusAttachment connect succeeded. BusName %s\\n\",\n alljoyn_busattachment_getuniquename(bus));\n } else {\n printf(\"FAILED to connect to router node (%s)\\n\",\n QCC_StatusText(status));\n return 1;\n }\n\n alljoyn_sessionopts opts =\n alljoyn_sessionopts_create(ALLJOYN_TRAFFIC_TYPE_MESSAGES, QCC_FALSE,\n ALLJOYN_PROXIMITY_ANY,\n ALLJOYN_TRANSPORT_ANY);\n alljoyn_sessionport sessionPort = ASSIGNED_SESSION_PORT;\n alljoyn_sessionportlistener listener = create_my_alljoyn_sessionportlistener();\n status = alljoyn_busattachment_bindsessionport(bus, &sessionPort,\n opts, listener);\n if (ER_OK != status) {\n printf(\"Failed to BindSessionPort (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n \n alljoyn_aboutdata aboutData = alljoyn_aboutdata_create(\"en\");\n \n uint8_t appId[] = { 0x01, 0xB3, 0xBA, 0x14,\n 0x1E, 0x82, 0x11, 0xE4,\n 0x86, 0x51, 0xD1, 0x56,\n 0x1D, 0x5D, 0x46, 0xB0 };\n status = alljoyn_aboutdata_setappid(aboutData, appId, 16);\n status = alljoyn_aboutdata_setdevicename(aboutData, \"My Device Name\", \"en\");\n \n status = alljoyn_aboutdata_setdeviceid(aboutData,\n \"93c06771-c725-48c2-b1ff-6a2a59d445b8\");\n status = alljoyn_aboutdata_setappname(aboutData, \"Application\", \"en\");\n status = alljoyn_aboutdata_setmanufacturer(aboutData, \"Manufacturer\", \"en\");\n status = alljoyn_aboutdata_setmodelnumber(aboutData, \"123456\");\n status = alljoyn_aboutdata_setdescription(aboutData,\n \"A poetic description of this application\",\n \"en\");\n status = alljoyn_aboutdata_setdateofmanufacture(aboutData, \"2014-03-24\");\n status = alljoyn_aboutdata_setsoftwareversion(aboutData, \"0.1.2\");\n status = alljoyn_aboutdata_sethardwareversion(aboutData, \"0.0.1\");\n status = alljoyn_aboutdata_setsupporturl(aboutData, \"http://www.example.org\");\n\n \n status = alljoyn_aboutdata_setdevicename(aboutData,\n \"Mi dispositivo Nombre\", \"es\");\n status = alljoyn_aboutdata_setappname(aboutData, \"aplicación\", \"es\");\n status = alljoyn_aboutdata_setmanufacturer(aboutData, \"fabricante\", \"es\");\n status = alljoyn_aboutdata_setdescription(aboutData,\n \"Una descripción poética de esta aplicación\",\n \"es\");\n\n \n if (!alljoyn_aboutdata_isvalid(aboutData, \"en\")) {\n printf(\"failed to setup about data.\\n\");\n }\n\n char interface["},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"256] = { 0 };\n\n#if defined(QCC_OS_GROUP_WINDOWS)\n _snprintf(\n#else\n snprintf(\n#endif\n interface, ArraySize(interface), \"<node>\" \\\n \"<interface name='%s'>\" \\\n \" <method name='Echo'>\" \\\n \" <arg name='out_arg' type='s' direction='in' />\" \\\n \" <arg name='return_arg' type='s' direction='out' />\" \\\n \" </method>\" \\\n \"</interface>\" \\\n \"</node>\", INTERFACE_NAME);\n interface[ArraySize(interface) - 1] = '\\0';\n\n printf(\"Interface = %s\\n\", interface);\n status = alljoyn_busattachment_createinterfacesfromxml(bus, interface);\n if (ER_OK != status) {\n printf(\"Failed to parse the xml interface definition (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n alljoyn_busobject busObject = create_my_alljoyn_busobject(bus,\n \"/example/path\");\n\n status = alljoyn_busattachment_registerbusobject(bus, busObject);\n if (ER_OK != status) {\n printf(\"Failed to register BusObject (%s)\", QCC_StatusText(status));\n return 1;\n }\n\n \n alljoyn_aboutobj aboutObj = alljoyn_aboutobj_create(bus, UNANNOUNCED);\n \n status = alljoyn_aboutobj_announce(aboutObj, sessionPort, aboutData);\n if (ER_OK == status) {\n printf(\"AboutObj Announce Succeeded.\\n\");\n } else {\n printf(\"AboutObj Announce failed (%s)\\n\", QCC_StatusText(status));\n return 1;\n }\n\n \n if (ER_OK == status) {\n while (s_interrupt == QCC_FALSE) {\n#ifdef _WIN32\n Sleep(100);\n#else\n usleep(100 * 1000);\n#endif\n }\n }\n\n alljoyn_aboutobj_unannounce(aboutObj);\n alljoyn_sessionportlistener_destroy(listener);\n\n alljoyn_busattachment_stop(bus);\n alljoyn_busattachment_join(bus);\n\n alljoyn_sessionopts_destroy(opts);\n alljoyn_aboutdata_destroy(aboutData);\n alljoyn_busobject_destroy(busObject);\n alljoyn_aboutobj_destroy(aboutObj);\n\n alljoyn_busattachment_destroy(bus);\n\n#ifdef ROUTER\n alljoyn_routershutdown();\n#endif\n alljoyn_shutdown();\n return 0;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"class BasicService: NSObject, AJNBusListener, AJNSessionPortListener, AJNSessionListener {\n\n\n\n weak var delegate: BasicServiceDelegate?\n\n\n\n private var bus: AJNBusAttachment?\n\n private var basicObject: BasicObject?\n\n\n\n func startServiceAsync() {\n\n DispatchQueue.global(qos: .default).async {\n\n self.startService()\n\n }\n\n }\n\n\n\n func stopServiceAsync() {\n\n DispatchQueue.global(qos: .default).async {\n\n self.stopService(bus: self.bus)\n\n }\n\n }\n\n\n\n func printVersionInformation() {\n","file_path":"alljoyn_objc/samples/iOS/Swift/BasicService/BasicService/BasicService.swift","rank":0,"score":381462.0778109959},{"content":"class AJNSessionPortListenerImpl : public ajn::SessionPortListener {\n\n protected:\n\n static const char* AJN_SESSION_PORT_LISTENER_DISPATCH_QUEUE_NAME;\n\n __weak AJNBusAttachment* busAttachment;\n\n\n\n /**\n\n * Objective C delegate called when one of the below virtual functions\n\n * is called.\n\n */\n\n __weak id<AJNSessionPortListener> m_delegate;\n\n\n\n public:\n\n\n\n\n\n /**\n\n * Constructor for the AJN session port listener implementation.\n\n *\n\n * @param aBusAttachment Objective C bus attachment wrapper object.\n\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\n\n */\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":1,"score":379336.7882531101},{"content":"class CommonBusListener : public ajn::BusListener, public ajn::SessionPortListener, public ajn::SessionListener {\n\n\n\n public:\n\n\n\n /**\n\n * Constructor of CommonBusListener\n\n * @param bus - used to set a session Listener\n\n * @param daemonDisconnectCB - used to set a callback for when the daemon is disconnected\n\n */\n\n CommonBusListener(ajn::BusAttachment* bus = NULL, void(*daemonDisconnectCB)() = NULL);\n\n\n\n /**\n\n * Destructor of CommonBusListener\n\n */\n\n ~CommonBusListener();\n\n\n\n /**\n\n * AcceptSessionJoiner - Receive request to join session and decide whether to accept it or not\n\n * @param sessionPort - the port of the request\n\n * @param joiner - the name of the joiner\n","file_path":"services/config/cpp/samples/ConfigServiceSample/CommonBusListener.h","rank":2,"score":363938.44836993434},{"content":"class BusListenerImpl : public ajn::BusListener, public ajn::SessionPortListener {\n\n\n\n public:\n\n\n\n /**\n\n * Constructor of CommonBusListener\n\n */\n\n BusListenerImpl();\n\n\n\n /**\n\n * Constructor of CommonBusListener\n\n * @param sessionPort - port of listener\n\n */\n\n BusListenerImpl(ajn::SessionPort sessionPort);\n\n\n\n /**\n\n * Destructor of CommonBusListener\n\n */\n\n ~BusListenerImpl();\n\n\n","file_path":"services/about/cpp/samples/AboutServiceSample/BusListenerImpl.h","rank":3,"score":352220.17762932804},{"content":"class SessionlessObj : public BusObject, public NameListener, public SessionListener, public SessionPortListener,\n\n public BusAttachment::JoinSessionAsyncCB, public qcc::AlarmListener, public IpNameServiceListener {\n\n\n\n public:\n\n /**\n\n * Constructor\n\n *\n\n * @param bus Bus to associate with org.freedesktop.DBus message handler.\n\n * @param router The DaemonRouter associated with the bus.\n\n * @param busController Controller that created this object.\n\n */\n\n SessionlessObj(Bus& bus, BusController* busController, DaemonRouter& router);\n\n\n\n /**\n\n * Destructor\n\n */\n\n ~SessionlessObj();\n\n\n\n /**\n\n * Initialize and register this DBusObj instance.\n","file_path":"alljoyn_core/router/SessionlessObj.h","rank":4,"score":348980.1591546877},{"content":"- (void)sessionWasLost:(AJNSessionId)sessionId;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionListener.h","rank":5,"score":344762.494908794},{"content":"class AboutInterfaceTestSessionPortListener : public SessionPortListener {\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\n\n {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n return true;\n\n }\n\n};\n\n\n\n/*\n\n * A PropertyStoreImplementation with all of the AboutData fields filled out.\n\n * The AppId and DeviceId are generated at random using the qcc::GUID function\n\n */\n","file_path":"services/about/cpp/unit_test/AboutInterfaceTest.cc","rank":6,"score":340874.3751309329},{"content":" String mServiceName;\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":7,"score":335733.37415119883},{"content":"class JoinAnnounceHandler : public ajn::services::AnnounceHandler {\n\n public:\n\n virtual void Announce(unsigned short version, unsigned short port, const char* busName,\n\n const ObjectDescriptions& objectDescs, const AboutData& aboutData)\n\n {\n\n QCC_UNUSED(objectDescs);\n\n EXPECT_EQ(1, version);\n\n EXPECT_EQ(25, port);\n\n char* deviceName;\n\n aboutData.find(\"DeviceName\")->second.Get(\"s\", &deviceName);\n\n EXPECT_STREQ(\"AnnounceHandler Unit Test framework\", deviceName);\n\n char* defaultLanguage;\n\n aboutData.find(\"DefaultLanguage\")->second.Get(\"s\", &defaultLanguage);\n\n EXPECT_STREQ(\"en\", defaultLanguage);\n\n char* appName;\n\n aboutData.find(\"AppName\")->second.Get(\"s\", &appName);\n\n EXPECT_STREQ(\"AnnounceHander Unit Test\", appName);\n\n announcePort = port;\n\n announceBusName = busName;\n\n announceHandlerFlag = true;\n","file_path":"services/about/cpp/unit_test/AboutInterfaceTest.cc","rank":8,"score":335511.1062483499},{"content":"- (QStatus)addMember:(AJNMessageType)type name:(NSString*)name inputSig:(NSString*)inputSig outSig:(NSString*)outSig argNames:(NSString*)argNames annotation:(uint8_t)annotation accessPerms:(NSString*)accessPerms;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceDescription.h","rank":9,"score":332874.66350902256},{"content":"class AnnounceHandlerTestSessionPortListener : public SessionPortListener {\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\n\n {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n return true;\n\n }\n\n};\n\n\n","file_path":"services/about/cpp/unit_test/AnnounceHandler2Test.cc","rank":10,"score":332515.2214987622},{"content":"class AnnounceHandlerTestSessionPortListener : public SessionPortListener {\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n return true;\n\n }\n\n};\n\n\n\n/*\n\n * A PropertyStoreImplementation with all of the AboutData fields filled out.\n\n * The AppId and DeviceId are generated at random using the qcc::GUID function\n\n */\n","file_path":"services/about/cpp/unit_test/AnnounceHandlerTest.cc","rank":11,"score":332515.2214987622},{"content":"//ASACORE-651\n\nclass RemoveObjectDescriptionAnnounceHandler : public ajn::services::AnnounceHandler {\n\n\n\n public:\n\n RemoveObjectDescriptionAnnounceHandler(const char* objToBeRemoved) : announceHandlerCount(0), toRemove(objToBeRemoved) { }\n\n void Announce(unsigned short version, unsigned short port, const char* busName, const ObjectDescriptions& objectDescs,\n\n const AboutData& aboutData) {\n\n QCC_UNUSED(version);\n\n QCC_UNUSED(port);\n\n QCC_UNUSED(busName);\n\n QCC_UNUSED(aboutData);\n\n\n\n if (announceHandlerCount == 0) {\n\n EXPECT_NE(objectDescs.end(), objectDescs.find(\"/org/alljoyn/test/a\"));\n\n EXPECT_NE(objectDescs.end(), objectDescs.find(\"/org/alljoyn/test/b\"));\n\n } else {\n\n if (toRemove == \"/org/alljoyn/test/b\") {\n\n EXPECT_NE(objectDescs.end(), objectDescs.find(\"/org/alljoyn/test/a\"));\n\n EXPECT_EQ(objectDescs.end(), objectDescs.find(\"/org/alljoyn/test/b\"));\n\n } else {\n\n EXPECT_EQ(objectDescs.end(), objectDescs.find(\"/org/alljoyn/test/a\"));\n","file_path":"services/about/cpp/unit_test/AnnounceHandlerTest.cc","rank":12,"score":329887.5074416655},{"content":"class AboutClientSessionJoiner : public ajn::BusAttachment::JoinSessionAsyncCB {\n\n\n\n public:\n\n\n\n AboutClientSessionJoiner(ajn::BusAttachment& bus, const qcc::String& busName, SessionJoinedCallback callback = 0);\n\n\n\n virtual ~AboutClientSessionJoiner();\n\n\n\n void JoinSessionCB(QStatus status, ajn::SessionId id, const ajn::SessionOpts& opts, void* context);\n\n\n\n private:\n\n /* Private assigment operator - does nothing */\n\n AboutClientSessionJoiner operator=(const AboutClientSessionJoiner&);\n\n\n\n ajn::BusAttachment& bus;\n\n\n\n qcc::String m_BusName;\n\n\n\n SessionJoinedCallback m_Callback;\n\n};\n\n\n\n#endif /* ABOUTCLIENTSESSIONJOINER_H_ */\n","file_path":"services/about/cpp/samples/AboutClientSample/AboutClientSessionJoiner.h","rank":13,"score":326037.7320273883},{"content":" short mPort;\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":14,"score":322424.14541038126},{"content":" public void attemptToJoinSession(String serviceName, short port, Map<String, Variant> announceData)\n\n {\n\n SessionOpts sessionOpts = new SessionOpts();\n\n sessionOpts.traffic = SessionOpts.TRAFFIC_MESSAGES;\n\n sessionOpts.isMultipoint = false;\n\n sessionOpts.proximity = SessionOpts.PROXIMITY_ANY;\n\n sessionOpts.transports = SessionOpts.TRANSPORT_ANY;\n\n\n\n Mutable.IntegerValue sessionId = new Mutable.IntegerValue();\n\n\n\n Status status = mBusAttachment.joinSession(serviceName, port, sessionId, sessionOpts, new SessionListener());\n\n if (Status.OK == status) {\n\n System.out.println(\"Succesfully joined session with: \\\"\" + serviceName + \"\\\" SessionId: \\\"\" + sessionId.value +\"\\\"\");\n\n ProxyBusObject aboutObj = mBusAttachment.getProxyBusObject(serviceName, AboutTransport.OBJ_PATH,\n\n sessionId.value, new Class<?>[] { AboutTransport.class});\n\n AboutTransport aboutIntf = aboutObj.getInterface(AboutTransport.class);\n\n try {\n\n /*\n\n * Get property org.alljoyn.About.Version\n\n */\n\n System.out.println(\"--------------Getting org.alljoyn.About.Version property-------------\");\n\n int version = aboutIntf.getVersion();\n\n System.out.println(\"version: \" + version);\n\n } catch(BusException e1){\n\n System.out.println(e1.getMessage());\n\n }\n\n\n\n try{\n\n /*\n\n * Call org.alljoyn.About.GetObjectDescription method for default language\n\n */\n\n System.out.println(\"--------Calling org.alljoyn.About.GetObjectDescription method--------\");\n\n BusObjectDescription[] objDescription = aboutIntf.GetObjectDescription();\n\n System.out.println(\"ObjectDescriptions:\");\n\n for(BusObjectDescription busObjectDescription : objDescription) {\n\n System.out.println(\"\\tObjectPath = \" + busObjectDescription.path);\n\n for(String allJoynInterface : busObjectDescription.interfaces) {\n\n System.out.println(\"\\t\\tInterface = \" + allJoynInterface);\n\n }\n\n }\n\n } catch(BusException e2) {\n\n System.out.println(e2.getMessage());\n\n }\n\n\n\n try {\n\n /*\n\n * Call org.alljoyn.About.GetAboutData method for default language\n\n */\n\n String defaultLanguage = announceData.get(AboutKeys.ABOUT_DEFAULT_LANGUAGE).getObject(String.class);\n\n System.out.println(\"---------Calling org.alljoyn.About.GetAboutData method for \" + defaultLanguage + \"--------\");\n\n Map<String, Variant> defaultAboutData = aboutIntf.GetAboutData(defaultLanguage);\n\n System.out.println(\"AboutData: for \" + defaultLanguage + \" language\");\n\n printAboutData(defaultAboutData);\n\n\n\n Variant variant = defaultAboutData.get(AboutKeys.ABOUT_SUPPORTED_LANGUAGES);\n\n String[] supportedLangs = variant.getObject(String[].class);\n\n /*\n\n * Call org.alljoyn.About.GetAboutData method for supported languages\n\n */\n\n for (String lang: supportedLangs) {\n\n if (!lang.equals(defaultLanguage)) {\n\n System.out.println(\"---------Calling org.alljoyn.About.GetAboutData method for \" + lang + \"--------\");\n\n Map<String, Variant> aboutData = aboutIntf.GetAboutData(lang);\n\n System.out.println(\"AboutData: for \" + lang + \" language\");\n\n printAboutData(aboutData);\n\n }\n\n }\n\n\n\n } catch(BusException e3) {\n\n System.out.println(e3.getMessage());\n\n }\n\n status = mBusAttachment.leaveSession(sessionId.value);\n\n if (Status.OK == status) {\n\n System.out.println(\"left session with: \\\"\" + serviceName + \"\\\" SessionId: \\\"\" + sessionId.value +\"\\\"\");\n\n }\n\n }\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":15,"score":321821.6788206335},{"content":"class AsyncSessionJoiner : public ajn::BusAttachment::JoinSessionAsyncCB {\n\n\n\n public:\n\n /**\n\n * Constructor\n\n * @param name\n\n * @param callback\n\n */\n\n AsyncSessionJoiner(const char* name, SessionJoinedCallback callback = 0);\n\n\n\n /**\n\n * destructor\n\n */\n\n virtual ~AsyncSessionJoiner();\n\n\n\n /**\n\n * JoinSessionCB\n\n * @param status\n\n * @param id\n\n * @param opts\n","file_path":"services/config/cpp/samples/ConfigClientSample/AsyncSessionJoiner.h","rank":16,"score":317848.070833551},{"content":" @Deprecated\n","file_path":"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java","rank":17,"score":312621.30235521914},{"content":"class AJNSessionListenerImpl : public ajn::SessionListener {\n\n protected:\n\n __weak AJNBusAttachment* busAttachment;\n\n\n\n /**\n\n * Objective C delegate called when one of the below virtual functions\n\n * is called.\n\n */\n\n __weak id<AJNSessionListener> m_delegate;\n\n\n\n public:\n\n /**\n\n * Constructor for the AJN session listener implementation.\n\n *\n\n * @param aBusAttachment Objective C bus attachment wrapper object.\n\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\n\n */\n\n AJNSessionListenerImpl(AJNBusAttachment* aBusAttachment, id<AJNSessionListener> aDelegate);\n\n\n\n /**\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionListenerImpl.h","rank":18,"score":311818.82364210486},{"content":" @Deprecated\n","file_path":"services/config/java/src/org/alljoyn/services/common/BusObjectDescription.java","rank":19,"score":309335.62614550075},{"content":"class MyBusListener : public BusListener, public SessionPortListener {\n\n\n\n public:\n\n MyBusListener() : BusListener() { }\n\n\n\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts);\n\n\n\n};\n\n\n\n/* Auth Listener */\n","file_path":"alljoyn_core/unit_test/ServiceSetup.h","rank":20,"score":303384.6273910875},{"content":"class AJNApplicationStateListenerImpl : public ajn::ApplicationStateListener {\n\n protected:\n\n /**\n\n * Objective C delegate called when one of the below virtual functions\n\n * is called.\n\n */\n\n __weak id<AJNApplicationStateListener> m_delegate;\n\n\n\n public:\n\n /**\n\n * Constructor for the AJNApplicationStateListener implementation.\n\n *\n\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\n\n */\n\n AJNApplicationStateListenerImpl(id<AJNApplicationStateListener> aDelegate);\n\n\n\n /**\n\n * Virtual destructor for derivable class.\n\n */\n\n virtual ~AJNApplicationStateListenerImpl();\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNApplicationStateListenerImpl.h","rank":21,"score":303279.0651083387},{"content":" int sessionId;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/AboutListenerTest.java","rank":22,"score":300522.25056413794},{"content":"class SessionPortListener : public ajn::SessionPortListener {\n\n public:\n\n\n","file_path":"alljoyn_js/jni/BusAttachmentHost.cc","rank":23,"score":299968.6799825398},{"content":"class AboutClientSessionListener : public ajn::SessionListener {\n\n public:\n\n AboutClientSessionListener(qcc::String inServiceName);\n\n\n\n virtual ~AboutClientSessionListener();\n\n\n\n void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\n\n\n\n private:\n\n\n\n qcc::String serviceName;\n\n\n\n};\n\n\n\n#endif /* ABOUTCLIENTSESSIONLISTENER_H_ */\n\n\n","file_path":"services/about/cpp/samples/AboutClientSample/AboutClientSessionListener.h","rank":24,"score":298531.8152308282},{"content":" @Override\n\n public void addBusObjectAnnouncements(List<BusObjectDescription> descriptions)\n\n {\n\n m_ObjectDescriptions.addAll(descriptions);\n","file_path":"services/about/java/src/org/alljoyn/about/AboutServiceImpl.java","rank":25,"score":298213.77727848035},{"content":"class SessionPortListenerCallbackC : public SessionPortListener {\n\n public:\n\n SessionPortListenerCallbackC(const alljoyn_sessionportlistener_callbacks* in_callbacks, const void* in_context)\n\n {\n\n QCC_DbgTrace((\"%s\", __FUNCTION__));\n\n memcpy(&callbacks, in_callbacks, sizeof(alljoyn_sessionportlistener_callbacks));\n\n context = in_context;\n\n }\n\n\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\n\n {\n\n QCC_DbgTrace((\"%s\", __FUNCTION__));\n\n QCC_BOOL ret = SessionPortListener::AcceptSessionJoiner(sessionPort, joiner, opts) ? QCC_TRUE : QCC_FALSE;\n\n if (callbacks.accept_session_joiner != NULL) {\n\n if (!DeferredCallback::sMainThreadCallbacksOnly) {\n\n ret = callbacks.accept_session_joiner(context, sessionPort, joiner, (alljoyn_sessionopts)(&opts));\n\n } else {\n\n DeferredCallback_4<QCC_BOOL, const void*, SessionPort, const char*, alljoyn_sessionopts>* dcb =\n\n new DeferredCallback_4<QCC_BOOL, const void*, SessionPort, const char*, alljoyn_sessionopts>(callbacks.accept_session_joiner, context, sessionPort, joiner, (alljoyn_sessionopts)(&opts));\n\n ret = DEFERRED_CALLBACK_EXECUTE(dcb);\n","file_path":"alljoyn_c/src/SessionPortListener.cc","rank":26,"score":298011.3917419807},{"content":"\n\n /**\n\n * Called by the bus when a session has been successfully joined. The session is now fully up.\n\n *\n\n * This callback is only used by session creators. Therefore it is only called on listeners\n\n * passed to BusAttachment::BindSessionPort.\n\n *\n\n * @param sessionPort Session port that was joined.\n\n * @param sessionId Id of session.\n\n * @param joiner Unique name of the joiner.\n\n */\n\n virtual void SessionJoined(ajn::SessionPort sessionPort, ajn::SessionId sessionId, const char* joiner);\n\n\n\n\n\n /**\n\n * Accessor for Objective-C delegate.\n\n *\n\n * return delegate The Objective-C delegate called to handle the above event methods.\n\n */\n\n id<AJNSessionPortListener> getDelegate();\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":27,"score":296101.1162275686},{"content":" AJNSessionPortListenerImpl(AJNBusAttachment* aBusAttachment, id<AJNSessionPortListener> aDelegate);\n\n\n\n /**\n\n * Virtual destructor for derivable class.\n\n */\n\n virtual ~AJNSessionPortListenerImpl();\n\n\n\n /**\n\n * Accept or reject an incoming JoinSession request. The session does not exist until this\n\n * after this function returns.\n\n *\n\n * This callback is only used by session creators. Therefore it is only called on listeners\n\n * passed to BusAttachment::BindSessionPort.\n\n *\n\n * @param sessionPort Session port that was joined.\n\n * @param joiner Unique name of potential joiner.\n\n * @param opts Session options requested by the joiner.\n\n * @return Return true if JoinSession request is accepted. false if rejected.\n\n */\n\n virtual bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts);\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":28,"score":296094.9925792182},{"content":"\n\n /**\n\n * Mutator for Objective-C delegate.\n\n *\n\n * @param delegate The Objective-C delegate called to handle the above event methods.\n\n */\n\n void setDelegate(id<AJNSessionPortListener> delegate);\n\n};\n\n\n\ninline id<AJNSessionPortListener> AJNSessionPortListenerImpl::getDelegate()\n\n{\n\n return m_delegate;\n\n}\n\n\n\ninline void AJNSessionPortListenerImpl::setDelegate(id<AJNSessionPortListener> delegate)\n\n{\n\n m_delegate = delegate;\n\n}\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":29,"score":296070.1372516573},{"content":"// WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED\n\n// WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE\n\n// AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\n\n// DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\n\n// PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n\n// PERFORMANCE OF THIS SOFTWARE.\n\n////////////////////////////////////////////////////////////////////////////////\n\n\n\n#import <Foundation/Foundation.h>\n\n#import <alljoyn/SessionPortListener.h>\n\n#import <alljoyn/TransportMask.h>\n\n#import \"AJNBusListener.h\"\n\n#import \"AJNBusAttachment.h\"\n\n\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":30,"score":296050.88355035346},{"content":"////////////////////////////////////////////////////////////////////////////////\n\n// Copyright (c) Open Connectivity Foundation (OCF), AllJoyn Open Source\n\n// Project (AJOSP) Contributors and others.\n\n//\n\n// SPDX-License-Identifier: Apache-2.0\n\n//\n\n// All rights reserved. This program and the accompanying materials are\n\n// made available under the terms of the Apache License, Version 2.0\n\n// which accompanies this distribution, and is available at\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Copyright (c) Open Connectivity Foundation and Contributors to AllSeen\n\n// Alliance. All rights reserved.\n\n//\n\n// Permission to use, copy, modify, and/or distribute this software for\n\n// any purpose with or without fee is hereby granted, provided that the\n\n// above copyright notice and this permission notice appear in all\n\n// copies.\n\n//\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h","rank":31,"score":296015.15322204144},{"content":"- (id)initWithVersion:(uint16_t)version port:(uint16_t)port busName:(NSString *)busName objectDescriptions:(NSMutableDictionary *)objectDescs aboutData:(NSMutableDictionary **)aboutData __deprecated;\n","file_path":"services/about/ios/inc/alljoyn/about/AJNAnnouncement.h","rank":32,"score":294964.94741872593},{"content":"class BasicClient: NSObject, AJNBusListener, AJNSessionListener, AJNJoinSessionDelegate {\n\n\n\n weak var delegate: BasicClientDelegate?\n\n\n\n private let joinedSessionCondition = NSCondition()\n\n private var bus: AJNBusAttachment?\n\n private var sessionId: AJNSessionId?\n\n private var foundServiceName: String?\n\n private var wasNameAlreadyFound = false\n\n private var clientQueue = DispatchQueue(label: \"org.alljoyn.swift.BasicClient.ClientQueue\")\n\n private var lockQueue = DispatchQueue(label: \"org.alljoyn.swift.BasicClient.LockQueue\")\n\n\n\n func sendHelloMessage() {\n\n clientQueue.async {\n\n self.wasNameAlreadyFound = false\n\n self.run()\n\n }\n\n }\n\n\n\n func run() {\n","file_path":"alljoyn_objc/samples/iOS/Swift/BasicClient/BasicClient/BasicClient.swift","rank":33,"score":293754.370759628},{"content":"class SessionListenerImpl : public ajn::SessionListener {\n\n public:\n\n /**\n\n * SessionListenerImpl\n\n * @param inServiceNAme\n\n */\n\n SessionListenerImpl(qcc::String const& inServiceNAme);\n\n\n\n /**\n\n * destructor\n\n */\n\n virtual ~SessionListenerImpl();\n\n\n\n /**\n\n * SessionLost\n\n * @param sessionId\n\n * @param reason\n\n */\n\n void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\n\n\n\n private:\n\n\n\n qcc::String serviceName;\n\n\n\n};\n\n\n\n#endif /* SESSIONLISTENERIMPL_H_ */\n\n\n","file_path":"services/config/cpp/samples/ConfigClientSample/SessionListenerImpl.h","rank":34,"score":291620.36618557794},{"content":"static const AJNInterfacePropertyAnnotationFlags kAJNInterfacePropertyEmitChangedSignalConst = 4;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceMember.h","rank":35,"score":286145.39092651405},{"content":"@class AJNInterfaceDescription;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusObject.h","rank":36,"score":286102.3935360234},{"content":" public int sessionId;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/AboutProxyTest.java","rank":37,"score":286087.9731392142},{"content":"class _SessionOptsInterface : public ScriptableObject {\n\n public:\n\n static std::map<qcc::String, int32_t>& Constants();\n\n _SessionOptsInterface(Plugin& plugin);\n\n virtual ~_SessionOptsInterface();\n\n\n\n private:\n\n static std::map<qcc::String, int32_t> constants;\n\n};\n\n\n\ntypedef qcc::ManagedObj<_SessionOptsInterface> SessionOptsInterface;\n\n\n\n#endif // _SESSIONOPTSINTERFACE_H\n","file_path":"alljoyn_js/jni/SessionOptsInterface.h","rank":38,"score":285280.46885034046},{"content":"class MySessionPortListener : public SessionPortListener {\n\n bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts)\n\n {\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n\n\n if (sessionPort != ASSIGNED_SESSION_PORT) {\n\n printf(\"Rejecting join attempt on unexpected session port %d\\n\", sessionPort);\n\n return false;\n\n }\n\n return true;\n\n }\n\n void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner)\n\n {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n\n\n printf(\"Session Joined SessionId = %u\\n\", id);\n\n }\n\n};\n\n\n","file_path":"alljoyn_core/samples/about/AboutService.cc","rank":39,"score":284600.1792538432},{"content":"class SessionJoinedSessionPortListener : public SessionPortListener {\n\n\n\n private:\n\n /* Private assigment operator - does nothing */\n\n SessionJoinedSessionPortListener& operator=(const SessionJoinedSessionPortListener&);\n\n\n\n BusAttachment& bus;\n\n SessionListener*sl;\n\n\n\n\n\n\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n\n\n sessionJoinerAcceptedFlag = true;\n\n return true;\n\n }\n\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\n","file_path":"alljoyn_core/unit_test/SessionTest.cc","rank":40,"score":283183.9581309152},{"content":"class JoinSession_SessionPortListener : public SessionPortListener, SessionListener {\n\n public:\n\n JoinSession_SessionPortListener(BusAttachment* bus) : bus(bus) { };\n\n\n\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n\n\n if (sessionPort == 42) {\n\n sessionAccepted = true;\n\n bus->EnableConcurrentCallbacks();\n\n return true;\n\n } else {\n\n sessionAccepted = false;\n\n return false;\n\n }\n\n }\n\n\n\n void SessionLost(SessionId id, SessionListener::SessionLostReason reason) {\n\n QCC_UNUSED(id);\n","file_path":"alljoyn_core/unit_test/BusAttachmentTest.cc","rank":41,"score":282111.13776820473},{"content":"@class AJNInterfaceMember;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNProxyBusObject.h","rank":42,"score":281576.19931048964},{"content":"@class AJNInterfaceDescription;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNProxyBusObject.h","rank":43,"score":281426.27762807725},{"content":" public int sessionId;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/AboutIconProxyTest.java","rank":44,"score":279953.4449723898},{"content":"class AnnounceListenerTestSessionPortListener : public SessionPortListener {\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n return true;\n\n }\n\n};\n\n\n\n\n","file_path":"alljoyn_core/unit_test/AboutListenerTest.cc","rank":45,"score":279804.3673016026},{"content":" class JoinSessionThread extends Thread {\n\n JoinSessionThread(String serviceName, short port, Map<String, Variant> announceData) {\n\n mServiceName = serviceName;\n\n mPort = port;\n\n mAnnounceData = announceData;\n\n }\n\n public void run() {\n\n attemptToJoinSession(mServiceName, mPort, mAnnounceData);\n\n }\n\n String mServiceName;\n\n short mPort;\n\n Map<String, Variant> mAnnounceData;\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":46,"score":279616.95965199417},{"content":"@interface AJNAboutObjectDescription : AJNObject\n\n\n\n/**\n\n * Get a list of the paths that are added to this AboutObjectDescription.\n\n * @return paths found in the AboutObjectDescription\n\n */\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNAboutObjectDescription.h","rank":47,"score":279433.52547042625},{"content":" Map<String, Variant> mAnnounceData;\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":48,"score":278552.19510551286},{"content":"class BindMemberSessionPortListener : public SessionPortListener {\n\n public:\n\n BindMemberSessionPortListener(BusAttachment* bus, BindMemberSessionListenerA* bindMemberSessionListener) :\n\n bus(bus),\n\n sessionListener(bindMemberSessionListener) { }\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n\n\n sessionJoinerAcceptedFlag = true;\n\n return true;\n\n }\n\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n\n\n bindMemberSessionId = id;\n\n sessionJoinedFlag = true;\n\n QStatus status = bus->SetSessionListener(id, sessionListener);\n\n EXPECT_EQ(ER_OK, status);\n\n }\n\n BusAttachment* bus;\n\n BindMemberSessionListenerA* sessionListener;\n\n};\n\n\n","file_path":"alljoyn_core/unit_test/SessionTest.cc","rank":49,"score":278324.91121574095},{"content":"@protocol AJNBusObject<AJNHandle>\n\n\n\n/**\n\n * Return the path for the object\n\n *\n\n * @return Object path\n\n */\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusObject.h","rank":50,"score":277311.61240903585},{"content":"class SessionJoinedListenerNative : public NativeObject {\n\n public:\n\n SessionJoinedListenerNative(Plugin& plugin, NPObject* objectValue);\n\n virtual ~SessionJoinedListenerNative();\n\n\n\n void onJoined(ajn::SessionPort port, ajn::SessionId id, const qcc::String& joiner);\n\n};\n\n\n\n#endif // _SESSIONJOINEDLISTENERNATIVE_H\n","file_path":"alljoyn_js/jni/SessionJoinedListenerNative.h","rank":51,"score":277248.5851079859},{"content":"@interface AJNInterfaceProperty : AJNObject\n\n\n\n/** Name of the property */\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceProperty.h","rank":52,"score":277046.586994512},{"content":"@protocol AJNServiceDelegate <AJNBusControllerDelegate>\n\n\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNServiceController.h","rank":53,"score":276545.84907169134},{"content":" public void run() {\n\n attemptToJoinSession(mServiceName, mPort, mAnnounceData);\n","file_path":"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java","rank":54,"score":276063.19587232673},{"content":" public void sessionMemberAdded(int sessionId, String uniqueName) {\n\n sessionMemberAddedFlagA = true;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java","rank":55,"score":275540.72779271664},{"content":" public void sessionMemberRemoved(int sessionId, String uniqueName) {\n\n sessionMemberRemovedFlagA = true;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java","rank":56,"score":275540.72779271664},{"content":" private int mSessionId = 0;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":57,"score":274792.52147756726},{"content":"- (QStatus)setLinkTimeoutAsync:(uint32_t)timeout forSession:(AJNSessionId)sessionId completionBlock:(AJNLinkTimeoutBlock) block context:(void *)context;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusAttachment.h","rank":58,"score":273248.05160177976},{"content":"- (void)didJoinInSession:(AJNSessionId)sessionId withService:(NSString *)serviceName;\n","file_path":"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNClientController.h","rank":59,"score":273248.05160177976},{"content":"struct SessionJoinerContext {\n\n qcc::String busName;\n\n AboutClientSessionListener* aboutClientSessionListener;\n\n\n\n SessionJoinerContext(qcc::String name, AboutClientSessionListener* absl) :\n\n busName(name), aboutClientSessionListener(absl) { }\n\n};\n\n\n","file_path":"services/about/cpp/samples/AboutClientSample/AboutClientSessionJoiner.h","rank":60,"score":273226.5567859194},{"content":"class IpNameServiceListener {\n\n public:\n\n virtual ~IpNameServiceListener() { }\n\n virtual bool QueryHandler(TransportMask transport, MDNSPacket query, const qcc::IPEndpoint& src, const qcc::IPEndpoint& dst) {\n\n QCC_UNUSED(transport);\n\n QCC_UNUSED(query);\n\n QCC_UNUSED(src);\n\n QCC_UNUSED(dst);\n\n return false;\n\n }\n\n virtual bool ResponseHandler(TransportMask transport, MDNSPacket response, uint16_t recvPort) {\n\n QCC_UNUSED(transport);\n\n QCC_UNUSED(response);\n\n QCC_UNUSED(recvPort);\n\n return false;\n\n }\n\n};\n\n\n\n/**\n\n * @brief API to provide an implementation dependent IP (Layer 3) Name Service\n","file_path":"alljoyn_core/router/ns/IpNameService.h","rank":61,"score":271860.85526184225},{"content":" public int getSessionId() {\n\n return mSessionId;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":62,"score":271847.63053241855},{"content":" private int mSessionId = 0;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":63,"score":271754.08032604575},{"content":" public void sessionJoined(short sessionPort, int id, String joiner) {}\n","file_path":"alljoyn_java/test/org/alljoyn/bus/SecurityApplicationProxyTest.java","rank":64,"score":270378.46623088676},{"content":"class AcceptSessionJoinerListenerNative : public NativeObject {\n\n public:\n\n AcceptSessionJoinerListenerNative(Plugin& plugin, NPObject* objectValue);\n\n virtual ~AcceptSessionJoinerListenerNative();\n\n\n\n bool onAccept(ajn::SessionPort port, const qcc::String& joiner, SessionOptsHost& opts);\n\n};\n\n\n\n#endif // _ACCEPTSESSIONJOINERLISTENERNATIVE_H\n","file_path":"alljoyn_js/jni/AcceptSessionJoinerListenerNative.h","rank":65,"score":269848.0955506684},{"content":"class SessionMemberAddedListenerNative : public NativeObject {\n\n public:\n\n SessionMemberAddedListenerNative(Plugin& plugin, NPObject* objectValue);\n\n virtual ~SessionMemberAddedListenerNative();\n\n\n\n void onMemberAdded(ajn::SessionId id, const qcc::String& uniqueName);\n\n};\n\n\n\n#endif // _SESSIONMEMBERADDEDLISTENERNATIVE_H\n","file_path":"alljoyn_js/jni/SessionMemberAddedListenerNative.h","rank":66,"score":269836.77639379096},{"content":"class SessionMemberRemovedListenerNative : public NativeObject {\n\n public:\n\n SessionMemberRemovedListenerNative(Plugin& plugin, NPObject* objectValue);\n\n virtual ~SessionMemberRemovedListenerNative();\n\n\n\n void onMemberRemoved(ajn::SessionId id, const qcc::String& uniqueName);\n\n};\n\n\n\n#endif // _SESSIONMEMBERREMOVEDLISTENERNATIVE_H\n","file_path":"alljoyn_js/jni/SessionMemberRemovedListenerNative.h","rank":67,"score":269836.77639379096},{"content":"class BindSessionPortCallbackContext : public CallbackContext {\n\n public:\n\n ajn::SessionPort port;\n\n BindSessionPortCallbackContext(CallbackNative* callbackNative, QStatus status, ajn::SessionPort port) :\n\n CallbackContext(callbackNative, status),\n\n port(port) { }\n\n};\n\n\n\nvoid CallbackNative::DispatchCallback(Plugin& plugin, CallbackNative* callbackNative, QStatus status, ajn::SessionPort port)\n\n{\n\n PluginData::Callback callback(plugin, _BindSessionPortCallbackCB);\n\n callback->context = new BindSessionPortCallbackContext(callbackNative, status, port);\n\n PluginData::DispatchCallback(callback);\n\n}\n\n\n\nvoid CallbackNative::_BindSessionPortCallbackCB(PluginData::CallbackContext* ctx)\n\n{\n\n BindSessionPortCallbackContext* context = static_cast<BindSessionPortCallbackContext*>(ctx);\n\n context->callbackNative->onCallback(context->status, context->port);\n\n}\n\n\n","file_path":"alljoyn_js/jni/CallbackNative.cc","rank":68,"score":269337.0019873697},{"content":" public int getSessionId() {\n\n return mSessionId;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":69,"score":268876.0356088272},{"content":" public void sessionJoined(short sessionPort, int id, String joiner) {}\n","file_path":"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java","rank":70,"score":268343.876779462},{"content":"class BindMemberJoinSessionAsyncCB : public ajn::BusAttachment::JoinSessionAsyncCB {\n\n public:\n\n virtual void JoinSessionCB(QStatus status, SessionId sessionId, const SessionOpts& opts, void* context) {\n\n QCC_UNUSED(sessionId);\n\n QCC_UNUSED(opts);\n\n QCC_UNUSED(context);\n\n\n\n EXPECT_EQ(ER_OK, status);\n\n sessionJoinedCBFlag = true;\n\n }\n\n};\n\nTEST_F(SessionTest, BindMemberAddedRemoved) {\n\n QStatus status = ER_FAIL;\n\n /* make sure global flags are initialized */\n\n sessionMemberAddedFlagA = false;\n\n sessionMemberRemovedFlagA = false;\n\n sessionMemberAddedFlagB = false;\n\n sessionMemberRemovedFlagB = false;\n\n sessionMemberAddedFlagC = false;\n\n sessionMemberRemovedFlagC = false;\n","file_path":"alljoyn_core/unit_test/SessionTest.cc","rank":71,"score":268221.9742260587},{"content":" public boolean isConnected() {\n\n return mIsConnected;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":72,"score":268041.65550288593},{"content":" private boolean mIsConnected = false;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":73,"score":268041.65550288593},{"content":" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {\n\n return true;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/SecurityApplicationProxyTest.java","rank":74,"score":266805.9759365538},{"content":" static int sessionId;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsService/src/org/alljoyn/bus/samples/Service.java","rank":75,"score":265242.0371739067},{"content":" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {return false;}\n","file_path":"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java","rank":76,"score":265193.61697020347},{"content":" public boolean isConnected() {\n\n return mIsConnected;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":77,"score":264872.6062592003},{"content":" private boolean mIsConnected = false;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java","rank":78,"score":264872.6062592003},{"content":"class RemoveSessionMemberBusAListener : public SessionPortListener, public SessionListener {\n\n public:\n\n RemoveSessionMemberBusAListener(BusAttachment* bus) : bus(bus) {\n\n }\n\n\n\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n sessionJoinerAcceptedFlag = true;\n\n return true;\n\n }\n\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\n\n QCC_UNUSED(sessionPort);\n\n\n\n bindMemberSessionId = id;\n\n sessionJoinedTestJoiner = joiner;\n\n sessionJoinedFlag = true;\n\n ++sessionJoinedCounter;\n\n EXPECT_EQ(ER_OK, bus->SetHostedSessionListener(id, this));\n","file_path":"alljoyn_core/unit_test/SessionTest.cc","rank":79,"score":264765.3941336497},{"content":"class MyBusListener : public BusListener, public SessionPortListener, public SessionListener {\n\n public:\n\n\n\n MyBusListener(JavaVM* vm, jobject& jobj) : vm(vm), jobj(jobj), _id(0) { }\n\n\n\n void NameOwnerChanged(const char* busName, const char* previousOwner, const char* newOwner)\n\n {\n\n }\n\n\n\n /* Accept an incoming JoinSession request */\n\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\n\n {\n\n if (sessionPort != SESSION_PORT) {\n\n LOGE(\"Rejecting join attempt on non-chat session port %d\\n\", sessionPort);\n\n return false;\n\n }\n\n\n\n LOGD(\"Accepting join session request from %s (opts.proximity=%x, opts.traffic=%x, opts.transports=%x)\\n\",\n\n joiner, opts.proximity, opts.traffic, opts.transports);\n\n\n","file_path":"alljoyn_core/samples/simple/android/service/jni/Service_jni.cpp","rank":80,"score":263529.8905985035},{"content":" public void sessionJoined(short sessionPort, int id, String joiner) {}\n","file_path":"alljoyn_java/test/org/alljoyn/bus/SecurityProxyBusObjectTest.java","rank":81,"score":263136.87386225443},{"content":" private native void create();\n","file_path":"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java","rank":82,"score":263023.1127368889},{"content":" private native void create();\n","file_path":"alljoyn_java/src/org/alljoyn/bus/OnJoinSessionListener.java","rank":83,"score":263014.03204567917},{"content":" static int sessionId;\n","file_path":"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionService/src/org/alljoyn/bus/samples/Service.java","rank":84,"score":262409.73421092366},{"content":" int sessionId;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/AboutDataCheckTest.java","rank":85,"score":262347.08496037254},{"content":" @Override\n\n public void sessionJoined(short sessionPort, int id, String joiner) {\n\n sessionJoinedFlag = true;\n\n bus.setSessionListener(id, new SessionListener() {\n\n public void sessionLost(final int sessionId, int reason) {\n\n sessionLostFlagA = true;\n\n }\n\n public void sessionMemberAdded(int sessionId, String uniqueName) {\n\n sessionMemberAddedFlagA = true;\n\n }\n\n public void sessionMemberRemoved(int sessionId, String uniqueName) {\n\n sessionMemberRemovedFlagA = true;\n\n }\n\n });\n","file_path":"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java","rank":86,"score":262067.03521314063},{"content":" public void sessionLost(final int sessionId, int reason) {\n\n sessionLostFlagA = true;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java","rank":87,"score":260962.736233726},{"content":" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {\n\n return true;\n","file_path":"alljoyn_java/test/org/alljoyn/bus/SecurityProxyBusObjectTest.java","rank":88,"score":259756.11883304664},{"content":" short port;\n","file_path":"services/config/java/samples/java/ConfigClientSample/src/org/alljoyn/config/samples/configclient/ConfigApplication.java","rank":89,"score":259108.82335958473},{"content":" @Deprecated\n","file_path":"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java","rank":90,"score":258626.5467604007},{"content":" @Override\n\n public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts sessionOpts) {\n\n if (sessionPort == 42) {\n\n sessionAccepted = true;\n\n return true;\n\n } else {\n\n sessionAccepted = false;\n\n return false;\n\n }\n","file_path":"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java","rank":91,"score":258546.07024760763},{"content":" UUID appId;\n","file_path":"services/config/java/samples/java/ConfigClientSample/src/org/alljoyn/config/samples/configclient/ConfigApplication.java","rank":92,"score":256226.7933274436},{"content":"class Service : public App, private SessionPortListener, private SessionListener {\n\n public:\n\n Service(BusAttachment& bus);\n\n ~Service();\n\n\n\n private:\n\n BusAttachment& bus;\n\n multimap<SessionId, BusObject*> objects;\n\n SessionPort port;\n\n\n\n void Add(SessionId id, bool autoUpdate);\n\n\n\n // SessionPortListener methods\n\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n\n return true;\n\n }\n\n void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner);\n","file_path":"alljoyn_core/test/proptester.cc","rank":93,"score":256130.49228565392},{"content":"class Service : public App, private SessionPortListener, private SessionListener {\n\n public:\n\n Service(BusAttachment& bus, int nbrOfObjects);\n\n ~Service();\n\n\n\n void Execute(uint64_t timeToRun);\n\n\n\n private:\n\n BusAttachment& bus;\n\n int nbrOfObjects;\n\n multimap<SessionId, PropTesterObject*> objects;\n\n SessionPort port;\n\n\n\n void Add(SessionId id, uint32_t number);\n\n\n\n // SessionPortListener methods\n\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\n\n QCC_UNUSED(sessionPort);\n\n QCC_UNUSED(joiner);\n\n QCC_UNUSED(opts);\n","file_path":"alljoyn_core/test/propstresstest.cc","rank":94,"score":256130.49228565392},{"content":" @Deprecated\n\n public String getPath()\n\n {\n\n return path;\n","file_path":"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java","rank":95,"score":255638.41753945046},{"content":" */\n\n void shutdown();\n\n\n\n /* From About */\n\n void Announce(unsigned short version, unsigned short port, const char* busName,\n\n const ajn::services::AboutClient::ObjectDescriptions& objectDescs,\n\n const ajn::services::AboutClient::AboutData& aboutData);\n\n\n\n void EventHandler(const ajn::InterfaceDescription::Member* member, const char* srcPath, ajn::Message& msg);\n\n\n\n /* For MethodCallAsync */\n\n void AsyncCallReplyHandler(ajn::Message& msg, void* context);\n\n\n\n /* From SessionListener */\n\n virtual void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\n\n\n\n /** JoinSessionAsync callback */\n\n virtual void JoinSessionCB(QStatus status, ajn::SessionId sessionId, const ajn::SessionOpts& opts, void* context);\n\n\n\n private:\n","file_path":"alljoyn_core/samples/eventaction/Android_test_tools/Events/jni/MyAllJoynCode.h","rank":96,"score":129.8947158802489},{"content":"using namespace std;\n\nusing namespace qcc;\n\nusing namespace ajn;\n\n\n\n/** Static top level message bus object */\n\nstatic BusAttachment* s_msgBus = nullptr;\n\n\n\nstatic const char* INTERFACE_NAME = \"org.alljoyn.Bus.signal_sample\";\n\nstatic const char* SERVICE_NAME = \"org.alljoyn.Bus.signal_sample\";\n\nstatic const char* SERVICE_PATH = \"/\";\n\nstatic const SessionPort SERVICE_PORT = 25;\n\n\n\nstatic volatile sig_atomic_t s_interrupt = false;\n\n\n\nstatic void CDECL_CALL SigIntHandler(int sig)\n\n{\n\n QCC_UNUSED(sig);\n\n s_interrupt = true;\n\n}\n\n\n\nstatic const char* tags[] = { \"en\", \"de\", \"hi\" };\n\nstatic const char* objId = \"obj\";\n\nstatic const char* objDescription[] = { \"This is the object\", \"Es ist das Objekt\", \"Ye Object hai\" };\n\n\n","file_path":"alljoyn_core/samples/basic/signal_service.cc","rank":97,"score":126.85039777068097},{"content":"\n\n bool enableEvent(EventInfo* event);\n\n\n\n /**\n\n * Free up and release the objects used\n\n */\n\n void shutdown();\n\n\n\n /* From About */\n\n void Announced(const char* busName, uint16_t version, ajn::SessionPort port,\n\n const ajn::MsgArg& objectDescriptionArg, const ajn::MsgArg& aboutDataArg);\n\n\n\n void EventHandler(const ajn::InterfaceDescription::Member* member, const char* srcPath, ajn::Message& msg);\n\n\n\n /* For MethodCallAsync */\n\n void AsyncCallReplyHandler(ajn::Message& msg, void* context);\n\n\n\n /* From SessionListener */\n\n virtual void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\n\n\n","file_path":"alljoyn_core/samples/eventaction/Android/jni/event/MyEventCode.h","rank":98,"score":119.06379387901552},{"content":" /**\n\n * Setup AllJoyn, creating the objects needed and registering listeners.\n\n *\n\n * @param packageName\tThis value is provided to the BusAttachment constructor to name the application\n\n *\n\n */\n\n void initialize(const char* packageName);\n\n\n\n /**\n\n * Free up and release the objects used\n\n */\n\n void shutdown();\n\n\n\n private:\n\n\n\n /* From About */\n\n void Announced(const char* busName, uint16_t version, ajn::SessionPort port, const ajn::MsgArg& objectDescriptionArg, const ajn::MsgArg& aboutDataArg);\n\n\n\n /* From SessionPortListener */\n\n virtual bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts);\n","file_path":"alljoyn_core/samples/eventaction/SimpleRulesEngine/posix/MyAllJoynCode.h","rank":99,"score":113.43479064180853}],"string":"[\n {\n \"content\": \"class BasicService: NSObject, AJNBusListener, AJNSessionPortListener, AJNSessionListener {\\n\\n\\n\\n weak var delegate: BasicServiceDelegate?\\n\\n\\n\\n private var bus: AJNBusAttachment?\\n\\n private var basicObject: BasicObject?\\n\\n\\n\\n func startServiceAsync() {\\n\\n DispatchQueue.global(qos: .default).async {\\n\\n self.startService()\\n\\n }\\n\\n }\\n\\n\\n\\n func stopServiceAsync() {\\n\\n DispatchQueue.global(qos: .default).async {\\n\\n self.stopService(bus: self.bus)\\n\\n }\\n\\n }\\n\\n\\n\\n func printVersionInformation() {\\n\",\n \"file_path\": \"alljoyn_objc/samples/iOS/Swift/BasicService/BasicService/BasicService.swift\",\n \"rank\": 0,\n \"score\": 381462.0778109959\n },\n {\n \"content\": \"class AJNSessionPortListenerImpl : public ajn::SessionPortListener {\\n\\n protected:\\n\\n static const char* AJN_SESSION_PORT_LISTENER_DISPATCH_QUEUE_NAME;\\n\\n __weak AJNBusAttachment* busAttachment;\\n\\n\\n\\n /**\\n\\n * Objective C delegate called when one of the below virtual functions\\n\\n * is called.\\n\\n */\\n\\n __weak id<AJNSessionPortListener> m_delegate;\\n\\n\\n\\n public:\\n\\n\\n\\n\\n\\n /**\\n\\n * Constructor for the AJN session port listener implementation.\\n\\n *\\n\\n * @param aBusAttachment Objective C bus attachment wrapper object.\\n\\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\\n\\n */\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 1,\n \"score\": 379336.7882531101\n },\n {\n \"content\": \"class CommonBusListener : public ajn::BusListener, public ajn::SessionPortListener, public ajn::SessionListener {\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Constructor of CommonBusListener\\n\\n * @param bus - used to set a session Listener\\n\\n * @param daemonDisconnectCB - used to set a callback for when the daemon is disconnected\\n\\n */\\n\\n CommonBusListener(ajn::BusAttachment* bus = NULL, void(*daemonDisconnectCB)() = NULL);\\n\\n\\n\\n /**\\n\\n * Destructor of CommonBusListener\\n\\n */\\n\\n ~CommonBusListener();\\n\\n\\n\\n /**\\n\\n * AcceptSessionJoiner - Receive request to join session and decide whether to accept it or not\\n\\n * @param sessionPort - the port of the request\\n\\n * @param joiner - the name of the joiner\\n\",\n \"file_path\": \"services/config/cpp/samples/ConfigServiceSample/CommonBusListener.h\",\n \"rank\": 2,\n \"score\": 363938.44836993434\n },\n {\n \"content\": \"class BusListenerImpl : public ajn::BusListener, public ajn::SessionPortListener {\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Constructor of CommonBusListener\\n\\n */\\n\\n BusListenerImpl();\\n\\n\\n\\n /**\\n\\n * Constructor of CommonBusListener\\n\\n * @param sessionPort - port of listener\\n\\n */\\n\\n BusListenerImpl(ajn::SessionPort sessionPort);\\n\\n\\n\\n /**\\n\\n * Destructor of CommonBusListener\\n\\n */\\n\\n ~BusListenerImpl();\\n\\n\\n\",\n \"file_path\": \"services/about/cpp/samples/AboutServiceSample/BusListenerImpl.h\",\n \"rank\": 3,\n \"score\": 352220.17762932804\n },\n {\n \"content\": \"class SessionlessObj : public BusObject, public NameListener, public SessionListener, public SessionPortListener,\\n\\n public BusAttachment::JoinSessionAsyncCB, public qcc::AlarmListener, public IpNameServiceListener {\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Constructor\\n\\n *\\n\\n * @param bus Bus to associate with org.freedesktop.DBus message handler.\\n\\n * @param router The DaemonRouter associated with the bus.\\n\\n * @param busController Controller that created this object.\\n\\n */\\n\\n SessionlessObj(Bus& bus, BusController* busController, DaemonRouter& router);\\n\\n\\n\\n /**\\n\\n * Destructor\\n\\n */\\n\\n ~SessionlessObj();\\n\\n\\n\\n /**\\n\\n * Initialize and register this DBusObj instance.\\n\",\n \"file_path\": \"alljoyn_core/router/SessionlessObj.h\",\n \"rank\": 4,\n \"score\": 348980.1591546877\n },\n {\n \"content\": \"- (void)sessionWasLost:(AJNSessionId)sessionId;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionListener.h\",\n \"rank\": 5,\n \"score\": 344762.494908794\n },\n {\n \"content\": \"class AboutInterfaceTestSessionPortListener : public SessionPortListener {\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\\n\\n {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n/*\\n\\n * A PropertyStoreImplementation with all of the AboutData fields filled out.\\n\\n * The AppId and DeviceId are generated at random using the qcc::GUID function\\n\\n */\\n\",\n \"file_path\": \"services/about/cpp/unit_test/AboutInterfaceTest.cc\",\n \"rank\": 6,\n \"score\": 340874.3751309329\n },\n {\n \"content\": \" String mServiceName;\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 7,\n \"score\": 335733.37415119883\n },\n {\n \"content\": \"class JoinAnnounceHandler : public ajn::services::AnnounceHandler {\\n\\n public:\\n\\n virtual void Announce(unsigned short version, unsigned short port, const char* busName,\\n\\n const ObjectDescriptions& objectDescs, const AboutData& aboutData)\\n\\n {\\n\\n QCC_UNUSED(objectDescs);\\n\\n EXPECT_EQ(1, version);\\n\\n EXPECT_EQ(25, port);\\n\\n char* deviceName;\\n\\n aboutData.find(\\\"DeviceName\\\")->second.Get(\\\"s\\\", &deviceName);\\n\\n EXPECT_STREQ(\\\"AnnounceHandler Unit Test framework\\\", deviceName);\\n\\n char* defaultLanguage;\\n\\n aboutData.find(\\\"DefaultLanguage\\\")->second.Get(\\\"s\\\", &defaultLanguage);\\n\\n EXPECT_STREQ(\\\"en\\\", defaultLanguage);\\n\\n char* appName;\\n\\n aboutData.find(\\\"AppName\\\")->second.Get(\\\"s\\\", &appName);\\n\\n EXPECT_STREQ(\\\"AnnounceHander Unit Test\\\", appName);\\n\\n announcePort = port;\\n\\n announceBusName = busName;\\n\\n announceHandlerFlag = true;\\n\",\n \"file_path\": \"services/about/cpp/unit_test/AboutInterfaceTest.cc\",\n \"rank\": 8,\n \"score\": 335511.1062483499\n },\n {\n \"content\": \"- (QStatus)addMember:(AJNMessageType)type name:(NSString*)name inputSig:(NSString*)inputSig outSig:(NSString*)outSig argNames:(NSString*)argNames annotation:(uint8_t)annotation accessPerms:(NSString*)accessPerms;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceDescription.h\",\n \"rank\": 9,\n \"score\": 332874.66350902256\n },\n {\n \"content\": \"class AnnounceHandlerTestSessionPortListener : public SessionPortListener {\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\\n\\n {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"services/about/cpp/unit_test/AnnounceHandler2Test.cc\",\n \"rank\": 10,\n \"score\": 332515.2214987622\n },\n {\n \"content\": \"class AnnounceHandlerTestSessionPortListener : public SessionPortListener {\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n/*\\n\\n * A PropertyStoreImplementation with all of the AboutData fields filled out.\\n\\n * The AppId and DeviceId are generated at random using the qcc::GUID function\\n\\n */\\n\",\n \"file_path\": \"services/about/cpp/unit_test/AnnounceHandlerTest.cc\",\n \"rank\": 11,\n \"score\": 332515.2214987622\n },\n {\n \"content\": \"//ASACORE-651\\n\\nclass RemoveObjectDescriptionAnnounceHandler : public ajn::services::AnnounceHandler {\\n\\n\\n\\n public:\\n\\n RemoveObjectDescriptionAnnounceHandler(const char* objToBeRemoved) : announceHandlerCount(0), toRemove(objToBeRemoved) { }\\n\\n void Announce(unsigned short version, unsigned short port, const char* busName, const ObjectDescriptions& objectDescs,\\n\\n const AboutData& aboutData) {\\n\\n QCC_UNUSED(version);\\n\\n QCC_UNUSED(port);\\n\\n QCC_UNUSED(busName);\\n\\n QCC_UNUSED(aboutData);\\n\\n\\n\\n if (announceHandlerCount == 0) {\\n\\n EXPECT_NE(objectDescs.end(), objectDescs.find(\\\"/org/alljoyn/test/a\\\"));\\n\\n EXPECT_NE(objectDescs.end(), objectDescs.find(\\\"/org/alljoyn/test/b\\\"));\\n\\n } else {\\n\\n if (toRemove == \\\"/org/alljoyn/test/b\\\") {\\n\\n EXPECT_NE(objectDescs.end(), objectDescs.find(\\\"/org/alljoyn/test/a\\\"));\\n\\n EXPECT_EQ(objectDescs.end(), objectDescs.find(\\\"/org/alljoyn/test/b\\\"));\\n\\n } else {\\n\\n EXPECT_EQ(objectDescs.end(), objectDescs.find(\\\"/org/alljoyn/test/a\\\"));\\n\",\n \"file_path\": \"services/about/cpp/unit_test/AnnounceHandlerTest.cc\",\n \"rank\": 12,\n \"score\": 329887.5074416655\n },\n {\n \"content\": \"class AboutClientSessionJoiner : public ajn::BusAttachment::JoinSessionAsyncCB {\\n\\n\\n\\n public:\\n\\n\\n\\n AboutClientSessionJoiner(ajn::BusAttachment& bus, const qcc::String& busName, SessionJoinedCallback callback = 0);\\n\\n\\n\\n virtual ~AboutClientSessionJoiner();\\n\\n\\n\\n void JoinSessionCB(QStatus status, ajn::SessionId id, const ajn::SessionOpts& opts, void* context);\\n\\n\\n\\n private:\\n\\n /* Private assigment operator - does nothing */\\n\\n AboutClientSessionJoiner operator=(const AboutClientSessionJoiner&);\\n\\n\\n\\n ajn::BusAttachment& bus;\\n\\n\\n\\n qcc::String m_BusName;\\n\\n\\n\\n SessionJoinedCallback m_Callback;\\n\\n};\\n\\n\\n\\n#endif /* ABOUTCLIENTSESSIONJOINER_H_ */\\n\",\n \"file_path\": \"services/about/cpp/samples/AboutClientSample/AboutClientSessionJoiner.h\",\n \"rank\": 13,\n \"score\": 326037.7320273883\n },\n {\n \"content\": \" short mPort;\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 14,\n \"score\": 322424.14541038126\n },\n {\n \"content\": \" public void attemptToJoinSession(String serviceName, short port, Map<String, Variant> announceData)\\n\\n {\\n\\n SessionOpts sessionOpts = new SessionOpts();\\n\\n sessionOpts.traffic = SessionOpts.TRAFFIC_MESSAGES;\\n\\n sessionOpts.isMultipoint = false;\\n\\n sessionOpts.proximity = SessionOpts.PROXIMITY_ANY;\\n\\n sessionOpts.transports = SessionOpts.TRANSPORT_ANY;\\n\\n\\n\\n Mutable.IntegerValue sessionId = new Mutable.IntegerValue();\\n\\n\\n\\n Status status = mBusAttachment.joinSession(serviceName, port, sessionId, sessionOpts, new SessionListener());\\n\\n if (Status.OK == status) {\\n\\n System.out.println(\\\"Succesfully joined session with: \\\\\\\"\\\" + serviceName + \\\"\\\\\\\" SessionId: \\\\\\\"\\\" + sessionId.value +\\\"\\\\\\\"\\\");\\n\\n ProxyBusObject aboutObj = mBusAttachment.getProxyBusObject(serviceName, AboutTransport.OBJ_PATH,\\n\\n sessionId.value, new Class<?>[] { AboutTransport.class});\\n\\n AboutTransport aboutIntf = aboutObj.getInterface(AboutTransport.class);\\n\\n try {\\n\\n /*\\n\\n * Get property org.alljoyn.About.Version\\n\\n */\\n\\n System.out.println(\\\"--------------Getting org.alljoyn.About.Version property-------------\\\");\\n\\n int version = aboutIntf.getVersion();\\n\\n System.out.println(\\\"version: \\\" + version);\\n\\n } catch(BusException e1){\\n\\n System.out.println(e1.getMessage());\\n\\n }\\n\\n\\n\\n try{\\n\\n /*\\n\\n * Call org.alljoyn.About.GetObjectDescription method for default language\\n\\n */\\n\\n System.out.println(\\\"--------Calling org.alljoyn.About.GetObjectDescription method--------\\\");\\n\\n BusObjectDescription[] objDescription = aboutIntf.GetObjectDescription();\\n\\n System.out.println(\\\"ObjectDescriptions:\\\");\\n\\n for(BusObjectDescription busObjectDescription : objDescription) {\\n\\n System.out.println(\\\"\\\\tObjectPath = \\\" + busObjectDescription.path);\\n\\n for(String allJoynInterface : busObjectDescription.interfaces) {\\n\\n System.out.println(\\\"\\\\t\\\\tInterface = \\\" + allJoynInterface);\\n\\n }\\n\\n }\\n\\n } catch(BusException e2) {\\n\\n System.out.println(e2.getMessage());\\n\\n }\\n\\n\\n\\n try {\\n\\n /*\\n\\n * Call org.alljoyn.About.GetAboutData method for default language\\n\\n */\\n\\n String defaultLanguage = announceData.get(AboutKeys.ABOUT_DEFAULT_LANGUAGE).getObject(String.class);\\n\\n System.out.println(\\\"---------Calling org.alljoyn.About.GetAboutData method for \\\" + defaultLanguage + \\\"--------\\\");\\n\\n Map<String, Variant> defaultAboutData = aboutIntf.GetAboutData(defaultLanguage);\\n\\n System.out.println(\\\"AboutData: for \\\" + defaultLanguage + \\\" language\\\");\\n\\n printAboutData(defaultAboutData);\\n\\n\\n\\n Variant variant = defaultAboutData.get(AboutKeys.ABOUT_SUPPORTED_LANGUAGES);\\n\\n String[] supportedLangs = variant.getObject(String[].class);\\n\\n /*\\n\\n * Call org.alljoyn.About.GetAboutData method for supported languages\\n\\n */\\n\\n for (String lang: supportedLangs) {\\n\\n if (!lang.equals(defaultLanguage)) {\\n\\n System.out.println(\\\"---------Calling org.alljoyn.About.GetAboutData method for \\\" + lang + \\\"--------\\\");\\n\\n Map<String, Variant> aboutData = aboutIntf.GetAboutData(lang);\\n\\n System.out.println(\\\"AboutData: for \\\" + lang + \\\" language\\\");\\n\\n printAboutData(aboutData);\\n\\n }\\n\\n }\\n\\n\\n\\n } catch(BusException e3) {\\n\\n System.out.println(e3.getMessage());\\n\\n }\\n\\n status = mBusAttachment.leaveSession(sessionId.value);\\n\\n if (Status.OK == status) {\\n\\n System.out.println(\\\"left session with: \\\\\\\"\\\" + serviceName + \\\"\\\\\\\" SessionId: \\\\\\\"\\\" + sessionId.value +\\\"\\\\\\\"\\\");\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 15,\n \"score\": 321821.6788206335\n },\n {\n \"content\": \"class AsyncSessionJoiner : public ajn::BusAttachment::JoinSessionAsyncCB {\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Constructor\\n\\n * @param name\\n\\n * @param callback\\n\\n */\\n\\n AsyncSessionJoiner(const char* name, SessionJoinedCallback callback = 0);\\n\\n\\n\\n /**\\n\\n * destructor\\n\\n */\\n\\n virtual ~AsyncSessionJoiner();\\n\\n\\n\\n /**\\n\\n * JoinSessionCB\\n\\n * @param status\\n\\n * @param id\\n\\n * @param opts\\n\",\n \"file_path\": \"services/config/cpp/samples/ConfigClientSample/AsyncSessionJoiner.h\",\n \"rank\": 16,\n \"score\": 317848.070833551\n },\n {\n \"content\": \" @Deprecated\\n\",\n \"file_path\": \"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java\",\n \"rank\": 17,\n \"score\": 312621.30235521914\n },\n {\n \"content\": \"class AJNSessionListenerImpl : public ajn::SessionListener {\\n\\n protected:\\n\\n __weak AJNBusAttachment* busAttachment;\\n\\n\\n\\n /**\\n\\n * Objective C delegate called when one of the below virtual functions\\n\\n * is called.\\n\\n */\\n\\n __weak id<AJNSessionListener> m_delegate;\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Constructor for the AJN session listener implementation.\\n\\n *\\n\\n * @param aBusAttachment Objective C bus attachment wrapper object.\\n\\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\\n\\n */\\n\\n AJNSessionListenerImpl(AJNBusAttachment* aBusAttachment, id<AJNSessionListener> aDelegate);\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionListenerImpl.h\",\n \"rank\": 18,\n \"score\": 311818.82364210486\n },\n {\n \"content\": \" @Deprecated\\n\",\n \"file_path\": \"services/config/java/src/org/alljoyn/services/common/BusObjectDescription.java\",\n \"rank\": 19,\n \"score\": 309335.62614550075\n },\n {\n \"content\": \"class MyBusListener : public BusListener, public SessionPortListener {\\n\\n\\n\\n public:\\n\\n MyBusListener() : BusListener() { }\\n\\n\\n\\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts);\\n\\n\\n\\n};\\n\\n\\n\\n/* Auth Listener */\\n\",\n \"file_path\": \"alljoyn_core/unit_test/ServiceSetup.h\",\n \"rank\": 20,\n \"score\": 303384.6273910875\n },\n {\n \"content\": \"class AJNApplicationStateListenerImpl : public ajn::ApplicationStateListener {\\n\\n protected:\\n\\n /**\\n\\n * Objective C delegate called when one of the below virtual functions\\n\\n * is called.\\n\\n */\\n\\n __weak id<AJNApplicationStateListener> m_delegate;\\n\\n\\n\\n public:\\n\\n /**\\n\\n * Constructor for the AJNApplicationStateListener implementation.\\n\\n *\\n\\n * @param aDelegate Objective C delegate called when one of the below virtual functions is called.\\n\\n */\\n\\n AJNApplicationStateListenerImpl(id<AJNApplicationStateListener> aDelegate);\\n\\n\\n\\n /**\\n\\n * Virtual destructor for derivable class.\\n\\n */\\n\\n virtual ~AJNApplicationStateListenerImpl();\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNApplicationStateListenerImpl.h\",\n \"rank\": 21,\n \"score\": 303279.0651083387\n },\n {\n \"content\": \" int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/AboutListenerTest.java\",\n \"rank\": 22,\n \"score\": 300522.25056413794\n },\n {\n \"content\": \"class SessionPortListener : public ajn::SessionPortListener {\\n\\n public:\\n\\n\\n\",\n \"file_path\": \"alljoyn_js/jni/BusAttachmentHost.cc\",\n \"rank\": 23,\n \"score\": 299968.6799825398\n },\n {\n \"content\": \"class AboutClientSessionListener : public ajn::SessionListener {\\n\\n public:\\n\\n AboutClientSessionListener(qcc::String inServiceName);\\n\\n\\n\\n virtual ~AboutClientSessionListener();\\n\\n\\n\\n void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\\n\\n\\n\\n private:\\n\\n\\n\\n qcc::String serviceName;\\n\\n\\n\\n};\\n\\n\\n\\n#endif /* ABOUTCLIENTSESSIONLISTENER_H_ */\\n\\n\\n\",\n \"file_path\": \"services/about/cpp/samples/AboutClientSample/AboutClientSessionListener.h\",\n \"rank\": 24,\n \"score\": 298531.8152308282\n },\n {\n \"content\": \" @Override\\n\\n public void addBusObjectAnnouncements(List<BusObjectDescription> descriptions)\\n\\n {\\n\\n m_ObjectDescriptions.addAll(descriptions);\\n\",\n \"file_path\": \"services/about/java/src/org/alljoyn/about/AboutServiceImpl.java\",\n \"rank\": 25,\n \"score\": 298213.77727848035\n },\n {\n \"content\": \"class SessionPortListenerCallbackC : public SessionPortListener {\\n\\n public:\\n\\n SessionPortListenerCallbackC(const alljoyn_sessionportlistener_callbacks* in_callbacks, const void* in_context)\\n\\n {\\n\\n QCC_DbgTrace((\\\"%s\\\", __FUNCTION__));\\n\\n memcpy(&callbacks, in_callbacks, sizeof(alljoyn_sessionportlistener_callbacks));\\n\\n context = in_context;\\n\\n }\\n\\n\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\\n\\n {\\n\\n QCC_DbgTrace((\\\"%s\\\", __FUNCTION__));\\n\\n QCC_BOOL ret = SessionPortListener::AcceptSessionJoiner(sessionPort, joiner, opts) ? QCC_TRUE : QCC_FALSE;\\n\\n if (callbacks.accept_session_joiner != NULL) {\\n\\n if (!DeferredCallback::sMainThreadCallbacksOnly) {\\n\\n ret = callbacks.accept_session_joiner(context, sessionPort, joiner, (alljoyn_sessionopts)(&opts));\\n\\n } else {\\n\\n DeferredCallback_4<QCC_BOOL, const void*, SessionPort, const char*, alljoyn_sessionopts>* dcb =\\n\\n new DeferredCallback_4<QCC_BOOL, const void*, SessionPort, const char*, alljoyn_sessionopts>(callbacks.accept_session_joiner, context, sessionPort, joiner, (alljoyn_sessionopts)(&opts));\\n\\n ret = DEFERRED_CALLBACK_EXECUTE(dcb);\\n\",\n \"file_path\": \"alljoyn_c/src/SessionPortListener.cc\",\n \"rank\": 26,\n \"score\": 298011.3917419807\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Called by the bus when a session has been successfully joined. The session is now fully up.\\n\\n *\\n\\n * This callback is only used by session creators. Therefore it is only called on listeners\\n\\n * passed to BusAttachment::BindSessionPort.\\n\\n *\\n\\n * @param sessionPort Session port that was joined.\\n\\n * @param sessionId Id of session.\\n\\n * @param joiner Unique name of the joiner.\\n\\n */\\n\\n virtual void SessionJoined(ajn::SessionPort sessionPort, ajn::SessionId sessionId, const char* joiner);\\n\\n\\n\\n\\n\\n /**\\n\\n * Accessor for Objective-C delegate.\\n\\n *\\n\\n * return delegate The Objective-C delegate called to handle the above event methods.\\n\\n */\\n\\n id<AJNSessionPortListener> getDelegate();\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 27,\n \"score\": 296101.1162275686\n },\n {\n \"content\": \" AJNSessionPortListenerImpl(AJNBusAttachment* aBusAttachment, id<AJNSessionPortListener> aDelegate);\\n\\n\\n\\n /**\\n\\n * Virtual destructor for derivable class.\\n\\n */\\n\\n virtual ~AJNSessionPortListenerImpl();\\n\\n\\n\\n /**\\n\\n * Accept or reject an incoming JoinSession request. The session does not exist until this\\n\\n * after this function returns.\\n\\n *\\n\\n * This callback is only used by session creators. Therefore it is only called on listeners\\n\\n * passed to BusAttachment::BindSessionPort.\\n\\n *\\n\\n * @param sessionPort Session port that was joined.\\n\\n * @param joiner Unique name of potential joiner.\\n\\n * @param opts Session options requested by the joiner.\\n\\n * @return Return true if JoinSession request is accepted. false if rejected.\\n\\n */\\n\\n virtual bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts);\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 28,\n \"score\": 296094.9925792182\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Mutator for Objective-C delegate.\\n\\n *\\n\\n * @param delegate The Objective-C delegate called to handle the above event methods.\\n\\n */\\n\\n void setDelegate(id<AJNSessionPortListener> delegate);\\n\\n};\\n\\n\\n\\ninline id<AJNSessionPortListener> AJNSessionPortListenerImpl::getDelegate()\\n\\n{\\n\\n return m_delegate;\\n\\n}\\n\\n\\n\\ninline void AJNSessionPortListenerImpl::setDelegate(id<AJNSessionPortListener> delegate)\\n\\n{\\n\\n m_delegate = delegate;\\n\\n}\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 29,\n \"score\": 296070.1372516573\n },\n {\n \"content\": \"// WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED\\n\\n// WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE\\n\\n// AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\\n\\n// DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\\n\\n// PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\\n\\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\\n\\n// PERFORMANCE OF THIS SOFTWARE.\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#import <Foundation/Foundation.h>\\n\\n#import <alljoyn/SessionPortListener.h>\\n\\n#import <alljoyn/TransportMask.h>\\n\\n#import \\\"AJNBusListener.h\\\"\\n\\n#import \\\"AJNBusAttachment.h\\\"\\n\\n\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 30,\n \"score\": 296050.88355035346\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////\\n\\n// Copyright (c) Open Connectivity Foundation (OCF), AllJoyn Open Source\\n\\n// Project (AJOSP) Contributors and others.\\n\\n//\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n//\\n\\n// All rights reserved. This program and the accompanying materials are\\n\\n// made available under the terms of the Apache License, Version 2.0\\n\\n// which accompanies this distribution, and is available at\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Copyright (c) Open Connectivity Foundation and Contributors to AllSeen\\n\\n// Alliance. All rights reserved.\\n\\n//\\n\\n// Permission to use, copy, modify, and/or distribute this software for\\n\\n// any purpose with or without fee is hereby granted, provided that the\\n\\n// above copyright notice and this permission notice appear in all\\n\\n// copies.\\n\\n//\\n\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNSessionPortListenerImpl.h\",\n \"rank\": 31,\n \"score\": 296015.15322204144\n },\n {\n \"content\": \"- (id)initWithVersion:(uint16_t)version port:(uint16_t)port busName:(NSString *)busName objectDescriptions:(NSMutableDictionary *)objectDescs aboutData:(NSMutableDictionary **)aboutData __deprecated;\\n\",\n \"file_path\": \"services/about/ios/inc/alljoyn/about/AJNAnnouncement.h\",\n \"rank\": 32,\n \"score\": 294964.94741872593\n },\n {\n \"content\": \"class BasicClient: NSObject, AJNBusListener, AJNSessionListener, AJNJoinSessionDelegate {\\n\\n\\n\\n weak var delegate: BasicClientDelegate?\\n\\n\\n\\n private let joinedSessionCondition = NSCondition()\\n\\n private var bus: AJNBusAttachment?\\n\\n private var sessionId: AJNSessionId?\\n\\n private var foundServiceName: String?\\n\\n private var wasNameAlreadyFound = false\\n\\n private var clientQueue = DispatchQueue(label: \\\"org.alljoyn.swift.BasicClient.ClientQueue\\\")\\n\\n private var lockQueue = DispatchQueue(label: \\\"org.alljoyn.swift.BasicClient.LockQueue\\\")\\n\\n\\n\\n func sendHelloMessage() {\\n\\n clientQueue.async {\\n\\n self.wasNameAlreadyFound = false\\n\\n self.run()\\n\\n }\\n\\n }\\n\\n\\n\\n func run() {\\n\",\n \"file_path\": \"alljoyn_objc/samples/iOS/Swift/BasicClient/BasicClient/BasicClient.swift\",\n \"rank\": 33,\n \"score\": 293754.370759628\n },\n {\n \"content\": \"class SessionListenerImpl : public ajn::SessionListener {\\n\\n public:\\n\\n /**\\n\\n * SessionListenerImpl\\n\\n * @param inServiceNAme\\n\\n */\\n\\n SessionListenerImpl(qcc::String const& inServiceNAme);\\n\\n\\n\\n /**\\n\\n * destructor\\n\\n */\\n\\n virtual ~SessionListenerImpl();\\n\\n\\n\\n /**\\n\\n * SessionLost\\n\\n * @param sessionId\\n\\n * @param reason\\n\\n */\\n\\n void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\\n\\n\\n\\n private:\\n\\n\\n\\n qcc::String serviceName;\\n\\n\\n\\n};\\n\\n\\n\\n#endif /* SESSIONLISTENERIMPL_H_ */\\n\\n\\n\",\n \"file_path\": \"services/config/cpp/samples/ConfigClientSample/SessionListenerImpl.h\",\n \"rank\": 34,\n \"score\": 291620.36618557794\n },\n {\n \"content\": \"static const AJNInterfacePropertyAnnotationFlags kAJNInterfacePropertyEmitChangedSignalConst = 4;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceMember.h\",\n \"rank\": 35,\n \"score\": 286145.39092651405\n },\n {\n \"content\": \"@class AJNInterfaceDescription;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusObject.h\",\n \"rank\": 36,\n \"score\": 286102.3935360234\n },\n {\n \"content\": \" public int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/AboutProxyTest.java\",\n \"rank\": 37,\n \"score\": 286087.9731392142\n },\n {\n \"content\": \"class _SessionOptsInterface : public ScriptableObject {\\n\\n public:\\n\\n static std::map<qcc::String, int32_t>& Constants();\\n\\n _SessionOptsInterface(Plugin& plugin);\\n\\n virtual ~_SessionOptsInterface();\\n\\n\\n\\n private:\\n\\n static std::map<qcc::String, int32_t> constants;\\n\\n};\\n\\n\\n\\ntypedef qcc::ManagedObj<_SessionOptsInterface> SessionOptsInterface;\\n\\n\\n\\n#endif // _SESSIONOPTSINTERFACE_H\\n\",\n \"file_path\": \"alljoyn_js/jni/SessionOptsInterface.h\",\n \"rank\": 38,\n \"score\": 285280.46885034046\n },\n {\n \"content\": \"class MySessionPortListener : public SessionPortListener {\\n\\n bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts)\\n\\n {\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n\\n\\n if (sessionPort != ASSIGNED_SESSION_PORT) {\\n\\n printf(\\\"Rejecting join attempt on unexpected session port %d\\\\n\\\", sessionPort);\\n\\n return false;\\n\\n }\\n\\n return true;\\n\\n }\\n\\n void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner)\\n\\n {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n\\n\\n printf(\\\"Session Joined SessionId = %u\\\\n\\\", id);\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/samples/about/AboutService.cc\",\n \"rank\": 39,\n \"score\": 284600.1792538432\n },\n {\n \"content\": \"class SessionJoinedSessionPortListener : public SessionPortListener {\\n\\n\\n\\n private:\\n\\n /* Private assigment operator - does nothing */\\n\\n SessionJoinedSessionPortListener& operator=(const SessionJoinedSessionPortListener&);\\n\\n\\n\\n BusAttachment& bus;\\n\\n SessionListener*sl;\\n\\n\\n\\n\\n\\n\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n\\n\\n sessionJoinerAcceptedFlag = true;\\n\\n return true;\\n\\n }\\n\\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\\n\",\n \"file_path\": \"alljoyn_core/unit_test/SessionTest.cc\",\n \"rank\": 40,\n \"score\": 283183.9581309152\n },\n {\n \"content\": \"class JoinSession_SessionPortListener : public SessionPortListener, SessionListener {\\n\\n public:\\n\\n JoinSession_SessionPortListener(BusAttachment* bus) : bus(bus) { };\\n\\n\\n\\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n\\n\\n if (sessionPort == 42) {\\n\\n sessionAccepted = true;\\n\\n bus->EnableConcurrentCallbacks();\\n\\n return true;\\n\\n } else {\\n\\n sessionAccepted = false;\\n\\n return false;\\n\\n }\\n\\n }\\n\\n\\n\\n void SessionLost(SessionId id, SessionListener::SessionLostReason reason) {\\n\\n QCC_UNUSED(id);\\n\",\n \"file_path\": \"alljoyn_core/unit_test/BusAttachmentTest.cc\",\n \"rank\": 41,\n \"score\": 282111.13776820473\n },\n {\n \"content\": \"@class AJNInterfaceMember;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNProxyBusObject.h\",\n \"rank\": 42,\n \"score\": 281576.19931048964\n },\n {\n \"content\": \"@class AJNInterfaceDescription;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNProxyBusObject.h\",\n \"rank\": 43,\n \"score\": 281426.27762807725\n },\n {\n \"content\": \" public int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/AboutIconProxyTest.java\",\n \"rank\": 44,\n \"score\": 279953.4449723898\n },\n {\n \"content\": \"class AnnounceListenerTestSessionPortListener : public SessionPortListener {\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/unit_test/AboutListenerTest.cc\",\n \"rank\": 45,\n \"score\": 279804.3673016026\n },\n {\n \"content\": \" class JoinSessionThread extends Thread {\\n\\n JoinSessionThread(String serviceName, short port, Map<String, Variant> announceData) {\\n\\n mServiceName = serviceName;\\n\\n mPort = port;\\n\\n mAnnounceData = announceData;\\n\\n }\\n\\n public void run() {\\n\\n attemptToJoinSession(mServiceName, mPort, mAnnounceData);\\n\\n }\\n\\n String mServiceName;\\n\\n short mPort;\\n\\n Map<String, Variant> mAnnounceData;\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 46,\n \"score\": 279616.95965199417\n },\n {\n \"content\": \"@interface AJNAboutObjectDescription : AJNObject\\n\\n\\n\\n/**\\n\\n * Get a list of the paths that are added to this AboutObjectDescription.\\n\\n * @return paths found in the AboutObjectDescription\\n\\n */\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNAboutObjectDescription.h\",\n \"rank\": 47,\n \"score\": 279433.52547042625\n },\n {\n \"content\": \" Map<String, Variant> mAnnounceData;\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 48,\n \"score\": 278552.19510551286\n },\n {\n \"content\": \"class BindMemberSessionPortListener : public SessionPortListener {\\n\\n public:\\n\\n BindMemberSessionPortListener(BusAttachment* bus, BindMemberSessionListenerA* bindMemberSessionListener) :\\n\\n bus(bus),\\n\\n sessionListener(bindMemberSessionListener) { }\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n\\n\\n sessionJoinerAcceptedFlag = true;\\n\\n return true;\\n\\n }\\n\\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n\\n\\n bindMemberSessionId = id;\\n\\n sessionJoinedFlag = true;\\n\\n QStatus status = bus->SetSessionListener(id, sessionListener);\\n\\n EXPECT_EQ(ER_OK, status);\\n\\n }\\n\\n BusAttachment* bus;\\n\\n BindMemberSessionListenerA* sessionListener;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/unit_test/SessionTest.cc\",\n \"rank\": 49,\n \"score\": 278324.91121574095\n },\n {\n \"content\": \"@protocol AJNBusObject<AJNHandle>\\n\\n\\n\\n/**\\n\\n * Return the path for the object\\n\\n *\\n\\n * @return Object path\\n\\n */\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusObject.h\",\n \"rank\": 50,\n \"score\": 277311.61240903585\n },\n {\n \"content\": \"class SessionJoinedListenerNative : public NativeObject {\\n\\n public:\\n\\n SessionJoinedListenerNative(Plugin& plugin, NPObject* objectValue);\\n\\n virtual ~SessionJoinedListenerNative();\\n\\n\\n\\n void onJoined(ajn::SessionPort port, ajn::SessionId id, const qcc::String& joiner);\\n\\n};\\n\\n\\n\\n#endif // _SESSIONJOINEDLISTENERNATIVE_H\\n\",\n \"file_path\": \"alljoyn_js/jni/SessionJoinedListenerNative.h\",\n \"rank\": 51,\n \"score\": 277248.5851079859\n },\n {\n \"content\": \"@interface AJNInterfaceProperty : AJNObject\\n\\n\\n\\n/** Name of the property */\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNInterfaceProperty.h\",\n \"rank\": 52,\n \"score\": 277046.586994512\n },\n {\n \"content\": \"@protocol AJNServiceDelegate <AJNBusControllerDelegate>\\n\\n\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNServiceController.h\",\n \"rank\": 53,\n \"score\": 276545.84907169134\n },\n {\n \"content\": \" public void run() {\\n\\n attemptToJoinSession(mServiceName, mPort, mAnnounceData);\\n\",\n \"file_path\": \"services/about/java/samples/java/AboutClientSample/src/org/alljoyn/about/sample/DeviceAnnouncementHandler.java\",\n \"rank\": 54,\n \"score\": 276063.19587232673\n },\n {\n \"content\": \" public void sessionMemberAdded(int sessionId, String uniqueName) {\\n\\n sessionMemberAddedFlagA = true;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java\",\n \"rank\": 55,\n \"score\": 275540.72779271664\n },\n {\n \"content\": \" public void sessionMemberRemoved(int sessionId, String uniqueName) {\\n\\n sessionMemberRemovedFlagA = true;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java\",\n \"rank\": 56,\n \"score\": 275540.72779271664\n },\n {\n \"content\": \" private int mSessionId = 0;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 57,\n \"score\": 274792.52147756726\n },\n {\n \"content\": \"- (QStatus)setLinkTimeoutAsync:(uint32_t)timeout forSession:(AJNSessionId)sessionId completionBlock:(AJNLinkTimeoutBlock) block context:(void *)context;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNBusAttachment.h\",\n \"rank\": 58,\n \"score\": 273248.05160177976\n },\n {\n \"content\": \"- (void)didJoinInSession:(AJNSessionId)sessionId withService:(NSString *)serviceName;\\n\",\n \"file_path\": \"alljoyn_objc/AllJoynFramework/AllJoynFramework/include/AJNClientController.h\",\n \"rank\": 59,\n \"score\": 273248.05160177976\n },\n {\n \"content\": \"struct SessionJoinerContext {\\n\\n qcc::String busName;\\n\\n AboutClientSessionListener* aboutClientSessionListener;\\n\\n\\n\\n SessionJoinerContext(qcc::String name, AboutClientSessionListener* absl) :\\n\\n busName(name), aboutClientSessionListener(absl) { }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"services/about/cpp/samples/AboutClientSample/AboutClientSessionJoiner.h\",\n \"rank\": 60,\n \"score\": 273226.5567859194\n },\n {\n \"content\": \"class IpNameServiceListener {\\n\\n public:\\n\\n virtual ~IpNameServiceListener() { }\\n\\n virtual bool QueryHandler(TransportMask transport, MDNSPacket query, const qcc::IPEndpoint& src, const qcc::IPEndpoint& dst) {\\n\\n QCC_UNUSED(transport);\\n\\n QCC_UNUSED(query);\\n\\n QCC_UNUSED(src);\\n\\n QCC_UNUSED(dst);\\n\\n return false;\\n\\n }\\n\\n virtual bool ResponseHandler(TransportMask transport, MDNSPacket response, uint16_t recvPort) {\\n\\n QCC_UNUSED(transport);\\n\\n QCC_UNUSED(response);\\n\\n QCC_UNUSED(recvPort);\\n\\n return false;\\n\\n }\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief API to provide an implementation dependent IP (Layer 3) Name Service\\n\",\n \"file_path\": \"alljoyn_core/router/ns/IpNameService.h\",\n \"rank\": 61,\n \"score\": 271860.85526184225\n },\n {\n \"content\": \" public int getSessionId() {\\n\\n return mSessionId;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 62,\n \"score\": 271847.63053241855\n },\n {\n \"content\": \" private int mSessionId = 0;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 63,\n \"score\": 271754.08032604575\n },\n {\n \"content\": \" public void sessionJoined(short sessionPort, int id, String joiner) {}\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/SecurityApplicationProxyTest.java\",\n \"rank\": 64,\n \"score\": 270378.46623088676\n },\n {\n \"content\": \"class AcceptSessionJoinerListenerNative : public NativeObject {\\n\\n public:\\n\\n AcceptSessionJoinerListenerNative(Plugin& plugin, NPObject* objectValue);\\n\\n virtual ~AcceptSessionJoinerListenerNative();\\n\\n\\n\\n bool onAccept(ajn::SessionPort port, const qcc::String& joiner, SessionOptsHost& opts);\\n\\n};\\n\\n\\n\\n#endif // _ACCEPTSESSIONJOINERLISTENERNATIVE_H\\n\",\n \"file_path\": \"alljoyn_js/jni/AcceptSessionJoinerListenerNative.h\",\n \"rank\": 65,\n \"score\": 269848.0955506684\n },\n {\n \"content\": \"class SessionMemberAddedListenerNative : public NativeObject {\\n\\n public:\\n\\n SessionMemberAddedListenerNative(Plugin& plugin, NPObject* objectValue);\\n\\n virtual ~SessionMemberAddedListenerNative();\\n\\n\\n\\n void onMemberAdded(ajn::SessionId id, const qcc::String& uniqueName);\\n\\n};\\n\\n\\n\\n#endif // _SESSIONMEMBERADDEDLISTENERNATIVE_H\\n\",\n \"file_path\": \"alljoyn_js/jni/SessionMemberAddedListenerNative.h\",\n \"rank\": 66,\n \"score\": 269836.77639379096\n },\n {\n \"content\": \"class SessionMemberRemovedListenerNative : public NativeObject {\\n\\n public:\\n\\n SessionMemberRemovedListenerNative(Plugin& plugin, NPObject* objectValue);\\n\\n virtual ~SessionMemberRemovedListenerNative();\\n\\n\\n\\n void onMemberRemoved(ajn::SessionId id, const qcc::String& uniqueName);\\n\\n};\\n\\n\\n\\n#endif // _SESSIONMEMBERREMOVEDLISTENERNATIVE_H\\n\",\n \"file_path\": \"alljoyn_js/jni/SessionMemberRemovedListenerNative.h\",\n \"rank\": 67,\n \"score\": 269836.77639379096\n },\n {\n \"content\": \"class BindSessionPortCallbackContext : public CallbackContext {\\n\\n public:\\n\\n ajn::SessionPort port;\\n\\n BindSessionPortCallbackContext(CallbackNative* callbackNative, QStatus status, ajn::SessionPort port) :\\n\\n CallbackContext(callbackNative, status),\\n\\n port(port) { }\\n\\n};\\n\\n\\n\\nvoid CallbackNative::DispatchCallback(Plugin& plugin, CallbackNative* callbackNative, QStatus status, ajn::SessionPort port)\\n\\n{\\n\\n PluginData::Callback callback(plugin, _BindSessionPortCallbackCB);\\n\\n callback->context = new BindSessionPortCallbackContext(callbackNative, status, port);\\n\\n PluginData::DispatchCallback(callback);\\n\\n}\\n\\n\\n\\nvoid CallbackNative::_BindSessionPortCallbackCB(PluginData::CallbackContext* ctx)\\n\\n{\\n\\n BindSessionPortCallbackContext* context = static_cast<BindSessionPortCallbackContext*>(ctx);\\n\\n context->callbackNative->onCallback(context->status, context->port);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alljoyn_js/jni/CallbackNative.cc\",\n \"rank\": 68,\n \"score\": 269337.0019873697\n },\n {\n \"content\": \" public int getSessionId() {\\n\\n return mSessionId;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 69,\n \"score\": 268876.0356088272\n },\n {\n \"content\": \" public void sessionJoined(short sessionPort, int id, String joiner) {}\\n\",\n \"file_path\": \"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java\",\n \"rank\": 70,\n \"score\": 268343.876779462\n },\n {\n \"content\": \"class BindMemberJoinSessionAsyncCB : public ajn::BusAttachment::JoinSessionAsyncCB {\\n\\n public:\\n\\n virtual void JoinSessionCB(QStatus status, SessionId sessionId, const SessionOpts& opts, void* context) {\\n\\n QCC_UNUSED(sessionId);\\n\\n QCC_UNUSED(opts);\\n\\n QCC_UNUSED(context);\\n\\n\\n\\n EXPECT_EQ(ER_OK, status);\\n\\n sessionJoinedCBFlag = true;\\n\\n }\\n\\n};\\n\\nTEST_F(SessionTest, BindMemberAddedRemoved) {\\n\\n QStatus status = ER_FAIL;\\n\\n /* make sure global flags are initialized */\\n\\n sessionMemberAddedFlagA = false;\\n\\n sessionMemberRemovedFlagA = false;\\n\\n sessionMemberAddedFlagB = false;\\n\\n sessionMemberRemovedFlagB = false;\\n\\n sessionMemberAddedFlagC = false;\\n\\n sessionMemberRemovedFlagC = false;\\n\",\n \"file_path\": \"alljoyn_core/unit_test/SessionTest.cc\",\n \"rank\": 71,\n \"score\": 268221.9742260587\n },\n {\n \"content\": \" public boolean isConnected() {\\n\\n return mIsConnected;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 72,\n \"score\": 268041.65550288593\n },\n {\n \"content\": \" private boolean mIsConnected = false;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 73,\n \"score\": 268041.65550288593\n },\n {\n \"content\": \" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {\\n\\n return true;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/SecurityApplicationProxyTest.java\",\n \"rank\": 74,\n \"score\": 266805.9759365538\n },\n {\n \"content\": \" static int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocMethodsService/src/org/alljoyn/bus/samples/Service.java\",\n \"rank\": 75,\n \"score\": 265242.0371739067\n },\n {\n \"content\": \" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {return false;}\\n\",\n \"file_path\": \"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java\",\n \"rank\": 76,\n \"score\": 265193.61697020347\n },\n {\n \"content\": \" public boolean isConnected() {\\n\\n return mIsConnected;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 77,\n \"score\": 264872.6062592003\n },\n {\n \"content\": \" private boolean mIsConnected = false;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionClient/src/org/alljoyn/bus/samples/SampleOnJoinSessionListener.java\",\n \"rank\": 78,\n \"score\": 264872.6062592003\n },\n {\n \"content\": \"class RemoveSessionMemberBusAListener : public SessionPortListener, public SessionListener {\\n\\n public:\\n\\n RemoveSessionMemberBusAListener(BusAttachment* bus) : bus(bus) {\\n\\n }\\n\\n\\n\\n virtual bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n sessionJoinerAcceptedFlag = true;\\n\\n return true;\\n\\n }\\n\\n virtual void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n\\n\\n bindMemberSessionId = id;\\n\\n sessionJoinedTestJoiner = joiner;\\n\\n sessionJoinedFlag = true;\\n\\n ++sessionJoinedCounter;\\n\\n EXPECT_EQ(ER_OK, bus->SetHostedSessionListener(id, this));\\n\",\n \"file_path\": \"alljoyn_core/unit_test/SessionTest.cc\",\n \"rank\": 79,\n \"score\": 264765.3941336497\n },\n {\n \"content\": \"class MyBusListener : public BusListener, public SessionPortListener, public SessionListener {\\n\\n public:\\n\\n\\n\\n MyBusListener(JavaVM* vm, jobject& jobj) : vm(vm), jobj(jobj), _id(0) { }\\n\\n\\n\\n void NameOwnerChanged(const char* busName, const char* previousOwner, const char* newOwner)\\n\\n {\\n\\n }\\n\\n\\n\\n /* Accept an incoming JoinSession request */\\n\\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts)\\n\\n {\\n\\n if (sessionPort != SESSION_PORT) {\\n\\n LOGE(\\\"Rejecting join attempt on non-chat session port %d\\\\n\\\", sessionPort);\\n\\n return false;\\n\\n }\\n\\n\\n\\n LOGD(\\\"Accepting join session request from %s (opts.proximity=%x, opts.traffic=%x, opts.transports=%x)\\\\n\\\",\\n\\n joiner, opts.proximity, opts.traffic, opts.transports);\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/samples/simple/android/service/jni/Service_jni.cpp\",\n \"rank\": 80,\n \"score\": 263529.8905985035\n },\n {\n \"content\": \" public void sessionJoined(short sessionPort, int id, String joiner) {}\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/SecurityProxyBusObjectTest.java\",\n \"rank\": 81,\n \"score\": 263136.87386225443\n },\n {\n \"content\": \" private native void create();\\n\",\n \"file_path\": \"alljoyn_java/src/org/alljoyn/bus/SessionPortListener.java\",\n \"rank\": 82,\n \"score\": 263023.1127368889\n },\n {\n \"content\": \" private native void create();\\n\",\n \"file_path\": \"alljoyn_java/src/org/alljoyn/bus/OnJoinSessionListener.java\",\n \"rank\": 83,\n \"score\": 263014.03204567917\n },\n {\n \"content\": \" static int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/samples/java/JavaSDKDoc/JavaSDKDocIntrospectWithDescriptionService/src/org/alljoyn/bus/samples/Service.java\",\n \"rank\": 84,\n \"score\": 262409.73421092366\n },\n {\n \"content\": \" int sessionId;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/AboutDataCheckTest.java\",\n \"rank\": 85,\n \"score\": 262347.08496037254\n },\n {\n \"content\": \" @Override\\n\\n public void sessionJoined(short sessionPort, int id, String joiner) {\\n\\n sessionJoinedFlag = true;\\n\\n bus.setSessionListener(id, new SessionListener() {\\n\\n public void sessionLost(final int sessionId, int reason) {\\n\\n sessionLostFlagA = true;\\n\\n }\\n\\n public void sessionMemberAdded(int sessionId, String uniqueName) {\\n\\n sessionMemberAddedFlagA = true;\\n\\n }\\n\\n public void sessionMemberRemoved(int sessionId, String uniqueName) {\\n\\n sessionMemberRemovedFlagA = true;\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java\",\n \"rank\": 86,\n \"score\": 262067.03521314063\n },\n {\n \"content\": \" public void sessionLost(final int sessionId, int reason) {\\n\\n sessionLostFlagA = true;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java\",\n \"rank\": 87,\n \"score\": 260962.736233726\n },\n {\n \"content\": \" public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts opts) {\\n\\n return true;\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/SecurityProxyBusObjectTest.java\",\n \"rank\": 88,\n \"score\": 259756.11883304664\n },\n {\n \"content\": \" short port;\\n\",\n \"file_path\": \"services/config/java/samples/java/ConfigClientSample/src/org/alljoyn/config/samples/configclient/ConfigApplication.java\",\n \"rank\": 89,\n \"score\": 259108.82335958473\n },\n {\n \"content\": \" @Deprecated\\n\",\n \"file_path\": \"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java\",\n \"rank\": 90,\n \"score\": 258626.5467604007\n },\n {\n \"content\": \" @Override\\n\\n public boolean acceptSessionJoiner(short sessionPort, String joiner, SessionOpts sessionOpts) {\\n\\n if (sessionPort == 42) {\\n\\n sessionAccepted = true;\\n\\n return true;\\n\\n } else {\\n\\n sessionAccepted = false;\\n\\n return false;\\n\\n }\\n\",\n \"file_path\": \"alljoyn_java/test/org/alljoyn/bus/BusAttachmentTest.java\",\n \"rank\": 91,\n \"score\": 258546.07024760763\n },\n {\n \"content\": \" UUID appId;\\n\",\n \"file_path\": \"services/config/java/samples/java/ConfigClientSample/src/org/alljoyn/config/samples/configclient/ConfigApplication.java\",\n \"rank\": 92,\n \"score\": 256226.7933274436\n },\n {\n \"content\": \"class Service : public App, private SessionPortListener, private SessionListener {\\n\\n public:\\n\\n Service(BusAttachment& bus);\\n\\n ~Service();\\n\\n\\n\\n private:\\n\\n BusAttachment& bus;\\n\\n multimap<SessionId, BusObject*> objects;\\n\\n SessionPort port;\\n\\n\\n\\n void Add(SessionId id, bool autoUpdate);\\n\\n\\n\\n // SessionPortListener methods\\n\\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\\n return true;\\n\\n }\\n\\n void SessionJoined(SessionPort sessionPort, SessionId id, const char* joiner);\\n\",\n \"file_path\": \"alljoyn_core/test/proptester.cc\",\n \"rank\": 93,\n \"score\": 256130.49228565392\n },\n {\n \"content\": \"class Service : public App, private SessionPortListener, private SessionListener {\\n\\n public:\\n\\n Service(BusAttachment& bus, int nbrOfObjects);\\n\\n ~Service();\\n\\n\\n\\n void Execute(uint64_t timeToRun);\\n\\n\\n\\n private:\\n\\n BusAttachment& bus;\\n\\n int nbrOfObjects;\\n\\n multimap<SessionId, PropTesterObject*> objects;\\n\\n SessionPort port;\\n\\n\\n\\n void Add(SessionId id, uint32_t number);\\n\\n\\n\\n // SessionPortListener methods\\n\\n bool AcceptSessionJoiner(SessionPort sessionPort, const char* joiner, const SessionOpts& opts) {\\n\\n QCC_UNUSED(sessionPort);\\n\\n QCC_UNUSED(joiner);\\n\\n QCC_UNUSED(opts);\\n\",\n \"file_path\": \"alljoyn_core/test/propstresstest.cc\",\n \"rank\": 94,\n \"score\": 256130.49228565392\n },\n {\n \"content\": \" @Deprecated\\n\\n public String getPath()\\n\\n {\\n\\n return path;\\n\",\n \"file_path\": \"services/about/java/src/org/alljoyn/services/common/BusObjectDescription.java\",\n \"rank\": 95,\n \"score\": 255638.41753945046\n },\n {\n \"content\": \" */\\n\\n void shutdown();\\n\\n\\n\\n /* From About */\\n\\n void Announce(unsigned short version, unsigned short port, const char* busName,\\n\\n const ajn::services::AboutClient::ObjectDescriptions& objectDescs,\\n\\n const ajn::services::AboutClient::AboutData& aboutData);\\n\\n\\n\\n void EventHandler(const ajn::InterfaceDescription::Member* member, const char* srcPath, ajn::Message& msg);\\n\\n\\n\\n /* For MethodCallAsync */\\n\\n void AsyncCallReplyHandler(ajn::Message& msg, void* context);\\n\\n\\n\\n /* From SessionListener */\\n\\n virtual void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\\n\\n\\n\\n /** JoinSessionAsync callback */\\n\\n virtual void JoinSessionCB(QStatus status, ajn::SessionId sessionId, const ajn::SessionOpts& opts, void* context);\\n\\n\\n\\n private:\\n\",\n \"file_path\": \"alljoyn_core/samples/eventaction/Android_test_tools/Events/jni/MyAllJoynCode.h\",\n \"rank\": 96,\n \"score\": 129.8947158802489\n },\n {\n \"content\": \"using namespace std;\\n\\nusing namespace qcc;\\n\\nusing namespace ajn;\\n\\n\\n\\n/** Static top level message bus object */\\n\\nstatic BusAttachment* s_msgBus = nullptr;\\n\\n\\n\\nstatic const char* INTERFACE_NAME = \\\"org.alljoyn.Bus.signal_sample\\\";\\n\\nstatic const char* SERVICE_NAME = \\\"org.alljoyn.Bus.signal_sample\\\";\\n\\nstatic const char* SERVICE_PATH = \\\"/\\\";\\n\\nstatic const SessionPort SERVICE_PORT = 25;\\n\\n\\n\\nstatic volatile sig_atomic_t s_interrupt = false;\\n\\n\\n\\nstatic void CDECL_CALL SigIntHandler(int sig)\\n\\n{\\n\\n QCC_UNUSED(sig);\\n\\n s_interrupt = true;\\n\\n}\\n\\n\\n\\nstatic const char* tags[] = { \\\"en\\\", \\\"de\\\", \\\"hi\\\" };\\n\\nstatic const char* objId = \\\"obj\\\";\\n\\nstatic const char* objDescription[] = { \\\"This is the object\\\", \\\"Es ist das Objekt\\\", \\\"Ye Object hai\\\" };\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/samples/basic/signal_service.cc\",\n \"rank\": 97,\n \"score\": 126.85039777068097\n },\n {\n \"content\": \"\\n\\n bool enableEvent(EventInfo* event);\\n\\n\\n\\n /**\\n\\n * Free up and release the objects used\\n\\n */\\n\\n void shutdown();\\n\\n\\n\\n /* From About */\\n\\n void Announced(const char* busName, uint16_t version, ajn::SessionPort port,\\n\\n const ajn::MsgArg& objectDescriptionArg, const ajn::MsgArg& aboutDataArg);\\n\\n\\n\\n void EventHandler(const ajn::InterfaceDescription::Member* member, const char* srcPath, ajn::Message& msg);\\n\\n\\n\\n /* For MethodCallAsync */\\n\\n void AsyncCallReplyHandler(ajn::Message& msg, void* context);\\n\\n\\n\\n /* From SessionListener */\\n\\n virtual void SessionLost(ajn::SessionId sessionId, ajn::SessionListener::SessionLostReason reason);\\n\\n\\n\",\n \"file_path\": \"alljoyn_core/samples/eventaction/Android/jni/event/MyEventCode.h\",\n \"rank\": 98,\n \"score\": 119.06379387901552\n },\n {\n \"content\": \" /**\\n\\n * Setup AllJoyn, creating the objects needed and registering listeners.\\n\\n *\\n\\n * @param packageName\\tThis value is provided to the BusAttachment constructor to name the application\\n\\n *\\n\\n */\\n\\n void initialize(const char* packageName);\\n\\n\\n\\n /**\\n\\n * Free up and release the objects used\\n\\n */\\n\\n void shutdown();\\n\\n\\n\\n private:\\n\\n\\n\\n /* From About */\\n\\n void Announced(const char* busName, uint16_t version, ajn::SessionPort port, const ajn::MsgArg& objectDescriptionArg, const ajn::MsgArg& aboutDataArg);\\n\\n\\n\\n /* From SessionPortListener */\\n\\n virtual bool AcceptSessionJoiner(ajn::SessionPort sessionPort, const char* joiner, const ajn::SessionOpts& opts);\\n\",\n \"file_path\": \"alljoyn_core/samples/eventaction/SimpleRulesEngine/posix/MyAllJoynCode.h\",\n \"rank\": 99,\n \"score\": 113.43479064180853\n }\n]","isConversational":false}}},{"rowIdx":393,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/Sound/AttenuationShapes.cpp"},"repo_name":{"kind":"string","value":"SparkyStudios/AmplitudeSDK"},"commit":{"kind":"string","value":"bcfb9d9c2fcea8ecd3a540576508f062fb3d5e21"},"file_code":{"kind":"string","value":"\n\n#include <Sound/AttenuationShapes.h>\n\n#include <SparkyStudios/Audio/Amplitude/Core/Engine.h>\n#include <SparkyStudios/Audio/Amplitude/Core/Log.h>\n\n#include <Core/EngineInternalState.h>\n\nnamespace SparkyStudios::Audio::Amplitude\n{\n AttenuationShape::AttenuationShape()\n : m_maxAttenuationFactor(1.0f)\n {}\n\n float AttenuationShape::GetAttenuationFactor(const Attenuation*, const hmm_vec3&, const ListenerInternalState*)\n {\n return m_maxAttenuationFactor;\n }\n\n float AttenuationShape::GetAttenuationFactor(const Attenuation*, const EntityInternalState*, const ListenerInternalState*)\n {\n return m_maxAttenuationFactor;\n }\n\n AttenuationShape* AttenuationShape::Create(const AttenuationShapeDefinition* definition)\n {\n if (definition == nullptr)\n return nullptr;\n\n AttenuationShape* shape = nullptr;\n\n switch (definition->model())\n {\n default:\n case AttenuationShapeModel_Default:\n shape = new AttenuationShape();\n break;\n case AttenuationShapeModel_Cone:\n shape = new ConeAttenuationShape(definition->settings_as_Cone());\n break;\n case AttenuationShapeModel_Sphere:\n shape = new SphereAttenuationShape(definition->settings_as_Sphere());\n break;\n case AttenuationShapeModel_Box:\n shape = new BoxAttenuationShape(definition->settings_as_Box());\n break;\n case AttenuationShapeModel_Capsule:\n shape = new CapsuleAttenuationShape(definition->settings_as_Capsule());\n break;\n }\n\n shape->m_maxAttenuationFactor = definition->max_attenuation_factor();\n\n return shape;\n }\n\n float ConeAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n if (const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n AM_Length(soundToListener) >= attenuation->GetMaxDistance())\n return 0.0f;\n\n \n return 1.0f;\n }\n\n float ConeAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - entity->GetLocation();\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n const float coneDist = AM_Dot(soundToListener, entity->GetDirection());\n\n if (coneDist < 0.0f || coneDist > _outerHeight)\n return gain * m_maxAttenuationFactor;\n\n if (coneDist > _innerHeight)\n return gain * AM_Lerp(1.0f, (coneDist - _innerHeight) / (_outerHeight - _innerHeight), m_maxAttenuationFactor);\n\n const float innerConeRadius = coneDist / _innerHeight * _innerRadius;\n const float outerConeRadius = coneDist / _outerHeight * _outerRadius;\n\n const float d = AM_Length(soundToListener - coneDist * entity->GetDirection());\n\n if (d <= innerConeRadius)\n return gain * 1.0f;\n if (d >= outerConeRadius)\n return gain * m_maxAttenuationFactor;\n\n const float delta = (distance - innerConeRadius) / (outerConeRadius - innerConeRadius);\n\n return gain * AM_Lerp(1.0f, AM_CLAMP(delta, 0.0f, 1.0f), m_maxAttenuationFactor);\n }\n\n float ConeAttenuationShape::GetOuterRadius() const\n {\n return _outerRadius;\n }\n\n float ConeAttenuationShape::GetInnerRadius() const\n {\n return _innerRadius;\n }\n\n float ConeAttenuationShape::GetInnerHeight() const\n {\n return _innerHeight;\n }\n\n float ConeAttenuationShape::GetOuterHeight() const\n {\n return _outerHeight;\n }\n\n float SphereAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n const float delta = (distance - _innerRadius) / (_outerRadius - _innerRadius);\n\n return gain * AM_Lerp(1.0f, AM_CLAMP(delta, 0.0f, 1.0f), m_maxAttenuationFactor);\n }\n\n float SphereAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n return GetAttenuationFactor(attenuation, entity->GetLocation(), listener);\n }\n\n float BoxAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n\n return gain * _getFactor(soundLocation, listener, AM_Mat4d(1.0f));\n }\n\n float BoxAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - entity->GetLocation();\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n\n return gain * _getFactor(entity->GetLocation(), listener, AM_LookAt(AM_Vec3(0, 0, 0), entity->GetDirection(), entity->GetUp()));\n }\n\n float BoxAttenuationShape::_getFactor(const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt)\n {\n lookAt = AM_Multiply(AM_Translate(soundLocation), lookAt);\n\n const hmm_vec3& x = listener->GetLocation();\n\n hmm_vec3 iP1, iP2, iP3, iP4, oP1, oP2, oP3, oP4;\n\n switch (amEngine->GetState()->up_axis)\n {\n default:\n case GameEngineUpAxis_Y:\n iP1 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n iP2 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfHeight, _innerHalfDepth, 1.0f)).XYZ;\n iP3 = AM_Multiply(lookAt, AM_Vec4(_innerHalfWidth, -_innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n iP4 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, _innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n\n oP1 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n oP2 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfHeight, _outerHalfDepth, 1.0f)).XYZ;\n oP3 = AM_Multiply(lookAt, AM_Vec4(_outerHalfWidth, -_outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n oP4 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, _outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n break;\n\n case GameEngineUpAxis_Z:\n iP1 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP2 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, _innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP3 = AM_Multiply(lookAt, AM_Vec4(_innerHalfWidth, -_innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP4 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfDepth, _innerHalfHeight, 1.0f)).XYZ;\n\n oP1 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP2 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, _outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP3 = AM_Multiply(lookAt, AM_Vec4(_outerHalfWidth, -_outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP4 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfDepth, _outerHalfHeight, 1.0f)).XYZ;\n break;\n }\n\n hmm_vec3 iU = AM_Normalize(iP2 - iP1);\n hmm_vec3 iV = AM_Normalize(iP3 - iP1);\n hmm_vec3 iW = AM_Normalize(iP4 - iP1);\n\n hmm_vec3 oU = AM_Normalize(oP2 - oP1);\n hmm_vec3 oV = AM_Normalize(oP3 - oP1);\n hmm_vec3 oW = AM_Normalize(oP4 - oP1);\n\n const float iUX = AM_Dot(iU, x);\n const float iVX = AM_Dot(iV, x);\n const float iWX = AM_Dot(iW, x);\n\n const float oUX = AM_Dot(oU, x);\n const float oVX = AM_Dot(oV, x);\n const float oWX = AM_Dot(oW, x);\n\n const float iUP1 = AM_Dot(iU, iP1);\n const float iVP1 = AM_Dot(iV, iP1);\n const float iWP1 = AM_Dot(iW, iP1);\n\n const float iUP2 = AM_Dot(iU, iP2);\n const float iVP3 = AM_Dot(iV, iP3);\n const float iWP4 = AM_Dot(iW, iP4);\n\n const float oUP1 = AM_Dot(oU, oP1);\n const float oVP1 = AM_Dot(oV, oP1);\n const float oWP1 = AM_Dot(oW, oP1);\n\n const float oUP2 = AM_Dot(oU, oP2);\n const float oVP3 = AM_Dot(oV, oP3);\n const float oWP4 = AM_Dot(oW, oP4);\n\n if (AM_BETWEEN(iUX, iUP1, iUP2) && AM_BETWEEN(iVX, iVP1, iVP3) && AM_BETWEEN(iWX, iWP1, iWP4))\n return 1.0f;\n\n if (!(AM_BETWEEN(oUX, oUP1, oUP2) && AM_BETWEEN(oVX, oVP1, oVP3) && AM_BETWEEN(oWX, oWP1, oWP4)))\n return m_maxAttenuationFactor;\n\n const float dP1 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP2 - oP1))) / (_outerHalfDepth - _innerHalfDepth);\n const float dP2 = HMM_ABS(AM_Dot(x - oP2, AM_Normalize(oP1 - oP2))) / (_outerHalfDepth - _innerHalfDepth);\n const float dP3 = HMM_ABS(AM_Dot(x - oP3, AM_Normalize(oP1 - oP3))) / (_outerHalfWidth - _innerHalfWidth);\n const float dP4 = HMM_ABS(AM_Dot(x - oP4, AM_Normalize(oP1 - oP4))) / (_outerHalfHeight - _innerHalfHeight);\n const float dP5 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP3 - oP1))) / (_outerHalfWidth - _innerHalfWidth);\n const float dP6 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP4 - oP1))) / (_outerHalfHeight - _innerHalfHeight);\n\n const float shortestRoad = AM_MIN(dP1, AM_MIN(dP2, AM_MIN(dP3, AM_MIN(dP4, AM_MIN(dP5, dP6)))));\n\n return AM_Lerp(m_maxAttenuationFactor, AM_CLAMP(shortestRoad, 0.0f, 1.0f), 1.0f);\n }\n\n float CapsuleAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n return _getFactor(attenuation, soundLocation, listener, AM_Mat4d(1.0f));\n }\n\n float CapsuleAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n return _getFactor(\n attenuation, entity->GetLocation(), listener, AM_LookAt(AM_Vec3(0, 0, 0), entity->GetDirection(), entity->GetUp()));\n }\n\n float CapsuleAttenuationShape::_getFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt)\n {\n lookAt = AM_Multiply(AM_Translate(soundLocation), lookAt);\n\n const hmm_vec3& x = listener->GetLocation();\n\n const float distanceToOrigin = AM_Length(x - soundLocation);\n\n const float innerHalfHeight = _innerHalfHeight - _innerRadius;\n const float outerHalfHeight = _outerHalfHeight - _outerRadius;\n\n hmm_vec3 iA, iB, oA, oB;\n\n switch (amEngine->GetState()->up_axis)\n {\n default:\n case GameEngineUpAxis_Y:\n iA = AM_Multiply(lookAt, AM_Vec4(0.0f, innerHalfHeight, 0.0f, 1.0f)).XYZ;\n iB = AM_Multiply(lookAt, AM_Vec4(0.0f, -innerHalfHeight, 0.0f, 1.0f)).XYZ;\n\n oA = AM_Multiply(lookAt, AM_Vec4(0.0f, outerHalfHeight, 0.0f, 1.0f)).XYZ;\n oB = AM_Multiply(lookAt, AM_Vec4(0.0f, -outerHalfHeight, 0.0f, 1.0f)).XYZ;\n break;\n\n case GameEngineUpAxis_Z:\n iA = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, innerHalfHeight, 1.0f)).XYZ;\n iB = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, -innerHalfHeight, 1.0f)).XYZ;\n\n oA = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, outerHalfHeight, 1.0f)).XYZ;\n oB = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, -outerHalfHeight, 1.0f)).XYZ;\n break;\n }\n\n hmm_vec3 iE = iB - iA;\n hmm_vec3 iM = AM_Cross(iA, iB);\n\n hmm_vec3 oE = oB - oA;\n hmm_vec3 oM = AM_Cross(oA, oB);\n\n const float iDistanceToAxis = AM_Length(iM + AM_Cross(iE, x)) / AM_Length(iE);\n const float oDistanceToAxis = AM_Length(oM + AM_Cross(oE, x)) / AM_Length(oE);\n\n if (oDistanceToAxis >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(iDistanceToAxis);\n\n const float iDistanceToA = AM_Length(x - iA);\n const float iDistanceToB = AM_Length(x - iB);\n\n const float oDistanceToA = AM_Length(x - oA);\n const float oDistanceToB = AM_Length(x - oB);\n\n if (iDistanceToAxis <= _innerRadius && distanceToOrigin <= innerHalfHeight)\n return gain * 1.0f;\n\n if (oDistanceToAxis >= _outerRadius && distanceToOrigin >= outerHalfHeight)\n return gain * m_maxAttenuationFactor;\n\n const float rDelta = 1.0f - (oDistanceToAxis - _innerRadius) / (_outerRadius - _innerRadius);\n const float hDelta = 1.0f - (distanceToOrigin - _innerHalfHeight) / (_outerHalfHeight - _innerHalfHeight);\n\n const float delta = AM_MIN(rDelta, hDelta);\n\n return gain * AM_Lerp(m_maxAttenuationFactor, AM_CLAMP(delta, 0.0f, 1.0f), 1.0f);\n }\n} \n"},"prefix":{"kind":"string","value":"\n\n#include <Sound/AttenuationShapes.h>\n\n#include <SparkyStudios/Audio/Amplitude/Core/Engine.h>\n#include <SparkyStudios/Audio/Amplitude/Core/Log.h>\n\n#include <Core/EngineInternalState.h>\n\nnamespace SparkyStudios::Audio::Amplitude\n{\n AttenuationShape::AttenuationShape()\n : m_maxAttenuationFactor(1.0f)\n {}\n\n float AttenuationShape::GetAttenuationFactor(const Attenuation*, const hmm_vec3&, const ListenerInternalState*)\n {\n return m_maxAttenuationFactor;\n }\n\n float AttenuationShape::GetAttenuationFactor(const Attenuation*, const EntityInternalState*, const ListenerInternalState*)\n {\n return m_maxAttenuationFactor;\n }\n\n AttenuationShape* AttenuationShape::Create(const AttenuationShapeDefinition* definition)\n {\n if (definition == nullptr)\n return nullptr;\n\n AttenuationShape* shape = nullptr;\n\n switch (definition->model())\n {\n default:\n case AttenuationShapeModel_Default:\n shape = new AttenuationShape();\n break;\n case AttenuationShapeModel_Cone:\n shape = new ConeAttenuationShape(definition->settings_as_Cone());\n break;\n case AttenuationShapeModel_Sphere:\n shape = new SphereAttenuationShape(definition->settings_as_Sphere());\n break;\n case AttenuationShapeModel_Box:\n shape = new BoxAttenuationShape(definition->settings_as_Box());\n break;\n case AttenuationShapeModel_Capsule:\n shape = new CapsuleAttenuationShape(definition->settings_as_Capsule());\n break;\n }\n\n shape->m_maxAttenuationFactor = definition->max_attenuation_factor();\n\n return shape;\n }\n\n float ConeAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n if (const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n AM_Length(soundToListener) >= attenuation->GetMaxDistance())\n return 0.0f;\n\n \n return 1.0f;\n }\n\n float ConeAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - entity->GetLocation();\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n const float coneDist = AM_Dot(soundToListener, entity->GetDirection());\n\n if (coneDist < 0.0f || coneDist > _outerHeight)\n return gain * m_maxAttenuationFactor;\n\n if (coneDist > _innerHeight)\n return gain * AM_Lerp(1.0f, (coneDist - _innerHeight) / (_outerHeight - _innerHeight), m_maxAttenuationFactor);\n\n const float innerConeRadius = coneDist / _innerHeight * _innerRadius;\n const float outerConeRadius = coneDist / _outerHeight * _outerRadius;\n\n const float d = AM_Length(soundToListener - coneDist * entity->GetDirection());\n\n if (d <= innerConeRadius)\n return gain * 1.0f;\n if (d >= outerConeRadius)\n return gain * m_maxAttenuationFactor;\n\n const float delta = (distance - innerConeRadius) / (outerConeRadius - innerConeRadius);\n\n return gain * AM_Lerp(1.0f, AM_CLAMP(delta, 0.0f, 1.0f), m_maxAttenuationFactor);\n }\n\n float ConeAttenuationShape::GetOuterRadius() const\n {\n return _outerRadius;\n }\n\n float ConeAttenuationShape::GetInnerRadius() const\n {\n return _innerRadius;\n }\n\n float ConeAttenuationShape::GetInnerHeight() const\n {\n return _innerHeight;\n }\n\n float ConeAttenuationShape::GetOuterHeight() const\n {\n return _outerHeight;\n }\n\n float SphereAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n const float delta = (distance - _innerRadius) / (_outerRadius - _innerRadius);\n\n return gain * AM_Lerp(1.0f, AM_CLAMP(delta, 0.0f, 1.0f), m_maxAttenuationFactor);\n }\n\n float SphereAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n return GetAttenuationFactor(attenuation, entity->GetLocation(), listener);\n }\n\n float BoxAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - soundLocation;\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n\n return gain * _getFactor(soundLocation, listener, AM_Mat4d(1.0f));\n }\n\n float BoxAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n const hmm_vec3& soundToListener = listener->GetLocation() - entity->GetLocation();\n const float distance = AM_Length(soundToListener);\n if (distance >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(distance);\n\n return gain * _getFactor(entity->GetLocation(), listener, AM_LookAt(AM_Vec3(0, 0, 0), entity->GetDirection(), entity->GetUp()));\n }\n\n float BoxAttenuationShape::_getFactor(const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt)\n {\n lookAt = AM_Multiply(AM_Translate(soundLocation), lookAt);\n\n const hmm_vec3& x = listener->GetLocation();\n\n hmm_vec3 iP1, iP2, iP3, iP4, oP1, oP2, oP3, oP4;\n\n switch (amEngine->GetState()->up_axis)\n {\n default:\n case GameEngineUpAxis_Y:\n iP1 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n iP2 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfHeight, _innerHalfDepth, 1.0f)).XYZ;\n iP3 = AM_Multiply(lookAt, AM_Vec4(_innerHalfWidth, -_innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n iP4 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, _innerHalfHeight, -_innerHalfDepth, 1.0f)).XYZ;\n\n oP1 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n oP2 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfHeight, _outerHalfDepth, 1.0f)).XYZ;\n oP3 = AM_Multiply(lookAt, AM_Vec4(_outerHalfWidth, -_outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n oP4 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, _outerHalfHeight, -_outerHalfDepth, 1.0f)).XYZ;\n break;\n\n case GameEngineUpAxis_Z:\n iP1 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP2 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, _innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP3 = AM_Multiply(lookAt, AM_Vec4(_innerHalfWidth, -_innerHalfDepth, -_innerHalfHeight, 1.0f)).XYZ;\n iP4 = AM_Multiply(lookAt, AM_Vec4(-_innerHalfWidth, -_innerHalfDepth, _innerHalfHeight, 1.0f)).XYZ;\n\n oP1 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP2 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, _outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP3 = AM_Multiply(lookAt, AM_Vec4(_outerHalfWidth, -_outerHalfDepth, -_outerHalfHeight, 1.0f)).XYZ;\n oP4 = AM_Multiply(lookAt, AM_Vec4(-_outerHalfWidth, -_outerHalfDepth, _outerHalfHeight, 1.0f)).XYZ;\n break;\n }\n\n hmm_vec3 iU = AM_Normalize(iP2 - iP1);\n hmm_vec3 iV = AM_Normalize(iP3 - iP1);\n hmm_vec3 iW = AM_Normalize(iP4 - iP1);\n\n hmm_vec3 oU = AM_Normalize(oP2 - oP1);\n hmm_vec3 oV = AM_Normalize(oP3 - oP1);\n hmm_vec3 oW = AM_Normalize(oP4 - oP1);\n\n const float iUX = AM_Dot(iU, x);\n const float iVX = AM_Dot(iV, x);\n const float iWX = AM_Dot(iW, x);\n\n const float oUX = AM_Dot(oU, x);\n const float oVX = AM_Dot(oV, x);\n const float oWX = AM_Dot(oW, x);\n\n const float iUP1 = AM_Dot(iU, iP1);\n const float iVP1 = AM_Dot(iV, iP1);\n const float iWP1 = AM_Dot(iW, iP1);\n\n const float iUP2 = AM_Dot(iU, iP2);\n const float iVP3 = AM_Dot(iV, iP3);\n const float iWP4 = AM_Dot(iW, iP4);\n\n const float oUP1 = AM_Dot(oU, oP1);\n const float oVP1 = AM_Dot(oV, oP1);\n const float oWP1 = AM_Dot(oW, oP1);\n\n const float oUP2 = AM_Dot(oU, oP2);\n const float oVP3 = AM_Dot(oV, oP3);\n const float oWP4 = AM_Dot(oW, oP4);\n\n if (AM_BETWEEN(iUX, iUP1, iUP2) && AM_BETWEEN(iVX, iVP1, iVP3) && AM_BETWEEN(iWX, iWP1, iWP4))\n return 1.0f;\n\n if (!(AM_BETWEEN(oUX, oUP1, oUP2) && AM_BETWEEN(oVX, oVP1, oVP3) && AM_BETWEEN(oWX, oWP1, oWP4)))\n return m_maxAttenuationFactor;\n\n const float dP1 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP2 - oP1))) / (_outerHalfDepth - _innerHalfDepth);\n const float dP2 = HMM_ABS(AM_Dot(x - oP2, AM_Normalize(oP1 - oP2))) / (_outerHalfDepth - _innerHalfDepth);\n const float dP3 = HMM_ABS(AM_Dot(x - oP3, AM_Normalize(oP1 - oP3))) / (_outerHalfWidth - _innerHalfWidth);\n const float dP4 = HMM_ABS(AM_Dot(x - oP4, AM_Normalize(oP1 - oP4))) / (_outerHalfHeight - _innerHalfHeight);\n const float dP5 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP3 - oP1))) / (_outerHalfWidth - _innerHalfWidth);\n const float dP6 = HMM_ABS(AM_Dot(x - oP1, AM_Normalize(oP4 - oP1))) / (_outerHalfHeight - _innerHalfHeight);\n\n const float shortestRoad = AM_MIN(dP1, AM_MIN(dP2, AM_MIN(dP3, AM_MIN(dP4, AM_MIN(dP5, dP6)))));\n\n return AM_Lerp(m_maxAttenuationFactor, AM_CLAMP(shortestRoad, 0.0f, 1.0f), 1.0f);\n }\n\n float CapsuleAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener)\n {\n return _getFactor(attenuation, soundLocation, listener, AM_Mat4d(1.0f));\n }\n\n float CapsuleAttenuationShape::GetAttenuationFactor(\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener)\n {\n return _getFactor(\n attenuation, entity->GetLocation(), listener, AM_LookAt(AM_Vec3(0, 0, 0), entity->GetDirection(), entity->GetUp()));\n }\n\n float CapsuleAttenuationShape::_getFactor(\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt)\n {\n lookAt = AM_Multiply(AM_Translate(soundLocation), "},"suffix":{"kind":"string","value":" const float outerHalfHeight = _outerHalfHeight - _outerRadius;\n\n hmm_vec3 iA, iB, oA, oB;\n\n switch (amEngine->GetState()->up_axis)\n {\n default:\n case GameEngineUpAxis_Y:\n iA = AM_Multiply(lookAt, AM_Vec4(0.0f, innerHalfHeight, 0.0f, 1.0f)).XYZ;\n iB = AM_Multiply(lookAt, AM_Vec4(0.0f, -innerHalfHeight, 0.0f, 1.0f)).XYZ;\n\n oA = AM_Multiply(lookAt, AM_Vec4(0.0f, outerHalfHeight, 0.0f, 1.0f)).XYZ;\n oB = AM_Multiply(lookAt, AM_Vec4(0.0f, -outerHalfHeight, 0.0f, 1.0f)).XYZ;\n break;\n\n case GameEngineUpAxis_Z:\n iA = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, innerHalfHeight, 1.0f)).XYZ;\n iB = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, -innerHalfHeight, 1.0f)).XYZ;\n\n oA = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, outerHalfHeight, 1.0f)).XYZ;\n oB = AM_Multiply(lookAt, AM_Vec4(0.0f, 0.0f, -outerHalfHeight, 1.0f)).XYZ;\n break;\n }\n\n hmm_vec3 iE = iB - iA;\n hmm_vec3 iM = AM_Cross(iA, iB);\n\n hmm_vec3 oE = oB - oA;\n hmm_vec3 oM = AM_Cross(oA, oB);\n\n const float iDistanceToAxis = AM_Length(iM + AM_Cross(iE, x)) / AM_Length(iE);\n const float oDistanceToAxis = AM_Length(oM + AM_Cross(oE, x)) / AM_Length(oE);\n\n if (oDistanceToAxis >= attenuation->GetMaxDistance())\n return 0.0f;\n\n const float gain = attenuation->GetGainCurve().Get(iDistanceToAxis);\n\n const float iDistanceToA = AM_Length(x - iA);\n const float iDistanceToB = AM_Length(x - iB);\n\n const float oDistanceToA = AM_Length(x - oA);\n const float oDistanceToB = AM_Length(x - oB);\n\n if (iDistanceToAxis <= _innerRadius && distanceToOrigin <= innerHalfHeight)\n return gain * 1.0f;\n\n if (oDistanceToAxis >= _outerRadius && distanceToOrigin >= outerHalfHeight)\n return gain * m_maxAttenuationFactor;\n\n const float rDelta = 1.0f - (oDistanceToAxis - _innerRadius) / (_outerRadius - _innerRadius);\n const float hDelta = 1.0f - (distanceToOrigin - _innerHalfHeight) / (_outerHalfHeight - _innerHalfHeight);\n\n const float delta = AM_MIN(rDelta, hDelta);\n\n return gain * AM_Lerp(m_maxAttenuationFactor, AM_CLAMP(delta, 0.0f, 1.0f), 1.0f);\n }\n} \n"},"middle":{"kind":"string","value":"lookAt);\n\n const hmm_vec3& x = listener->GetLocation();\n\n const float distanceToOrigin = AM_Length(x - soundLocation);\n\n const float innerHalfHeight = _innerHalfHeight - _innerRadius;\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" class AttenuationShape\n\n {\n\n public:\n\n /**\n\n * @brief Returns the attenuation factor.\n\n *\n\n * This method is used only for position based sound sources.\n\n *\n\n * @param attenuation The Attenuator object to use for distance attenuation.\n\n * @param soundLocation The location of the sound source.\n\n * @param listener The listener for which compute the attenuation.\n\n *\n\n * @return The attenuation factor.\n\n */\n\n virtual float GetAttenuationFactor(\n\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener);\n\n\n\n /**\n\n * @brief Returns the attenuation factor.\n\n *\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":0,"score":142188.14681399876},{"content":" class Switch\n\n {\n\n public:\n\n /**\n\n * @brief Construct an uninitialized Switch.\n\n *\n\n * An uninitialized Switch cannot set no provide the actual switch state.\n\n */\n\n Switch();\n\n\n\n bool LoadSwitchDefinition(const std::string& switchDefinition);\n\n bool LoadSwitchDefinitionFromFile(AmOsString filename);\n\n\n\n /**\n\n * @brief Get the switch definition which generated this Switch.\n\n *\n\n * @return The switch definition.\n\n */\n\n [[nodiscard]] const SwitchDefinition* GetSwitchDefinition() const;\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":1,"score":130959.46592709041},{"content":" class ConeAttenuationShape : public AttenuationShape\n\n {\n\n public:\n\n explicit ConeAttenuationShape(const ConeAttenuationSettings* settings)\n\n : AttenuationShape()\n\n {\n\n _innerRadius = settings->inner_radius();\n\n _outerRadius = settings->outer_radius();\n\n _innerHeight = settings->inner_height();\n\n _outerHeight = settings->outer_height();\n\n }\n\n\n\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\n\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\n\n [[nodiscard]] float GetInnerRadius() const;\n\n [[nodiscard]] float GetOuterRadius() const;\n\n [[nodiscard]] float GetInnerHeight() const;\n\n [[nodiscard]] float GetOuterHeight() const;\n\n\n\n private:\n\n float _innerRadius;\n\n float _outerRadius;\n\n float _innerHeight;\n\n float _outerHeight;\n\n };\n\n\n","file_path":"src/Sound/AttenuationShapes.h","rank":2,"score":125584.57552466364},{"content":" class SphereAttenuationShape : public AttenuationShape\n\n {\n\n public:\n\n explicit SphereAttenuationShape(const SphereAttenuationSettings* settings)\n\n : AttenuationShape()\n\n {\n\n _innerRadius = settings->inner_radius();\n\n _outerRadius = settings->outer_radius();\n\n }\n\n\n\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\n\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\n\n\n\n [[nodiscard]] float GetInnerRadius() const\n\n {\n\n return _innerRadius;\n\n }\n\n\n\n [[nodiscard]] float GetOuterRadius() const\n\n {\n\n return _outerRadius;\n\n }\n\n\n\n private:\n\n float _innerRadius;\n\n float _outerRadius;\n\n };\n\n\n","file_path":"src/Sound/AttenuationShapes.h","rank":3,"score":125584.57552466364},{"content":" class BoxAttenuationShape : public AttenuationShape\n\n {\n\n public:\n\n explicit BoxAttenuationShape(const BoxAttenuationSettings* settings)\n\n : AttenuationShape()\n\n {\n\n _innerHalfHeight = settings->inner_half_height();\n\n _outerHalfHeight = settings->outer_half_height();\n\n _innerHalfWidth = settings->inner_half_width();\n\n _outerHalfWidth = settings->outer_half_width();\n\n _innerHalfDepth = settings->inner_half_depth();\n\n _outerHalfDepth = settings->outer_half_depth();\n\n }\n\n\n\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\n\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\n\n\n\n [[nodiscard]] float GetInnerHalfHeight() const\n\n {\n\n return _innerHalfHeight;\n","file_path":"src/Sound/AttenuationShapes.h","rank":4,"score":125584.57552466364},{"content":" class CapsuleAttenuationShape : public AttenuationShape\n\n {\n\n public:\n\n explicit CapsuleAttenuationShape(const CapsuleAttenuationSettings* settings)\n\n : AttenuationShape()\n\n {\n\n _innerRadius = settings->inner_radius();\n\n _outerRadius = settings->outer_radius();\n\n _innerHalfHeight = settings->inner_half_height();\n\n _outerHalfHeight = settings->outer_half_height();\n\n }\n\n\n\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\n\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\n\n\n\n [[nodiscard]] float GetInnerRadius() const\n\n {\n\n return _innerRadius;\n\n }\n\n\n","file_path":"src/Sound/AttenuationShapes.h","rank":5,"score":125584.57552466364},{"content":" float X, Y, Z;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Math/HandmadeMath.h","rank":6,"score":112187.17517551189},{"content":"\n\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\n\n\n\n#include <Core/EntityInternalState.h>\n\n#include <Core/ListenerInternalState.h>\n\n#include <SparkyStudios/Audio/Amplitude/Math/Curve.h>\n\n\n\n#include \"attenuation_definition_generated.h\"\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n","file_path":"src/Sound/AttenuationShapes.h","rank":7,"score":103357.3084903441},{"content":" [[nodiscard]] float GetOuterRadius() const\n\n {\n\n return _outerRadius;\n\n }\n\n\n\n [[nodiscard]] float GetInnerHalfHeight() const\n\n {\n\n return _innerHalfHeight;\n\n }\n\n\n\n [[nodiscard]] float GetOuterHalfHeight() const\n\n {\n\n return _outerHalfHeight;\n\n }\n\n\n\n private:\n\n float _getFactor(const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt);\n\n\n\n float _innerRadius;\n\n float _outerRadius;\n\n float _innerHalfHeight;\n\n float _outerHalfHeight;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\n","file_path":"src/Sound/AttenuationShapes.h","rank":8,"score":103349.68920415836},{"content":" }\n\n\n\n [[nodiscard]] float GetOuterHalfDepth() const\n\n {\n\n return _outerHalfDepth;\n\n }\n\n\n\n private:\n\n float _getFactor(const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt);\n\n\n\n float _innerHalfHeight;\n\n float _outerHalfHeight;\n\n float _innerHalfWidth;\n\n float _outerHalfWidth;\n\n float _innerHalfDepth;\n\n float _outerHalfDepth;\n\n };\n\n\n","file_path":"src/Sound/AttenuationShapes.h","rank":9,"score":103344.72622815396},{"content":" }\n\n\n\n [[nodiscard]] float GetOuterHalfHeight() const\n\n {\n\n return _outerHalfHeight;\n\n }\n\n\n\n [[nodiscard]] float GetInnerHalfWidth() const\n\n {\n\n return _innerHalfWidth;\n\n }\n\n\n\n [[nodiscard]] float GetOuterHalfWidth() const\n\n {\n\n return _outerHalfWidth;\n\n }\n\n\n\n [[nodiscard]] float GetInnerHalfDepth() const\n\n {\n\n return _innerHalfDepth;\n","file_path":"src/Sound/AttenuationShapes.h","rank":10,"score":103340.0843248977},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\n\n#define SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n","file_path":"src/Sound/AttenuationShapes.h","rank":11,"score":103339.2070581073},{"content":" class Entity\n\n {\n\n public:\n\n /**\n\n * @brief Creates an uninitialized Entity.\n\n *\n\n * An uninitialized Entity cannot provide location and orientation\n\n * information, and therefore cannot play sounds.\n\n */\n\n Entity();\n\n\n\n explicit Entity(EntityInternalState* state);\n\n\n\n /**\n\n * @brief Uninitializes this Entity.\n\n *\n\n * Note that this does not destroy the internal state it references,\n\n * it just removes this reference to it.\n\n */\n\n void Clear();\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":12,"score":102221.67793893711},{"content":" class Listener\n\n {\n\n public:\n\n /**\n\n * @brief Construct an uninitialized Listener.\n\n *\n\n * An uninitialized Listener cannot have its location set or queried.\n\n * To initialize the Listener, use <code>Engine::AddListener();</code>.\n\n */\n\n Listener();\n\n\n\n explicit Listener(ListenerInternalState* state);\n\n\n\n /**\n\n * @brief Uninitialize this Listener.\n\n *\n\n * Note that this does not destroy the internal state it references,\n\n * it just removes this reference to it. To destroy the Listener,\n\n * use <code>Engine::RemoveListener();</code>.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":13,"score":102220.23484192528},{"content":" class Attenuation;\n\n\n\n /**\n\n * @brief The propagation shape for positional sounds.\n\n *\n\n * This allows to increase the attenuation according to the shape of\n\n * the sound propagation.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":14,"score":102195.66138483437},{"content":" class Attenuation\n\n {\n\n public:\n\n /**\n\n * @brief Creates an uninitialized Attenuation.\n\n *\n\n * An uninitialized Attenuation instance cannot compute gain nor provide\n\n * attenuation configuration data.\n\n */\n\n Attenuation();\n\n\n\n bool LoadAttenuationDefinition(const std::string& attenuation);\n\n bool LoadAttenuationDefinitionFromFile(AmOsString filename);\n\n\n\n /**\n\n * @brief Returns the gain of the sound from the given distance to the listener.\n\n *\n\n * @param soundLocation The location of the sound source.\n\n * @param listener The listener which is hearing the sound.\n\n *\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":15,"score":102195.66138483437},{"content":" class EntityInternalState;\n\n\n\n /**\n\n * @brief An Entity represent an object in the game.\n\n *\n\n * Amplitude use entities to link sound to an object in the game. Each sounds\n\n * played from an entity get the location and orientation data fom that entity.\n\n *\n\n * The Entity class is a lightweight reference to a EntityInternalState object\n\n * which is managed by the Engine.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":33,"score":96714.63170564332},{"content":" class ListenerInternalState;\n\n\n\n /**\n\n * @brief An object whose distance from sounds determines their gain.\n\n *\n\n * The Listener class is a lightweight reference to a ListenerInternalState\n\n * which is managed by the Engine. Multiple Listener objects may point to\n\n * the same underlying data.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":34,"score":96713.25283435184},{"content":" class SwitchContainer\n\n {\n\n public:\n\n SwitchContainer();\n\n ~SwitchContainer();\n\n\n\n bool LoadSwitchContainerDefinition(const std::string& source, EngineInternalState* state);\n\n bool LoadSwitchContainerDefinitionFromFile(AmOsString filename, EngineInternalState* state);\n\n void AcquireReferences(EngineInternalState* state);\n\n void ReleaseReferences(EngineInternalState* state);\n\n [[nodiscard]] const SwitchContainerDefinition* GetSwitchContainerDefinition() const;\n\n\n\n /**\n\n * @brief Gets the actual gain of the switch container.\n\n *\n\n * @return The SwitchContainer gain.\n\n */\n\n const RtpcValue& GetGain() const;\n\n\n\n /**\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":35,"score":96691.15634463904},{"content":" [[nodiscard]] AmReal32 GetObstruction() const;\n\n\n\n /**\n\n * @brief Get the occlusion level of sounds played by this Entity.\n\n *\n\n * @return The occlusion amount.\n\n */\n\n [[nodiscard]] AmReal32 GetOcclusion() const;\n\n\n\n /**\n\n * @brief Returns the internal state of this Entity.\n\n *\n\n * @return The Entity internal state.\n\n */\n\n [[nodiscard]] EntityInternalState* GetState() const;\n\n\n\n private:\n\n EntityInternalState* _state;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SS_AMPLITUDE_AUDIO_ENTITY_H\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":36,"score":91617.33586616952},{"content":" */\n\n [[nodiscard]] hmm_vec3 GetLocation() const;\n\n\n\n /**\n\n * @brief Set the location of this Listener.\n\n *\n\n * @param location The new location of this Listener.\n\n */\n\n void SetLocation(const hmm_vec3& location);\n\n\n\n /**\n\n * @brief Set the location, direction and up vector of this Listener.\n\n *\n\n * @param direction The direction of this Listener.\n\n * @param up THe up vector of this Listener.\n\n */\n\n void SetOrientation(const hmm_vec3& direction, const hmm_vec3& up);\n\n\n\n /**\n\n * @brief Returns the internal state of this Listener.\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":37,"score":91616.0193013305},{"content":"\n\n /**\n\n * @brief Checks whether this Entity has been initialized.\n\n *\n\n * @return boolean true if this Entity has been initialized.\n\n */\n\n [[nodiscard]] bool Valid() const;\n\n\n\n /**\n\n * @brief Gets the ID of this Entity in game.\n\n *\n\n * @return The game Entity ID.\n\n */\n\n [[nodiscard]] AmEntityID GetId() const;\n\n\n\n /**\n\n * @brief Sets the location of this Entity.\n\n *\n\n * @param location The new location.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":38,"score":91615.62349306046},{"content":" *\n\n * @return ListenerInternalState*\n\n */\n\n [[nodiscard]] ListenerInternalState* GetState() const\n\n {\n\n return _state;\n\n }\n\n\n\n private:\n\n ListenerInternalState* _state;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SPARK_AUDIO_LISTENER_H\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":39,"score":91614.87786536365},{"content":" * @return The computed gain value fom the curve.\n\n */\n\n float GetGain(const hmm_vec3& soundLocation, const ListenerInternalState* listener) const;\n\n\n\n /**\n\n * @brief Returns the gain of the sound from the given distance to the listener.\n\n *\n\n * @param entity The entity which emits the sound.\n\n * @param listener The listener which is hearing the sound.\n\n *\n\n * @return The computed gain value fom the curve.\n\n */\n\n float GetGain(const EntityInternalState* entity, const ListenerInternalState* listener) const;\n\n\n\n /**\n\n * @brief Returns the unique ID of this Attenuation.\n\n *\n\n * @return The Attenuation ID.\n\n */\n\n [[nodiscard]] AmAttenuationID GetId() const;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":40,"score":91614.76340971605},{"content":" void Clear();\n\n\n\n /**\n\n * @brief Checks whether this Listener has been initialized.\n\n *\n\n * @return bool true if this Listener has been initialized.\n\n */\n\n [[nodiscard]] bool Valid() const;\n\n\n\n /**\n\n * @brief Gets the ID of this Listener in game.\n\n *\n\n * @return The game Listener ID.\n\n */\n\n [[nodiscard]] AmListenerID GetId() const;\n\n\n\n /**\n\n * @brief Returns the location of this Listener.\n\n *\n\n * @return hmm_vec3 The location of this Listener.\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":41,"score":91614.55152653145},{"content":" * This method is used by position and orientation based sound sources.\n\n *\n\n * @param attenuation The Attenuator object to use for distance attenuation.\n\n * @param entity The entity which emits the sound.\n\n * @param listener The listener for which compute the attenuation.\n\n *\n\n * @return The attenuation factor.\n\n */\n\n virtual float GetAttenuationFactor(\n\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener);\n\n\n\n /**\n\n * @brief Creates an AttenuationShape object from the definition.\n\n *\n\n * @param definition The attenuation shape definition.\n\n *\n\n * @return An AttenuationShape object.\n\n */\n\n static AttenuationShape* Create(const AttenuationShapeDefinition* definition);\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":42,"score":91613.93075991412},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SS_AMPLITUDE_AUDIO_ENTITY_H\n\n#define SS_AMPLITUDE_AUDIO_ENTITY_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":43,"score":91612.64964304243},{"content":" void SetLocation(const hmm_vec3& location);\n\n\n\n /**\n\n * @brief Gets the current location of this Entity.\n\n *\n\n * @return The current location of this Entity.\n\n */\n\n [[nodiscard]] const hmm_vec3& GetLocation() const;\n\n\n\n /**\n\n * @brief Sets the orientation of this Entity.\n\n *\n\n * @param direction The direction towards the Entity.\n\n * @param up The up vector.\n\n */\n\n void SetOrientation(const hmm_vec3& direction, const hmm_vec3& up);\n\n\n\n /**\n\n * @brief Get the direction vector of the Entity.\n\n *\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":44,"score":91611.89318147331},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SPARK_AUDIO_LISTENER_H\n\n#define SPARK_AUDIO_LISTENER_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Listener.h","rank":45,"score":91611.6276566267},{"content":" * @return The direction vector.\n\n */\n\n [[nodiscard]] const hmm_vec3& GetDirection() const;\n\n\n\n /**\n\n * @brief Get the up vector of the Entity.\n\n *\n\n * @return The up vector.\n\n */\n\n [[nodiscard]] const hmm_vec3& GetUp() const;\n\n\n\n /**\n\n * @brief Update the state of this Entity.\n\n *\n\n * This method is called automatically by the Engine\n\n * on each frames.\n\n */\n\n void Update();\n\n\n\n /**\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":46,"score":91610.8871300695},{"content":"\n\n#include <SparkyStudios/Audio/Amplitude/Core/Entity.h>\n\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\n\n#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Math/Curve.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n\n struct AttenuationDefinition;\n\n struct AttenuationShapeDefinition;\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":47,"score":91610.82931525695},{"content":" * @brief Set the obstruction level of sounds played by this Entity.\n\n *\n\n * @param obstruction The obstruction amount. This is provided by the\n\n * game engine.\n\n */\n\n void SetObstruction(AmReal32 obstruction);\n\n\n\n /**\n\n * @brief Set the occlusion level of sounds played by this Entity.\n\n *\n\n * @param occlusion The occlusion amount. This is provided by the\n\n * game engine.\n\n */\n\n void SetOcclusion(AmReal32 occlusion);\n\n\n\n /**\n\n * @brief Get the obstruction level of sounds played by this Entity.\n\n *\n\n * @return The obstruction amount.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Core/Entity.h","rank":48,"score":91610.7745900066},{"content":" protected:\n\n AttenuationShape();\n\n\n\n /**\n\n * @brief THe maximum attenuation factor to apply to the sound gain.\n\n */\n\n float m_maxAttenuationFactor;\n\n };\n\n\n\n /**\n\n * @brief An Attenuation materialize how the sound volume and other distance-based\n\n * parameters are calculated following the distance of the sound source to the listener.\n\n *\n\n * The Attenuation is an shared object between sound sources. They are used only\n\n * when the sound need to lower his volume due to the distance of from the listener,\n\n * and many other parameters.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":49,"score":91608.54457730454},{"content":"\n\n /**\n\n * @brief Returns the name of this Attenuation.\n\n *\n\n * @return The Attenuation name.\n\n */\n\n [[nodiscard]] const std::string& GetName() const;\n\n\n\n /**\n\n * @brief Returns the shape object of this Attenuation.\n\n *\n\n * @return The Attenuation shape.\n\n */\n\n [[nodiscard]] AttenuationShape* GetShape() const;\n\n\n\n /**\n\n * @brief Returns the gain curve attached to this Attenuation.\n\n *\n\n * @return The attenuation's gain curve.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":50,"score":91608.23276200757},{"content":" [[nodiscard]] const Curve& GetGainCurve() const;\n\n\n\n /**\n\n * @brief Returns the maximum distance for a fully attenuated sound\n\n *\n\n * @return The maximum sound attenuation distance.\n\n */\n\n [[nodiscard]] double GetMaxDistance() const;\n\n\n\n /**\n\n * @brief Get the attenuation definition which generated this attenuation.\n\n *\n\n * @return The attenuation definition.\n\n */\n\n [[nodiscard]] const AttenuationDefinition* GetAttenuationDefinition() const;\n\n\n\n RefCounter* GetRefCounter();\n\n\n\n private:\n\n std::string _source;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":51,"score":91606.17624753401},{"content":"\n\n AmAttenuationID _id;\n\n std::string _name;\n\n\n\n double _maxDistance;\n\n\n\n AttenuationShape* _shape;\n\n\n\n Curve _gainCurve;\n\n\n\n RefCounter _refCounter;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SS_AMPLITUDE_AUDIO_ATTENUATION_H\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":52,"score":91605.64051211487},{"content":"#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n\n struct SwitchDefinition;\n\n\n\n /**\n\n * @brief A switch state.\n\n */\n\n struct SwitchState\n\n {\n\n /**\n\n * @brief The ID of this switch state.\n\n *\n\n * This ID is unique only in the parent switch.\n\n */\n\n AmObjectID m_id;\n\n\n\n /**\n\n * @brief The name of this switch state.\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":53,"score":91602.02884480984},{"content":" * list of switch states.\n\n */\n\n void SetState(const std::string& name);\n\n\n\n /**\n\n * @brief Get the list of available SwitchStates in this Switch.\n\n *\n\n * @return The list of available SwitchStates.\n\n */\n\n [[nodiscard]] const std::vector<SwitchState>& GetSwitchStates() const;\n\n\n\n RefCounter* GetRefCounter();\n\n\n\n private:\n\n std::string _source;\n\n\n\n AmSwitchID _id;\n\n std::string _name;\n\n\n\n SwitchState _activeState;\n\n std::vector<SwitchState> _states;\n\n\n\n RefCounter _refCounter;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SS_AMPLITUDE_AUDIO_SWITCH_H\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":54,"score":91595.06740267207},{"content":" /**\n\n * @brief Get the ID of this Switch.\n\n *\n\n * @return The switch ID.\n\n */\n\n [[nodiscard]] AmSwitchID GetId() const;\n\n\n\n /**\n\n * @brief Get the name of this Switch.\n\n *\n\n * @return The switch name.\n\n */\n\n [[nodiscard]] const std::string& GetName() const;\n\n\n\n /**\n\n * @brief Get the current state of the switch.\n\n *\n\n * @return The current state of the switch.\n\n */\n\n [[nodiscard]] const SwitchState& GetState() const;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":55,"score":91593.4397802627},{"content":" */\n\n std::string m_name;\n\n\n\n /**\n\n * @brief Checks whether this switch state is valid.\n\n *\n\n * @return true if the switch state is valid, false otherwise.\n\n */\n\n [[nodiscard]] bool Valid() const;\n\n\n\n bool operator==(const SwitchState& other) const;\n\n bool operator!=(const SwitchState& other) const;\n\n };\n\n\n\n /**\n\n * @brief A switch is a collection of states which can change the sound played during from a SwitchContainer the game.\n\n *\n\n * For example, you can have a switch named \"SurfaceType\" which have \"wood\", \"grass\", \"metal\" and \"water\" as states. A\n\n * SwitchContainer using this switch can group sounds per switch states, so when a state is active, all the sounds of\n\n * that state are played.\n\n *\n\n * The Switch is a shared object between sound sources. They are used only by SwitchContainer objects.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":56,"score":91593.17933246148},{"content":"\n\n /**\n\n * @brief Set the current state of the switch.\n\n *\n\n * @param state The state to apply to the switch.\n\n */\n\n void SetState(const SwitchState& state);\n\n\n\n /**\n\n * @brief Set the current state of the switch using the state ID.\n\n *\n\n * @param id The ID of the state to apply. This ID should exist in the list\n\n * of switch states.\n\n */\n\n void SetState(AmObjectID id);\n\n\n\n /**\n\n * @brief Set the current state of the switch using the state name.\n\n *\n\n * @param name The name of the state to apply. This name should exist in the\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":57,"score":91592.42864737849},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SS_AMPLITUDE_AUDIO_SWITCH_H\n\n#define SS_AMPLITUDE_AUDIO_SWITCH_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h","rank":58,"score":91591.63801889843},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SS_AMPLITUDE_AUDIO_ATTENUATION_H\n\n#define SS_AMPLITUDE_AUDIO_ATTENUATION_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h","rank":59,"score":91590.49882702605},{"content":" /**\n\n * @brief Return the bus this SwitchContainer will play on.\n\n *\n\n * @return The bus this SwitchContainer will play on.\n\n */\n\n [[nodiscard]] BusInternalState* GetBus() const;\n\n\n\n /**\n\n * @brief Returns the effect attached to this SwitchContainer.\n\n *\n\n * @return The effect of this SwitchContainer if available or nullptr.\n\n */\n\n [[nodiscard]] const Effect* GetEffect() const;\n\n\n\n /**\n\n * @brief Returns the attenuation attached to this SwitchContainer.\n\n *\n\n * @return The attenuation of this SwitchContainer if available or nullptr.\n\n */\n\n [[nodiscard]] const Attenuation* GetAttenuation() const;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":60,"score":88356.65982626902},{"content":"#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Effect.h>\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Fader.h>\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Rtpc.h>\n\n#include <SparkyStudios/Audio/Amplitude/Sound/Switch.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n\n struct SwitchContainerDefinition;\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":61,"score":88353.73280938121},{"content":"\n\n /**\n\n * @brief Returns the switch attached to this SwitchContainer.\n\n *\n\n * @return The switch of this SwitchContainer if available or nullptr.\n\n */\n\n [[nodiscard]] const Switch* GetSwitch() const;\n\n\n\n /**\n\n * @brief Get the fade in Fader for the given sound object ID.\n\n *\n\n * @param id The ID of the sound object.\n\n *\n\n * @return The fade in Fader.\n\n */\n\n Fader* GetFaderIn(AmObjectID id) const;\n\n\n\n /**\n\n * @brief Get the fade out Fader for the given sound object ID.\n\n *\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":62,"score":88348.57799164554},{"content":" [[nodiscard]] const std::vector<SwitchContainerItem>& GetSoundObjects(AmObjectID stateId) const;\n\n\n\n private:\n\n // The bus this SwitchContainer will play on.\n\n BusInternalState* _bus;\n\n\n\n // The World scope sound scheduler\n\n Switch* _switch;\n\n\n\n std::string _source;\n\n std::map<AmObjectID, std::vector<SwitchContainerItem>> _sounds;\n\n std::map<AmObjectID, Fader*> _fadersIn;\n\n std::map<AmObjectID, Fader*> _fadersOut;\n\n\n\n AmSwitchContainerID _id;\n\n std::string _name;\n\n\n\n RtpcValue _gain;\n\n RtpcValue _priority;\n\n\n\n Effect* _effect;\n\n Attenuation* _attenuation;\n\n\n\n RefCounter _refCounter;\n\n };\n\n} // namespace SparkyStudios::Audio::Amplitude\n\n\n\n#endif // SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":63,"score":88348.22793343583},{"content":" * @brief Gets the actual priority of the switch container.\n\n *\n\n * @return The SwitchContainer priority.\n\n */\n\n const RtpcValue& GetPriority() const;\n\n\n\n /**\n\n * @brief Returns the unique ID of this SwitchContainer.\n\n *\n\n * @return The SwitchContainer unique ID.\n\n */\n\n [[nodiscard]] AmCollectionID GetId() const;\n\n\n\n /**\n\n * @brief Returns the name of this SwitchContainer.\n\n *\n\n * @return The SwitchContainer name.\n\n */\n\n [[nodiscard]] const std::string& GetName() const;\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":64,"score":88347.22025052848},{"content":" * @param id The ID of the sound object.\n\n *\n\n * @return The fade out Fader.\n\n */\n\n Fader* GetFaderOut(AmObjectID id) const;\n\n\n\n /**\n\n * @brief Get the references counter of this instance.\n\n *\n\n * @return The references counter.\n\n */\n\n RefCounter* GetRefCounter();\n\n\n\n /**\n\n * @brief Returns the list of sound objects referenced in this SwitchContainer for the given state.\n\n *\n\n * @param state The switch state to get the objects for.\n\n *\n\n * @return The list of sound object IDs.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":65,"score":88343.75779748979},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#pragma once\n\n\n\n#ifndef SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\n\n#define SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":66,"score":88338.77531257487},{"content":" class CurveDefinition;\n","file_path":"include/SparkyStudios/Audio/Amplitude/Math/Curve.h","rank":67,"score":85355.6052770595},{"content":" class CurvePartDefinition;\n\n\n\n /**\n\n * @brief A single point in a Curve.\n\n */\n\n struct CurvePoint\n\n {\n\n /**\n\n * @brief The coordinates of the point over the X axis.\n\n */\n\n double x;\n\n\n\n /**\n\n * @brief The coordinates of the point over the Y axis.\n\n */\n\n float y;\n\n\n\n bool operator==(const CurvePoint& rhs) const;\n\n bool operator!=(const CurvePoint& rhs) const;\n\n };\n\n\n\n /**\n\n * @brief A part of a Curve.\n\n *\n\n * CurveParts allows to a curve to have different fading algorithms at the same time.\n\n * Each CurvePart has a start and end point, and the fading algorithm which moves the value\n\n * from the start point to the end point.\n\n */\n","file_path":"include/SparkyStudios/Audio/Amplitude/Math/Curve.h","rank":68,"score":82527.62308002886},{"content":" drwav_int32 delta[2];\n","file_path":"src/Utils/miniaudio/miniaudio.h","rank":69,"score":80755.62479326654},{"content":" float* pNewGains;\n","file_path":"src/Utils/miniaudio/miniaudio.h","rank":70,"score":80176.13771310567},{"content":" class BusInternalState;\n\n struct EngineInternalState;\n\n\n\n struct SwitchContainerItem\n\n {\n\n AmObjectID m_id;\n\n bool m_continueBetweenStates;\n\n AmTime m_fadeInDuration;\n\n AmUInt8 m_fadeInAlgorithm;\n\n AmTime m_fadeOutDuration;\n\n AmUInt8 m_fadeOutAlgorithm;\n\n RtpcValue m_gain;\n\n };\n\n\n","file_path":"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h","rank":71,"score":79838.18304054478},{"content":" Curve gain;\n","file_path":"src/Core/EngineInternalState.h","rank":72,"score":79407.77331220993},{"content":" drwav_int32 delta[2];\n","file_path":"src/Core/Codecs/WAV/dr_wav.h","rank":73,"score":78180.89220724825},{"content":" float* pNewChannelGainsOut; /* An offset of _pHeap. Used by ma_spatializer_process_pcm_frames() to store new channel gains. The number of elements in this array is equal to config.channelsOut. */\n","file_path":"src/Utils/miniaudio/miniaudio.h","rank":74,"score":77690.6523500622},{"content":" size_t newGainsOffset;\n","file_path":"src/Utils/miniaudio/miniaudio.h","rank":75,"score":77684.84247560264},{"content":" size_t newChannelGainsOffset;\n","file_path":"src/Utils/miniaudio/miniaudio.h","rank":76,"score":75343.70436137967},{"content":" class EntityInternalState\n\n {\n\n public:\n\n EntityInternalState();\n\n\n\n /**\n\n * @brief Gets the ID of this Entity in game.\n\n *\n\n * @return The game Entity ID.\n\n */\n\n [[nodiscard]] AmEntityID GetId() const;\n\n\n\n /**\n\n * @brief Sets the ID of this Entity in game.\n\n *\n\n * @param id The game Entity ID.\n\n */\n\n void SetId(AmEntityID id);\n\n\n\n /**\n","file_path":"src/Core/EntityInternalState.h","rank":77,"score":58209.405099555705},{"content":" class ListenerInternalState\n\n {\n\n public:\n\n ListenerInternalState();\n\n\n\n /**\n\n * @brief Gets the ID of this Listener in game.\n\n *\n\n * @return The game Listener ID.\n\n */\n\n [[nodiscard]] AmListenerID GetId() const;\n\n\n\n /**\n\n * @brief Sets the ID of this Listener in game.\n\n *\n\n * @param id The game Listener ID.\n\n */\n\n void SetId(AmListenerID id);\n\n\n\n /**\n","file_path":"src/Core/ListenerInternalState.h","rank":78,"score":58207.962002543856},{"content":"namespace SparkyStudios::Audio::Amplitude\n\n{\n\n Listener::Listener()\n\n : _state(nullptr)\n\n {}\n\n\n\n Listener::Listener(ListenerInternalState* state)\n\n : _state(state)\n\n {}\n\n\n\n void Listener::Clear()\n\n {\n\n _state = nullptr;\n\n }\n\n\n\n bool Listener::Valid() const\n\n {\n\n return _state != nullptr && _state->GetId() != kAmInvalidObjectId && _state->node.in_list();\n\n }\n\n\n","file_path":"src/Core/Listener.cpp","rank":79,"score":51691.525093473225},{"content":" Entity::Entity()\n\n : _state(nullptr)\n\n {}\n\n\n\n Entity::Entity(EntityInternalState* state)\n\n : _state(state)\n\n {}\n\n\n\n void Entity::Clear()\n\n {\n\n _state = nullptr;\n\n }\n\n\n\n bool Entity::Valid() const\n\n {\n\n return _state != nullptr && _state->GetId() != kAmInvalidObjectId && _state->node.in_list();\n\n }\n\n\n\n AmEntityID Entity::GetId() const\n\n {\n","file_path":"src/Core/Entity.cpp","rank":80,"score":51690.16946763257},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#include <SparkyStudios/Audio/Amplitude/Core/Entity.h>\n\n\n\n#include <Core/EntityInternalState.h>\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n","file_path":"src/Core/Entity.cpp","rank":81,"score":51686.38015417035},{"content":" {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetObstruction(obstruction);\n\n }\n\n\n\n void Entity::SetOcclusion(AmReal32 occlusion)\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetOcclusion(occlusion);\n\n }\n\n\n\n AmReal32 Entity::GetObstruction() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetObstruction();\n\n }\n\n\n\n AmReal32 Entity::GetOcclusion() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetOcclusion();\n\n }\n\n\n\n EntityInternalState* Entity::GetState() const\n\n {\n\n return _state;\n\n }\n\n} // namespace SparkyStudios::Audio::Amplitude\n","file_path":"src/Core/Entity.cpp","rank":82,"score":51686.01833393406},{"content":"\n\n _gainCurve.Initialize(definition->gain_curve());\n\n\n\n _shape = AttenuationShape::Create(definition->shape());\n\n\n\n return true;\n\n }\n\n\n\n bool Attenuation::LoadAttenuationDefinitionFromFile(AmOsString filename)\n\n {\n\n std::string source;\n\n return LoadFile(filename, &source) && LoadAttenuationDefinition(source);\n\n }\n\n\n\n float Attenuation::GetGain(const hmm_vec3& soundLocation, const ListenerInternalState* listener) const\n\n {\n\n return _shape->GetAttenuationFactor(this, soundLocation, listener);\n\n }\n\n\n\n float Attenuation::GetGain(const EntityInternalState* entity, const ListenerInternalState* listener) const\n","file_path":"src/Sound/Attenuation.cpp","rank":83,"score":51685.52567511867},{"content":" AmListenerID Listener::GetId() const\n\n {\n\n return _state->GetId();\n\n }\n\n\n\n void Listener::SetOrientation(const hmm_vec3& direction, const hmm_vec3& up)\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetOrientation(direction, up);\n\n }\n\n\n\n hmm_vec3 Listener::GetLocation() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetLocation();\n\n }\n\n\n\n void Listener::SetLocation(const hmm_vec3& location)\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetLocation(location);\n\n }\n\n} // namespace SparkyStudios::Audio::Amplitude\n","file_path":"src/Core/Listener.cpp","rank":84,"score":51684.628065718134},{"content":"\n\n const hmm_vec3& Entity::GetDirection() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetDirection();\n\n }\n\n\n\n const hmm_vec3& Entity::GetUp() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetUp();\n\n }\n\n\n\n void Entity::Update()\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->Update();\n\n }\n\n\n\n void Entity::SetObstruction(AmReal32 obstruction)\n","file_path":"src/Core/Entity.cpp","rank":85,"score":51683.89400487297},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\n\n\n\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\n\n\n\n#include <Core/ListenerInternalState.h>\n\n\n","file_path":"src/Core/Listener.cpp","rank":86,"score":51683.86966246855},{"content":" return _state->GetId();\n\n }\n\n\n\n void Entity::SetLocation(const hmm_vec3& location)\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetLocation(location);\n\n }\n\n\n\n const hmm_vec3& Entity::GetLocation() const\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n return _state->GetLocation();\n\n }\n\n\n\n void Entity::SetOrientation(const hmm_vec3& direction, const hmm_vec3& up)\n\n {\n\n AMPLITUDE_ASSERT(Valid());\n\n _state->SetOrientation(direction, up);\n\n }\n","file_path":"src/Core/Entity.cpp","rank":87,"score":51682.9350351394},{"content":"namespace SparkyStudios::Audio::Amplitude\n\n{\n\n Attenuation::Attenuation()\n\n : _gainCurve()\n\n , _id(kAmInvalidObjectId)\n\n , _name()\n\n , _maxDistance(0.0f)\n\n , _shape(nullptr)\n\n , _refCounter()\n\n {}\n\n\n\n bool Attenuation::LoadAttenuationDefinition(const std::string& attenuation)\n\n {\n\n _source = attenuation;\n\n const AttenuationDefinition* definition = GetAttenuationDefinition();\n\n\n\n _id = definition->id();\n\n _name = definition->name()->str();\n\n\n\n _maxDistance = definition->max_distance();\n","file_path":"src/Sound/Attenuation.cpp","rank":88,"score":51680.83384928255},{"content":" {\n\n return &_refCounter;\n\n }\n\n\n\n AttenuationShape* Attenuation::GetShape() const\n\n {\n\n return _shape;\n\n }\n\n\n\n const Curve& Attenuation::GetGainCurve() const\n\n {\n\n return _gainCurve;\n\n }\n\n\n\n double Attenuation::GetMaxDistance() const\n\n {\n\n return _maxDistance;\n\n }\n\n} // namespace SparkyStudios::Audio::Amplitude","file_path":"src/Sound/Attenuation.cpp","rank":89,"score":51679.82511723951},{"content":" {\n\n return _shape->GetAttenuationFactor(this, entity, listener);\n\n }\n\n\n\n AmAttenuationID Attenuation::GetId() const\n\n {\n\n return _id;\n\n }\n\n\n\n const std::string& Attenuation::GetName() const\n\n {\n\n return _name;\n\n }\n\n\n\n const AttenuationDefinition* Attenuation::GetAttenuationDefinition() const\n\n {\n\n return Amplitude::GetAttenuationDefinition(_source.c_str());\n\n }\n\n\n\n RefCounter* Attenuation::GetRefCounter()\n","file_path":"src/Sound/Attenuation.cpp","rank":90,"score":51675.96375043355},{"content":" {\n\n _states[i].m_id = definition->states()->Get(i)->id();\n\n _states[i].m_name = definition->states()->Get(i)->name()->str();\n\n }\n\n\n\n return true;\n\n }\n\n\n\n bool Switch::LoadSwitchDefinitionFromFile(AmOsString filename)\n\n {\n\n std::string source;\n\n return Amplitude::LoadFile(filename, &source) && LoadSwitchDefinition(source);\n\n }\n\n\n\n const SwitchDefinition* Switch::GetSwitchDefinition() const\n\n {\n\n return Amplitude::GetSwitchDefinition(_source.c_str());\n\n }\n\n\n\n AmSwitchID Switch::GetId() const\n","file_path":"src/Sound/Switch.cpp","rank":91,"score":51668.332351701014},{"content":" , _name()\n\n , _activeState()\n\n , _states()\n\n , _refCounter()\n\n {}\n\n\n\n bool Switch::LoadSwitchDefinition(const std::string& switchDefinition)\n\n {\n\n AMPLITUDE_ASSERT(_id == kAmInvalidObjectId);\n\n\n\n _source = switchDefinition;\n\n const SwitchDefinition* definition = GetSwitchDefinition();\n\n\n\n _id = definition->id();\n\n _name = definition->name()->str();\n\n\n\n flatbuffers::uoffset_t size = definition->states() ? definition->states()->size() : 0;\n\n _states.resize(size);\n\n\n\n for (flatbuffers::uoffset_t i = 0; i < size; ++i)\n","file_path":"src/Sound/Switch.cpp","rank":92,"score":51667.7586547279},{"content":"\n\n const std::vector<SwitchState>& Switch::GetSwitchStates() const\n\n {\n\n return _states;\n\n }\n\n\n\n RefCounter* Switch::GetRefCounter()\n\n {\n\n return &_refCounter;\n\n }\n\n} // namespace SparkyStudios::Audio::Amplitude\n","file_path":"src/Sound/Switch.cpp","rank":93,"score":51666.35644555039},{"content":"namespace SparkyStudios::Audio::Amplitude\n\n{\n\n bool SwitchState::Valid() const\n\n {\n\n return m_id != kAmInvalidObjectId && !m_name.empty();\n\n }\n\n\n\n bool SwitchState::operator==(const SwitchState& other) const\n\n {\n\n return m_id == other.m_id && m_name == other.m_name;\n\n }\n\n\n\n bool SwitchState::operator!=(const SwitchState& other) const\n\n {\n\n return !(*this == other);\n\n }\n\n\n\n Switch::Switch()\n\n : _source()\n\n , _id(kAmInvalidObjectId)\n","file_path":"src/Sound/Switch.cpp","rank":94,"score":51665.66947704277},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#include <SparkyStudios/Audio/Amplitude/Sound/Switch.h>\n\n\n\n#include <Core/EngineInternalState.h>\n\n\n\n#include \"switch_definition_generated.h\"\n\n\n","file_path":"src/Sound/Switch.cpp","rank":95,"score":51665.46586218318},{"content":"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\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#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\n\n\n\n#include <Core/EngineInternalState.h>\n\n\n\n#include \"attenuation_definition_generated.h\"\n\n\n","file_path":"src/Sound/Attenuation.cpp","rank":96,"score":51664.18495521791},{"content":" const ListenerList& listeners,\n\n const float userGain,\n\n ListenerFetchMode fetchMode)\n\n {\n\n *gain = soundGain * bus->GetGain() * userGain;\n\n if (spatialization == Spatialization_Position || spatialization == Spatialization_PositionOrientation)\n\n {\n\n ListenerList::const_iterator listener;\n\n float distanceSquared;\n\n hmm_vec3 listenerSpaceLocation;\n\n if (BestListener(&listener, &distanceSquared, &listenerSpaceLocation, listeners, location, fetchMode))\n\n {\n\n if (attenuation != nullptr)\n\n {\n\n if (spatialization == Spatialization_PositionOrientation)\n\n {\n\n AMPLITUDE_ASSERT(entity.Valid());\n\n *gain *= attenuation->GetGain(entity.GetState(), &*listener);\n\n }\n\n else\n","file_path":"src/Core/Engine.cpp","rank":97,"score":27.06366181208948},{"content":" &gain, &pan, switchContainer->GetGain().GetValue(), switchContainer->GetBus(), definition->spatialization(),\n\n switchContainer->GetAttenuation(), channel->GetEntity(), channel->GetLocation(), state->listener_list,\n\n channel->GetUserGain(), state->listener_fetch_mode);\n\n channel->SetGain(gain);\n\n channel->SetPan(pan);\n\n }\n\n else if (const Collection* collection = channel->GetCollection(); collection != nullptr)\n\n {\n\n const CollectionDefinition* definition = collection->GetCollectionDefinition();\n\n\n\n float gain;\n\n hmm_vec2 pan;\n\n CalculateGainAndPan(\n\n &gain, &pan, collection->GetGain().GetValue(), collection->GetBus(), definition->spatialization(),\n\n collection->GetAttenuation(), channel->GetEntity(), channel->GetLocation(), state->listener_list, channel->GetUserGain(),\n\n state->listener_fetch_mode);\n\n channel->SetGain(gain);\n\n channel->SetPan(pan);\n\n }\n\n else if (const Sound* sound = channel->GetSound(); sound != nullptr)\n","file_path":"src/Core/Engine.cpp","rank":98,"score":23.520858133963145},{"content":"#include <Sound/Schedulers/RandomScheduler.h>\n\n#include <Sound/Schedulers/SequenceScheduler.h>\n\n\n\n#include \"collection_definition_generated.h\"\n\n\n\nnamespace SparkyStudios::Audio::Amplitude\n\n{\n\n Collection::Collection()\n\n : _bus(nullptr)\n\n , _worldScopeScheduler(nullptr)\n\n , _entityScopeSchedulers()\n\n , _source()\n\n , _sounds()\n\n , _soundSettings()\n\n , _id(kAmInvalidObjectId)\n\n , _name()\n\n , _gain()\n\n , _priority()\n\n , _effect(nullptr)\n\n , _attenuation(nullptr)\n","file_path":"src/Sound/Collection.cpp","rank":99,"score":23.145163025885342}],"string":"[\n {\n \"content\": \" class AttenuationShape\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * @brief Returns the attenuation factor.\\n\\n *\\n\\n * This method is used only for position based sound sources.\\n\\n *\\n\\n * @param attenuation The Attenuator object to use for distance attenuation.\\n\\n * @param soundLocation The location of the sound source.\\n\\n * @param listener The listener for which compute the attenuation.\\n\\n *\\n\\n * @return The attenuation factor.\\n\\n */\\n\\n virtual float GetAttenuationFactor(\\n\\n const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener);\\n\\n\\n\\n /**\\n\\n * @brief Returns the attenuation factor.\\n\\n *\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 0,\n \"score\": 142188.14681399876\n },\n {\n \"content\": \" class Switch\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * @brief Construct an uninitialized Switch.\\n\\n *\\n\\n * An uninitialized Switch cannot set no provide the actual switch state.\\n\\n */\\n\\n Switch();\\n\\n\\n\\n bool LoadSwitchDefinition(const std::string& switchDefinition);\\n\\n bool LoadSwitchDefinitionFromFile(AmOsString filename);\\n\\n\\n\\n /**\\n\\n * @brief Get the switch definition which generated this Switch.\\n\\n *\\n\\n * @return The switch definition.\\n\\n */\\n\\n [[nodiscard]] const SwitchDefinition* GetSwitchDefinition() const;\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 1,\n \"score\": 130959.46592709041\n },\n {\n \"content\": \" class ConeAttenuationShape : public AttenuationShape\\n\\n {\\n\\n public:\\n\\n explicit ConeAttenuationShape(const ConeAttenuationSettings* settings)\\n\\n : AttenuationShape()\\n\\n {\\n\\n _innerRadius = settings->inner_radius();\\n\\n _outerRadius = settings->outer_radius();\\n\\n _innerHeight = settings->inner_height();\\n\\n _outerHeight = settings->outer_height();\\n\\n }\\n\\n\\n\\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\\n\\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\\n\\n [[nodiscard]] float GetInnerRadius() const;\\n\\n [[nodiscard]] float GetOuterRadius() const;\\n\\n [[nodiscard]] float GetInnerHeight() const;\\n\\n [[nodiscard]] float GetOuterHeight() const;\\n\\n\\n\\n private:\\n\\n float _innerRadius;\\n\\n float _outerRadius;\\n\\n float _innerHeight;\\n\\n float _outerHeight;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 2,\n \"score\": 125584.57552466364\n },\n {\n \"content\": \" class SphereAttenuationShape : public AttenuationShape\\n\\n {\\n\\n public:\\n\\n explicit SphereAttenuationShape(const SphereAttenuationSettings* settings)\\n\\n : AttenuationShape()\\n\\n {\\n\\n _innerRadius = settings->inner_radius();\\n\\n _outerRadius = settings->outer_radius();\\n\\n }\\n\\n\\n\\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\\n\\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\\n\\n\\n\\n [[nodiscard]] float GetInnerRadius() const\\n\\n {\\n\\n return _innerRadius;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetOuterRadius() const\\n\\n {\\n\\n return _outerRadius;\\n\\n }\\n\\n\\n\\n private:\\n\\n float _innerRadius;\\n\\n float _outerRadius;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 3,\n \"score\": 125584.57552466364\n },\n {\n \"content\": \" class BoxAttenuationShape : public AttenuationShape\\n\\n {\\n\\n public:\\n\\n explicit BoxAttenuationShape(const BoxAttenuationSettings* settings)\\n\\n : AttenuationShape()\\n\\n {\\n\\n _innerHalfHeight = settings->inner_half_height();\\n\\n _outerHalfHeight = settings->outer_half_height();\\n\\n _innerHalfWidth = settings->inner_half_width();\\n\\n _outerHalfWidth = settings->outer_half_width();\\n\\n _innerHalfDepth = settings->inner_half_depth();\\n\\n _outerHalfDepth = settings->outer_half_depth();\\n\\n }\\n\\n\\n\\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\\n\\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\\n\\n\\n\\n [[nodiscard]] float GetInnerHalfHeight() const\\n\\n {\\n\\n return _innerHalfHeight;\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 4,\n \"score\": 125584.57552466364\n },\n {\n \"content\": \" class CapsuleAttenuationShape : public AttenuationShape\\n\\n {\\n\\n public:\\n\\n explicit CapsuleAttenuationShape(const CapsuleAttenuationSettings* settings)\\n\\n : AttenuationShape()\\n\\n {\\n\\n _innerRadius = settings->inner_radius();\\n\\n _outerRadius = settings->outer_radius();\\n\\n _innerHalfHeight = settings->inner_half_height();\\n\\n _outerHalfHeight = settings->outer_half_height();\\n\\n }\\n\\n\\n\\n float GetAttenuationFactor(const Attenuation*, const hmm_vec3& soundLocation, const ListenerInternalState* listener) override;\\n\\n float GetAttenuationFactor(const Attenuation*, const EntityInternalState* entity, const ListenerInternalState* listener) override;\\n\\n\\n\\n [[nodiscard]] float GetInnerRadius() const\\n\\n {\\n\\n return _innerRadius;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 5,\n \"score\": 125584.57552466364\n },\n {\n \"content\": \" float X, Y, Z;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Math/HandmadeMath.h\",\n \"rank\": 6,\n \"score\": 112187.17517551189\n },\n {\n \"content\": \"\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\\n\\n\\n\\n#include <Core/EntityInternalState.h>\\n\\n#include <Core/ListenerInternalState.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Math/Curve.h>\\n\\n\\n\\n#include \\\"attenuation_definition_generated.h\\\"\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 7,\n \"score\": 103357.3084903441\n },\n {\n \"content\": \" [[nodiscard]] float GetOuterRadius() const\\n\\n {\\n\\n return _outerRadius;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetInnerHalfHeight() const\\n\\n {\\n\\n return _innerHalfHeight;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetOuterHalfHeight() const\\n\\n {\\n\\n return _outerHalfHeight;\\n\\n }\\n\\n\\n\\n private:\\n\\n float _getFactor(const Attenuation* attenuation, const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt);\\n\\n\\n\\n float _innerRadius;\\n\\n float _outerRadius;\\n\\n float _innerHalfHeight;\\n\\n float _outerHalfHeight;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 8,\n \"score\": 103349.68920415836\n },\n {\n \"content\": \" }\\n\\n\\n\\n [[nodiscard]] float GetOuterHalfDepth() const\\n\\n {\\n\\n return _outerHalfDepth;\\n\\n }\\n\\n\\n\\n private:\\n\\n float _getFactor(const hmm_vec3& soundLocation, const ListenerInternalState* listener, hmm_mat4 lookAt);\\n\\n\\n\\n float _innerHalfHeight;\\n\\n float _outerHalfHeight;\\n\\n float _innerHalfWidth;\\n\\n float _outerHalfWidth;\\n\\n float _innerHalfDepth;\\n\\n float _outerHalfDepth;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 9,\n \"score\": 103344.72622815396\n },\n {\n \"content\": \" }\\n\\n\\n\\n [[nodiscard]] float GetOuterHalfHeight() const\\n\\n {\\n\\n return _outerHalfHeight;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetInnerHalfWidth() const\\n\\n {\\n\\n return _innerHalfWidth;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetOuterHalfWidth() const\\n\\n {\\n\\n return _outerHalfWidth;\\n\\n }\\n\\n\\n\\n [[nodiscard]] float GetInnerHalfDepth() const\\n\\n {\\n\\n return _innerHalfDepth;\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 10,\n \"score\": 103340.0843248977\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\\n\\n#define SS_AMPLITUDE_AUDIO_ATTENUATION_INTERNAL_STATE_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\",\n \"file_path\": \"src/Sound/AttenuationShapes.h\",\n \"rank\": 11,\n \"score\": 103339.2070581073\n },\n {\n \"content\": \" class Entity\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * @brief Creates an uninitialized Entity.\\n\\n *\\n\\n * An uninitialized Entity cannot provide location and orientation\\n\\n * information, and therefore cannot play sounds.\\n\\n */\\n\\n Entity();\\n\\n\\n\\n explicit Entity(EntityInternalState* state);\\n\\n\\n\\n /**\\n\\n * @brief Uninitializes this Entity.\\n\\n *\\n\\n * Note that this does not destroy the internal state it references,\\n\\n * it just removes this reference to it.\\n\\n */\\n\\n void Clear();\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 12,\n \"score\": 102221.67793893711\n },\n {\n \"content\": \" class Listener\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * @brief Construct an uninitialized Listener.\\n\\n *\\n\\n * An uninitialized Listener cannot have its location set or queried.\\n\\n * To initialize the Listener, use <code>Engine::AddListener();</code>.\\n\\n */\\n\\n Listener();\\n\\n\\n\\n explicit Listener(ListenerInternalState* state);\\n\\n\\n\\n /**\\n\\n * @brief Uninitialize this Listener.\\n\\n *\\n\\n * Note that this does not destroy the internal state it references,\\n\\n * it just removes this reference to it. To destroy the Listener,\\n\\n * use <code>Engine::RemoveListener();</code>.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 13,\n \"score\": 102220.23484192528\n },\n {\n \"content\": \" class Attenuation;\\n\\n\\n\\n /**\\n\\n * @brief The propagation shape for positional sounds.\\n\\n *\\n\\n * This allows to increase the attenuation according to the shape of\\n\\n * the sound propagation.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 14,\n \"score\": 102195.66138483437\n },\n {\n \"content\": \" class Attenuation\\n\\n {\\n\\n public:\\n\\n /**\\n\\n * @brief Creates an uninitialized Attenuation.\\n\\n *\\n\\n * An uninitialized Attenuation instance cannot compute gain nor provide\\n\\n * attenuation configuration data.\\n\\n */\\n\\n Attenuation();\\n\\n\\n\\n bool LoadAttenuationDefinition(const std::string& attenuation);\\n\\n bool LoadAttenuationDefinitionFromFile(AmOsString filename);\\n\\n\\n\\n /**\\n\\n * @brief Returns the gain of the sound from the given distance to the listener.\\n\\n *\\n\\n * @param soundLocation The location of the sound source.\\n\\n * @param listener The listener which is hearing the sound.\\n\\n *\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 15,\n \"score\": 102195.66138483437\n },\n {\n \"content\": \" class EntityInternalState;\\n\\n\\n\\n /**\\n\\n * @brief An Entity represent an object in the game.\\n\\n *\\n\\n * Amplitude use entities to link sound to an object in the game. Each sounds\\n\\n * played from an entity get the location and orientation data fom that entity.\\n\\n *\\n\\n * The Entity class is a lightweight reference to a EntityInternalState object\\n\\n * which is managed by the Engine.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 33,\n \"score\": 96714.63170564332\n },\n {\n \"content\": \" class ListenerInternalState;\\n\\n\\n\\n /**\\n\\n * @brief An object whose distance from sounds determines their gain.\\n\\n *\\n\\n * The Listener class is a lightweight reference to a ListenerInternalState\\n\\n * which is managed by the Engine. Multiple Listener objects may point to\\n\\n * the same underlying data.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 34,\n \"score\": 96713.25283435184\n },\n {\n \"content\": \" class SwitchContainer\\n\\n {\\n\\n public:\\n\\n SwitchContainer();\\n\\n ~SwitchContainer();\\n\\n\\n\\n bool LoadSwitchContainerDefinition(const std::string& source, EngineInternalState* state);\\n\\n bool LoadSwitchContainerDefinitionFromFile(AmOsString filename, EngineInternalState* state);\\n\\n void AcquireReferences(EngineInternalState* state);\\n\\n void ReleaseReferences(EngineInternalState* state);\\n\\n [[nodiscard]] const SwitchContainerDefinition* GetSwitchContainerDefinition() const;\\n\\n\\n\\n /**\\n\\n * @brief Gets the actual gain of the switch container.\\n\\n *\\n\\n * @return The SwitchContainer gain.\\n\\n */\\n\\n const RtpcValue& GetGain() const;\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 35,\n \"score\": 96691.15634463904\n },\n {\n \"content\": \" [[nodiscard]] AmReal32 GetObstruction() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the occlusion level of sounds played by this Entity.\\n\\n *\\n\\n * @return The occlusion amount.\\n\\n */\\n\\n [[nodiscard]] AmReal32 GetOcclusion() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the internal state of this Entity.\\n\\n *\\n\\n * @return The Entity internal state.\\n\\n */\\n\\n [[nodiscard]] EntityInternalState* GetState() const;\\n\\n\\n\\n private:\\n\\n EntityInternalState* _state;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SS_AMPLITUDE_AUDIO_ENTITY_H\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 36,\n \"score\": 91617.33586616952\n },\n {\n \"content\": \" */\\n\\n [[nodiscard]] hmm_vec3 GetLocation() const;\\n\\n\\n\\n /**\\n\\n * @brief Set the location of this Listener.\\n\\n *\\n\\n * @param location The new location of this Listener.\\n\\n */\\n\\n void SetLocation(const hmm_vec3& location);\\n\\n\\n\\n /**\\n\\n * @brief Set the location, direction and up vector of this Listener.\\n\\n *\\n\\n * @param direction The direction of this Listener.\\n\\n * @param up THe up vector of this Listener.\\n\\n */\\n\\n void SetOrientation(const hmm_vec3& direction, const hmm_vec3& up);\\n\\n\\n\\n /**\\n\\n * @brief Returns the internal state of this Listener.\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 37,\n \"score\": 91616.0193013305\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Checks whether this Entity has been initialized.\\n\\n *\\n\\n * @return boolean true if this Entity has been initialized.\\n\\n */\\n\\n [[nodiscard]] bool Valid() const;\\n\\n\\n\\n /**\\n\\n * @brief Gets the ID of this Entity in game.\\n\\n *\\n\\n * @return The game Entity ID.\\n\\n */\\n\\n [[nodiscard]] AmEntityID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Sets the location of this Entity.\\n\\n *\\n\\n * @param location The new location.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 38,\n \"score\": 91615.62349306046\n },\n {\n \"content\": \" *\\n\\n * @return ListenerInternalState*\\n\\n */\\n\\n [[nodiscard]] ListenerInternalState* GetState() const\\n\\n {\\n\\n return _state;\\n\\n }\\n\\n\\n\\n private:\\n\\n ListenerInternalState* _state;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SPARK_AUDIO_LISTENER_H\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 39,\n \"score\": 91614.87786536365\n },\n {\n \"content\": \" * @return The computed gain value fom the curve.\\n\\n */\\n\\n float GetGain(const hmm_vec3& soundLocation, const ListenerInternalState* listener) const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the gain of the sound from the given distance to the listener.\\n\\n *\\n\\n * @param entity The entity which emits the sound.\\n\\n * @param listener The listener which is hearing the sound.\\n\\n *\\n\\n * @return The computed gain value fom the curve.\\n\\n */\\n\\n float GetGain(const EntityInternalState* entity, const ListenerInternalState* listener) const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the unique ID of this Attenuation.\\n\\n *\\n\\n * @return The Attenuation ID.\\n\\n */\\n\\n [[nodiscard]] AmAttenuationID GetId() const;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 40,\n \"score\": 91614.76340971605\n },\n {\n \"content\": \" void Clear();\\n\\n\\n\\n /**\\n\\n * @brief Checks whether this Listener has been initialized.\\n\\n *\\n\\n * @return bool true if this Listener has been initialized.\\n\\n */\\n\\n [[nodiscard]] bool Valid() const;\\n\\n\\n\\n /**\\n\\n * @brief Gets the ID of this Listener in game.\\n\\n *\\n\\n * @return The game Listener ID.\\n\\n */\\n\\n [[nodiscard]] AmListenerID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the location of this Listener.\\n\\n *\\n\\n * @return hmm_vec3 The location of this Listener.\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 41,\n \"score\": 91614.55152653145\n },\n {\n \"content\": \" * This method is used by position and orientation based sound sources.\\n\\n *\\n\\n * @param attenuation The Attenuator object to use for distance attenuation.\\n\\n * @param entity The entity which emits the sound.\\n\\n * @param listener The listener for which compute the attenuation.\\n\\n *\\n\\n * @return The attenuation factor.\\n\\n */\\n\\n virtual float GetAttenuationFactor(\\n\\n const Attenuation* attenuation, const EntityInternalState* entity, const ListenerInternalState* listener);\\n\\n\\n\\n /**\\n\\n * @brief Creates an AttenuationShape object from the definition.\\n\\n *\\n\\n * @param definition The attenuation shape definition.\\n\\n *\\n\\n * @return An AttenuationShape object.\\n\\n */\\n\\n static AttenuationShape* Create(const AttenuationShapeDefinition* definition);\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 42,\n \"score\": 91613.93075991412\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SS_AMPLITUDE_AUDIO_ENTITY_H\\n\\n#define SS_AMPLITUDE_AUDIO_ENTITY_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 43,\n \"score\": 91612.64964304243\n },\n {\n \"content\": \" void SetLocation(const hmm_vec3& location);\\n\\n\\n\\n /**\\n\\n * @brief Gets the current location of this Entity.\\n\\n *\\n\\n * @return The current location of this Entity.\\n\\n */\\n\\n [[nodiscard]] const hmm_vec3& GetLocation() const;\\n\\n\\n\\n /**\\n\\n * @brief Sets the orientation of this Entity.\\n\\n *\\n\\n * @param direction The direction towards the Entity.\\n\\n * @param up The up vector.\\n\\n */\\n\\n void SetOrientation(const hmm_vec3& direction, const hmm_vec3& up);\\n\\n\\n\\n /**\\n\\n * @brief Get the direction vector of the Entity.\\n\\n *\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 44,\n \"score\": 91611.89318147331\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SPARK_AUDIO_LISTENER_H\\n\\n#define SPARK_AUDIO_LISTENER_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Listener.h\",\n \"rank\": 45,\n \"score\": 91611.6276566267\n },\n {\n \"content\": \" * @return The direction vector.\\n\\n */\\n\\n [[nodiscard]] const hmm_vec3& GetDirection() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the up vector of the Entity.\\n\\n *\\n\\n * @return The up vector.\\n\\n */\\n\\n [[nodiscard]] const hmm_vec3& GetUp() const;\\n\\n\\n\\n /**\\n\\n * @brief Update the state of this Entity.\\n\\n *\\n\\n * This method is called automatically by the Engine\\n\\n * on each frames.\\n\\n */\\n\\n void Update();\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 46,\n \"score\": 91610.8871300695\n },\n {\n \"content\": \"\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Entity.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Math/Curve.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n struct AttenuationDefinition;\\n\\n struct AttenuationShapeDefinition;\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 47,\n \"score\": 91610.82931525695\n },\n {\n \"content\": \" * @brief Set the obstruction level of sounds played by this Entity.\\n\\n *\\n\\n * @param obstruction The obstruction amount. This is provided by the\\n\\n * game engine.\\n\\n */\\n\\n void SetObstruction(AmReal32 obstruction);\\n\\n\\n\\n /**\\n\\n * @brief Set the occlusion level of sounds played by this Entity.\\n\\n *\\n\\n * @param occlusion The occlusion amount. This is provided by the\\n\\n * game engine.\\n\\n */\\n\\n void SetOcclusion(AmReal32 occlusion);\\n\\n\\n\\n /**\\n\\n * @brief Get the obstruction level of sounds played by this Entity.\\n\\n *\\n\\n * @return The obstruction amount.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Core/Entity.h\",\n \"rank\": 48,\n \"score\": 91610.7745900066\n },\n {\n \"content\": \" protected:\\n\\n AttenuationShape();\\n\\n\\n\\n /**\\n\\n * @brief THe maximum attenuation factor to apply to the sound gain.\\n\\n */\\n\\n float m_maxAttenuationFactor;\\n\\n };\\n\\n\\n\\n /**\\n\\n * @brief An Attenuation materialize how the sound volume and other distance-based\\n\\n * parameters are calculated following the distance of the sound source to the listener.\\n\\n *\\n\\n * The Attenuation is an shared object between sound sources. They are used only\\n\\n * when the sound need to lower his volume due to the distance of from the listener,\\n\\n * and many other parameters.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 49,\n \"score\": 91608.54457730454\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Returns the name of this Attenuation.\\n\\n *\\n\\n * @return The Attenuation name.\\n\\n */\\n\\n [[nodiscard]] const std::string& GetName() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the shape object of this Attenuation.\\n\\n *\\n\\n * @return The Attenuation shape.\\n\\n */\\n\\n [[nodiscard]] AttenuationShape* GetShape() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the gain curve attached to this Attenuation.\\n\\n *\\n\\n * @return The attenuation's gain curve.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 50,\n \"score\": 91608.23276200757\n },\n {\n \"content\": \" [[nodiscard]] const Curve& GetGainCurve() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the maximum distance for a fully attenuated sound\\n\\n *\\n\\n * @return The maximum sound attenuation distance.\\n\\n */\\n\\n [[nodiscard]] double GetMaxDistance() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the attenuation definition which generated this attenuation.\\n\\n *\\n\\n * @return The attenuation definition.\\n\\n */\\n\\n [[nodiscard]] const AttenuationDefinition* GetAttenuationDefinition() const;\\n\\n\\n\\n RefCounter* GetRefCounter();\\n\\n\\n\\n private:\\n\\n std::string _source;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 51,\n \"score\": 91606.17624753401\n },\n {\n \"content\": \"\\n\\n AmAttenuationID _id;\\n\\n std::string _name;\\n\\n\\n\\n double _maxDistance;\\n\\n\\n\\n AttenuationShape* _shape;\\n\\n\\n\\n Curve _gainCurve;\\n\\n\\n\\n RefCounter _refCounter;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SS_AMPLITUDE_AUDIO_ATTENUATION_H\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 52,\n \"score\": 91605.64051211487\n },\n {\n \"content\": \"#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n struct SwitchDefinition;\\n\\n\\n\\n /**\\n\\n * @brief A switch state.\\n\\n */\\n\\n struct SwitchState\\n\\n {\\n\\n /**\\n\\n * @brief The ID of this switch state.\\n\\n *\\n\\n * This ID is unique only in the parent switch.\\n\\n */\\n\\n AmObjectID m_id;\\n\\n\\n\\n /**\\n\\n * @brief The name of this switch state.\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 53,\n \"score\": 91602.02884480984\n },\n {\n \"content\": \" * list of switch states.\\n\\n */\\n\\n void SetState(const std::string& name);\\n\\n\\n\\n /**\\n\\n * @brief Get the list of available SwitchStates in this Switch.\\n\\n *\\n\\n * @return The list of available SwitchStates.\\n\\n */\\n\\n [[nodiscard]] const std::vector<SwitchState>& GetSwitchStates() const;\\n\\n\\n\\n RefCounter* GetRefCounter();\\n\\n\\n\\n private:\\n\\n std::string _source;\\n\\n\\n\\n AmSwitchID _id;\\n\\n std::string _name;\\n\\n\\n\\n SwitchState _activeState;\\n\\n std::vector<SwitchState> _states;\\n\\n\\n\\n RefCounter _refCounter;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SS_AMPLITUDE_AUDIO_SWITCH_H\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 54,\n \"score\": 91595.06740267207\n },\n {\n \"content\": \" /**\\n\\n * @brief Get the ID of this Switch.\\n\\n *\\n\\n * @return The switch ID.\\n\\n */\\n\\n [[nodiscard]] AmSwitchID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the name of this Switch.\\n\\n *\\n\\n * @return The switch name.\\n\\n */\\n\\n [[nodiscard]] const std::string& GetName() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the current state of the switch.\\n\\n *\\n\\n * @return The current state of the switch.\\n\\n */\\n\\n [[nodiscard]] const SwitchState& GetState() const;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 55,\n \"score\": 91593.4397802627\n },\n {\n \"content\": \" */\\n\\n std::string m_name;\\n\\n\\n\\n /**\\n\\n * @brief Checks whether this switch state is valid.\\n\\n *\\n\\n * @return true if the switch state is valid, false otherwise.\\n\\n */\\n\\n [[nodiscard]] bool Valid() const;\\n\\n\\n\\n bool operator==(const SwitchState& other) const;\\n\\n bool operator!=(const SwitchState& other) const;\\n\\n };\\n\\n\\n\\n /**\\n\\n * @brief A switch is a collection of states which can change the sound played during from a SwitchContainer the game.\\n\\n *\\n\\n * For example, you can have a switch named \\\"SurfaceType\\\" which have \\\"wood\\\", \\\"grass\\\", \\\"metal\\\" and \\\"water\\\" as states. A\\n\\n * SwitchContainer using this switch can group sounds per switch states, so when a state is active, all the sounds of\\n\\n * that state are played.\\n\\n *\\n\\n * The Switch is a shared object between sound sources. They are used only by SwitchContainer objects.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 56,\n \"score\": 91593.17933246148\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Set the current state of the switch.\\n\\n *\\n\\n * @param state The state to apply to the switch.\\n\\n */\\n\\n void SetState(const SwitchState& state);\\n\\n\\n\\n /**\\n\\n * @brief Set the current state of the switch using the state ID.\\n\\n *\\n\\n * @param id The ID of the state to apply. This ID should exist in the list\\n\\n * of switch states.\\n\\n */\\n\\n void SetState(AmObjectID id);\\n\\n\\n\\n /**\\n\\n * @brief Set the current state of the switch using the state name.\\n\\n *\\n\\n * @param name The name of the state to apply. This name should exist in the\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 57,\n \"score\": 91592.42864737849\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SS_AMPLITUDE_AUDIO_SWITCH_H\\n\\n#define SS_AMPLITUDE_AUDIO_SWITCH_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Switch.h\",\n \"rank\": 58,\n \"score\": 91591.63801889843\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SS_AMPLITUDE_AUDIO_ATTENUATION_H\\n\\n#define SS_AMPLITUDE_AUDIO_ATTENUATION_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/Attenuation.h\",\n \"rank\": 59,\n \"score\": 91590.49882702605\n },\n {\n \"content\": \" /**\\n\\n * @brief Return the bus this SwitchContainer will play on.\\n\\n *\\n\\n * @return The bus this SwitchContainer will play on.\\n\\n */\\n\\n [[nodiscard]] BusInternalState* GetBus() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the effect attached to this SwitchContainer.\\n\\n *\\n\\n * @return The effect of this SwitchContainer if available or nullptr.\\n\\n */\\n\\n [[nodiscard]] const Effect* GetEffect() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the attenuation attached to this SwitchContainer.\\n\\n *\\n\\n * @return The attenuation of this SwitchContainer if available or nullptr.\\n\\n */\\n\\n [[nodiscard]] const Attenuation* GetAttenuation() const;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 60,\n \"score\": 88356.65982626902\n },\n {\n \"content\": \"#include <SparkyStudios/Audio/Amplitude/Core/RefCounter.h>\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Effect.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Fader.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Rtpc.h>\\n\\n#include <SparkyStudios/Audio/Amplitude/Sound/Switch.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n struct SwitchContainerDefinition;\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 61,\n \"score\": 88353.73280938121\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * @brief Returns the switch attached to this SwitchContainer.\\n\\n *\\n\\n * @return The switch of this SwitchContainer if available or nullptr.\\n\\n */\\n\\n [[nodiscard]] const Switch* GetSwitch() const;\\n\\n\\n\\n /**\\n\\n * @brief Get the fade in Fader for the given sound object ID.\\n\\n *\\n\\n * @param id The ID of the sound object.\\n\\n *\\n\\n * @return The fade in Fader.\\n\\n */\\n\\n Fader* GetFaderIn(AmObjectID id) const;\\n\\n\\n\\n /**\\n\\n * @brief Get the fade out Fader for the given sound object ID.\\n\\n *\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 62,\n \"score\": 88348.57799164554\n },\n {\n \"content\": \" [[nodiscard]] const std::vector<SwitchContainerItem>& GetSoundObjects(AmObjectID stateId) const;\\n\\n\\n\\n private:\\n\\n // The bus this SwitchContainer will play on.\\n\\n BusInternalState* _bus;\\n\\n\\n\\n // The World scope sound scheduler\\n\\n Switch* _switch;\\n\\n\\n\\n std::string _source;\\n\\n std::map<AmObjectID, std::vector<SwitchContainerItem>> _sounds;\\n\\n std::map<AmObjectID, Fader*> _fadersIn;\\n\\n std::map<AmObjectID, Fader*> _fadersOut;\\n\\n\\n\\n AmSwitchContainerID _id;\\n\\n std::string _name;\\n\\n\\n\\n RtpcValue _gain;\\n\\n RtpcValue _priority;\\n\\n\\n\\n Effect* _effect;\\n\\n Attenuation* _attenuation;\\n\\n\\n\\n RefCounter _refCounter;\\n\\n };\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\\n\\n\\n#endif // SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 63,\n \"score\": 88348.22793343583\n },\n {\n \"content\": \" * @brief Gets the actual priority of the switch container.\\n\\n *\\n\\n * @return The SwitchContainer priority.\\n\\n */\\n\\n const RtpcValue& GetPriority() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the unique ID of this SwitchContainer.\\n\\n *\\n\\n * @return The SwitchContainer unique ID.\\n\\n */\\n\\n [[nodiscard]] AmCollectionID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Returns the name of this SwitchContainer.\\n\\n *\\n\\n * @return The SwitchContainer name.\\n\\n */\\n\\n [[nodiscard]] const std::string& GetName() const;\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 64,\n \"score\": 88347.22025052848\n },\n {\n \"content\": \" * @param id The ID of the sound object.\\n\\n *\\n\\n * @return The fade out Fader.\\n\\n */\\n\\n Fader* GetFaderOut(AmObjectID id) const;\\n\\n\\n\\n /**\\n\\n * @brief Get the references counter of this instance.\\n\\n *\\n\\n * @return The references counter.\\n\\n */\\n\\n RefCounter* GetRefCounter();\\n\\n\\n\\n /**\\n\\n * @brief Returns the list of sound objects referenced in this SwitchContainer for the given state.\\n\\n *\\n\\n * @param state The switch state to get the objects for.\\n\\n *\\n\\n * @return The list of sound object IDs.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 65,\n \"score\": 88343.75779748979\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#pragma once\\n\\n\\n\\n#ifndef SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\\n\\n#define SS_AMPLITUDE_AUDIO_SWITCHCONTAINER_H\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 66,\n \"score\": 88338.77531257487\n },\n {\n \"content\": \" class CurveDefinition;\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Math/Curve.h\",\n \"rank\": 67,\n \"score\": 85355.6052770595\n },\n {\n \"content\": \" class CurvePartDefinition;\\n\\n\\n\\n /**\\n\\n * @brief A single point in a Curve.\\n\\n */\\n\\n struct CurvePoint\\n\\n {\\n\\n /**\\n\\n * @brief The coordinates of the point over the X axis.\\n\\n */\\n\\n double x;\\n\\n\\n\\n /**\\n\\n * @brief The coordinates of the point over the Y axis.\\n\\n */\\n\\n float y;\\n\\n\\n\\n bool operator==(const CurvePoint& rhs) const;\\n\\n bool operator!=(const CurvePoint& rhs) const;\\n\\n };\\n\\n\\n\\n /**\\n\\n * @brief A part of a Curve.\\n\\n *\\n\\n * CurveParts allows to a curve to have different fading algorithms at the same time.\\n\\n * Each CurvePart has a start and end point, and the fading algorithm which moves the value\\n\\n * from the start point to the end point.\\n\\n */\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Math/Curve.h\",\n \"rank\": 68,\n \"score\": 82527.62308002886\n },\n {\n \"content\": \" drwav_int32 delta[2];\\n\",\n \"file_path\": \"src/Utils/miniaudio/miniaudio.h\",\n \"rank\": 69,\n \"score\": 80755.62479326654\n },\n {\n \"content\": \" float* pNewGains;\\n\",\n \"file_path\": \"src/Utils/miniaudio/miniaudio.h\",\n \"rank\": 70,\n \"score\": 80176.13771310567\n },\n {\n \"content\": \" class BusInternalState;\\n\\n struct EngineInternalState;\\n\\n\\n\\n struct SwitchContainerItem\\n\\n {\\n\\n AmObjectID m_id;\\n\\n bool m_continueBetweenStates;\\n\\n AmTime m_fadeInDuration;\\n\\n AmUInt8 m_fadeInAlgorithm;\\n\\n AmTime m_fadeOutDuration;\\n\\n AmUInt8 m_fadeOutAlgorithm;\\n\\n RtpcValue m_gain;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"include/SparkyStudios/Audio/Amplitude/Sound/SwitchContainer.h\",\n \"rank\": 71,\n \"score\": 79838.18304054478\n },\n {\n \"content\": \" Curve gain;\\n\",\n \"file_path\": \"src/Core/EngineInternalState.h\",\n \"rank\": 72,\n \"score\": 79407.77331220993\n },\n {\n \"content\": \" drwav_int32 delta[2];\\n\",\n \"file_path\": \"src/Core/Codecs/WAV/dr_wav.h\",\n \"rank\": 73,\n \"score\": 78180.89220724825\n },\n {\n \"content\": \" float* pNewChannelGainsOut; /* An offset of _pHeap. Used by ma_spatializer_process_pcm_frames() to store new channel gains. The number of elements in this array is equal to config.channelsOut. */\\n\",\n \"file_path\": \"src/Utils/miniaudio/miniaudio.h\",\n \"rank\": 74,\n \"score\": 77690.6523500622\n },\n {\n \"content\": \" size_t newGainsOffset;\\n\",\n \"file_path\": \"src/Utils/miniaudio/miniaudio.h\",\n \"rank\": 75,\n \"score\": 77684.84247560264\n },\n {\n \"content\": \" size_t newChannelGainsOffset;\\n\",\n \"file_path\": \"src/Utils/miniaudio/miniaudio.h\",\n \"rank\": 76,\n \"score\": 75343.70436137967\n },\n {\n \"content\": \" class EntityInternalState\\n\\n {\\n\\n public:\\n\\n EntityInternalState();\\n\\n\\n\\n /**\\n\\n * @brief Gets the ID of this Entity in game.\\n\\n *\\n\\n * @return The game Entity ID.\\n\\n */\\n\\n [[nodiscard]] AmEntityID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Sets the ID of this Entity in game.\\n\\n *\\n\\n * @param id The game Entity ID.\\n\\n */\\n\\n void SetId(AmEntityID id);\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/Core/EntityInternalState.h\",\n \"rank\": 77,\n \"score\": 58209.405099555705\n },\n {\n \"content\": \" class ListenerInternalState\\n\\n {\\n\\n public:\\n\\n ListenerInternalState();\\n\\n\\n\\n /**\\n\\n * @brief Gets the ID of this Listener in game.\\n\\n *\\n\\n * @return The game Listener ID.\\n\\n */\\n\\n [[nodiscard]] AmListenerID GetId() const;\\n\\n\\n\\n /**\\n\\n * @brief Sets the ID of this Listener in game.\\n\\n *\\n\\n * @param id The game Listener ID.\\n\\n */\\n\\n void SetId(AmListenerID id);\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/Core/ListenerInternalState.h\",\n \"rank\": 78,\n \"score\": 58207.962002543856\n },\n {\n \"content\": \"namespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n Listener::Listener()\\n\\n : _state(nullptr)\\n\\n {}\\n\\n\\n\\n Listener::Listener(ListenerInternalState* state)\\n\\n : _state(state)\\n\\n {}\\n\\n\\n\\n void Listener::Clear()\\n\\n {\\n\\n _state = nullptr;\\n\\n }\\n\\n\\n\\n bool Listener::Valid() const\\n\\n {\\n\\n return _state != nullptr && _state->GetId() != kAmInvalidObjectId && _state->node.in_list();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/Core/Listener.cpp\",\n \"rank\": 79,\n \"score\": 51691.525093473225\n },\n {\n \"content\": \" Entity::Entity()\\n\\n : _state(nullptr)\\n\\n {}\\n\\n\\n\\n Entity::Entity(EntityInternalState* state)\\n\\n : _state(state)\\n\\n {}\\n\\n\\n\\n void Entity::Clear()\\n\\n {\\n\\n _state = nullptr;\\n\\n }\\n\\n\\n\\n bool Entity::Valid() const\\n\\n {\\n\\n return _state != nullptr && _state->GetId() != kAmInvalidObjectId && _state->node.in_list();\\n\\n }\\n\\n\\n\\n AmEntityID Entity::GetId() const\\n\\n {\\n\",\n \"file_path\": \"src/Core/Entity.cpp\",\n \"rank\": 80,\n \"score\": 51690.16946763257\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#include <SparkyStudios/Audio/Amplitude/Core/Entity.h>\\n\\n\\n\\n#include <Core/EntityInternalState.h>\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\",\n \"file_path\": \"src/Core/Entity.cpp\",\n \"rank\": 81,\n \"score\": 51686.38015417035\n },\n {\n \"content\": \" {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetObstruction(obstruction);\\n\\n }\\n\\n\\n\\n void Entity::SetOcclusion(AmReal32 occlusion)\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetOcclusion(occlusion);\\n\\n }\\n\\n\\n\\n AmReal32 Entity::GetObstruction() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetObstruction();\\n\\n }\\n\\n\\n\\n AmReal32 Entity::GetOcclusion() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetOcclusion();\\n\\n }\\n\\n\\n\\n EntityInternalState* Entity::GetState() const\\n\\n {\\n\\n return _state;\\n\\n }\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\",\n \"file_path\": \"src/Core/Entity.cpp\",\n \"rank\": 82,\n \"score\": 51686.01833393406\n },\n {\n \"content\": \"\\n\\n _gainCurve.Initialize(definition->gain_curve());\\n\\n\\n\\n _shape = AttenuationShape::Create(definition->shape());\\n\\n\\n\\n return true;\\n\\n }\\n\\n\\n\\n bool Attenuation::LoadAttenuationDefinitionFromFile(AmOsString filename)\\n\\n {\\n\\n std::string source;\\n\\n return LoadFile(filename, &source) && LoadAttenuationDefinition(source);\\n\\n }\\n\\n\\n\\n float Attenuation::GetGain(const hmm_vec3& soundLocation, const ListenerInternalState* listener) const\\n\\n {\\n\\n return _shape->GetAttenuationFactor(this, soundLocation, listener);\\n\\n }\\n\\n\\n\\n float Attenuation::GetGain(const EntityInternalState* entity, const ListenerInternalState* listener) const\\n\",\n \"file_path\": \"src/Sound/Attenuation.cpp\",\n \"rank\": 83,\n \"score\": 51685.52567511867\n },\n {\n \"content\": \" AmListenerID Listener::GetId() const\\n\\n {\\n\\n return _state->GetId();\\n\\n }\\n\\n\\n\\n void Listener::SetOrientation(const hmm_vec3& direction, const hmm_vec3& up)\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetOrientation(direction, up);\\n\\n }\\n\\n\\n\\n hmm_vec3 Listener::GetLocation() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetLocation();\\n\\n }\\n\\n\\n\\n void Listener::SetLocation(const hmm_vec3& location)\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetLocation(location);\\n\\n }\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\",\n \"file_path\": \"src/Core/Listener.cpp\",\n \"rank\": 84,\n \"score\": 51684.628065718134\n },\n {\n \"content\": \"\\n\\n const hmm_vec3& Entity::GetDirection() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetDirection();\\n\\n }\\n\\n\\n\\n const hmm_vec3& Entity::GetUp() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetUp();\\n\\n }\\n\\n\\n\\n void Entity::Update()\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->Update();\\n\\n }\\n\\n\\n\\n void Entity::SetObstruction(AmReal32 obstruction)\\n\",\n \"file_path\": \"src/Core/Entity.cpp\",\n \"rank\": 85,\n \"score\": 51683.89400487297\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#include <SparkyStudios/Audio/Amplitude/Core/Common.h>\\n\\n\\n\\n#include <SparkyStudios/Audio/Amplitude/Core/Listener.h>\\n\\n\\n\\n#include <Core/ListenerInternalState.h>\\n\\n\\n\",\n \"file_path\": \"src/Core/Listener.cpp\",\n \"rank\": 86,\n \"score\": 51683.86966246855\n },\n {\n \"content\": \" return _state->GetId();\\n\\n }\\n\\n\\n\\n void Entity::SetLocation(const hmm_vec3& location)\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetLocation(location);\\n\\n }\\n\\n\\n\\n const hmm_vec3& Entity::GetLocation() const\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n return _state->GetLocation();\\n\\n }\\n\\n\\n\\n void Entity::SetOrientation(const hmm_vec3& direction, const hmm_vec3& up)\\n\\n {\\n\\n AMPLITUDE_ASSERT(Valid());\\n\\n _state->SetOrientation(direction, up);\\n\\n }\\n\",\n \"file_path\": \"src/Core/Entity.cpp\",\n \"rank\": 87,\n \"score\": 51682.9350351394\n },\n {\n \"content\": \"namespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n Attenuation::Attenuation()\\n\\n : _gainCurve()\\n\\n , _id(kAmInvalidObjectId)\\n\\n , _name()\\n\\n , _maxDistance(0.0f)\\n\\n , _shape(nullptr)\\n\\n , _refCounter()\\n\\n {}\\n\\n\\n\\n bool Attenuation::LoadAttenuationDefinition(const std::string& attenuation)\\n\\n {\\n\\n _source = attenuation;\\n\\n const AttenuationDefinition* definition = GetAttenuationDefinition();\\n\\n\\n\\n _id = definition->id();\\n\\n _name = definition->name()->str();\\n\\n\\n\\n _maxDistance = definition->max_distance();\\n\",\n \"file_path\": \"src/Sound/Attenuation.cpp\",\n \"rank\": 88,\n \"score\": 51680.83384928255\n },\n {\n \"content\": \" {\\n\\n return &_refCounter;\\n\\n }\\n\\n\\n\\n AttenuationShape* Attenuation::GetShape() const\\n\\n {\\n\\n return _shape;\\n\\n }\\n\\n\\n\\n const Curve& Attenuation::GetGainCurve() const\\n\\n {\\n\\n return _gainCurve;\\n\\n }\\n\\n\\n\\n double Attenuation::GetMaxDistance() const\\n\\n {\\n\\n return _maxDistance;\\n\\n }\\n\\n} // namespace SparkyStudios::Audio::Amplitude\",\n \"file_path\": \"src/Sound/Attenuation.cpp\",\n \"rank\": 89,\n \"score\": 51679.82511723951\n },\n {\n \"content\": \" {\\n\\n return _shape->GetAttenuationFactor(this, entity, listener);\\n\\n }\\n\\n\\n\\n AmAttenuationID Attenuation::GetId() const\\n\\n {\\n\\n return _id;\\n\\n }\\n\\n\\n\\n const std::string& Attenuation::GetName() const\\n\\n {\\n\\n return _name;\\n\\n }\\n\\n\\n\\n const AttenuationDefinition* Attenuation::GetAttenuationDefinition() const\\n\\n {\\n\\n return Amplitude::GetAttenuationDefinition(_source.c_str());\\n\\n }\\n\\n\\n\\n RefCounter* Attenuation::GetRefCounter()\\n\",\n \"file_path\": \"src/Sound/Attenuation.cpp\",\n \"rank\": 90,\n \"score\": 51675.96375043355\n },\n {\n \"content\": \" {\\n\\n _states[i].m_id = definition->states()->Get(i)->id();\\n\\n _states[i].m_name = definition->states()->Get(i)->name()->str();\\n\\n }\\n\\n\\n\\n return true;\\n\\n }\\n\\n\\n\\n bool Switch::LoadSwitchDefinitionFromFile(AmOsString filename)\\n\\n {\\n\\n std::string source;\\n\\n return Amplitude::LoadFile(filename, &source) && LoadSwitchDefinition(source);\\n\\n }\\n\\n\\n\\n const SwitchDefinition* Switch::GetSwitchDefinition() const\\n\\n {\\n\\n return Amplitude::GetSwitchDefinition(_source.c_str());\\n\\n }\\n\\n\\n\\n AmSwitchID Switch::GetId() const\\n\",\n \"file_path\": \"src/Sound/Switch.cpp\",\n \"rank\": 91,\n \"score\": 51668.332351701014\n },\n {\n \"content\": \" , _name()\\n\\n , _activeState()\\n\\n , _states()\\n\\n , _refCounter()\\n\\n {}\\n\\n\\n\\n bool Switch::LoadSwitchDefinition(const std::string& switchDefinition)\\n\\n {\\n\\n AMPLITUDE_ASSERT(_id == kAmInvalidObjectId);\\n\\n\\n\\n _source = switchDefinition;\\n\\n const SwitchDefinition* definition = GetSwitchDefinition();\\n\\n\\n\\n _id = definition->id();\\n\\n _name = definition->name()->str();\\n\\n\\n\\n flatbuffers::uoffset_t size = definition->states() ? definition->states()->size() : 0;\\n\\n _states.resize(size);\\n\\n\\n\\n for (flatbuffers::uoffset_t i = 0; i < size; ++i)\\n\",\n \"file_path\": \"src/Sound/Switch.cpp\",\n \"rank\": 92,\n \"score\": 51667.7586547279\n },\n {\n \"content\": \"\\n\\n const std::vector<SwitchState>& Switch::GetSwitchStates() const\\n\\n {\\n\\n return _states;\\n\\n }\\n\\n\\n\\n RefCounter* Switch::GetRefCounter()\\n\\n {\\n\\n return &_refCounter;\\n\\n }\\n\\n} // namespace SparkyStudios::Audio::Amplitude\\n\",\n \"file_path\": \"src/Sound/Switch.cpp\",\n \"rank\": 93,\n \"score\": 51666.35644555039\n },\n {\n \"content\": \"namespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n bool SwitchState::Valid() const\\n\\n {\\n\\n return m_id != kAmInvalidObjectId && !m_name.empty();\\n\\n }\\n\\n\\n\\n bool SwitchState::operator==(const SwitchState& other) const\\n\\n {\\n\\n return m_id == other.m_id && m_name == other.m_name;\\n\\n }\\n\\n\\n\\n bool SwitchState::operator!=(const SwitchState& other) const\\n\\n {\\n\\n return !(*this == other);\\n\\n }\\n\\n\\n\\n Switch::Switch()\\n\\n : _source()\\n\\n , _id(kAmInvalidObjectId)\\n\",\n \"file_path\": \"src/Sound/Switch.cpp\",\n \"rank\": 94,\n \"score\": 51665.66947704277\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#include <SparkyStudios/Audio/Amplitude/Sound/Switch.h>\\n\\n\\n\\n#include <Core/EngineInternalState.h>\\n\\n\\n\\n#include \\\"switch_definition_generated.h\\\"\\n\\n\\n\",\n \"file_path\": \"src/Sound/Switch.cpp\",\n \"rank\": 95,\n \"score\": 51665.46586218318\n },\n {\n \"content\": \"// Copyright (c) 2021-present Sparky Studios. All rights reserved.\\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#include <SparkyStudios/Audio/Amplitude/Sound/Attenuation.h>\\n\\n\\n\\n#include <Core/EngineInternalState.h>\\n\\n\\n\\n#include \\\"attenuation_definition_generated.h\\\"\\n\\n\\n\",\n \"file_path\": \"src/Sound/Attenuation.cpp\",\n \"rank\": 96,\n \"score\": 51664.18495521791\n },\n {\n \"content\": \" const ListenerList& listeners,\\n\\n const float userGain,\\n\\n ListenerFetchMode fetchMode)\\n\\n {\\n\\n *gain = soundGain * bus->GetGain() * userGain;\\n\\n if (spatialization == Spatialization_Position || spatialization == Spatialization_PositionOrientation)\\n\\n {\\n\\n ListenerList::const_iterator listener;\\n\\n float distanceSquared;\\n\\n hmm_vec3 listenerSpaceLocation;\\n\\n if (BestListener(&listener, &distanceSquared, &listenerSpaceLocation, listeners, location, fetchMode))\\n\\n {\\n\\n if (attenuation != nullptr)\\n\\n {\\n\\n if (spatialization == Spatialization_PositionOrientation)\\n\\n {\\n\\n AMPLITUDE_ASSERT(entity.Valid());\\n\\n *gain *= attenuation->GetGain(entity.GetState(), &*listener);\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"src/Core/Engine.cpp\",\n \"rank\": 97,\n \"score\": 27.06366181208948\n },\n {\n \"content\": \" &gain, &pan, switchContainer->GetGain().GetValue(), switchContainer->GetBus(), definition->spatialization(),\\n\\n switchContainer->GetAttenuation(), channel->GetEntity(), channel->GetLocation(), state->listener_list,\\n\\n channel->GetUserGain(), state->listener_fetch_mode);\\n\\n channel->SetGain(gain);\\n\\n channel->SetPan(pan);\\n\\n }\\n\\n else if (const Collection* collection = channel->GetCollection(); collection != nullptr)\\n\\n {\\n\\n const CollectionDefinition* definition = collection->GetCollectionDefinition();\\n\\n\\n\\n float gain;\\n\\n hmm_vec2 pan;\\n\\n CalculateGainAndPan(\\n\\n &gain, &pan, collection->GetGain().GetValue(), collection->GetBus(), definition->spatialization(),\\n\\n collection->GetAttenuation(), channel->GetEntity(), channel->GetLocation(), state->listener_list, channel->GetUserGain(),\\n\\n state->listener_fetch_mode);\\n\\n channel->SetGain(gain);\\n\\n channel->SetPan(pan);\\n\\n }\\n\\n else if (const Sound* sound = channel->GetSound(); sound != nullptr)\\n\",\n \"file_path\": \"src/Core/Engine.cpp\",\n \"rank\": 98,\n \"score\": 23.520858133963145\n },\n {\n \"content\": \"#include <Sound/Schedulers/RandomScheduler.h>\\n\\n#include <Sound/Schedulers/SequenceScheduler.h>\\n\\n\\n\\n#include \\\"collection_definition_generated.h\\\"\\n\\n\\n\\nnamespace SparkyStudios::Audio::Amplitude\\n\\n{\\n\\n Collection::Collection()\\n\\n : _bus(nullptr)\\n\\n , _worldScopeScheduler(nullptr)\\n\\n , _entityScopeSchedulers()\\n\\n , _source()\\n\\n , _sounds()\\n\\n , _soundSettings()\\n\\n , _id(kAmInvalidObjectId)\\n\\n , _name()\\n\\n , _gain()\\n\\n , _priority()\\n\\n , _effect(nullptr)\\n\\n , _attenuation(nullptr)\\n\",\n \"file_path\": \"src/Sound/Collection.cpp\",\n \"rank\": 99,\n \"score\": 23.145163025885342\n }\n]","isConversational":false}}},{"rowIdx":394,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"LargeBarrelAnalysis/tests/TimeWindowCreatorToolsTest.cpp"},"repo_name":{"kind":"string","value":"kdulski/j-pet-framework-examples"},"commit":{"kind":"string","value":"ab2592a2c6cf8f901f5732f8878b750b9a7b6a49"},"file_code":{"kind":"string","value":"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TimeWindowCreatorToolsTest\n\n#include \"../TimeWindowCreatorTools.h\"\n#include <boost/test/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(TimeWindowCreatorToolsTestSuite)\n\nBOOST_AUTO_TEST_CASE(sortByValue_test) {\n JPetPM pm1(1, \"first\");\n\n JPetSigCh sigCh1(JPetSigCh::Leading, 1.0);\n JPetSigCh sigCh2(JPetSigCh::Trailing, 4.0);\n JPetSigCh sigCh3(JPetSigCh::Leading, 2.0);\n JPetSigCh sigCh4(JPetSigCh::Leading, 6.0);\n JPetSigCh sigCh5(JPetSigCh::Trailing, 5.0);\n JPetSigCh sigCh6(JPetSigCh::Leading, 3.0);\n sigCh1.setPM(pm1);\n sigCh2.setPM(pm1);\n sigCh3.setPM(pm1);\n sigCh4.setPM(pm1);\n sigCh5.setPM(pm1);\n sigCh6.setPM(pm1);\n\n std::vector<JPetSigCh> sigChs;\n sigChs.push_back(sigCh1);\n sigChs.push_back(sigCh2);\n sigChs.push_back(sigCh3);\n sigChs.push_back(sigCh4);\n sigChs.push_back(sigCh5);\n sigChs.push_back(sigCh6);\n\n BOOST_REQUIRE_EQUAL(sigChs.at(0).getValue(), 1.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(1).getValue(), 4.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(2).getValue(), 2.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(3).getValue(), 6.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(4).getValue(), 5.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(5).getValue(), 3.0);\n\n TimeWindowCreatorTools::sortByValue(sigChs);\n BOOST_REQUIRE_EQUAL(sigChs.at(0).getValue(), 1.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(1).getValue(), 2.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(2).getValue(), 3.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(3).getValue(), 4.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(4).getValue(), 5.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(5).getValue(), 6.0);\n}\n\nBOOST_AUTO_TEST_CASE(generateSigCh_test) {\n JPetFEB feb(1, true, \"just great\", \"very nice front-end board\", 1, 1, 4, 4);\n JPetTRB trb(2, 555, 333);\n std::pair<float, float> hvGains(23.4, 43.2);\n JPetPM pm(JPetPM::SideA, 23, 123, 321, hvGains, \"average pm\");\n\n JPetTOMBChannel channel(123);\n channel.setFEB(feb);\n channel.setTRB(trb);\n channel.setPM(pm);\n channel.setThreshold(34.5);\n channel.setLocalChannelNumber(1);\n\n std::map<unsigned int, std::vector<double>> thresholdsMap;\n std::map<unsigned int, std::vector<double>> timeCalibrationMap;\n std::vector<double> calibVec;\n calibVec.push_back(22.0);\n calibVec.push_back(33.0);\n calibVec.push_back(44.0);\n timeCalibrationMap[123] = calibVec;\n\n auto sigCh = TimeWindowCreatorTools::generateSigCh(\n 50.0, channel, timeCalibrationMap, thresholdsMap, JPetSigCh::Trailing,\n true);\n\n auto epsilon = 0.0001;\n BOOST_REQUIRE_EQUAL(sigCh.getType(), JPetSigCh::Trailing);\n BOOST_REQUIRE_EQUAL(sigCh.getPM().getID(), 23);\n BOOST_REQUIRE_EQUAL(sigCh.getFEB().getID(), 1);\n BOOST_REQUIRE_EQUAL(sigCh.getTRB().getID(), 2);\n BOOST_REQUIRE_EQUAL(sigCh.getDAQch(), 123);\n BOOST_REQUIRE_EQUAL(sigCh.getThresholdNumber(), 1);\n BOOST_REQUIRE_CLOSE(sigCh.getThreshold(), 34.5, epsilon);\n BOOST_REQUIRE_CLOSE(sigCh.getValue(), 1000.0 * (50.0 + 22.0), epsilon);\n}\n\nBOOST_AUTO_TEST_CASE(flagSigChs_test)\n{\n JPetSigCh sigCh00(JPetSigCh::Leading, 10.0);\n JPetSigCh sigCh01(JPetSigCh::Trailing, 11.0);\n\n JPetSigCh sigCh02(JPetSigCh::Leading, 12.0);\n JPetSigCh sigCh03(JPetSigCh::Leading, 13.0);\n JPetSigCh sigCh04(JPetSigCh::Trailing, 14.0);\n\n JPetSigCh sigCh05(JPetSigCh::Leading, 15.0);\n JPetSigCh sigCh06(JPetSigCh::Trailing, 16.0);\n\n JPetSigCh sigCh07(JPetSigCh::Leading, 17.0);\n JPetSigCh sigCh08(JPetSigCh::Trailing, 18.0);\n\n JPetSigCh sigCh09(JPetSigCh::Leading, 19.0);\n JPetSigCh sigCh10(JPetSigCh::Trailing, 20.0);\n JPetSigCh sigCh11(JPetSigCh::Trailing, 21.0);\n\n JPetSigCh sigCh12(JPetSigCh::Leading, 22.0);\n JPetSigCh sigCh13(JPetSigCh::Trailing, 23.0);\n\n JPetSigCh sigCh14(JPetSigCh::Leading, 24.0);\n JPetSigCh sigCh15(JPetSigCh::Leading, 25.0);\n JPetSigCh sigCh16(JPetSigCh::Leading, 26.0);\n JPetSigCh sigCh17(JPetSigCh::Trailing, 27.0);\n\n JPetSigCh sigCh18(JPetSigCh::Leading, 28.0);\n JPetSigCh sigCh19(JPetSigCh::Trailing, 29.0);\n\n JPetSigCh sigCh20(JPetSigCh::Leading, 30.0);\n JPetSigCh sigCh21(JPetSigCh::Trailing, 31.0);\n JPetSigCh sigCh22(JPetSigCh::Trailing, 32.0);\n JPetSigCh sigCh23(JPetSigCh::Trailing, 33.0);\n JPetSigCh sigCh24(JPetSigCh::Trailing, 33.0);\n\n JPetSigCh sigCh25(JPetSigCh::Leading, 34.0);\n JPetSigCh sigCh26(JPetSigCh::Trailing, 35.0);\n\n JPetSigCh sigCh27(JPetSigCh::Leading, 36.0);\n\n JPetPM pm1(1, \"first\");\n sigCh00.setPM(pm1);\n sigCh01.setPM(pm1);\n sigCh02.setPM(pm1);\n sigCh03.setPM(pm1);\n sigCh04.setPM(pm1);\n sigCh05.setPM(pm1);\n sigCh06.setPM(pm1);\n sigCh07.setPM(pm1);\n sigCh08.setPM(pm1);\n sigCh09.setPM(pm1);\n sigCh10.setPM(pm1);\n sigCh11.setPM(pm1);\n sigCh12.setPM(pm1);\n sigCh13.setPM(pm1);\n sigCh14.setPM(pm1);\n sigCh15.setPM(pm1);\n sigCh16.setPM(pm1);\n sigCh17.setPM(pm1);\n sigCh18.setPM(pm1);\n sigCh19.setPM(pm1);\n sigCh20.setPM(pm1);\n sigCh21.setPM(pm1);\n sigCh22.setPM(pm1);\n sigCh23.setPM(pm1);\n sigCh24.setPM(pm1);\n sigCh25.setPM(pm1);\n sigCh26.setPM(pm1);\n sigCh27.setPM(pm1);\n\n std::vector<JPetSigCh> thrSigCh;\n thrSigCh.push_back(sigCh00);\n thrSigCh.push_back(sigCh01);\n thrSigCh.push_back(sigCh02);\n thrSigCh.push_back(sigCh03);\n thrSigCh.push_back(sigCh04);\n thrSigCh.push_back(sigCh05);\n thrSigCh.push_back(sigCh06);\n thrSigCh.push_back(sigCh07);\n thrSigCh.push_back(sigCh08);\n thrSigCh.push_back(sigCh09);\n thrSigCh.push_back(sigCh10);\n thrSigCh.push_back(sigCh11);\n thrSigCh.push_back(sigCh12);\n thrSigCh.push_back(sigCh13);\n thrSigCh.push_back(sigCh14);\n thrSigCh.push_back(sigCh15);\n thrSigCh.push_back(sigCh16);\n thrSigCh.push_back(sigCh17);\n thrSigCh.push_back(sigCh18);\n thrSigCh.push_back(sigCh19);\n thrSigCh.push_back(sigCh20);\n thrSigCh.push_back(sigCh21);\n thrSigCh.push_back(sigCh22);\n thrSigCh.push_back(sigCh23);\n thrSigCh.push_back(sigCh24);\n thrSigCh.push_back(sigCh25);\n thrSigCh.push_back(sigCh26);\n thrSigCh.push_back(sigCh27);\n\n JPetStatistics stats;\n TimeWindowCreatorTools::flagSigChs(thrSigCh, stats, false);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(0).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(1).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(2).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(3).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(4).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(5).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(6).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(7).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(8).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(9).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(10).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(11).getRecoFlag(), JPetSigCh::Corrupted);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(12).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(13).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(14).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(15).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(16).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(17).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(18).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(19).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(20).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(21).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(22).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(23).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(24).getRecoFlag(), JPetSigCh::Corrupted);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(25).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(26).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(27).getRecoFlag(), JPetSigCh::Good);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n"},"prefix":{"kind":"string","value":"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE TimeWindowCreatorToolsTest\n\n#include \"../TimeWindowCreatorTools.h\"\n#include <boost/test/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(TimeWindowCreatorToolsTestSuite)\n\nBOOST_AUTO_TEST_CASE(sortByValue_test) {\n JPetPM pm1(1, \"first\");\n\n JPetSigCh sigCh1(JPetSigCh::Leading, 1.0);\n JPetSigCh sigCh2(JPetSigCh::Trailing, 4.0);\n JPetSigCh sigCh3(JPetSigCh::Leading, 2.0);\n JPetSigCh sigCh4(JPetSigCh::Leading, 6.0);\n JPetSigCh sigCh5(JPetSigCh::Trailing, 5.0);\n JPetSigCh sigCh6(JPetSigCh::Leading, 3.0);\n sigCh1.setPM(pm1);\n sigCh2.setPM(pm1);\n sigCh3.setPM(pm1);\n sigCh4.setPM(pm1);\n sigCh5.setPM(pm1);\n sigCh6.setPM(pm1);\n\n std::vector<JPetSigCh> sigChs;\n sigChs.push_back(sigCh1);\n sigChs.push_back(sigCh2);\n sigChs.push_back(sigCh3);\n sigChs.push_back(sigCh4);\n sigChs.push_back(sigCh5);\n sigChs.push_back(sigCh6);\n\n BOOST_REQUIRE_EQUAL(sigChs.at(0).getValue(), 1.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(1).getValue(), 4.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(2).getValue(), 2.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(3).getValue(), 6.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(4).getValue(), 5.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(5).getValue(), 3.0);\n\n TimeWindowCreatorTools::sortByValue(sigChs);\n BOOST_REQUIRE_EQUAL(sigChs.at(0).getValue(), 1.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(1).getValue(), 2.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(2).getValue(), 3.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(3).getValue(), 4.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(4).getValue(), 5.0);\n BOOST_REQUIRE_EQUAL(sigChs.at(5).getValue(), 6.0);\n}\n\nBOOST_AUTO_TEST_CASE(generateSigCh_test) {\n JPetFEB feb(1, true, \"just great\", \"very nice front-end board\", 1, 1, 4, 4);\n JPetTRB trb(2, 555, 333);\n std::pair<float, float> hvGains(23.4, 43.2);\n JPetPM pm(JPetPM::SideA, 23, 123, 321, hvGains, \"average pm\");\n\n JPetTOMBChannel channel(123);\n channel.setFEB(feb);\n channel.setTRB(trb);\n channel.setPM(pm);\n channel.setThreshold(34.5);\n channel.setLocalChannelNumber(1);\n\n std::map<unsigned int, std::vector<double>> thresholdsMap;\n std::map<unsigned int, std::vector<double>> timeCalibrationMap;\n std::vector<double> calibVec;\n calibVec.push_back(22.0);\n calibVec.push_back(33.0);\n calibVec.push_back(44.0);\n timeCalibrationMap[123] = calibVec;\n\n auto sigCh = TimeWindowCreatorTools::generateSigCh(\n 50.0, channel, timeCalibrationMap, thresholdsMap, JPetSigCh::Trai"},"suffix":{"kind":"string","value":"\n\nBOOST_AUTO_TEST_CASE(flagSigChs_test)\n{\n JPetSigCh sigCh00(JPetSigCh::Leading, 10.0);\n JPetSigCh sigCh01(JPetSigCh::Trailing, 11.0);\n\n JPetSigCh sigCh02(JPetSigCh::Leading, 12.0);\n JPetSigCh sigCh03(JPetSigCh::Leading, 13.0);\n JPetSigCh sigCh04(JPetSigCh::Trailing, 14.0);\n\n JPetSigCh sigCh05(JPetSigCh::Leading, 15.0);\n JPetSigCh sigCh06(JPetSigCh::Trailing, 16.0);\n\n JPetSigCh sigCh07(JPetSigCh::Leading, 17.0);\n JPetSigCh sigCh08(JPetSigCh::Trailing, 18.0);\n\n JPetSigCh sigCh09(JPetSigCh::Leading, 19.0);\n JPetSigCh sigCh10(JPetSigCh::Trailing, 20.0);\n JPetSigCh sigCh11(JPetSigCh::Trailing, 21.0);\n\n JPetSigCh sigCh12(JPetSigCh::Leading, 22.0);\n JPetSigCh sigCh13(JPetSigCh::Trailing, 23.0);\n\n JPetSigCh sigCh14(JPetSigCh::Leading, 24.0);\n JPetSigCh sigCh15(JPetSigCh::Leading, 25.0);\n JPetSigCh sigCh16(JPetSigCh::Leading, 26.0);\n JPetSigCh sigCh17(JPetSigCh::Trailing, 27.0);\n\n JPetSigCh sigCh18(JPetSigCh::Leading, 28.0);\n JPetSigCh sigCh19(JPetSigCh::Trailing, 29.0);\n\n JPetSigCh sigCh20(JPetSigCh::Leading, 30.0);\n JPetSigCh sigCh21(JPetSigCh::Trailing, 31.0);\n JPetSigCh sigCh22(JPetSigCh::Trailing, 32.0);\n JPetSigCh sigCh23(JPetSigCh::Trailing, 33.0);\n JPetSigCh sigCh24(JPetSigCh::Trailing, 33.0);\n\n JPetSigCh sigCh25(JPetSigCh::Leading, 34.0);\n JPetSigCh sigCh26(JPetSigCh::Trailing, 35.0);\n\n JPetSigCh sigCh27(JPetSigCh::Leading, 36.0);\n\n JPetPM pm1(1, \"first\");\n sigCh00.setPM(pm1);\n sigCh01.setPM(pm1);\n sigCh02.setPM(pm1);\n sigCh03.setPM(pm1);\n sigCh04.setPM(pm1);\n sigCh05.setPM(pm1);\n sigCh06.setPM(pm1);\n sigCh07.setPM(pm1);\n sigCh08.setPM(pm1);\n sigCh09.setPM(pm1);\n sigCh10.setPM(pm1);\n sigCh11.setPM(pm1);\n sigCh12.setPM(pm1);\n sigCh13.setPM(pm1);\n sigCh14.setPM(pm1);\n sigCh15.setPM(pm1);\n sigCh16.setPM(pm1);\n sigCh17.setPM(pm1);\n sigCh18.setPM(pm1);\n sigCh19.setPM(pm1);\n sigCh20.setPM(pm1);\n sigCh21.setPM(pm1);\n sigCh22.setPM(pm1);\n sigCh23.setPM(pm1);\n sigCh24.setPM(pm1);\n sigCh25.setPM(pm1);\n sigCh26.setPM(pm1);\n sigCh27.setPM(pm1);\n\n std::vector<JPetSigCh> thrSigCh;\n thrSigCh.push_back(sigCh00);\n thrSigCh.push_back(sigCh01);\n thrSigCh.push_back(sigCh02);\n thrSigCh.push_back(sigCh03);\n thrSigCh.push_back(sigCh04);\n thrSigCh.push_back(sigCh05);\n thrSigCh.push_back(sigCh06);\n thrSigCh.push_back(sigCh07);\n thrSigCh.push_back(sigCh08);\n thrSigCh.push_back(sigCh09);\n thrSigCh.push_back(sigCh10);\n thrSigCh.push_back(sigCh11);\n thrSigCh.push_back(sigCh12);\n thrSigCh.push_back(sigCh13);\n thrSigCh.push_back(sigCh14);\n thrSigCh.push_back(sigCh15);\n thrSigCh.push_back(sigCh16);\n thrSigCh.push_back(sigCh17);\n thrSigCh.push_back(sigCh18);\n thrSigCh.push_back(sigCh19);\n thrSigCh.push_back(sigCh20);\n thrSigCh.push_back(sigCh21);\n thrSigCh.push_back(sigCh22);\n thrSigCh.push_back(sigCh23);\n thrSigCh.push_back(sigCh24);\n thrSigCh.push_back(sigCh25);\n thrSigCh.push_back(sigCh26);\n thrSigCh.push_back(sigCh27);\n\n JPetStatistics stats;\n TimeWindowCreatorTools::flagSigChs(thrSigCh, stats, false);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(0).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(1).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(2).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(3).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(4).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(5).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(6).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(7).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(8).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(9).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(10).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(11).getRecoFlag(), JPetSigCh::Corrupted);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(12).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(13).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(14).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(15).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(16).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(17).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(18).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(19).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(20).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(21).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(22).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(23).getRecoFlag(), JPetSigCh::Corrupted);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(24).getRecoFlag(), JPetSigCh::Corrupted);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(25).getRecoFlag(), JPetSigCh::Good);\n BOOST_REQUIRE_EQUAL(thrSigCh.at(26).getRecoFlag(), JPetSigCh::Good);\n\n BOOST_REQUIRE_EQUAL(thrSigCh.at(27).getRecoFlag(), JPetSigCh::Good);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n"},"middle":{"kind":"string","value":"ling,\n true);\n\n auto epsilon = 0.0001;\n BOOST_REQUIRE_EQUAL(sigCh.getType(), JPetSigCh::Trailing);\n BOOST_REQUIRE_EQUAL(sigCh.getPM().getID(), 23);\n BOOST_REQUIRE_EQUAL(sigCh.getFEB().getID(), 1);\n BOOST_REQUIRE_EQUAL(sigCh.getTRB().getID(), 2);\n BOOST_REQUIRE_EQUAL(sigCh.getDAQch(), 123);\n BOOST_REQUIRE_EQUAL(sigCh.getThresholdNumber(), 1);\n BOOST_REQUIRE_CLOSE(sigCh.getThreshold(), 34.5, epsilon);\n BOOST_REQUIRE_CLOSE(sigCh.getValue(), 1000.0 * (50.0 + 22.0), epsilon);\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"Description of available parameters in TimeCalibration example.\n\nNote that configuration/calibration filed can be obtained from PetWiki:\n\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\n\n--------\n\n\n\nSave_Control_Histograms_bool\n\n--- Common for each module, if set to true, in the output ROOT files folder with\n\nstatistics will contain control histograms. Set to false if histograms not needed.\n\n\n\nStopIteration_bool\n\n---A flag indicating, that the module is called in the iterative mode with number of iterations defined in\n\nmain.cpp as the last argument (true) or with user-defined condition to exit the loop (false). In the latter case\n\none needs to put -1 as the last argument of manager.useTask (see the description of the TimeCalibration_NiterMax_int)\n\n---Default value: true\n\n\n\nUnpacker_TOToffsetCalib_std::string \n\n---Path to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\n\n\n\nUnpacker_TDCnonlinearityCalib_std::string \n\n---Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\n\n\n\nTimeWindowCreator_MainStrip_int\n\n--- Dedicated for files with data from measurement with Reference Detector:\n\nIn order to speed up the processing of a single position from a reference detector scan,\n\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\n\nThis means that signals from any other strips will be ignored at the lowest possible level,\n\nresulting in much faster processing. For more detailes please read README\n\n\n\nTimeWindowCreator_MinTime_float\n\n--- Time Slots have certain duration for specific runs, minimum time is usually\n\nnegative.\n\n--- Default value -1*10^6 ps\n\n\n\nTimeWindowCreator_MaxTime_float\n\n--- Default value 0.0 ps\n\n\n\nSignalFinder_EdgeMaxTime_float\n\n--- time window for matching Signal Channels on Leading Edge.\n","file_path":"TimeCalibration_iter/PARAMETERS.md","rank":1,"score":22.132663128622546},{"content":" if (fSaveControlHistos) {\n\n initialiseHistograms();\n\n }\n\n return true;\n\n}\n\n\n\nbool TimeWindowCreator::exec() {\n\n if (auto event = dynamic_cast<EventIII *const>(fEvent)) {\n\n int kTDCChannels = event->GetTotalNTDCChannels();\n\n if (fSaveControlHistos) {\n\n getStatistics().fillHistogram(\"sig_ch_per_time_slot\", kTDCChannels);\n\n }\n\n // Loop over all TDC channels in file\n\n auto tdcChannels = event->GetTDCChannelsArray();\n\n for (int i = 0; i < kTDCChannels; ++i) {\n\n auto tdcChannel = dynamic_cast<TDCChannel *const>(tdcChannels->At(i));\n\n auto tombNumber = tdcChannel->GetChannel();\n\n // Skip trigger signals from TRB - every 65th\n\n if (tombNumber % 65 == 0)\n\n continue;\n","file_path":"LargeBarrelAnalysis/TimeWindowCreator.cpp","rank":2,"score":20.596286166294924},{"content":"\n\n channels[i].setPM(pm1);\n\n channels[4+i].setPM(pm2);\n\n\n\n bank.addTOMBChannel(channels[i]);\n\n bank.addTOMBChannel(channels[4+i]);\n\n }\n\n\n\n SignalFinderTools::ThresholdOrderings orderings = SignalFinderTools::findThresholdOrders(bank);\n\n BOOST_REQUIRE_EQUAL(orderings.size(), 2);\n\n\n\n for(auto& pm: orderings){\n\n SignalFinderTools::ThresholdValues sorted_values;\n\n SignalFinderTools::ThresholdValues& orig_values = (pm.first==221 ? values_pm1 : values_pm2);\n\n for(int i=0;i<4;++i){\n\n sorted_values[pm.second[i]] = orig_values[i];\n\n }\n\n\n\n BOOST_REQUIRE_LE(sorted_values[0], sorted_values[1]);\n\n BOOST_REQUIRE_LE(sorted_values[1], sorted_values[2]);\n\n BOOST_REQUIRE_LE(sorted_values[2], sorted_values[3]);\n\n }\n\n}\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp","rank":3,"score":20.155447983252184},{"content":" JPetStatistics& stats, bool saveHistos\n\n){\n\n vector<JPetSigCh> allTDCSigChs;\n\n // Loop over all entries on leading edge in current TOMBChannel and create SigCh\n\n for (int j = 0; j < tdcChannel->GetLeadHitsNum(); j++) {\n\n auto leadTime = tdcChannel->GetLeadTime(j);\n\n if (leadTime > maxTime || leadTime < minTime ) { continue; }\n\n auto leadSigCh = generateSigCh(\n\n leadTime, tombChannel, timeCalibrationMap, thresholdsMap,\n\n JPetSigCh::Leading, setTHRValuesFromChannels\n\n );\n\n allTDCSigChs.push_back(leadSigCh);\n\n if (saveHistos){\n\n stats.fillHistogram(Form(\"pm_occupation_thr%d\", tombChannel.getLocalChannelNumber()),\n\n tombChannel.getPM().getID());\n\n }\n\n }\n\n // Loop over all entries on trailing edge in current TOMBChannel and create SigCh\n\n for (int j = 0; j < tdcChannel->GetTrailHitsNum(); j++) {\n\n auto trailTime = tdcChannel->GetTrailTime(j);\n","file_path":"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp","rank":4,"score":20.025408800244747},{"content":"`Unpacker_TOToffsetCalib_std::string` - Path to and name of a ROOT file with TOT offset calibrations (stretcher) applied during unpacking of HLD file;\n\n\n\n`Unpacker_TDCnonlinearityCalib_std::string` - Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\n\n\n\n`TimeWindowCreator_MinTime_float` - Time Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\n\n\n\n`TimeWindowCreator_MaxTime_float` - default value `0.0 ps`\n\n\n\n`TimeCalibLoader_ConfigFile_std::string` - Path to and name of ASCII file of required structure, containing time calibrations, specific for each run\n\n\n\n`ThresholdLoader_ConfigFile_std::string` - Path to and name of ASCII file of required structure, containing thresholds values, specific for each run\n\n\n\n`SignalFinder_UseCorruptedSigCh_bool` - if set to `true`, signal channels flagged as corrupted will be used in SignalFinder analysis, if set to `false` they will be filtered out\n\n\n\n`SignalFinder_EdgeMaxTime_float` - time window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\n\n\n\n`SignalFinder_LeadTrailMaxTime_float` - time window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\n\n\n\n`SignalTransformer_UseCorruptedSignals_bool` - if set to `true`, signals flagged as corrupted will be used in SignalTransformer analysis, if set to `false` they will be filtered out\n\n\n\n`HitFinder_UseCorruptedSignals_bool` - if set to `true`, signals flagged as corrupted will be used in HitFinder analysis, if set to `false` they will be filtered out\n\n\n\n`HitFinder_VelocityFile_std::string` - name of ASCII file of required format, containing values of effective velocities of light in each scintillator\n\n\n\n`HitFinder_ABTimeDiff_float` - time window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\n\n\n","file_path":"VelocityCalibration/README.md","rank":5,"score":19.37044358504059},{"content":" if(tc.second->getLocalChannelNumber() > kNumberOfThresholds){\n\n ERROR(\"Threshold sorting is meant to work with 4 thresholds only!\");\n\n return orderings;\n\n }\n\n\n\n thr_values_per_pm[pm_id][tc.second->getLocalChannelNumber()-1] = tc.second->getThreshold();\n\n }\n\n\n\n for(auto& pm: thr_values_per_pm){\n\n permuteThresholdsByValue(pm.second, orderings[pm.first]);\n\n }\n\n\n\n return orderings;\n\n}\n\n\n\n/**\n\n * Helper method for findThresholdOrders which constructs a single permutation\n\n * based on the threshold values on a single PMT\n\n *\n\n * @param threshold_values array of floating-point values of voltage thresholds set on\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":6,"score":19.176386843671747},{"content":"Description of available parameters in TimeCalibration example.\n\nNote that configuration/calibration files can be obtained from PetWiki:\n\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\n\n--------\n\n\n\n-------------------------userParams.json-------------------------\n\n\n\nSave_Control_Histograms_bool\n\n--- Common for each module, if set to true, in the output ROOT files folder with\n\nstatistics will contain control histograms. Set to false if histograms not needed.\n\n\n\nStopIteration_bool\n\n--- A flag indicating, that the module is called in the iterative mode with number of iterations defined in\n\nmain.cpp as the last argument (true) or with user-defined condition to exit the loop (false). In the latter case\n\none needs to put -1 as the last argument of manager.useTask (see the description of the TimeCalibration_NiterMax_int)\n\n--- Default value: true\n\n\n\nUnpacker_TOToffsetCalib_std::string \n\n--- Path to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\n\n\n\nUnpacker_TDCnonlinearityCalib_std::string \n\n--- Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\n\n\n\nTimeWindowCreator_MainStrip_int\n\n--- Dedicated for files with data from measurement with Reference Detector:\n\nIn order to speed up the processing of a single position from a reference detector scan,\n\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\n\nThis means that signals from any other strips will be ignored at the lowest possible level,\n\nresulting in much faster processing. For more detailes please read README\n\n\n\nTimeWindowCreator_MinTime_float\n\n--- Time Slots have certain duration for specific runs, minimum time is usually\n\nnegative.\n\n--- Default value -1*10^6 ps\n\n\n\nTimeWindowCreator_MaxTime_float\n","file_path":"TimeCalibration_lifetime/PARAMETERS.md","rank":7,"score":19.14071036878237},{"content":"Description of available parameters in TimeCalibration example.\n\nNote that configuration/calibration filed can be obtained from PetWiki:\n\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\n\n--------\n\n\n\nSave_Cotrol_Histograms_bool\n\n--- Common for each module, if set to true, in the output ROOT files folder with\n\nstatistics will contain control histograms. Set to false if histograms not needed.\n\n\n\nTimeWindowCreator_MainStrip_int\n\n--- Dedicated for files with data from measurement with Reference Detector:\n\nIn order to speed up the processing of a single position from a reference detector scan,\n\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\n\nThis means that signals from any other strips will be ignored at the lowest possible level,\n\nresulting in much faster processing. For more detailes please read README\n\n\n\nTimeWindowCreator_MinTime_float\n\n--- Time Slots have certain duration for specific runs, minimum time is usually\n\nnegative.\n\n--- Default value -1*10^6 ps\n\n\n\nTimeWindowCreator_MaxTime_float\n\n--- Default value 0.0 ps\n\n\n\nSignalFinder_EdgeMaxTime_float\n\n--- time window for matching Signal Channels on Leading Edge.\n\n--- Default value: 5 000 ps.\n\n\n\nSignalFinder_LeadTrailMaxTime_float\n\n--- time window for matching Signal Channels on the same thresholds from\n\nLeading and Trailing edge. Default value: 25 000 ps.\n\n\n\nHitFinder_VelocityFile_std::string\n\n--- name of ASCII file of required format, containing values of effective velocities\n\nof light in each scintillator.\n\n\n\nHitFinder_ABTimeDiff_float\n\n--- time window for matching Signals on the same scintillator and different sides\n\n--- Default value: 6 000 ps.\n\n\n\nHitFinder_RefDetScinID_int\n\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\n\n--- The only value used so far: 193\n\n\n\nTimeCalibration_PMIdRef_int\n\n--- Id of the photomultiplier of the refference detector.\n","file_path":"TimeCalibration/PARAMETERS.md","rank":8,"score":18.689551605460913},{"content":"\n\nbool SDARecoDrawAllOffsets::exec() {\n\n if (auto signal = dynamic_cast<const JPetRecoSignal *const>(fEvent))\n\n for (unsigned int j = 0; j < fNumberOfPMTs; j++)\n\n if ((signal->getPM().getID()) == fIDs[j]) {\n\n fOffset = signal->getOffset();\n\n fOffsets[j].push_back(fOffset);\n\n break;\n\n }\n\n return true;\n\n}\n\n\n\nbool SDARecoDrawAllOffsets::terminate() {\n\n auto c1 = new TCanvas();\n\n vector<double> minimums, maximums;\n\n for (unsigned int j = 0; j < fNumberOfPMTs; j++) {\n\n minimums.push_back(JPetRecoSignalTools::min(fOffsets[j]));\n\n maximums.push_back(JPetRecoSignalTools::max(fOffsets[j]));\n\n }\n\n double maximum = JPetRecoSignalTools::max(maximums);\n","file_path":"modules/SDA/JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.cpp","rank":9,"score":18.645224415476157},{"content":"\n\n#include \"JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.h\"\n\n#include \"JPetRecoSignalTools/JPetRecoSignalTools.h\"\n\n#include <TLegend.h>\n\n#include <sstream>\n\nusing namespace std;\n\nSDARecoDrawAllOffsets::SDARecoDrawAllOffsets(const char *name)\n\n : JPetUserTask(name) {}\n\nSDARecoDrawAllOffsets::~SDARecoDrawAllOffsets() {}\n\nbool SDARecoDrawAllOffsets::init() {\n\n const auto ¶mBank = getParamBank();\n\n fNumberOfPMTs = paramBank.getPMsSize();\n\n cout << \"Found \" << fNumberOfPMTs << \" PMTs in paramBank\\n\";\n\n for (size_t i = 0; i < fNumberOfPMTs; i++) {\n\n fIDs.push_back(paramBank.getPM(i).getID());\n\n vector<double> k;\n\n fOffsets.push_back(k);\n\n }\n\n return true;\n\n}\n","file_path":"modules/SDA/JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.cpp","rank":10,"score":18.532630370804718},{"content":" sigCh2.setRecoFlag(JPetSigCh::Corrupted);\n\n if(saveHistos){\n\n stats.fillHistogram(\"good_vs_bad_sigch\", 2);\n\n stats.fillHistogram(\"TT_per_PM\", sigCh1.getPM().getID());\n\n stats.fillHistogram(\"TT_per_THR\", sigCh1.getThresholdNumber());\n\n stats.fillHistogram(\"TT_time_diff\", sigCh2.getValue()-sigCh1.getValue());\n\n }\n\n }\n\n if(sigCh1.getRecoFlag() == JPetSigCh::Unknown && saveHistos){\n\n stats.fillHistogram(\"good_vs_bad_sigch\", 3);\n\n }\n\n }\n\n}\n\n\n\n/**\n\n* Sets up Signal Channel fields\n\n*/\n\nJPetSigCh TimeWindowCreatorTools::generateSigCh(\n\n double tdcChannelTime, const JPetTOMBChannel& channel,\n\n map<unsigned int, vector<double>>& timeCalibrationMap,\n","file_path":"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp","rank":11,"score":18.49444821819496},{"content":"# ImageReconstruction parameters description\n\n\n\n## Contents\n\n\n\nDescription of available parameters in ImageReconstruction example.\n\n\n\n- `FilterEvents_Cut_On_Z_Value_float` \n\n Events with Z value greater then this value will not be included in output file. [cm]\n\n\n\n- `FilterEvents_Cut_On_LOR_Distance_From_Center_float`\n\n Events with LOR distance greater then this value will not be included in output file [cm]\n\n\n\n- `FilterEvents_TOT_Min_Value_In_Ns_float`\n\n Events with sum of TOT with value less then this value will not be included in output file [ns]\n\n\n\n- `FilterEvents_TOT_Max_Value_In_Ns_float`\n\n Events with sum of TOT with value greater then this value will not be included in output file [ns]\n\n\n\n- `FilterEvents_Angle_Delta_Min_Value_float`\n\n Events that hits have angle differences value less then this value will not be included in output file [degrees]\n\n\n\n- `MLEMRunner_OutFileName_std::string`\n\n Path to file where will be saved converted data for futher reconstruction in j-pet-mlem [string]\n\n\n\n- `MLEMRunner_NumberOfPixelsInOneDimension_int`\n\n Number of pixels in reconstructed image in one demension [px]\n\n\n\n- `MLEMRunner_PixelSize_double`\n\n Size of 1 pixel in reconstructed image [m]\n\n\n\n- `MLEMRunner_StartPixelForPartialMatrix_int`\n\n Start pixel of partial matrix.\n\n\n\n- `MLEMRunner_NumberOfEmissionsPerPixel_int`\n\n Number of emmisions per pixel for system matrix.\n\n\n\n- `MLEMRunner_TOFStepSize_double`\n\n TOF step size [m]\n\n\n\n- `MLEMRunner_TOFSigmaAxis_float`\n\n TOF sigma [m]\n\n\n\n- `MLEMRunner_TOFSigmaAlongZAxis_float`\n\n TOF sigma along Z axis [m]\n\n\n\n- `MLEMRunner_DisplayInfo_bool`\n\n If true display extra info about reconstruction into cerr\n\n\n\n- `MLEMRunner_SystemMatrixOutputPath_std::string`\n\n Path to file where system matrix will be saved and from what file read system matrix if already generated\n\n\n\n- `MLEMRunner_SystemMatrixSaveFull_bool`\n","file_path":"ImageReconstruction/PARAMETERS.md","rank":12,"score":18.39695378852926},{"content":" return ok;\n\n });\n\n if (allOptionsExist) {\n\n TOTcut[0] = getOptionAsFloat(opts, kTOTCutLowOptName);\n\n TOTcut[1] = getOptionAsFloat(opts, kTOTCutHighOptName);\n\n int code = getOptionAsInt(opts, kMainStripOptName);\n\n fLayerToCalib = code / 100;\n\n fStripToCalib = code % 100;\n\n fIsCorrection = getOptionAsBool(opts, kLoadConstantsOptName);\n\n fTimeConstantsCalibFileNameTmp = getOptionAsString(opts, kCalibFileTmpOptName );\n\n fTimeConstantsCalibFileName = getOptionAsString(opts, kCalibFileFinalOptName );\n\n kPMIdRef = getOptionAsInt(opts, kPMIdRefOptName);\n\n NiterMax = getOptionAsInt(opts,MaxIterNumOptName); \n\n return true;\n\n } else {\n\n return false;\n\n }\n\n}\n\n\n\nvoid TimeCalibration::createHistograms()\n","file_path":"TimeCalibration_iter/TimeCalibration.cpp","rank":13,"score":18.22673943964369},{"content":" hit.setQualityOfTimeDiff(-1.0);\n\n hit.setEnergy(-1.0);\n\n hit.setQualityOfEnergy(-1.0);\n\n hit.setScintillator(signalB.getPM().getScin());\n\n hit.setBarrelSlot(signalB.getPM().getBarrelSlot());\n\n return hit;\n\n}\n\n\n\n/**\n\n * Helper method for getting TOMB channel\n\n */\n\nint HitFinderTools::getProperChannel(const JPetPhysSignal& signal)\n\n{\n\n auto someSigCh = signal.getRecoSignal().getRawSignal()\n\n .getPoints(JPetSigCh::Leading, JPetRawSignal::ByThrValue)[0];\n\n return someSigCh.getTOMBChannel().getChannel();\n\n}\n\n\n\n/**\n\n* Helper method for checking if theta is in radians\n","file_path":"LargeBarrelAnalysis/HitFinderTools.cpp","rank":14,"score":18.02910040750766},{"content":" }\n\n return false;\n\n}\n\n\n\nvoid TimeWindowCreator::initialiseHistograms() {\n\n getStatistics().createHistogramWithAxes(new TH1D(\"sig_ch_per_time_slot\", \"Signal Channels Per Time Slot\", 250, -0.125, 999.875),\n\n \"Signal Channels in Time Slot\", \"Number of Time Slots\");\n\n\n\n for (int i = 1; i <= kNumOfThresholds; i++) {\n\n getStatistics().createHistogramWithAxes(new TH1D(Form(\"pm_occupation_thr%d\", i), Form(\"Signal Channels per PM on THR %d\", i), \n\n 385, 0.5, 385.5), \"PM ID)\", \"Number of Signal Channels\");\n\n }\n\n\n\n getStatistics().createHistogramWithAxes(\n\n new TH1D(\"good_vs_bad_sigch\", \"Number of good and corrupted SigChs created\",\n\n 3, 0.5, 3.5), \"Quality\", \"Number of SigChs\");\n\n std::vector<std::pair<unsigned, std::string>> binLabels;\n\n binLabels.push_back(std::make_pair(1,\"GOOD\"));\n\n binLabels.push_back(std::make_pair(2,\"CORRUPTED\"));\n\n binLabels.push_back(std::make_pair(3,\"UNKNOWN\"));\n","file_path":"LargeBarrelAnalysis/TimeWindowCreator.cpp","rank":15,"score":17.908377330220183},{"content":"/**\n\n * Method returns a map of vectors of JPetSigCh ordered by photomultiplier ID\n\n */\n\nconst map<int, vector<JPetSigCh>> SignalFinderTools::getSigChByPM(\n\n const JPetTimeWindow* timeWindow, bool useCorrupts, int refPMID\n\n){\n\n map<int, vector<JPetSigCh>> sigChsPMMap;\n\n if (!timeWindow) {\n\n WARNING(\"Pointer of Time Window object is not set, returning empty map\");\n\n return sigChsPMMap;\n\n }\n\n // Map Signal Channels according to PM they belong to\n\n const unsigned int nSigChs = timeWindow->getNumberOfEvents();\n\n for (unsigned int i = 0; i < nSigChs; i++) {\n\n auto sigCh = dynamic_cast<const JPetSigCh&>(timeWindow->operator[](i));\n\n // If it is set not to use Corrupted SigChs, such flagged objects will be skipped\n\n // Here we ignore the corrupted flag of signals from Refference detector\n\n // since removing them results in double peak structures in the calibration spectra\n\n int pmtID = sigCh.getPM().getID();\n\n if(pmtID == refPMID) {\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":16,"score":17.903688730836873},{"content":" }\n\n if (fOrderThresholdsByValue){\n\n INFO(\"Threshold reordering was requested. Thresholds will be ordered by their values according to provided detector setup file.\");\n\n fThresholdOrderings = SignalFinderTools::findThresholdOrders(getParamBank());\n\n }\n\n\n\n // Creating control histograms\n\n if(fSaveControlHistos) { initialiseHistograms(); }\n\n return true;\n\n}\n\n\n\nbool SignalFinder::exec()\n\n{\n\n // Getting the data from event in an apropriate format\n\n if(auto timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\n\n // Distribute signal channels by PM IDs and filter out Corrupted SigChs if requested\n\n auto& sigChByPM = SignalFinderTools::getSigChByPM(timeWindow, fUseCorruptedSigCh, fRefPMID);\n\n // Building signals\n\n auto allSignals = SignalFinderTools::buildAllSignals(\n\n sigChByPM, fSigChEdgeMaxTime, fSigChLeadTrailMaxTime,\n","file_path":"LargeBarrelAnalysis/SignalFinder.cpp","rank":17,"score":17.856048227284617},{"content":" void fitAndSaveParametersToFile(const std::string& filename, const std::string& filenameTmp);\n\n bool CheckIfExit(int Niter);\n\n\n\n /// Required options to be loaded from the json file.\n\n const std::string kPMIdRefOptName = \"TimeCalibration_PMIdRef_int\";\n\n const std::string kTOTCutLowOptName = \"TimeCalibration_TOTCutLow_float\";\n\n const std::string kTOTCutHighOptName = \"TimeCalibration_TOTCutHigh_float\";\n\n // const std::string kMainStripOptName = \"TimeCalibration_MainStrip_int\";\n\n const std::string kMainStripOptName = \"TimeWindowCreator_MainStrip_int\"; \n\n const std::string kLoadConstantsOptName = \"TimeCalibration_LoadConstants_bool\";\n\n const std::string kCalibFileTmpOptName = \"TimeCalibration_OutputFileTmp_std::string\";\n\n const std::string kCalibFileFinalOptName = \"TimeCalibration_OutputFileFinal_std::string\";\n\n const std::string MaxIterNumOptName = \"TimeCalibration_NiterMax_int\";\n\n int kPMIdRef = 385;\n\n std::array<float, 2> TOTcut{{ -300000000., 300000000.}}; //TOT cuts for slot hits (sum of TOTs from both sides)\n\n int fLayerToCalib = -1; //Layer of calibrated slot\n\n int fStripToCalib = -1; //Slot to be calibrated\n\n bool fIsCorrection = true; //Flag for choosing the correction of times at the level of calibration module (use only if the calibration loader is not used)\n\n std::string fTimeConstantsCalibFileName = \"TimeConstantsCalib.txt\";\n\n std::string fTimeConstantsCalibFileNameTmp = \"TimeConstantsCalibTmp.txt\";\n","file_path":"TimeCalibration_iter/TimeCalibration.h","rank":18,"score":17.594180555451818},{"content":"# Large Barrel Analysis parameters description\n\n\n\n## Contents\n\nDescription of available parameters in LargeBarrelAnalysis example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\n\n\n\n- `Save_Control_Histograms_bool` \n\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms are not needed.\n\n\n\n- `Unpacker_TOToffsetCalib_std::string` \n\nPath to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\n\n\n\n- `Unpacker_TDCnonlinearityCalib_std::string` \n\nPath to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\n\n\n\n- `TimeWindowCreator_MainStrip_int` \n\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the scintillator we calibrate. If option is absent in the user parameters file, part with reference detector is ignored\n\n\n\n- `TimeWindowCreator_MinTime_float` \n\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\n\n\n\n- `TimeWindowCreator_MaxTime_float` \n\ndefault value `0.0 ps`\n\n\n\n- `TimeCalibLoader_ConfigFile_std::string` \n\nPath to and name of ASCII file of required structure, containing time calibrations, specific for each run\n\n\n\n- `SignalFinder_UseCorruptedSigCh_bool` \n\nIndication if Signal Finder module should use signal channels flagged as Corrupted in the previous task. Default value: `false`\n\n\n\n- `SignalFinder_EdgeMaxTime_float` \n\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\n\n\n\n- `SignalFinder_LeadTrailMaxTime_float` \n","file_path":"LargeBarrelAnalysis/PARAMETERS.md","rank":19,"score":17.525536875290165},{"content":"\n\n return true;\n\n}\n\n\n\nbool SinogramCreator::atenuation(const float value) { return distribution(generator) <= value; }\n\n\n\nvoid SinogramCreator::setUpOptions()\n\n{\n\n auto opts = getOptions();\n\n if (isOptionSet(opts, kOutFileNameKey))\n\n {\n\n fOutFileName = getOptionAsString(opts, kOutFileNameKey);\n\n }\n\n if (isOptionSet(opts, kReconstructionDistanceAccuracy))\n\n {\n\n fReconstructionDistanceAccuracy = getOptionAsFloat(opts, kReconstructionDistanceAccuracy);\n\n }\n\n if (isOptionSet(opts, kZSplitNumber))\n\n {\n\n fZSplitNumber = getOptionAsInt(opts, kZSplitNumber);\n","file_path":"ImageReconstruction/SinogramCreator.cpp","rank":20,"score":16.97201160822847},{"content":" // Build a list of allowed channels\n\n JPetGeomMapping mapper(getParamBank());\n\n for (int thr = 1; thr <= 4; ++thr) {\n\n int tombNumber = mapper.getTOMB(fMainStrip.first, fMainStrip.second,\n\n JPetPM::SideA, thr);\n\n fAllowedChannels.insert(tombNumber);\n\n tombNumber = mapper.getTOMB(fMainStrip.first, fMainStrip.second,\n\n JPetPM::SideB, thr);\n\n fAllowedChannels.insert(tombNumber);\n\n }\n\n // Add all reference detector channels to allowed channels list\n\n for (int thr = 1; thr <= 4; ++thr) {\n\n int tombNumber = mapper.getTOMB(4, 1, JPetPM::SideA, thr);\n\n fAllowedChannels.insert(tombNumber);\n\n tombNumber = mapper.getTOMB(4, 1, JPetPM::SideB, thr);\n\n fAllowedChannels.insert(tombNumber);\n\n }\n\n }\n\n\n\n // Control histograms\n","file_path":"LargeBarrelAnalysis/TimeWindowCreator.cpp","rank":21,"score":16.938193135179212},{"content":" std::map<std::tuple<int, int, JPetPM::Side, int>, int> fCorrectTombMap = {\n\n {std::make_tuple(1, 1, JPetPM::SideA, 1), 22},\n\n {std::make_tuple(3, 2, JPetPM::SideB, 4), 13},\n\n {std::make_tuple(2, 90, JPetPM::SideB, 2), 73}};\n\n};\n\n\n\nBOOST_AUTO_TEST_SUITE(UniversalFileLoaderSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(getConfigurationParameter) {\n\n UniversalFileLoader::TOMBChToParameter configuration = {\n\n {0, std::vector<double>{0.5, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\n\n {1, std::vector<double>{-1.2, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\n\n {3, std::vector<double>{0.2, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\n\n {4, std::vector<double>{-0.1, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}}};\n\n auto epsilon = 0.00001;\n\n BOOST_REQUIRE_CLOSE(\n\n UniversalFileLoader::getConfigurationParameter(configuration, 0), 0.5,\n\n epsilon);\n\n BOOST_REQUIRE_CLOSE(\n\n UniversalFileLoader::getConfigurationParameter(configuration, 1), -1.2,\n","file_path":"LargeBarrelAnalysis/tests/UniversalFileLoaderTest.cpp","rank":22,"score":16.204589928387737},{"content":"\tstd::map<unsigned int, std::vector<double>> fTimeCalibration;\n\n\tstd::map<unsigned int, std::vector<double>> fThresholds;\n\n\tbool fSetTHRValuesFromChannels = true;\n\n\tlong long int fCurrEventNumber = 0;\n\n\tstd::set<int> fAllowedChannels;\n\n\tbool fSaveControlHistos = true;\n\n\tstd::pair<int,int> fMainStrip;\n\n\tbool fMainStripSet = false;\n\n\tdouble fMinTime = -1.e6;\n\n\tdouble fMaxTime = 0.;\n\n};\n\n\n\n#endif /* !TIMEWINDOWCREATOR_H */\n","file_path":"LargeBarrelAnalysis/TimeWindowCreator.h","rank":23,"score":16.196220822938358},{"content":" JPetPM pm2(JPetPM::SideB, 222, 32, 64, std::make_pair(16.f, 32.f), \"test_pm2\");\n\n\n\n bank.addPM(pm1);\n\n bank.addPM(pm2);\n\n\n\n SignalFinderTools::ThresholdValues values_pm1 = {40., 3., 20., 10.};\n\n SignalFinderTools::ThresholdValues values_pm2 = {100., 400., 200., 300.};\n\n\n\n JPetTOMBChannel channels[8];\n\n\n\n for(int i=0;i<4;++i){\n\n\n\n channels[i] = JPetTOMBChannel(i);\n\n channels[4+i] = JPetTOMBChannel(4+i);\n\n\n\n channels[i].setLocalChannelNumber(i+1);\n\n channels[4+i].setLocalChannelNumber(i+1);\n\n\n\n channels[i].setThreshold(values_pm1[i]);\n\n channels[4+i].setThreshold(values_pm2[i]);\n","file_path":"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp","rank":24,"score":16.082361296142814},{"content":"--- Default value: 5 000 ps.\n\n\n\nSignalFinder_LeadTrailMaxTime_float\n\n--- time window for matching Signal Channels on the same thresholds from\n\nLeading and Trailing edge. Default value: 25 000 ps.\n\n\n\nSignalFinder_UseCorruptedSigCh_bool\n\n---Indication if Signal Finder module should use signal channels flagged as Corrupted in the previous task.\n\nDefault value: false\n\n\n\nHitFinder_VelocityFile_std::string\n\n--- name of ASCII file of required format, containing values of effective velocities\n\nof light in each scintillator.\n\n\n\nHitFinder_ABTimeDiff_float\n\n--- time window for matching Signals on the same scintillator and different sides\n\n--- Default value: 6 000 ps.\n\n\n\nHitFinder_RefDetScinID_int\n\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\n\n--- The only value used so far: 193\n\n\n\nHitFinder_UseCorruptedSignals_bool \n\n--- Indication if Hit Finder module should use signals flagged as Corrupted in the previous task.\n\n--- Default value: `false`\n\n\n\nTimeCalibration_PMIdRef_int\n\n--- Id of the photomultiplier of the refference detector.\n\n--- So far we used always number 385\n\n\n\nTimeCalibration_TOTCutLow_float (in the older versions\tof Framework: TOTCutLow)\n\n--- Lower bound of TOT for signals used to calibrate slots with refference detector.\n\nWe do not use it so far since the results with cuts were not better then without.\n\n--- Default value: -300000000\n\n\n\nTimeCalibration_TOTCutHigh_float (in the older versions of Framework: TOTCutHigh)\n\n---Upper bound of TOT for signals used to calibrate slots with refference detector.\n\nWe do not use it so far since the results with cuts were not better then without.\n","file_path":"TimeCalibration_iter/PARAMETERS.md","rank":25,"score":16.050410921436136},{"content":" return true;\n\n}\n\n\n\nvoid TimeWindowCreator::saveSigChs(const vector<JPetSigCh> &sigChVec) {\n\n for (auto &sigCh : sigChVec) {\n\n fOutputEvents->add<JPetSigCh>(sigCh);\n\n }\n\n}\n\n\n\n/**\n\n * Reference Detector\n\n * Returns true if signal from the channel given as argument should be passed\n\n */\n\nbool TimeWindowCreator::isAllowedChannel(JPetTOMBChannel &tombChannel) const {\n\n // If main strip was not defined, pass all channels\n\n if (!fMainStripSet)\n\n return true;\n\n if (fAllowedChannels.find(tombChannel.getChannel()) !=\n\n fAllowedChannels.end()) {\n\n return true;\n","file_path":"LargeBarrelAnalysis/TimeWindowCreator.cpp","rank":26,"score":16.03121131713219},{"content":"# Imaging stream parameters description\n\n\n\n## Contents\n\nDescription of available parameters in Imaging example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\n\n\n\n- `Save_Control_Histograms_bool` \n\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\n\n\n\n- `TimeWindowCreator_MainStrip_int` \n\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\n\n\n\n- `TimeWindowCreator_MinTime_float` \n\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\n\n\n\n- `TimeWindowCreator_MaxTime_float` \n\ndefault value `0.0 ps`\n\n\n\n- `TimeCalibLoader_ConfigFile_std::string` \n\nname of ASCII file of required structure, containing time calibrations, specific for each run\n\n\n\n- `SignalFinder_EdgeMaxTime_float` \n\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\n\n\n\n- `SignalFinder_LeadTrailMaxTime_float` \n\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\n\n\n\n- `HitFinder_VelocityFile_std::string` \n\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\n\n\n\n- `HitFinder_ABTimeDiff_float` \n\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\n\n\n\n- `HitFinder_RefDetScinID_int` \n\n`ID` of Reference Detector Scintillator, needed for creating reference hits\n\n\n\n- `EventFinder_EventTime_float` \n\ntime window for grouping hits in one event. Default value `5 000 ps`\n\n\n\n- `EventFinder_MinEventMultiplicity_int` \n","file_path":"Imaging/PARAMETERS.md","rank":27,"score":16.003532185469403},{"content":"\n\n std::string fOutFileName = \"mlem_reconstruction_output.txt\";\n\n float fHalfStripLenght = 0.f;\n\n\n\n Scanner2D fScanner;\n\n\n\n std::ofstream fOutputStream; // outputs data in format accepted by 3d_hybrid_reconstruction\n\n std::stringstream fReconstructionStringStream; // connection between parsing events and reconstruction\n\n\n\n int fNumberOfPixelsInOneDimension = 160; // Dimension of 1 axis in 3d reconstructed image(n-pixels)\n\n double fPixelSize = 0.004; // Size of 1 pixel in m(s-pixel)\n\n unsigned int fStartPixelForPartialMatrix = 0u; // Starting position of matrix\n\n unsigned int fNumberOfEmissionsPerPixel = 100000000; // Number of emissions per pixel for system matrix\n\n double fTOFStep = 0.;\n\n float fTOFSigmaAxis = 0.06f;\n\n float fTOFSigmaAlongZAxis = 0.015f;\n\n\n\n bool fVerbose = true; // if true prints extra information about reconstruction to cerr\n\n bool fSystemMatrixSaveFull = true; // if true generate and save full system matrix, if not only 1/8 of it and then converts to full\n\n int fReconstructionIterations = 10; // number of iterations in reconstruction\n","file_path":"ImageReconstruction/MLEMRunner.h","rank":28,"score":15.891667004458919},{"content":"# Physics stream parameters description\n\n\n\n## Contents\n\nDescription of available parameters in Physics example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\n\n\n\n- `Save_Control_Histograms_bool` \n\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\n\n\n\n- `TimeWindowCreator_MainStrip_int` \n\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\n\n\n\n- `TimeWindowCreator_MinTime_float` \n\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\n\n\n\n- `TimeWindowCreator_MaxTime_float` \n\ndefault value `0.0 ps`\n\n\n\n- `TimeCalibLoader_ConfigFile_std::string` \n\nname of ASCII file of required structure, containing time calibrations, specific for each run\n\n\n\n- `SignalFinder_EdgeMaxTime_float` \n\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\n\n\n\n- `SignalFinder_LeadTrailMaxTime_float` \n\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\n\n\n\n- `HitFinder_VelocityFile_std::string` \n\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\n\n\n\n- `HitFinder_ABTimeDiff_float` \n\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\n\n\n\n- `HitFinder_RefDetScinID_int` \n","file_path":"PhysicAnalysis/PARAMETERS.md","rank":29,"score":15.862252954976382},{"content":"# Cosmics stream - data selection of cosmic radiation events parameters\n\n\n\n## Contents\n\nDescription of available parameters in CosmicAnalysis example.\n\nNote that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\n\n\n\n- `Save_Control_Histograms_bool` \n\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\n\n\n\n- `TimeWindowCreator_MainStrip_int` \n\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\n\n\n\n- `TimeWindowCreator_MinTime_float` \n\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\n\n\n\n- `TimeWindowCreator_MaxTime_float` \n\ndefault value `0.0 ps`\n\n\n\n- `TimeCalibLoader_ConfigFile_std::string` \n\nname of ASCII file of required structure, containing time calibrations, specific for each run\n\n\n\n- `SignalFinder_EdgeMaxTime_float` \n\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\n\n\n\n- `SignalFinder_LeadTrailMaxTime_float` \n\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\n\n\n\n- `HitFinder_VelocityFile_std::string` \n\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\n\n\n\n- `HitFinder_ABTimeDiff_float` \n\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\n\n\n\n- `HitFinder_RefDetScinID_int` \n","file_path":"CosmicAnalysis/PARAMETERS.md","rank":30,"score":15.745731457498097},{"content":"#include \"JPetLoggerInclude.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(SignalFinderTestSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(getSigChByPM_nullPointer_test)\n\n{\n\n auto results = SignalFinderTools::getSigChByPM(nullptr, false, -1);\n\n BOOST_REQUIRE(results.empty());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(getSigChByPM_Test) {\n\n JPetPM pm1(1, \"first\");\n\n JPetSigCh sigChA1(JPetSigCh::Leading, 10.0);\n\n JPetSigCh sigChA2(JPetSigCh::Leading, 11.0);\n\n JPetSigCh sigChA3(JPetSigCh::Leading, 12.5);\n\n sigChA1.setPM(pm1);\n\n sigChA2.setPM(pm1);\n\n sigChA3.setPM(pm1);\n\n sigChA1.setRecoFlag(JPetSigCh::Good);\n\n sigChA2.setRecoFlag(JPetSigCh::Good);\n","file_path":"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp","rank":31,"score":15.669096718678173},{"content":"--- Default value 0.0 ps\n\n\n\nSignalFinder_EdgeMaxTime_float\n\n--- time window for matching Signal Channels on Leading Edge.\n\n--- Default value: 5 000 ps.\n\n\n\nSignalFinder_LeadTrailMaxTime_float\n\n--- time window for matching Signal Channels on the same thresholds from\n\nLeading and Trailing edge. Default value: 25 000 ps.\n\n\n\nSignalFinder_UseCorruptedSigCh_bool\n\n--- Indication if Signal Finder module should use signal channels flagged as Corrupted in the previous task.\n\nDefault value: false\n\n\n\nHitFinder_VelocityFile_std::string\n\n--- name of ASCII file of required format, containing values of effective velocities\n\nof light in each scintillator.\n\n\n\nHitFinder_ABTimeDiff_float\n\n--- time window for matching Signals on the same scintillator and different sides\n\n--- Default value: 6 000 ps.\n\n\n\nHitFinder_RefDetScinID_int\n\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\n\n--- The only value used so far: -1\n\n\n\nHitFinder_UseCorruptedSignals_bool\n\n--- Indication if Hit Finder module should use signals flagged as Corrupted in the previous task.\n\n--- Default value: `false`\n\n\n\nPALSCalibrationTask_Anni_TOT_Cut_Min_float\n\n--- minimal TOT for the hit that come from the annihilation of the positron-electron\n\n--- Default value: 23 000 ps\n\n\n\nPALSCalibrationTask_Anni_TOT_Cut_Max_float\n\n--- maximal TOT for the hit that come from the annihilation of the positron-electron\n\n--- Default value: 30 000 ps\n\n\n\nPALSCalibrationTask_Deex_TOT_Cut_Min_float\n\n--- minimal TOT for the hit that come from the deexcitation of the source\n\n--- Default value: 35 000 ps\n\n\n\nPALSCalibrationTask_Deex_TOT_Cut_Max_float\n\n--- maximal TOT for the hit that come from the deexcitation of the source\n\n--- Default value: 35 000 ps\n\n\n\nPALSCalibrationTask_ZpositionCut_float\n\n--- maximal Z position accepted for a hit\n\n--- Default value: 23 cm\n\n\n\nPALSCalibrationTask_EffectiveLength_float\n\n--- effective length assumed for a first threshold\n","file_path":"TimeCalibration_lifetime/PARAMETERS.md","rank":32,"score":15.569662733507785},{"content":"BOOST_AUTO_TEST_CASE(test_angle_middle)\n\n{\n\n const float EPSILON = 0.01f;\n\n const float r = 10;\n\n const float maxDistance = 20.f;\n\n const float accuracy = 0.1f;\n\n\n\n for (int i = 0; i < 360; i++)\n\n {\n\n const float x1 = r * std::cos((i) * (M_PI / 180.f));\n\n const float y1 = r * std::sin((i) * (M_PI / 180.f));\n\n const float x2 = r * std::cos((i + 180) * (M_PI / 180.f));\n\n const float y2 = r * std::sin((i + 180) * (M_PI / 180.f));\n\n const auto result =\n\n SinogramCreatorTools::getSinogramRepresentation(x1, y1, x2, y2, maxDistance, accuracy, std::ceil(maxDistance * 2.f * (1.f / accuracy)), 180);\n\n int resultAngle = i < 90 ? 90 + i : i < 180 ? i - 90 : i < 270 ? i - 90 : i - 270;\n\n BOOST_REQUIRE_EQUAL(result.second, resultAngle);\n\n const float distanceResult = SinogramCreatorTools::roundToNearesMultiplicity(maxDistance, accuracy);\n\n BOOST_REQUIRE_CLOSE(result.first, distanceResult, EPSILON);\n\n }\n","file_path":"ImageReconstruction/SinogramCreatorToolsTest.cpp","rank":34,"score":15.532147583678151},{"content":"#include \"JPetLoggerInclude.h\"\n\n\n\n/**\n\n * Method returns a patameter for given TOMB channel\n\n */\n\ndouble UniversalFileLoader::getConfigurationParameter(\n\n const TOMBChToParameter& confParameters,\n\n const unsigned int channel)\n\n{\n\n if (confParameters.find(channel) == confParameters.end()) {\n\n DEBUG(\"No parameter available for the channel\" + std::to_string(channel));\n\n return 0.0;\n\n } else {\n\n return confParameters.at(channel)[0];\n\n }\n\n}\n\n\n\n/**\n\n * Method loading parameters from ASCII file\n\n * Arguments: file name string, TOMBChMap object containing the dependency\n","file_path":"LargeBarrelAnalysis/UniversalFileLoader.cpp","rank":35,"score":15.401899210684807},{"content":"\n\n BOOST_REQUIRE_EQUAL(result1.size(), 2);\n\n BOOST_REQUIRE_EQUAL(result2.size(), 1);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(createHit_test)\n\n{\n\n JPetLayer layer1(1, true, \"layer1\", 10.0);\n\n JPetBarrelSlot slot1(2, true, \"barel1\", 30.0, 23);\n\n slot1.setLayer(layer1);\n\n\n\n JPetScin scin1(1);\n\n scin1.setBarrelSlot(slot1);\n\n\n\n JPetPM pmA(11, \"first\"), pmB(22, \"second\");\n\n pmA.setScin(scin1);\n\n pmB.setScin(scin1);\n\n pmA.setBarrelSlot(slot1);\n\n pmB.setBarrelSlot(slot1);\n\n pmA.setSide(JPetPM::SideA);\n","file_path":"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp","rank":36,"score":15.05575782067111},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\n\n#include <boost/test/unit_test.hpp>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <utility>\n\n#include <vector>\n\n\n\n#include \"JPetCommonTools/JPetCommonTools.h\"\n\n#include \"./JPetFilterCosine.h\"\n\n#include \"./JPetFilterHamming.h\"\n\n#include \"./JPetFilterNone.h\"\n\n#include \"./JPetFilterRamLak.h\"\n\n#include \"./JPetFilterRidgelet.h\"\n\n#include \"./JPetFilterSheppLogan.h\"\n\n#include \"./JPetRecoImageTools.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(rescale_0)\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp","rank":37,"score":14.950708237928836},{"content":" in >> height;\n\n int val;\n\n in >> val; // skip max val\n\n JPetRecoImageTools::Matrix2DProj sinogram(height, std::vector<double>(width));\n\n for (unsigned int i = 0; i < height; i++) {\n\n for (unsigned int j = 0; j < width; j++) {\n\n in >> val;\n\n sinogram[i][j] = val;\n\n }\n\n }\n\n return sinogram;\n\n}\n\n\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(backProjectSinogramNone)\n\n{\n\n const auto outFile = \"backprojectSinogramNone.ppm\";\n\n\n\n JPetRecoImageTools::Matrix2DProj sinogram = readFile(inFile);\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoTest.cpp","rank":38,"score":14.889937444152798},{"content":"--- Default value: 300000000.\n\n\n\nTimeCalibration_LoadConstants_bool\n\n---The flag indicating if the temporary calibration constants should be loaded after each iteration of the calibration.\n\nUse it only if You disable the calibration loading module (by default it is off), by default it is set to \"true\"\n\nsince this is much faster than the full analysis done starting from unpacker stage. If You really want to use corrections\n\nat that level first uncomment in main.cpp the CalibLoader module and change TimeCalibration_LoadConstants_bool to false.\n\n--- Default value: true\n\n\n\nTimeCalibration_OutputFileTmp_std::string\n\n---The file which is used to store the temporary calibration constants after each iteration.\n\n--- Default value: TimeConstantsCalibTmp.txt\n\n\n\nTimeCalibration_OutputFileFinal_std::string\n\n---The final output file with calibration constants\n\n--- Default value: TimeConstantsCalib.txt\n\n\n\nTimeCalibration_NiterMax_int\n\n--- The user defined number of iterations of calibration. Use it with option \"StopIteration_bool\" set to false and with\n\nmanager.useTask(\"TimeCalibration\", \"hits\", \"calib\",-1) in the main.cpp\n\n--- Default value: 1\n","file_path":"TimeCalibration_iter/PARAMETERS.md","rank":39,"score":14.870611137440049},{"content":" //take slot number for the hit\n\n int slot_number = hit.getBarrelSlot().getID();\n\n int layer_number = hit.getBarrelSlot().getLayer().getID();\n\n int slot_nr;\n\n\n\n if (layer_number == 1) slot_nr = slot_number;\n\n if (layer_number == 2) slot_nr = slot_number - 48;\n\n if (layer_number == 3) slot_nr = slot_number - 96;\n\n\n\n double thr_time_diff_t_A[5], thr_time_diff_A[5];\n\n double thr_time_diff_t_B[5], thr_time_diff_B[5];\n\n double lead_times_first_A, lead_times_first_B;\n\n double trail_times_first_A, trail_times_first_B;\n\n\n\n // leading edge\n\n\n\n // A\n\n for (auto& thr_time_pair : lead_times_A) {\n\n \n\n int thr = thr_time_pair.first;\n","file_path":"InterThresholdCalibration/InterThresholdCalibration.cpp","rank":40,"score":14.748995863703433},{"content":" std::vector <JPetHit> histCalib;\n\n std::vector <double> refTimesL;\n\n std::vector <double> refTimesT;\n\n\n\n if (auto timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\n\n auto n = timeWindow->getNumberOfEvents();\n\n for (auto i = 0u; i < n; ++i) {\n\n const JPetHit& hit = dynamic_cast<const JPetHit&>(timeWindow->operator[](i));\n\n int PMid = hit.getSignalB().getRecoSignal().getRawSignal().getPM().getID();\n\n if (PMid == kPMIdRef) {\n\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n //\n\n for (auto& thr_time_pair : lead_times_B) {\n\n int thr = thr_time_pair.first;\n\n RefTimeLead[thr] = thr_time_pair.second;\n\n\n\n }\n\n for (auto& thr_time_pair : trail_times_B) {\n\n int thr = thr_time_pair.first;\n","file_path":"TimeCalibration_iter/TimeCalibration.cpp","rank":41,"score":14.668530202343074},{"content":" auto trail_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n\n\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n//\n\n//-----------TOT calculation for the slot hit\n\n float TOT_A = 0.;\n\n float TOT_B = 0.;\n\n double timeDiffTmin = 0;\n\n double timeDiffLmin = 0;\n\n //\n\n\n\n //**\tint StripToCalibTemp = hit.getScintillator().getID();\n\n //**\tint LayerToCalibTemp = hit.getBarrelSlot().getLayer().getID();\n\n //\n\n for (auto& thr_time_pair : lead_times_A) {\n\n int thr = thr_time_pair.first;\n\n\n\n if (trail_times_A.count(thr) > 0 ) {\n\n TOT_A = TOT_A + trail_times_A[thr] - lead_times_A[thr];\n","file_path":"TimeCalibration/TimeCalibration.cpp","rank":42,"score":14.505673206255912},{"content":"BOOST_AUTO_TEST_CASE(generateConfigurationParameters_empty) {\n\n std::vector<ConfRecord> records;\n\n std::map<std::tuple<int, int, JPetPM::Side, int>, int> tombMap;\n\n auto configuration =\n\n UniversalFileLoader::generateConfigurationParameters(records, tombMap);\n\n BOOST_REQUIRE(configuration.empty());\n\n}\n\n\n\nBOOST_FIXTURE_TEST_CASE(generateConfigurationParameters, myFixtures) {\n\n auto epsilon = 0.0001;\n\n auto configuration = UniversalFileLoader::generateConfigurationParameters(\n\n fCorrectRecords, fCorrectTombMap);\n\n BOOST_REQUIRE_EQUAL(configuration.size(), 3);\n\n BOOST_REQUIRE_EQUAL(configuration.count(22), 1);\n\n BOOST_REQUIRE_EQUAL(configuration.count(13), 1);\n\n BOOST_REQUIRE_EQUAL(configuration.count(73), 1);\n\n BOOST_REQUIRE_CLOSE(configuration.at(22).at(0), 7, epsilon);\n\n BOOST_REQUIRE_CLOSE(configuration.at(13).at(0), 5, epsilon);\n\n BOOST_REQUIRE_CLOSE(configuration.at(73).at(0), -3, epsilon);\n\n}\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"LargeBarrelAnalysis/tests/UniversalFileLoaderTest.cpp","rank":43,"score":14.499584647583427},{"content":" BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.01f, 0.01f), 1u);\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.02f, 0.01f), 2u);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(test_angle_middle) {\n\n const float EPSILON = 0.01f;\n\n const float r = 10;\n\n const float maxDistance = 20.f;\n\n const float accuracy = 0.1f;\n\n \n\n float distanceSign = 1;\n\n\n\n for (int i = 0; i < 360; i++) {\n\n const float angle1 = (i + 45) * 0.0174532925;\n\n const float angle2 = (i + 135) * 0.0174532925;\n\n const float x1 = r * std::cos(angle1);\n\n const float y1 = r * std::sin(angle1);\n\n const float x2 = r * std::cos(angle2);\n","file_path":"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp","rank":44,"score":14.474039325348091},{"content":" if (signal1.getPM().getSide() == JPetPM::SideA) {\n\n signalA = signal1;\n\n signalB = signal2;\n\n } else {\n\n signalA = signal2;\n\n signalB = signal1;\n\n }\n\n auto radius = signalA.getPM().getBarrelSlot().getLayer().getRadius();\n\n auto theta = TMath::DegToRad() * signalA.getPM().getBarrelSlot().getTheta();\n\n auto velocity = UniversalFileLoader::getConfigurationParameter(\n\n velocitiesMap, getProperChannel(signalA)\n\n );\n\n checkTheta(theta);\n\n\n\n JPetHit hit;\n\n hit.setSignalA(signalA);\n\n hit.setSignalB(signalB);\n\n hit.setTime((signalA.getTime() + signalB.getTime()) / 2.0);\n\n hit.setQualityOfTime(-1.0);\n\n hit.setTimeDiff(signalB.getTime() - signalA.getTime());\n","file_path":"LargeBarrelAnalysis/HitFinderTools.cpp","rank":45,"score":14.424227693923761},{"content":" BOOST_REQUIRE_EQUAL(results1[234].size(), 3);\n\n BOOST_REQUIRE_EQUAL(results2[234].size(), 3);\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(buildRawSignals_empty)\n\n{\n\n JPetStatistics stats;\n\n std::vector<JPetSigCh> sigChByPM;\n\n auto results = SignalFinderTools::buildRawSignals(\n\n sigChByPM, 5.0, 5.0, stats, false\n\n );\n\n BOOST_REQUIRE(results.empty());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(buildRawSignals_one_signal) {\n\n JPetStatistics stats;\n\n JPetBarrelSlot bs1(1, true, \"some_slot\", 57.7, 123);\n\n JPetPM pm1(1, \"first\");\n\n pm1.setBarrelSlot(bs1);\n\n JPetSigCh sigCh1(JPetSigCh::Leading, 10);\n","file_path":"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp","rank":46,"score":14.377741937844704},{"content":" map<unsigned int, vector<double>>& thresholdsMap,\n\n JPetSigCh::EdgeType edge, bool setTHRValuesFromChannels\n\n) {\n\n JPetSigCh sigCh;\n\n sigCh.setValue(1000.*(tdcChannelTime\n\n + UniversalFileLoader::getConfigurationParameter(timeCalibrationMap, channel.getChannel())\n\n ));\n\n sigCh.setType(edge);\n\n sigCh.setTOMBChannel(channel);\n\n sigCh.setPM(channel.getPM());\n\n sigCh.setFEB(channel.getFEB());\n\n sigCh.setTRB(channel.getTRB());\n\n sigCh.setDAQch(channel.getChannel());\n\n sigCh.setThresholdNumber(channel.getLocalChannelNumber());\n\n if(setTHRValuesFromChannels) {\n\n sigCh.setThreshold(channel.getThreshold());\n\n } else {\n\n sigCh.setThreshold(\n\n UniversalFileLoader::getConfigurationParameter(thresholdsMap, channel.getChannel())\n\n );\n\n }\n\n return sigCh;\n\n}\n","file_path":"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp","rank":47,"score":14.321017928654936},{"content":"\n\nBOOST_AUTO_TEST_CASE(matchAllSignals_test_refDetID)\n\n{\n\n JPetBarrelSlot slot(1, true, \"one\", 15.0, 1);\n\n JPetBarrelSlot refSlot(193, true, \"refDet\", 15.0, 1);\n\n JPetPM pm(11, \"first\");\n\n JPetPM refPM(385, \"reference\");\n\n pm.setBarrelSlot(slot);\n\n refPM.setBarrelSlot(refSlot);\n\n JPetPhysSignal physSig1, physSig2, physSig3;\n\n physSig1.setBarrelSlot(slot);\n\n physSig2.setBarrelSlot(refSlot);\n\n physSig3.setBarrelSlot(refSlot);\n\n physSig1.setPM(pm);\n\n physSig2.setPM(refPM);\n\n physSig3.setPM(refPM);\n\n physSig1.setTime(1.0);\n\n physSig2.setTime(2.0);\n\n physSig3.setTime(3.0);\n\n std::vector<JPetPhysSignal> slotSignals;\n","file_path":"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp","rank":48,"score":14.307804276716565},{"content":" for (int x = 0; x < imageSize; x++)\n\n {\n\n for (int y = 0; y < imageSize; y++) { reconstructedProjection(y, x) *= M_PI / 360.; }\n\n }\n\n rescaleFunc(reconstructedProjection, rescaleMinCutoff, rescaleFactor);\n\n return reconstructedProjection;\n\n}\n\n\n\nJPetSinogramType::SparseMatrix JPetRecoImageTools::backProjectMatlab(const JPetSinogramType::Matrix3D& sinogram, float sinogramAccuracy, float tofWindow,\n\n float lorTOFSigma, FilteredBackProjectionWeightingFunction fbpwf, RescaleFunc rescaleFunc,\n\n int rescaleMinCutoff, int rescaleFactor)\n\n{\n\n if (sinogram.size() == 0)\n\n return JPetSinogramType::SparseMatrix(0, 0);\n\n const auto sinogramBegin = sinogram.cbegin();\n\n const int projectionLenght = sinogramBegin->second.size1();\n\n const int projectionAngles = sinogramBegin->second.size2();\n\n const double angleStep = M_PI / (double)projectionAngles;\n\n\n\n const int N = 2 * std::floor((double)projectionLenght / (2. * std::sqrt(2)));\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageTools.cpp","rank":49,"score":14.284457795598964},{"content":" if(rawSignal.getRecoFlag()==JPetBaseSignal::Good){\n\n getStatistics().fillHistogram(\"good_vs_bad_signals\", 1);\n\n for(unsigned int i=0;i<leads.size();i++){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_good\", 2*i+1);\n\n }\n\n for(unsigned int i=0;i<trails.size();i++){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_good\", 2*(i+1));\n\n }\n\n } else if(rawSignal.getRecoFlag()==JPetBaseSignal::Corrupted){\n\n\t //\n\n\t int PMid = leads.at(0).getPM().getID();\n\n\t \n\n\t getStatistics().fillHistogram(\"PmIdCorrupted\", PMid);\n\n getStatistics().fillHistogram(\"good_vs_bad_signals\", 2);\n\n for(unsigned int i=0;i<leads.size();i++){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr\", 2*i+1);\n\n if(leads.at(i).getRecoFlag()==JPetSigCh::Good){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr_sigch_good\", 2*i+1);\n\n } else if(leads.at(i).getRecoFlag()==JPetSigCh::Corrupted){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr_sigch_corr\", 2*i+1);\n","file_path":"LargeBarrelAnalysis/SignalTransformer.cpp","rank":50,"score":14.277748136198081},{"content":" int layer = -1;\n\n int slot = -1;\n\n char side = 'A';\n\n int thr = -1;\n\n vector<double> inputParameters = {0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0};\n\n istringstream stream(input);\n\n stream >> layer >> slot >> side >> thr\n\n >> inputParameters.at(0) >> inputParameters.at(1) >> inputParameters.at(2)\n\n >> inputParameters.at(3) >> inputParameters.at(4) >> inputParameters.at(5)\n\n >> inputParameters.at(6) >> inputParameters.at(7);\n\n if (stream.fail() || (side != 'A' && side != 'B')) return false;\n\n else {\n\n outRecord.layer = layer;\n\n outRecord.slot = slot;\n\n if (side == 'A') outRecord.side = JPetPM::SideA;\n\n else outRecord.side = JPetPM::SideB;\n\n outRecord.thresholdNumber = thr;\n\n outRecord.parameters = inputParameters;\n\n return true;\n\n }\n\n}\n","file_path":"LargeBarrelAnalysis/UniversalFileLoader.cpp","rank":51,"score":14.275677279217163},{"content":" getStatistics().createHistogram(new TH1D(\"annihilation_point_z\",\n\n \"Annihilation point Z\",\n\n fZRange, -fZRange, fZRange));\n\n\n\n getStatistics().createHistogram(new TH1D(\"annihilation_point_z_cutted\",\n\n \"Annihilation point Z\",\n\n fZRange, -fZRange, fZRange));\n\n\n\n return true;\n\n}\n\n\n\nbool ImageReco::exec()\n\n{\n\n if (const auto &timeWindow = dynamic_cast<const JPetTimeWindow *const>(fEvent))\n\n {\n\n unsigned int numberOfEventsInTimeWindow = timeWindow->getNumberOfEvents();\n\n for (unsigned int i = 0; i < numberOfEventsInTimeWindow; i++)\n\n {\n\n auto event = dynamic_cast<const JPetEvent &>(timeWindow->operator[](static_cast<int>(i)));\n\n auto numberOfHits = event.getHits().size();\n","file_path":"ImageReconstruction/ImageReco.cpp","rank":52,"score":14.136689056779321},{"content":" if (trailTime > maxTime || trailTime < minTime ) { continue; }\n\n auto trailSigCh = generateSigCh(\n\n trailTime, tombChannel, timeCalibrationMap, thresholdsMap,\n\n JPetSigCh::Trailing, setTHRValuesFromChannels\n\n );\n\n allTDCSigChs.push_back(trailSigCh);\n\n if (saveHistos){\n\n stats.fillHistogram(Form(\"pm_occupation_thr%d\", tombChannel.getLocalChannelNumber()),\n\n tombChannel.getPM().getID());\n\n }\n\n }\n\n return allTDCSigChs;\n\n}\n\n\n\n/**\n\n * Method for investigation of repetated edges - setting RecoFlag for each SigCh.\n\n * SigChs are flagged as GOOD if they appear in the sequence LTLTLTLT ->\n\n * in other words, each found LT pair is marked as GOOD. If sequence of one type of\n\n * the edge is encountered, repeated ones are flagged CORRUPTED. Examples:\n\n * edge type -> LTLTLT LLT LLTT LLLLTTTT LLTTLTLTTTLLLLTT\n","file_path":"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp","rank":53,"score":14.117021650393113},{"content":" 4, cos, sin, imageSize, center, length, matrixGet),\n\n 15, epsilon); // 5 + 4 + 3 + 2 + 1\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(projection4)\n\n{\n\n double epsilon = 0.00001;\n\n JPetRecoImageTools::Matrix2D matrix = {\n\n {1, 10, 100, 1000, 10000, 100000, 1000000},\n\n {2, 20, 200, 2000, 20000, 200000, 2000000},\n\n {3, 30, 300, 3000, 30000, 300000, 3000000},\n\n {4, 40, 400, 4000, 40000, 400000, 4000000},\n\n {5, 50, 500, 5000, 50000, 500000, 5000000},\n\n {6, 60, 600, 6000, 60000, 600000, 6000000},\n\n {7, 70, 700, 7000, 70000, 700000, 7000000}\n\n };\n\n int imageSize = matrix.size();\n\n double center = (float)(imageSize - 1) / 2.0;\n\n double length = center * center;\n\n std::function< double(int, int) > matrixGet;\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp","rank":54,"score":14.0667316648606},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE SinogramCreatorTest\n\n#include <boost/test/unit_test.hpp>\n\n\n\n#include \"../SinogramCreatorTools.h\"\n\n#include <iostream>\n\n\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(roundToNearesMultiplicity_test) {\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.0f, 1.f), 0u);\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.4f, 1.f), 0u);\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.5f, 1.f), 1u);\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(30.f, 1.f), 30u);\n\n BOOST_REQUIRE_EQUAL(\n\n SinogramCreatorTools::roundToNearesMultiplicity(0.00f, 0.01f), 0u);\n","file_path":"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp","rank":55,"score":14.06310799028819},{"content":"//nevertheless it's needed for checking if the structure of project is correct\n\n#define override\n\n#endif\n\n\n\n#include \"JPetUserTask/JPetUserTask.h\"\n\n#include <memory>\n\n\n\n/**\n\n * @brief Image reconstruction module which should be used for quick, rough data tests.\n\n *\n\n * It implements a simple image reconstruction algorithm adapted from G. Korcyl's code.\n\n * It is equivalent to one back-projection without any filtering but including TOF information,\n\n * with the assumption that TOF error = 0. Before reconstructruction, the data are not preselected\n\n * it should be preselected using FilterEvents Task.\n\n * The point of annihilation is reconstructed for all combination of registered hits in given events.\n\n * Additional optional options:\n\n * - ImageReco_Annihilation_Point_Z_float\n\n * - ImageReco_Xrange_On_3D_Histogram_int\n\n * - ImageReco_Yrange_On_3D_Histogram_int\n\n * - ImageReco_Zrange_On_3D_Histogram_int\n\n * - ImageReco_Bin_Multiplier_double\n\n */\n","file_path":"ImageReconstruction/ImageReco.h","rank":56,"score":13.999653401099762},{"content":" getStatistics().getObject<TH1I>(\"number_of_hits_filtered_by_condition\")->Fill(\"Cut on delta angle\", 1);\n\n getStatistics().getObject<TH1I>(\"number_of_hits_filtered_by_condition\")->Fill(\"Cut on first hit TOT\", 1);\n\n getStatistics().getObject<TH1I>(\"number_of_hits_filtered_by_condition\")->Fill(\"Cut on second hit TOT\", 1);\n\n getStatistics().getObject<TH1I>(\"number_of_hits_filtered_by_condition\")->Fill(\"Cut on annihilation point Z\", 1);\n\n\n\n return true;\n\n}\n\n\n\nbool FilterEvents::exec()\n\n{\n\n if (const auto& timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\n\n unsigned int numberOfEventsInTimeWindow = timeWindow->getNumberOfEvents();\n\n for (unsigned int i = 0; i < numberOfEventsInTimeWindow; i++) {\n\n auto event = dynamic_cast<const JPetEvent&>(timeWindow->operator[](static_cast<int>(i)));\n\n auto numberOfHits = event.getHits().size();\n\n if (numberOfHits <= 1)\n\n continue;\n\n else {\n\n auto hits = event.getHits();\n\n for (unsigned int i = 0; i < hits.size() - 1; i++) {\n","file_path":"ImageReconstruction/FilterEvents.cpp","rank":57,"score":13.96828816992743},{"content":"\n\n\n\nJPetSinogramType::SparseMatrix JPetRecoImageTools::backProject(const JPetSinogramType::Matrix3D& sinogram, float sinogramAccuracy, float tofWindow,\n\n float lorTOFSigma, FilteredBackProjectionWeightingFunction fbpwf,\n\n RescaleFunc rescaleFunc, int rescaleMinCutoff, int rescaleFactor)\n\n{\n\n if (sinogram.size() == 0)\n\n return JPetSinogramType::SparseMatrix(0, 0);\n\n const auto sinogramBegin = sinogram.cbegin();\n\n int imageSize = sinogramBegin->second.size1();\n\n double center = (double)(imageSize - 1) / 2.0;\n\n double center2 = center * center;\n\n double angleStep = M_PI / (double)sinogramBegin->second.size2();\n\n\n\n JPetSinogramType::SparseMatrix reconstructedProjection(imageSize, imageSize);\n\n const double speed_of_light = 2.99792458 * sinogramAccuracy; // in reconstruction space, accuracy * ps/cm\n\n\n\n const int max_sigma_multi = 3;\n\n\n\n for (int angle = 0; angle < sinogramBegin->second.size2(); angle++)\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageTools.cpp","rank":58,"score":13.878744032409815},{"content":"\tbuf << strip << \"_\" << thresholdLabel;\n\n\tc->SaveAs( (buf.str() + \".png\").c_str() );\n\n\tstd::pair<double,double> resultOfFit = std::make_pair<double,double> ( (fit->GetParameter(1))*-0.2, (fit->GetParError(1))*-0.2 );\n\n\treturn resultOfFit;\n\n}\n\n\n\nbool ifScintillatorIsIn( std::vector<scintData>& data, int ID)\n\n{\n\n\tfor( auto scintillator : data )\n\n\t{\n\n\t\tif( ID == scintillator.ID )\n\n\t\t\treturn true;\n\n\t}\n\n\treturn false;\n\n}\n\n\n\nint findScintillatorIn( std::vector<scintData>& data, int ID)\n\n{\n\n\tfor( unsigned int i = 0; i < data.size(); i++ )\n\n\t{\n","file_path":"VelocityCalibration/estimateVelocity.cpp","rank":59,"score":13.846879208178517},{"content":"using namespace std;\n\nSDARecoDrawAllCharges::SDARecoDrawAllCharges(const char *name)\n\n : JPetUserTask(name) {}\n\nSDARecoDrawAllCharges::~SDARecoDrawAllCharges() {}\n\n\n\nbool SDARecoDrawAllCharges::init() {\n\n DEBUG(\"bool SDARecoDrawAllCharges::init\");\n\n const auto ¶mBank = getParamBank();\n\n fNumberOfPMTs = paramBank.getPMsSize();\n\n for (const auto &id_pm_pair : getParamBank().getPMs()) {\n\n fIDs.push_back(id_pm_pair.first);\n\n std::vector<double> k;\n\n fCharges[id_pm_pair.first] = k;\n\n }\n\n fOutputEvents = new JPetTimeWindow(\"JPetRecoSignal\");\n\n return true;\n\n}\n\n\n\nbool SDARecoDrawAllCharges::exec() {\n\n DEBUG(\"bool SDARecoDrawAllCharges::exec\");\n","file_path":"modules/SDA/JPetRecoDrawAllCharges/SDARecoDrawAllCharges.cpp","rank":60,"score":13.78209511238317},{"content":" const float y2 = r * std::sin(angle2);\n\n const auto result = SinogramCreatorTools::getSinogramRepresentation(\n\n x1, y1, x2, y2, maxDistance, accuracy,\n\n std::ceil(maxDistance * 2.f * (1.f / accuracy)), 180);\n\n int resultAngle =\n\n i < 90 ? 90 + i : i < 180 ? i - 90 : i < 270 ? i - 90 : i - 270;\n\n BOOST_REQUIRE_EQUAL(result.second, resultAngle);\n\n if(i > 0 && i <= 180)\n\n distanceSign = -1;\n\n else\n\n distanceSign = 1;\n\n const float distanceResult =\n\n SinogramCreatorTools::roundToNearesMultiplicity(maxDistance + distanceSign * (r / std::sqrt(2)), accuracy);\n\n \n\n\n\n BOOST_REQUIRE_CLOSE(result.first, distanceResult, EPSILON);\n\n }\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(test_lor_slice) {\n","file_path":"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp","rank":61,"score":13.76305430045695},{"content":" }\n\n }\n\n return true;\n\n}\n\n\n\nbool MLEMRunner::terminate()\n\n{\n\n INFO(\"Reconstructed \" + std::to_string(fReconstructedEvents) + \" events out of \" + std::to_string(fReconstructedEvents + fMissedEvents) +\n\n \" total(\" + std::to_string(fMissedEvents) + \" missed)\");\n\n runReconstruction();\n\n return true;\n\n}\n\n\n\nbool MLEMRunner::parseEvent(const JPetEvent& event)\n\n{\n\n const auto hits = event.getHits();\n\n if (hits.size() != 2) {\n\n return false;\n\n }\n\n const float x1 = hits[0].getPosX();\n","file_path":"ImageReconstruction/MLEMRunner.cpp","rank":62,"score":13.730287804673775},{"content":"}\n\n\n\nbool TimeCalibration::terminate()\n\n{\n\n fitAndSaveParametersToFile(fTimeConstantsCalibFileName, fTimeConstantsCalibFileNameTmp);\n\n if (CheckIfExit(Niter)) {\n\n auto newOpts = getOptions();\n\n newOpts[\"StopIteration_bool\"] = true;\n\n fParams = JPetParams(newOpts, fParams.getParamManagerAsShared());\n\n}\n\n return true;\n\n}\n\nbool TimeCalibration::CheckIfExit(int Niter)\n\n{\n\n if(Niter>=NiterMax){\n\n return true;\n\n }\n\n else\n\n {\n\n return false; \n","file_path":"TimeCalibration_iter/TimeCalibration.cpp","rank":63,"score":13.71634225471987},{"content":" * \"MLEMRunner_PixelSize_double\" : size of single pixel (in meters: e.g: 0.004 means 1 px corresponds 4mm)\n\n * \"MLEMRunner_StartPixelForPartialMatrix_int\" : start pixel for system matrix\n\n * \"MLEMRunner_NumberOfEmissionsPerPixel_int\" : number of emmisions per pixel for system matrix\n\n * \"MLEMRunner_TOFStepSize_double\" : TOF step size\n\n * \"MLEMRunner_DisplayInfo_bool\" : if true prints extra information about reconstruction on terminal\n\n * \"MLEMRunner_SystemMatrixOutputPath_std::string\" : path where system matrix will be/is saved\n\n * \"MLEMRunner_SystemMatrixSaveFull_bool\" : if true full system matrix will be saved\n\n * \"MLEMRunner_ReconstructionOutputPath_std::string\" : path where reconstructed image will be saved\n\n * \"MLEMRunner_ReconstuctionIterations_int\" : number of iterations in reconstruction\n\n * \"MLEMRunner_TOFSigmaAlongZAxis_float\" : error of measurement of Z position along scintillator in meters\n\n * \"MLEMRunner_TOFSigmaAxis_float\" : error of measurement TOF along LOR (or TOR in case of 3D) in meters\n\n */\n\n\n","file_path":"ImageReconstruction/MLEMRunner.h","rank":64,"score":13.702346145944711},{"content":" auto opts = getOptions();\n\n if (isOptionSet(opts, kOutFileNameKey)) {\n\n fOutFileName = getOptionAsString(opts, kOutFileNameKey);\n\n }\n\n\n\n fOutputStream.open(fOutFileName, std::ofstream::out | std::ofstream::app);\n\n std::vector<float> radius;\n\n radius.reserve(3);\n\n std::vector<int> scintillators;\n\n scintillators.reserve(3);\n\n\n\n const std::vector<float> rotation{0.f, 0.5f, 0.5f}; // rotation for BigBarrel\n\n\n\n const JPetParamBank& bank = getParamBank();\n\n const JPetGeomMapping mapping(bank);\n\n for (unsigned int i = 1; i < mapping.getLayersCount(); i++) {\n\n radius.push_back(mapping.getRadiusOfLayer(i) * kCentimetersToMeters);\n\n scintillators.push_back(static_cast<int>(mapping.getSlotsCount(i)));\n\n }\n\n\n","file_path":"ImageReconstruction/MLEMRunner.cpp","rank":65,"score":13.67774957006402},{"content":" fHitsArray)); // create LORs from Hits from the same Time Window\n\n } else {\n\n return false;\n\n }\n\n return true;\n\n}\n\n\n\nbool SDAMatchLORs::terminate() {\n\n int fEventNb = fCurrentEventNumber;\n\n INFO(Form(\"Matching complete \\nAmount of LORs mathed: %d out of %d hits\",\n\n fMatched, fEventNb));\n\n double goodPercent = fMatched * 100.0 / fEventNb;\n\n INFO(Form(\"%f %% of data was matched \\n \", goodPercent));\n\n return true;\n\n}\n\n\n\nvector<JPetLOR> SDAMatchLORs::createLORs(vector<JPetHit> &hits) {\n\n vector<JPetLOR> lors;\n\n for (auto i = hits.begin(); i != hits.end(); ++i) {\n\n for (auto j = i + 1; j != hits.end(); ++j) {\n","file_path":"modules/SDA/JPetMatchLORs/SDAMatchLORs.cpp","rank":66,"score":13.628598460704149},{"content":" if (auto oldTimeWindow = dynamic_cast<const JPetTimeWindow *const>(fEvent)) {\n\n auto n = oldTimeWindow->getNumberOfEvents();\n\n for (uint i = 0; i < n; ++i) {\n\n auto signal =\n\n dynamic_cast<const JPetRecoSignal &>(oldTimeWindow->operator[](i));\n\n fCharges[signal.getPM().getID()].push_back(signal.getCharge());\n\n }\n\n } else {\n\n return false;\n\n }\n\n return true;\n\n}\n\n\n\nbool SDARecoDrawAllCharges::terminate() {\n\n DEBUG(\"bool SDARecoDrawAllCharges::terminate\");\n\n auto c1 = new TCanvas();\n\n // looking for max and min value for all offsets\n\n double maximum = -1.e20;\n\n double minimum = 1.e20;\n\n for (const auto &id_vec_pair : fCharges) {\n","file_path":"modules/SDA/JPetRecoDrawAllCharges/SDARecoDrawAllCharges.cpp","rank":67,"score":13.594304329573305},{"content":"Aim\n\n---\n\nThis is an example analysis producing J-PET time calibration using data taken with a reference detector with option of iterative calibration constants determination. \n\n\n\nInput Data\n\n-----------\n\nFor a single execution of the program, a HLD file should be used, recorded when a single scintillator strip of the J-PET barrel was targeted by the reference detector.\n\n\n\nExpected output\n\n---------------\n\nNo output to stdout.\n\nJPet.log file appears with the log of the processing and ROOT files with the following etensions are produced:\n\n *.tslot.raw.root\n\n *.raw.sig.root\n\n *.phys.sig.root\n\n *.hits.root\n\n *.calib.root\n\nwhere \"*\" stands for the name of the output file (constructed as LayerId_slotId_FileId, e.g. for the first file measured for first scintillator in the first layer: \"Layer1_slot01_1\")\n\n\n\nMoreover, a text file \"TimeConstantsCalib.txt\" is created in the working directory, which contains time calibration information.\n\nFor the iterative version we create also temporary file \"ScintId_LayerId_TimeConstantsCalibTmp.txt\" where we save calibration constants after each iteration\n\n(again for the first scintillator in the first layer the filename is 1_1_TimeConstantsCalibTmp.txt.)\n\n\n\nDescription\n\n--------------\n\nThe analysis is using the same set of tasks as the \"LargeBarrelAnalysis\" example up to the level of creation of hits (included). On top of these tasks, an additional module called\n\n\"TimeCalibration\" is run, which prepares spectra of time differences between signals on the left and fight side of a scintillator and determines the necessary shifts of\n\ntimes at respective TDC channels.\n\n\n\nAdditional info\n\n--------------\n\nIn order to speed up the processing of a single position from a reference detector scan, one can provide a user option indicating which scintillator strip was targeted by the reference detector.\n\nThis was, signals from any other strips will be ignored at the lowest possible level, resulting in much faster processing.\n\n\n\nThis user option is:\n","file_path":"TimeCalibration_iter/README.md","rank":68,"score":13.561762586339011},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE SinogramCreatorTest\n\n#include <boost/test/unit_test.hpp>\n\n\n\n#include \"SinogramCreatorTools.h\"\n\n#include <iostream>\n\n\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\n\n\nBOOST_AUTO_TEST_CASE(roundToNearesMultiplicity_test)\n\n{\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.0f, 1.f), 0u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.4f, 1.f), 0u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.5f, 1.f), 1u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(30.f, 1.f), 30u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.00f, 0.01f), 0u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.01f, 0.01f), 1u);\n\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.02f, 0.01f), 2u);\n\n}\n\n\n","file_path":"ImageReconstruction/SinogramCreatorToolsTest.cpp","rank":69,"score":13.549932336466233},{"content":" auto n_iterations = fReconstructionIterations;\n\n int start_iteration = 0;\n\n util::progress progress(fVerbose, n_iterations, 1, start_iteration);\n\n\n\n for (int block = 0; block < n_blocks; ++block) {\n\n for (int i = 0; i < n_iterations_in_block; i++) {\n\n const auto iteration = block * n_iterations_in_block + i;\n\n if (iteration < start_iteration)\n\n continue;\n\n progress(iteration);\n\n (*fReconstruction)();\n\n progress(iteration, true);\n\n }\n\n const auto iteration = (block + 1) * n_iterations_in_block;\n\n if (iteration <= start_iteration)\n\n continue;\n\n util::nrrd_writer nrrd(fReconstructionOutputPath + \"_\" + std::to_string(iteration) + \".nrrd\",\n\n fReconstructionOutputPath + \"_\" + std::to_string(iteration), false);\n\n nrrd << fReconstruction->rho;\n\n util::obstream bin(fReconstructionOutputPath + \"_\" + std::to_string(iteration));\n\n bin << fReconstruction->rho;\n\n }\n\n // final reconstruction statistics\n\n const auto st = fReconstruction->statistics();\n\n std::cerr << \" event count = \" << st.used_events << std::endl;\n\n std::cerr << \" voxel count = \" << st.used_voxels << \"(\" << (double)st.used_voxels / st.used_events << \" / event)\" << std::endl;\n\n std::cerr << \" pixel count = \" << st.used_pixels << \"(\" << (double)st.used_pixels / st.used_events << \" / event)\" << std::endl;\n\n}\n","file_path":"ImageReconstruction/MLEMRunner.cpp","rank":70,"score":13.499894100118915},{"content":" int PMid = hit.getSignalB().getRecoSignal().getRawSignal().getPM().getID();\n\n //\n\n //taking refference detector hits times (scin=193, Pmt=385)\n\n //\n\n\n\n if (PMid == kPMidRef) {\n\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n //\n\n for (auto& thr_time_pair : lead_times_B) {\n\n int thr = thr_time_pair.first;\n\n RefTimeLead[thr] = thr_time_pair.second;\n\n\n\n }\n\n\n\n for (auto& thr_time_pair : trail_times_B) {\n\n int thr = thr_time_pair.first;\n\n RefTimeTrail[thr] = thr_time_pair.second;\n\n }\n\n fRefTimesL.push_back(RefTimeLead[1]);\n","file_path":"TimeCalibration/TimeCalibration.cpp","rank":71,"score":13.497965049109517},{"content":" slotSignals.push_back(physSig2);\n\n slotSignals.push_back(physSig3);\n\n\n\n JPetStatistics stats;\n\n std::map<unsigned int, std::vector<double>> velocitiesMap;\n\n JPetCachedFunctionParams params(\"pol1\", {0.0, 10.0});\n\n ToTEnergyConverter conv(params, Range(10000, 0., 100.));\n\n\n\n auto result = HitFinderTools::matchSignals(\n\n slotSignals, velocitiesMap, 5.0, false, conv, stats, false\n\n );\n\n BOOST_REQUIRE(result.empty());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(matchSignals_test)\n\n{\n\n JPetLayer layer1(1, true, \"layer1\", 10.0);\n\n JPetBarrelSlot slot1(23, true, \"barel1\", 30.0, 23);\n\n slot1.setLayer(layer1);\n\n\n","file_path":"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp","rank":72,"score":13.406944163188179},{"content":" sigCh.setRecoFlag(JPetSigCh::Good);\n\n }\n\n\n\n if(!useCorrupts && sigCh.getRecoFlag() == JPetSigCh::Corrupted) { continue; }\n\n\n\n auto search = sigChsPMMap.find(pmtID);\n\n if (search == sigChsPMMap.end()) {\n\n vector<JPetSigCh> tmp;\n\n tmp.push_back(sigCh);\n\n sigChsPMMap.insert(pair<int, vector<JPetSigCh>>(pmtID, tmp));\n\n } else {\n\n search->second.push_back(sigCh);\n\n }\n\n }\n\n return sigChsPMMap;\n\n}\n\n\n\n/**\n\n * Method invoking Raw Signal building method for each PM separately\n\n */\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":73,"score":13.37446026478975},{"content":" map<int, vector<JPetPhysSignal>> signalsBySlot;\n\n for (auto const &signal : signals) {\n\n int barrelSlotID = signal.getRecoSignal().getBarrelSlot().getID();\n\n signalsBySlot[barrelSlotID].push_back(signal);\n\n }\n\n\n\n // discard entries for PMTs with smalller number of signals than two for each\n\n // barrel slot since they cannot be merged into JPetHit and later for JPetLOR\n\n for (auto it = signalsBySlot.begin(); it != signalsBySlot.end(); ++it) {\n\n if (it->second.size() < 2) {\n\n signalsBySlot.erase(it);\n\n }\n\n }\n\n\n\n // iterate over barrel slots which had a sufficient number\n\n // of signals to match a hit\n\n for (auto it = signalsBySlot.begin(); it != signalsBySlot.end(); ++it) {\n\n vector<JPetHit> hitsFromSingleSlot = matchHitsWithinSlot(it->second);\n\n // append the hits found for one specific barrel slot to all hits from this\n\n // time window\n","file_path":"modules/SDA/JPetMatchHits/SDAMatchHits.cpp","rank":74,"score":13.347729969200405},{"content":" getStatistics().getObject<TH1I>(\"number_of_events\")->Fill(numberOfHits);\n\n if (numberOfHits <= 1)\n\n continue;\n\n else\n\n {\n\n auto hits = event.getHits();\n\n for (unsigned int i = 0; i < hits.size() - 1; i++)\n\n {\n\n calculateAnnihilationPoint(hits[i], hits[i + 1]);\n\n }\n\n }\n\n }\n\n }\n\n else\n\n {\n\n ERROR(\"Returned event is not TimeWindow\");\n\n return false;\n\n }\n\n return true;\n\n}\n","file_path":"ImageReconstruction/ImageReco.cpp","rank":75,"score":13.301100990885233},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\n\n#include <boost/test/unit_test.hpp>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <utility>\n\n#include <vector>\n\n\n\n#include \"./JPetFilterCosine.h\"\n\n#include \"./JPetFilterHamming.h\"\n\n#include \"./JPetFilterNone.h\"\n\n#include \"./JPetFilterRamLak.h\"\n\n#include \"./JPetFilterRidgelet.h\"\n\n#include \"./JPetFilterSheppLogan.h\"\n\n#include \"./JPetRecoImageTools.h\"\n\n#include \"JPetCommonTools/JPetCommonTools.h\"\n\n\n\nconst auto inFile = \"unitTestData/JPetRecoImageToolsTest/sinogramBackproject.ppm\";\n\n\n\nint getMaxValue(const JPetRecoImageTools::Matrix2DProj& result)\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoSheppLoganThresholdsTest.cpp","rank":76,"score":13.270982547352563},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\n\n#include <boost/test/unit_test.hpp>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <utility>\n\n#include <vector>\n\n\n\n#include \"JPetCommonTools/JPetCommonTools.h\"\n\n#include \"./JPetFilterCosine.h\"\n\n#include \"./JPetFilterHamming.h\"\n\n#include \"./JPetFilterNone.h\"\n\n#include \"./JPetFilterRamLak.h\"\n\n#include \"./JPetFilterRidgelet.h\"\n\n#include \"./JPetFilterSheppLogan.h\"\n\n#include \"./JPetRecoImageTools.h\"\n\n\n\nconst auto inFile = \"unitTestData/JPetRecoImageToolsTest/sinogramBackproject.ppm\";\n\n\n\nint getMaxValue(const JPetRecoImageTools::Matrix2DProj& result)\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoTest.cpp","rank":77,"score":13.270982547352562},{"content":" If true generate full system matrix, not faster 1/8 of the system matrix and using symetries reconstruct full matrix\n\n\n\n- `MLEMRunner_ReconstructionOutputPath_std::string`\n\n Path to file where reconstruction will be saved\n\n\n\n- `MLEMRunner_ReconstuctionIterations_int`\n\n Number of MLEM iterations\n\n\n\n- `ImageReco_Annihilation_Point_Z_float`\n\n Maximum value of Z of reconstructed annihilation point to be included in reconstruction\n\n\n\n- `ImageReco_Xrange_On_3D_Histogram_int`\n\n Range of X axis on 3D Histogram\n\n\n\n- `ImageReco_Yrange_On_3D_Histogram_int`\n\n Range of Y axis on 3D Histogram\n\n\n\n- `ImageReco_Zrange_On_3D_Histogram_int`\n\n Range of Z axis on 3D Histogram\n\n\n\n- `ImageReco_Bin_Multiplier_double`\n\n Used to decrease size of bin, if bin multiplier is 1: 1 bin correspondes to 1 cm.\n\n\n\n- `SinogramCreator_OutFileName_std::string`\n\n Path to file where sinogram will be saved.\n\n\n\n- `SinogramCreator_ReconstructionDistanceAccuracy_float`\n\n Used to decrease size of bin, if reconstruction distance accuracy is 1: 1 bin correspondes to 1cm\n\n\n\n- `SinogramCreator_SinogramZSplitNumber_int`\n\n Number of sinograms along Z axis. Z axis is divided by this number and then evenly split.\n\n\n\n- `SinogramCreator_ScintillatorLenght_float`\n\n Lenght of the scintillator. [cm]\n\n\n\n- `SinogramCreatorMC_OutFileName_std::string`\n\n Path to file where sinogram will be saved.\n\n\n\n- `SinogramCreatorMC_ReconstructionDistanceAccuracy_float`\n\n Used to decrease size of bin, if reconstruction distance accuracy is 1: 1 bin correspondes to 1cm\n\n\n\n- `SinogramCreatorMC_SinogramZSplitNumber_int`\n\n Number of sinograms along Z axis. Z axis is divided by this number and then evenly split.\n\n\n\n- `SinogramCreatorMC_ScintillatorLenght_float`\n\n Lenght of the scintillator. [cm]\n\n\n\n- `SinogramCreatorMC_MaxReconstructionRadius_float`\n\n Maximal possible reconstruction radius. [cm]\n\n\n\n- `SinogramCreatorMC_InputDataPath_std::string`\n\n Path to file where input data is stored.\n","file_path":"ImageReconstruction/PARAMETERS.md","rank":78,"score":13.267429366375119},{"content":"--- Default value: 192\n\n\n\nNumber_of_points_to_filter_int\n\n--- Number of points that linear filter should work on. Filter is used to smooth derivatives and to estimate corrections better\n\n--- Default value: 6\n\n\n\nThreshold_for_derivative_int\n\n--- Value used for finding the first estimation of the extremum on the derivatives. If it is too high, Calibrate.exe would\n\nshow for many modules that the threshold is too high. If it is too low, extremum estimates will be wrongly estimated.\n\n--- Default value: 6\n\n\n\nEffective_Length_float\n\n--- Value of the effective length that are used to estimate velocity of every module. It can be changed and different PALS\n\ncorrections can be calculated. So, the effective length scan can be done from the EventFinder taks, speeding up the whole process\n\n\n\n-------------------------effLenParams.json-------------------------\n\n\n\nNumber_of_files_int\n\n--- Number of files that are used for the effective length scan. Every file should ocrrespond to different effective length value\n\nfor which calibration was done. It is used to scan the effLenParams.json file in order to find every file and length. \n\nIf the number will be equal to 3, EstimateEffectiveLength.exe will look for options:\n\nFile_1_std::string\n\nFile_2_std::string\n\nFile_3_std::string\n\nLength_1_float\n\nLength_2_float\n\nLength_3_float\n\nif it will be equal to 2:\n\nFile_1_std::string\n\nFile_2_std::string\n\nLength_1_float\n\nLength_2_float\n\nso the number of options are fluent and can change with different number of files\n\n\n\nFile_%d_std::string\n\n--- Path to and name of a `txt` file that contains corrections for a given effective length indicated by \n\nLength_%d_float option. %d should be equal to the number of a given file, for example: File_1_std::string\n\n\n\nLength_%d_float\n\n--- value of a effective length that was used during calibration. %d should be equal to the number of a given file\n","file_path":"TimeCalibration_lifetime/PARAMETERS.md","rank":79,"score":13.25426386114881},{"content":" std::map<int, double> leadingPoints, trailingPoints;\n\n leadingPoints = signal.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n trailingPoints = signal.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n for (int i = 1; i < 5; i++) {\n\n auto leadSearch = leadingPoints.find(i);\n\n auto trailSearch = trailingPoints.find(i);\n\n\n\n if (leadSearch != leadingPoints.end() && trailSearch != trailingPoints.end())\n\n tot += (trailSearch->second - leadSearch->second);\n\n }\n\n return tot / 1000.;\n\n}\n\n\n\nvoid FilterEvents::setUpOptions()\n\n{\n\n auto opts = getOptions();\n\n\n\n if (isOptionSet(opts, kCutOnZValueKey)) {\n\n fCutOnZValue = getOptionAsFloat(opts, kCutOnZValueKey);\n\n }\n","file_path":"ImageReconstruction/FilterEvents.cpp","rank":80,"score":13.248660836640846},{"content":" }\n\n }\n\n // Adding created Raw Signal to vector\n\n rawSigVec.push_back(rawSig);\n\n thrLeadingSigCh.at(0).erase(thrLeadingSigCh.at(0).begin());\n\n }\n\n // Filling control histograms\n\n if(saveHistos){\n\n for(unsigned int jj=0;jj<kNumberOfThresholds;jj++){\n\n for(auto sigCh : thrLeadingSigCh.at(jj)){\n\n stats.fillHistogram(\"unused_sigch_all\", 2*sigCh.getThresholdNumber()-1);\n\n if(sigCh.getRecoFlag()==JPetSigCh::Good){\n\n stats.fillHistogram(\"unused_sigch_good\", 2*sigCh.getThresholdNumber()-1);\n\n } else if(sigCh.getRecoFlag()==JPetSigCh::Corrupted){\n\n stats.fillHistogram(\"unused_sigch_corr\", 2*sigCh.getThresholdNumber()-1);\n\n }\n\n }\n\n for(auto sigCh : thrTrailingSigCh.at(jj)){\n\n stats.fillHistogram(\"unused_sigch_all\", 2*sigCh.getThresholdNumber());\n\n if(sigCh.getRecoFlag()==JPetSigCh::Good){\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":81,"score":13.248516387959569},{"content":" * between layer, barrel slot, PM side, threshold and TOMB channel number.\n\n */\n\nUniversalFileLoader::TOMBChToParameter UniversalFileLoader::loadConfigurationParameters(\n\n const std::string& confFile,\n\n const UniversalFileLoader::TOMBChMap& tombMap)\n\n{\n\n INFO(\"Loading parameters from file: \" + confFile);\n\n if (!boost::filesystem::exists(confFile)) {\n\n ERROR(\"Configuration file does not exist: \" + confFile + \" Returning empty configuration.\");\n\n TOMBChToParameter cofigurationParamteres;\n\n return cofigurationParamteres;\n\n }\n\n auto confRecords = readConfigurationParametersFromFile(confFile);\n\n return generateConfigurationParameters(confRecords, tombMap);\n\n}\n\n\n\n/**\n\n * Method generates a dependedce map between TOMB channel numbers and\n\n * configuration paramters. Arguments: vector of configuration records,\n\n * map of TOMBs with dependency between layer, barrel slot, PM side, threshold\n","file_path":"LargeBarrelAnalysis/UniversalFileLoader.cpp","rank":82,"score":13.143244579388517},{"content":" epsilon); // 3* 0.6 + 4 * 0.4\n\n auto getterT =\n\n JPetRecoImageTools::matrixGetterFactory(matrix, true); /// transposed\n\n /// first argument is j second i (j,i)\n\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(0, 0, getterT), 1, epsilon);\n\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(1, 0, getterT), 2, epsilon);\n\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(0, 0.6, getterT), 2.2,\n\n epsilon); // 1*0.4 + 3 *0.6\n\n}\n\n/*\n\nBOOST_AUTO_TEST_CASE(calculateProjection)\n\n{\n\n double epsilon = 0.00001;\n\n JPetRecoImageTools::Matrix2D matrix = {{4}};\n\n //static double calculateProjection(const Matrix2D& emissionMatrix,\n\n //double phi,\n\n //int scanNumber,\n\n //int nScans,\n\n //InterpolationFunc& interpolationFunction\n\n //);\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp","rank":83,"score":13.11012578417714},{"content":" if (trailingFoundIdices.size() == 0) { return -1; }\n\n sort(trailingFoundIdices.begin(), trailingFoundIdices.end());\n\n return trailingFoundIdices.at(0);\n\n}\n\n\n\n/**\n\n * Method finds a 4-element permutation which has to be applied to threshold numbers\n\n * to have them sorted by increasing threshold values.\n\n *\n\n * The ordering may be different for each PMT, therefore the method creates a map\n\n * with PMT ID numbers as keys and 4-element permutations as values.\n\n */\n\nSignalFinderTools::ThresholdOrderings SignalFinderTools::findThresholdOrders(const JPetParamBank& bank){\n\n\n\n ThresholdOrderings orderings;\n\n std::map<PMid, ThresholdValues> thr_values_per_pm;\n\n\n\n for(auto& tc: bank.getTOMBChannels()){\n\n PMid pm_id = tc.second->getPM().getID();\n\n\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":84,"score":12.988924568371967},{"content":" JPetEvent event3;\n\n event3.addHit(firstHit);\n\n event3.addHit(secondHit);\n\n event3.addHit(thirdHit);\n\n event3.addHit(fourthHit);\n\n\n\n JPetStatistics stats;\n\n BOOST_REQUIRE(!EventCategorizerTools::checkFor3Gamma(event0, stats, false));\n\n BOOST_REQUIRE(!EventCategorizerTools::checkFor3Gamma(event1, stats, false));\n\n BOOST_REQUIRE(EventCategorizerTools::checkFor3Gamma(event2, stats, false));\n\n BOOST_REQUIRE(EventCategorizerTools::checkFor3Gamma(event3, stats, false));\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(checkForPromptTest) {\n\n JPetBarrelSlot barrelSlot(666, true, \"Some Slot\", 66.0, 666);\n\n JPetPM pmA(1, \"A\");\n\n JPetPM pmB(2, \"B\");\n\n pmA.setSide(JPetPM::SideA);\n\n pmB.setSide(JPetPM::SideB);\n\n pmA.setBarrelSlot(barrelSlot);\n","file_path":"LargeBarrelAnalysis/tests/EventCategorizerToolsTest.cpp","rank":85,"score":12.976447481115112},{"content":"#include <TCanvas.h>\n\n#include <TFile.h>\n\n#include <TLegend.h>\n\n#include <TLine.h>\n\n#include <TUnixSystem.h>\n\n\n\nvoid JPetRecoSignalTools::saveBadSignalIntoRootFile(\n\n const JPetRecoSignal &signal, const int numberOfBadSignals,\n\n const std::string fileName) {\n\n TCanvas *c1 = new TCanvas();\n\n TGraph *badSignal = JPetRecoSignalTools::plotJPetRecoSignal(signal);\n\n badSignal->Draw(\"AP\");\n\n std::string title;\n\n std::stringstream ss;\n\n ss << numberOfBadSignals;\n\n std::string str = ss.str();\n\n ss.str(std::string());\n\n ss.clear();\n\n ss << signal.getPM().getID();\n\n std::string PMT = ss.str();\n","file_path":"modules/tools/JPetRecoSignalTools/JPetRecoSignalTools.cpp","rank":86,"score":12.968290378059923},{"content":" }\n\n return true;\n\n}\n\n\n\nbool SinogramCreator::analyzeHits(const JPetHit& firstHit, const JPetHit& secondHit)\n\n{\n\n return analyzeHits(firstHit.getPos(), firstHit.getTime(), secondHit.getPos(), secondHit.getTime());\n\n}\n\n\n\nbool SinogramCreator::analyzeHits(const float firstX, const float firstY, const float firstZ, const double firstTOF, const float secondX,\n\n const float secondY, const float secondZ, const double secondTOF)\n\n{\n\n int i = -1;\n\n if (!fEnableObliqueLORRemapping)\n\n {\n\n i = SinogramCreatorTools::getSplitRangeNumber(firstZ, secondZ, fZSplitRange);\n\n }\n\n else\n\n {\n\n i = SinogramCreatorTools::getSinogramSlice(firstX, firstY, firstZ, firstTOF, secondX, secondY, secondZ, secondTOF, fZSplitRange);\n","file_path":"ImageReconstruction/SinogramCreator.cpp","rank":87,"score":12.872541592803795},{"content":" bool convertToT, const ToTEnergyConverter& totConverter, JPetStatistics& stats,\n\n bool saveHistos\n\n) {\n\n vector<JPetHit> slotHits;\n\n vector<JPetPhysSignal> remainSignals;\n\n sortByTime(slotSignals);\n\n while (slotSignals.size() > 0) {\n\n auto physSig = slotSignals.at(0);\n\n if(slotSignals.size() == 1){\n\n remainSignals.push_back(physSig);\n\n break;\n\n }\n\n for (unsigned int j = 1; j < slotSignals.size(); j++) {\n\n if (slotSignals.at(j).getTime() - physSig.getTime() < timeDiffAB) {\n\n if (physSig.getPM().getSide() != slotSignals.at(j).getPM().getSide()) {\n\n auto hit = createHit(\n\n physSig, slotSignals.at(j), velocitiesMap,\n\n convertToT, totConverter, stats, saveHistos\n\n );\n\n slotHits.push_back(hit);\n","file_path":"LargeBarrelAnalysis/HitFinderTools.cpp","rank":88,"score":12.869554684497407},{"content":"vector<JPetRawSignal> SignalFinderTools::buildAllSignals(\n\n const map<int, vector<JPetSigCh>>& sigChByPM,\n\n double sigChEdgeMaxTime, double sigChLeadTrailMaxTime,\n\n JPetStatistics& stats, bool saveHistos,\n\n ThresholdOrderings thresholdOrderings\n\n) {\n\n vector<JPetRawSignal> allSignals;\n\n \n\n for (auto& sigChPair : sigChByPM) {\n\n Permutation P;\n\n if(thresholdOrderings.empty()){\n\n P = kIdentity;\n\n }else{\n\n P = thresholdOrderings.at(sigChPair.first);\n\n }\n\n\n\n auto signals = buildRawSignals(\n\n sigChPair.second, sigChEdgeMaxTime, sigChLeadTrailMaxTime, stats, saveHistos, P\n\n );\n\n allSignals.insert(allSignals.end(), signals.begin(), signals.end());\n","file_path":"LargeBarrelAnalysis/SignalFinderTools.cpp","rank":89,"score":12.841124653548093},{"content":" }\n\n }\n\n for(unsigned int i=0;i<trails.size();i++){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr\", 2*(i+1));\n\n if(trails.at(i).getRecoFlag()==JPetSigCh::Good){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr_sigch_good\", 2*(i+1));\n\n } else if(trails.at(i).getRecoFlag()==JPetSigCh::Corrupted){\n\n getStatistics().fillHistogram(\"raw_sigs_multi_corr_sigch_corr\", 2*(i+1));\n\n }\n\n }\n\n } else if(rawSignal.getRecoFlag()==JPetBaseSignal::Unknown){\n\n getStatistics().fillHistogram(\"good_vs_bad_signals\", 3);\n\n }\n\n }\n\n // Make Reco Signal from Raw Signal\n\n auto recoSignal = createRecoSignal(rawSignal);\n\n // Make Phys Signal from Reco Signal and save\n\n auto physSignal = createPhysSignal(recoSignal);\n\n fOutputEvents->add<JPetPhysSignal>(physSignal);\n\n }\n","file_path":"LargeBarrelAnalysis/SignalTransformer.cpp","rank":90,"score":12.826642499972085},{"content":"\n\n if (lead_times_A.count(thr) > 0 && trail_times_A.count(thr) > 0 && lead_times_A.size() == 4 && trail_times_A.size() == 4) { //exactly 4 thresholds\n\n\n\n lead_times_first_A = lead_times_A[1];\n\n\n\n if (thr >= 2) {\n\n\t\n\n thr_time_diff_A[thr] = lead_times_A[thr] / 1000 - lead_times_first_A / 1000;\n\n\t\n\n char* histo_name_l_A = Form(\"timeDiffA_leading_layer_%d_slot_%d_thr_1%d\", layer_number, slot_nr, thr);\n\n getStatistics().fillHistogram(histo_name_l_A, thr_time_diff_A[thr]);\n\n }\n\n }\n\n }\n\n \n\n // B\n\n for (auto& thr_time_pair : lead_times_B) {\n\n\n\n int thr = thr_time_pair.first;\n\n\n","file_path":"InterThresholdCalibration/InterThresholdCalibration.cpp","rank":91,"score":12.81444601138087},{"content":"BOOST_AUTO_TEST_CASE(matchSignals_test_sameSide)\n\n{\n\n JPetBarrelSlot slot1(1, true, \"one\", 15.0, 1);\n\n JPetScin scin1(1);\n\n JPetPM pm1(11, \"first\");\n\n pm1.setBarrelSlot(slot1);\n\n pm1.setScin(scin1);\n\n pm1.setSide(JPetPM::SideA);\n\n JPetPhysSignal physSig1, physSig2, physSig3;\n\n physSig1.setBarrelSlot(slot1);\n\n physSig2.setBarrelSlot(slot1);\n\n physSig3.setBarrelSlot(slot1);\n\n physSig1.setPM(pm1);\n\n physSig2.setPM(pm1);\n\n physSig3.setPM(pm1);\n\n physSig1.setTime(1.0);\n\n physSig2.setTime(2.0);\n\n physSig3.setTime(3.0);\n\n std::vector<JPetPhysSignal> slotSignals;\n\n slotSignals.push_back(physSig1);\n","file_path":"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp","rank":92,"score":12.789320182082593},{"content":" }\n\n}\n\n\n\nvoid TimeCalibration::fillHistosForHit(const JPetHit& hit, const std::vector<double>& refTimesL, const std::vector<double>& refTimesT)\n\n{\n\n auto lead_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n auto trail_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n\n\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\n\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\n\n float TOT_A = 0.;\n\n float TOT_B = 0.;\n\n double timeDiffTmin = 0;\n\n double timeDiffLmin = 0;\n\n\n\n for (auto& thr_time_pair : lead_times_A) {\n\n int thr = thr_time_pair.first;\n\n\n\n if (trail_times_A.count(thr) > 0 ) {\n\n TOT_A = TOT_A + trail_times_A[thr] - lead_times_A[thr];\n","file_path":"TimeCalibration_iter/TimeCalibration.cpp","rank":93,"score":12.713150699337715},{"content":" const auto scin = bank.getScintillator(1);\n\n\n\n const float detectorWidth = scin.getScinSize(JPetScin::Dimension::kWidth);\n\n const float detectorHeight = scin.getScinSize(JPetScin::Dimension::kHeight);\n\n fHalfStripLenght = scin.getScinSize(JPetScin::Dimension::kLength) / 2.f;\n\n const float detectorD = 0.f;\n\n const float fowRadius = 0.4f;\n\n\n\n fScanner = ScannerBuilder<SquareScanner>::build_multiple_rings(__PET2D_BARREL(radius, // radius\n\n rotation, // rotation\n\n scintillators, // n-detectors\n\n detectorWidth, // w-detector\n\n detectorHeight, // h-detector\n\n detectorD, // should be d-detector\n\n fowRadius // fow radius\n\n ));\n\n\n\n if (isOptionSet(opts, kNumberOfPixelsInOneDimensionKey)) {\n\n fNumberOfPixelsInOneDimension = getOptionAsInt(opts, kNumberOfPixelsInOneDimensionKey);\n\n }\n","file_path":"ImageReconstruction/MLEMRunner.cpp","rank":94,"score":12.697429506737837},{"content":" \"badOffsets.root\");\n\n fBadSignals++;\n\n } else {\n\n auto signalWithOffset = signal;\n\n signalWithOffset.setOffset(fOffset);\n\n fOutputEvents->add<JPetRecoSignal>(signalWithOffset);\n\n }\n\n fCurrentEventNumber++;\n\n }\n\n } else {\n\n return false;\n\n }\n\n\n\n return true;\n\n}\n\n\n\nbool SDARecoOffsetsCalc::terminate() {\n\n int fEventNb = fCurrentEventNumber;\n\n double goodPercent = (fEventNb - fBadSignals) * 100.0 / fEventNb;\n\n INFO(Form(\"Amount of signals in input file: %d\", fEventNb));\n\n INFO(Form(\"Offset calculation complete \\nAmount of bad signals: %d \\n %f %% \"\n\n \"of data is good\",\n\n fBadSignals, goodPercent));\n\n return true;\n\n}\n","file_path":"modules/SDA/JPetRecoOffsetCalc/SDARecoOffsetsCalc.cpp","rank":95,"score":12.689247375228579},{"content":" }\n\n }\n\n for (auto& thr_time_pair : lead_times_B) {\n\n int thr = thr_time_pair.first;\n\n if ( trail_times_B.count(thr) > 0 ) {\n\n TOT_B = TOT_B + trail_times_B[thr] - lead_times_B[thr];\n\n }\n\n }\n\n float tTOT = (TOT_A + TOT_B) / 1000.; //total TOT in ns\n\n//\n\n//----------cut the hit if TOT is out of accepted range (cuts given in ns)\n\n if (tTOT >= TOTcut[0] && tTOT <= TOTcut[1]) {\n\n//\n\n//leading edge\n\n for (auto& thr_time_pair : lead_times_A) {\n\n\n\n int thr = thr_time_pair.first;\n\n //**\t\tconst char * histo_name_l = Form(\"%slayer_%d_slot_%d_thr_%d\",\"timeDiffAB_leading_\",LayerToCalib,StripToCalib,thr);\n\n //**const char * histo_name_Ref_l = Form(\"%slayer_%d_slot_%d_thr_%d\",\"timeDiffRef_leading_\",LayerToCalib,StripToCalib,thr);\n\n //**std::cout << histo_name_l<<\" \"<<histo_name_l<< std::endl;\n","file_path":"TimeCalibration/TimeCalibration.cpp","rank":96,"score":12.678112044542154},{"content":"BOOST_AUTO_TEST_CASE(projection2)\n\n{\n\n double epsilon = 0.00001;\n\n JPetRecoImageTools::Matrix2D matrix = {{1, 2}, {3, 4}};\n\n /// 1 2\n\n /// 3 4\n\n\n\n int imageSize = matrix.size();\n\n double center = (float)(imageSize - 1) / 2.0;\n\n double length = center * center;\n\n std::function< double(int, int) > matrixGet;\n\n matrixGet = JPetRecoImageTools::matrixGetterFactory(\n\n matrix, false); // The matrix elements will be taken as (x,y).\n\n double step = (M_PI / 180);\n\n\n\n double cos = std::cos(step * 0); // 0 degree\n\n double sin = std::sin(step * 0); // 0 degree\n\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::calculateProjection2(\n\n 0, cos, sin, imageSize, center, length, matrixGet),\n\n 4, epsilon); // 1 + 3\n","file_path":"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp","rank":97,"score":12.611482405460636},{"content":" auto opts = getOptions();\n\n\n\n if (isOptionSet(opts, kXRangeOn3DHistogramKey))\n\n {\n\n fXRange = getOptionAsInt(opts, kXRangeOn3DHistogramKey);\n\n }\n\n\n\n if (isOptionSet(opts, kYRangeOn3DHistogramKey))\n\n {\n\n fYRange = getOptionAsInt(opts, kYRangeOn3DHistogramKey);\n\n }\n\n\n\n if (isOptionSet(opts, kZRangeOn3DHistogramKey))\n\n {\n\n fZRange = getOptionAsInt(opts, kZRangeOn3DHistogramKey);\n\n }\n\n\n\n if (isOptionSet(opts, kCutOnAnnihilationPointZKey))\n\n {\n\n fANNIHILATION_POINT_Z = getOptionAsFloat(opts, kCutOnAnnihilationPointZKey);\n","file_path":"ImageReconstruction/ImageReco.cpp","rank":98,"score":12.611482405460636},{"content":" }\n\n }\n\n for (auto& thr_time_pair : lead_times_B) {\n\n int thr = thr_time_pair.first;\n\n if ( trail_times_B.count(thr) > 0 ) {\n\n TOT_B = TOT_B + trail_times_B[thr] - lead_times_B[thr];\n\n }\n\n }\n\n float tTOT = (TOT_A + TOT_B) / 1000.;\n\n if (tTOT >= TOTcut[0] && tTOT <= TOTcut[1]) {\n\n for (auto& thr_time_pair : lead_times_A) {\n\n\n\n int thr = thr_time_pair.first;\n\n if ( lead_times_B.count(thr) > 0 ) {\n\n double timeDiffAB_l = (lead_times_B[thr] / 1000. + CBlCor[thr]) - (lead_times_A[thr] / 1000. + CAlCor[thr]);\n\n const char* histo_name_l = formatUniqueSlotDescription(hit.getBarrelSlot(), thr, \"timeDiffAB_leading_\");\n\n getStatistics().fillHistogram(histo_name_l, timeDiffAB_l);\n\n timeDiffLmin = 10000000000000.;\n\n for (unsigned int i = 0; i < refTimesL.size(); i++) {\n\n double timeDiffHit_L = (lead_times_A[thr] / 1000. + CAlCor[thr]) + (lead_times_B[thr] / 1000. + CBlCor[thr]);\n","file_path":"TimeCalibration_iter/TimeCalibration.cpp","rank":99,"score":12.553968654819666}],"string":"[\n {\n \"content\": \"Description of available parameters in TimeCalibration example.\\n\\nNote that configuration/calibration filed can be obtained from PetWiki:\\n\\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\\n\\n--------\\n\\n\\n\\nSave_Control_Histograms_bool\\n\\n--- Common for each module, if set to true, in the output ROOT files folder with\\n\\nstatistics will contain control histograms. Set to false if histograms not needed.\\n\\n\\n\\nStopIteration_bool\\n\\n---A flag indicating, that the module is called in the iterative mode with number of iterations defined in\\n\\nmain.cpp as the last argument (true) or with user-defined condition to exit the loop (false). In the latter case\\n\\none needs to put -1 as the last argument of manager.useTask (see the description of the TimeCalibration_NiterMax_int)\\n\\n---Default value: true\\n\\n\\n\\nUnpacker_TOToffsetCalib_std::string \\n\\n---Path to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\\n\\n\\n\\nUnpacker_TDCnonlinearityCalib_std::string \\n\\n---Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\\n\\n\\n\\nTimeWindowCreator_MainStrip_int\\n\\n--- Dedicated for files with data from measurement with Reference Detector:\\n\\nIn order to speed up the processing of a single position from a reference detector scan,\\n\\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\\n\\nThis means that signals from any other strips will be ignored at the lowest possible level,\\n\\nresulting in much faster processing. For more detailes please read README\\n\\n\\n\\nTimeWindowCreator_MinTime_float\\n\\n--- Time Slots have certain duration for specific runs, minimum time is usually\\n\\nnegative.\\n\\n--- Default value -1*10^6 ps\\n\\n\\n\\nTimeWindowCreator_MaxTime_float\\n\\n--- Default value 0.0 ps\\n\\n\\n\\nSignalFinder_EdgeMaxTime_float\\n\\n--- time window for matching Signal Channels on Leading Edge.\\n\",\n \"file_path\": \"TimeCalibration_iter/PARAMETERS.md\",\n \"rank\": 1,\n \"score\": 22.132663128622546\n },\n {\n \"content\": \" if (fSaveControlHistos) {\\n\\n initialiseHistograms();\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool TimeWindowCreator::exec() {\\n\\n if (auto event = dynamic_cast<EventIII *const>(fEvent)) {\\n\\n int kTDCChannels = event->GetTotalNTDCChannels();\\n\\n if (fSaveControlHistos) {\\n\\n getStatistics().fillHistogram(\\\"sig_ch_per_time_slot\\\", kTDCChannels);\\n\\n }\\n\\n // Loop over all TDC channels in file\\n\\n auto tdcChannels = event->GetTDCChannelsArray();\\n\\n for (int i = 0; i < kTDCChannels; ++i) {\\n\\n auto tdcChannel = dynamic_cast<TDCChannel *const>(tdcChannels->At(i));\\n\\n auto tombNumber = tdcChannel->GetChannel();\\n\\n // Skip trigger signals from TRB - every 65th\\n\\n if (tombNumber % 65 == 0)\\n\\n continue;\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreator.cpp\",\n \"rank\": 2,\n \"score\": 20.596286166294924\n },\n {\n \"content\": \"\\n\\n channels[i].setPM(pm1);\\n\\n channels[4+i].setPM(pm2);\\n\\n\\n\\n bank.addTOMBChannel(channels[i]);\\n\\n bank.addTOMBChannel(channels[4+i]);\\n\\n }\\n\\n\\n\\n SignalFinderTools::ThresholdOrderings orderings = SignalFinderTools::findThresholdOrders(bank);\\n\\n BOOST_REQUIRE_EQUAL(orderings.size(), 2);\\n\\n\\n\\n for(auto& pm: orderings){\\n\\n SignalFinderTools::ThresholdValues sorted_values;\\n\\n SignalFinderTools::ThresholdValues& orig_values = (pm.first==221 ? values_pm1 : values_pm2);\\n\\n for(int i=0;i<4;++i){\\n\\n sorted_values[pm.second[i]] = orig_values[i];\\n\\n }\\n\\n\\n\\n BOOST_REQUIRE_LE(sorted_values[0], sorted_values[1]);\\n\\n BOOST_REQUIRE_LE(sorted_values[1], sorted_values[2]);\\n\\n BOOST_REQUIRE_LE(sorted_values[2], sorted_values[3]);\\n\\n }\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp\",\n \"rank\": 3,\n \"score\": 20.155447983252184\n },\n {\n \"content\": \" JPetStatistics& stats, bool saveHistos\\n\\n){\\n\\n vector<JPetSigCh> allTDCSigChs;\\n\\n // Loop over all entries on leading edge in current TOMBChannel and create SigCh\\n\\n for (int j = 0; j < tdcChannel->GetLeadHitsNum(); j++) {\\n\\n auto leadTime = tdcChannel->GetLeadTime(j);\\n\\n if (leadTime > maxTime || leadTime < minTime ) { continue; }\\n\\n auto leadSigCh = generateSigCh(\\n\\n leadTime, tombChannel, timeCalibrationMap, thresholdsMap,\\n\\n JPetSigCh::Leading, setTHRValuesFromChannels\\n\\n );\\n\\n allTDCSigChs.push_back(leadSigCh);\\n\\n if (saveHistos){\\n\\n stats.fillHistogram(Form(\\\"pm_occupation_thr%d\\\", tombChannel.getLocalChannelNumber()),\\n\\n tombChannel.getPM().getID());\\n\\n }\\n\\n }\\n\\n // Loop over all entries on trailing edge in current TOMBChannel and create SigCh\\n\\n for (int j = 0; j < tdcChannel->GetTrailHitsNum(); j++) {\\n\\n auto trailTime = tdcChannel->GetTrailTime(j);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp\",\n \"rank\": 4,\n \"score\": 20.025408800244747\n },\n {\n \"content\": \"`Unpacker_TOToffsetCalib_std::string` - Path to and name of a ROOT file with TOT offset calibrations (stretcher) applied during unpacking of HLD file;\\n\\n\\n\\n`Unpacker_TDCnonlinearityCalib_std::string` - Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\\n\\n\\n\\n`TimeWindowCreator_MinTime_float` - Time Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\\n\\n\\n\\n`TimeWindowCreator_MaxTime_float` - default value `0.0 ps`\\n\\n\\n\\n`TimeCalibLoader_ConfigFile_std::string` - Path to and name of ASCII file of required structure, containing time calibrations, specific for each run\\n\\n\\n\\n`ThresholdLoader_ConfigFile_std::string` - Path to and name of ASCII file of required structure, containing thresholds values, specific for each run\\n\\n\\n\\n`SignalFinder_UseCorruptedSigCh_bool` - if set to `true`, signal channels flagged as corrupted will be used in SignalFinder analysis, if set to `false` they will be filtered out\\n\\n\\n\\n`SignalFinder_EdgeMaxTime_float` - time window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\\n\\n\\n\\n`SignalFinder_LeadTrailMaxTime_float` - time window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\\n\\n\\n\\n`SignalTransformer_UseCorruptedSignals_bool` - if set to `true`, signals flagged as corrupted will be used in SignalTransformer analysis, if set to `false` they will be filtered out\\n\\n\\n\\n`HitFinder_UseCorruptedSignals_bool` - if set to `true`, signals flagged as corrupted will be used in HitFinder analysis, if set to `false` they will be filtered out\\n\\n\\n\\n`HitFinder_VelocityFile_std::string` - name of ASCII file of required format, containing values of effective velocities of light in each scintillator\\n\\n\\n\\n`HitFinder_ABTimeDiff_float` - time window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\\n\\n\\n\",\n \"file_path\": \"VelocityCalibration/README.md\",\n \"rank\": 5,\n \"score\": 19.37044358504059\n },\n {\n \"content\": \" if(tc.second->getLocalChannelNumber() > kNumberOfThresholds){\\n\\n ERROR(\\\"Threshold sorting is meant to work with 4 thresholds only!\\\");\\n\\n return orderings;\\n\\n }\\n\\n\\n\\n thr_values_per_pm[pm_id][tc.second->getLocalChannelNumber()-1] = tc.second->getThreshold();\\n\\n }\\n\\n\\n\\n for(auto& pm: thr_values_per_pm){\\n\\n permuteThresholdsByValue(pm.second, orderings[pm.first]);\\n\\n }\\n\\n\\n\\n return orderings;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Helper method for findThresholdOrders which constructs a single permutation\\n\\n * based on the threshold values on a single PMT\\n\\n *\\n\\n * @param threshold_values array of floating-point values of voltage thresholds set on\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 6,\n \"score\": 19.176386843671747\n },\n {\n \"content\": \"Description of available parameters in TimeCalibration example.\\n\\nNote that configuration/calibration files can be obtained from PetWiki:\\n\\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\\n\\n--------\\n\\n\\n\\n-------------------------userParams.json-------------------------\\n\\n\\n\\nSave_Control_Histograms_bool\\n\\n--- Common for each module, if set to true, in the output ROOT files folder with\\n\\nstatistics will contain control histograms. Set to false if histograms not needed.\\n\\n\\n\\nStopIteration_bool\\n\\n--- A flag indicating, that the module is called in the iterative mode with number of iterations defined in\\n\\nmain.cpp as the last argument (true) or with user-defined condition to exit the loop (false). In the latter case\\n\\none needs to put -1 as the last argument of manager.useTask (see the description of the TimeCalibration_NiterMax_int)\\n\\n--- Default value: true\\n\\n\\n\\nUnpacker_TOToffsetCalib_std::string \\n\\n--- Path to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\\n\\n\\n\\nUnpacker_TDCnonlinearityCalib_std::string \\n\\n--- Path to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\\n\\n\\n\\nTimeWindowCreator_MainStrip_int\\n\\n--- Dedicated for files with data from measurement with Reference Detector:\\n\\nIn order to speed up the processing of a single position from a reference detector scan,\\n\\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\\n\\nThis means that signals from any other strips will be ignored at the lowest possible level,\\n\\nresulting in much faster processing. For more detailes please read README\\n\\n\\n\\nTimeWindowCreator_MinTime_float\\n\\n--- Time Slots have certain duration for specific runs, minimum time is usually\\n\\nnegative.\\n\\n--- Default value -1*10^6 ps\\n\\n\\n\\nTimeWindowCreator_MaxTime_float\\n\",\n \"file_path\": \"TimeCalibration_lifetime/PARAMETERS.md\",\n \"rank\": 7,\n \"score\": 19.14071036878237\n },\n {\n \"content\": \"Description of available parameters in TimeCalibration example.\\n\\nNote that configuration/calibration filed can be obtained from PetWiki:\\n\\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\\n\\n--------\\n\\n\\n\\nSave_Cotrol_Histograms_bool\\n\\n--- Common for each module, if set to true, in the output ROOT files folder with\\n\\nstatistics will contain control histograms. Set to false if histograms not needed.\\n\\n\\n\\nTimeWindowCreator_MainStrip_int\\n\\n--- Dedicated for files with data from measurement with Reference Detector:\\n\\nIn order to speed up the processing of a single position from a reference detector scan,\\n\\none can provide a user option indicating which scintillator strip was targeted by the reference detector.\\n\\nThis means that signals from any other strips will be ignored at the lowest possible level,\\n\\nresulting in much faster processing. For more detailes please read README\\n\\n\\n\\nTimeWindowCreator_MinTime_float\\n\\n--- Time Slots have certain duration for specific runs, minimum time is usually\\n\\nnegative.\\n\\n--- Default value -1*10^6 ps\\n\\n\\n\\nTimeWindowCreator_MaxTime_float\\n\\n--- Default value 0.0 ps\\n\\n\\n\\nSignalFinder_EdgeMaxTime_float\\n\\n--- time window for matching Signal Channels on Leading Edge.\\n\\n--- Default value: 5 000 ps.\\n\\n\\n\\nSignalFinder_LeadTrailMaxTime_float\\n\\n--- time window for matching Signal Channels on the same thresholds from\\n\\nLeading and Trailing edge. Default value: 25 000 ps.\\n\\n\\n\\nHitFinder_VelocityFile_std::string\\n\\n--- name of ASCII file of required format, containing values of effective velocities\\n\\nof light in each scintillator.\\n\\n\\n\\nHitFinder_ABTimeDiff_float\\n\\n--- time window for matching Signals on the same scintillator and different sides\\n\\n--- Default value: 6 000 ps.\\n\\n\\n\\nHitFinder_RefDetScinID_int\\n\\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\\n\\n--- The only value used so far: 193\\n\\n\\n\\nTimeCalibration_PMIdRef_int\\n\\n--- Id of the photomultiplier of the refference detector.\\n\",\n \"file_path\": \"TimeCalibration/PARAMETERS.md\",\n \"rank\": 8,\n \"score\": 18.689551605460913\n },\n {\n \"content\": \"\\n\\nbool SDARecoDrawAllOffsets::exec() {\\n\\n if (auto signal = dynamic_cast<const JPetRecoSignal *const>(fEvent))\\n\\n for (unsigned int j = 0; j < fNumberOfPMTs; j++)\\n\\n if ((signal->getPM().getID()) == fIDs[j]) {\\n\\n fOffset = signal->getOffset();\\n\\n fOffsets[j].push_back(fOffset);\\n\\n break;\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SDARecoDrawAllOffsets::terminate() {\\n\\n auto c1 = new TCanvas();\\n\\n vector<double> minimums, maximums;\\n\\n for (unsigned int j = 0; j < fNumberOfPMTs; j++) {\\n\\n minimums.push_back(JPetRecoSignalTools::min(fOffsets[j]));\\n\\n maximums.push_back(JPetRecoSignalTools::max(fOffsets[j]));\\n\\n }\\n\\n double maximum = JPetRecoSignalTools::max(maximums);\\n\",\n \"file_path\": \"modules/SDA/JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.cpp\",\n \"rank\": 9,\n \"score\": 18.645224415476157\n },\n {\n \"content\": \"\\n\\n#include \\\"JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.h\\\"\\n\\n#include \\\"JPetRecoSignalTools/JPetRecoSignalTools.h\\\"\\n\\n#include <TLegend.h>\\n\\n#include <sstream>\\n\\nusing namespace std;\\n\\nSDARecoDrawAllOffsets::SDARecoDrawAllOffsets(const char *name)\\n\\n : JPetUserTask(name) {}\\n\\nSDARecoDrawAllOffsets::~SDARecoDrawAllOffsets() {}\\n\\nbool SDARecoDrawAllOffsets::init() {\\n\\n const auto ¶mBank = getParamBank();\\n\\n fNumberOfPMTs = paramBank.getPMsSize();\\n\\n cout << \\\"Found \\\" << fNumberOfPMTs << \\\" PMTs in paramBank\\\\n\\\";\\n\\n for (size_t i = 0; i < fNumberOfPMTs; i++) {\\n\\n fIDs.push_back(paramBank.getPM(i).getID());\\n\\n vector<double> k;\\n\\n fOffsets.push_back(k);\\n\\n }\\n\\n return true;\\n\\n}\\n\",\n \"file_path\": \"modules/SDA/JPetRecoDrawAllOffsets/SDARecoDrawAllOffsets.cpp\",\n \"rank\": 10,\n \"score\": 18.532630370804718\n },\n {\n \"content\": \" sigCh2.setRecoFlag(JPetSigCh::Corrupted);\\n\\n if(saveHistos){\\n\\n stats.fillHistogram(\\\"good_vs_bad_sigch\\\", 2);\\n\\n stats.fillHistogram(\\\"TT_per_PM\\\", sigCh1.getPM().getID());\\n\\n stats.fillHistogram(\\\"TT_per_THR\\\", sigCh1.getThresholdNumber());\\n\\n stats.fillHistogram(\\\"TT_time_diff\\\", sigCh2.getValue()-sigCh1.getValue());\\n\\n }\\n\\n }\\n\\n if(sigCh1.getRecoFlag() == JPetSigCh::Unknown && saveHistos){\\n\\n stats.fillHistogram(\\\"good_vs_bad_sigch\\\", 3);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/**\\n\\n* Sets up Signal Channel fields\\n\\n*/\\n\\nJPetSigCh TimeWindowCreatorTools::generateSigCh(\\n\\n double tdcChannelTime, const JPetTOMBChannel& channel,\\n\\n map<unsigned int, vector<double>>& timeCalibrationMap,\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp\",\n \"rank\": 11,\n \"score\": 18.49444821819496\n },\n {\n \"content\": \"# ImageReconstruction parameters description\\n\\n\\n\\n## Contents\\n\\n\\n\\nDescription of available parameters in ImageReconstruction example.\\n\\n\\n\\n- `FilterEvents_Cut_On_Z_Value_float` \\n\\n Events with Z value greater then this value will not be included in output file. [cm]\\n\\n\\n\\n- `FilterEvents_Cut_On_LOR_Distance_From_Center_float`\\n\\n Events with LOR distance greater then this value will not be included in output file [cm]\\n\\n\\n\\n- `FilterEvents_TOT_Min_Value_In_Ns_float`\\n\\n Events with sum of TOT with value less then this value will not be included in output file [ns]\\n\\n\\n\\n- `FilterEvents_TOT_Max_Value_In_Ns_float`\\n\\n Events with sum of TOT with value greater then this value will not be included in output file [ns]\\n\\n\\n\\n- `FilterEvents_Angle_Delta_Min_Value_float`\\n\\n Events that hits have angle differences value less then this value will not be included in output file [degrees]\\n\\n\\n\\n- `MLEMRunner_OutFileName_std::string`\\n\\n Path to file where will be saved converted data for futher reconstruction in j-pet-mlem [string]\\n\\n\\n\\n- `MLEMRunner_NumberOfPixelsInOneDimension_int`\\n\\n Number of pixels in reconstructed image in one demension [px]\\n\\n\\n\\n- `MLEMRunner_PixelSize_double`\\n\\n Size of 1 pixel in reconstructed image [m]\\n\\n\\n\\n- `MLEMRunner_StartPixelForPartialMatrix_int`\\n\\n Start pixel of partial matrix.\\n\\n\\n\\n- `MLEMRunner_NumberOfEmissionsPerPixel_int`\\n\\n Number of emmisions per pixel for system matrix.\\n\\n\\n\\n- `MLEMRunner_TOFStepSize_double`\\n\\n TOF step size [m]\\n\\n\\n\\n- `MLEMRunner_TOFSigmaAxis_float`\\n\\n TOF sigma [m]\\n\\n\\n\\n- `MLEMRunner_TOFSigmaAlongZAxis_float`\\n\\n TOF sigma along Z axis [m]\\n\\n\\n\\n- `MLEMRunner_DisplayInfo_bool`\\n\\n If true display extra info about reconstruction into cerr\\n\\n\\n\\n- `MLEMRunner_SystemMatrixOutputPath_std::string`\\n\\n Path to file where system matrix will be saved and from what file read system matrix if already generated\\n\\n\\n\\n- `MLEMRunner_SystemMatrixSaveFull_bool`\\n\",\n \"file_path\": \"ImageReconstruction/PARAMETERS.md\",\n \"rank\": 12,\n \"score\": 18.39695378852926\n },\n {\n \"content\": \" return ok;\\n\\n });\\n\\n if (allOptionsExist) {\\n\\n TOTcut[0] = getOptionAsFloat(opts, kTOTCutLowOptName);\\n\\n TOTcut[1] = getOptionAsFloat(opts, kTOTCutHighOptName);\\n\\n int code = getOptionAsInt(opts, kMainStripOptName);\\n\\n fLayerToCalib = code / 100;\\n\\n fStripToCalib = code % 100;\\n\\n fIsCorrection = getOptionAsBool(opts, kLoadConstantsOptName);\\n\\n fTimeConstantsCalibFileNameTmp = getOptionAsString(opts, kCalibFileTmpOptName );\\n\\n fTimeConstantsCalibFileName = getOptionAsString(opts, kCalibFileFinalOptName );\\n\\n kPMIdRef = getOptionAsInt(opts, kPMIdRefOptName);\\n\\n NiterMax = getOptionAsInt(opts,MaxIterNumOptName); \\n\\n return true;\\n\\n } else {\\n\\n return false;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid TimeCalibration::createHistograms()\\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.cpp\",\n \"rank\": 13,\n \"score\": 18.22673943964369\n },\n {\n \"content\": \" hit.setQualityOfTimeDiff(-1.0);\\n\\n hit.setEnergy(-1.0);\\n\\n hit.setQualityOfEnergy(-1.0);\\n\\n hit.setScintillator(signalB.getPM().getScin());\\n\\n hit.setBarrelSlot(signalB.getPM().getBarrelSlot());\\n\\n return hit;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Helper method for getting TOMB channel\\n\\n */\\n\\nint HitFinderTools::getProperChannel(const JPetPhysSignal& signal)\\n\\n{\\n\\n auto someSigCh = signal.getRecoSignal().getRawSignal()\\n\\n .getPoints(JPetSigCh::Leading, JPetRawSignal::ByThrValue)[0];\\n\\n return someSigCh.getTOMBChannel().getChannel();\\n\\n}\\n\\n\\n\\n/**\\n\\n* Helper method for checking if theta is in radians\\n\",\n \"file_path\": \"LargeBarrelAnalysis/HitFinderTools.cpp\",\n \"rank\": 14,\n \"score\": 18.02910040750766\n },\n {\n \"content\": \" }\\n\\n return false;\\n\\n}\\n\\n\\n\\nvoid TimeWindowCreator::initialiseHistograms() {\\n\\n getStatistics().createHistogramWithAxes(new TH1D(\\\"sig_ch_per_time_slot\\\", \\\"Signal Channels Per Time Slot\\\", 250, -0.125, 999.875),\\n\\n \\\"Signal Channels in Time Slot\\\", \\\"Number of Time Slots\\\");\\n\\n\\n\\n for (int i = 1; i <= kNumOfThresholds; i++) {\\n\\n getStatistics().createHistogramWithAxes(new TH1D(Form(\\\"pm_occupation_thr%d\\\", i), Form(\\\"Signal Channels per PM on THR %d\\\", i), \\n\\n 385, 0.5, 385.5), \\\"PM ID)\\\", \\\"Number of Signal Channels\\\");\\n\\n }\\n\\n\\n\\n getStatistics().createHistogramWithAxes(\\n\\n new TH1D(\\\"good_vs_bad_sigch\\\", \\\"Number of good and corrupted SigChs created\\\",\\n\\n 3, 0.5, 3.5), \\\"Quality\\\", \\\"Number of SigChs\\\");\\n\\n std::vector<std::pair<unsigned, std::string>> binLabels;\\n\\n binLabels.push_back(std::make_pair(1,\\\"GOOD\\\"));\\n\\n binLabels.push_back(std::make_pair(2,\\\"CORRUPTED\\\"));\\n\\n binLabels.push_back(std::make_pair(3,\\\"UNKNOWN\\\"));\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreator.cpp\",\n \"rank\": 15,\n \"score\": 17.908377330220183\n },\n {\n \"content\": \"/**\\n\\n * Method returns a map of vectors of JPetSigCh ordered by photomultiplier ID\\n\\n */\\n\\nconst map<int, vector<JPetSigCh>> SignalFinderTools::getSigChByPM(\\n\\n const JPetTimeWindow* timeWindow, bool useCorrupts, int refPMID\\n\\n){\\n\\n map<int, vector<JPetSigCh>> sigChsPMMap;\\n\\n if (!timeWindow) {\\n\\n WARNING(\\\"Pointer of Time Window object is not set, returning empty map\\\");\\n\\n return sigChsPMMap;\\n\\n }\\n\\n // Map Signal Channels according to PM they belong to\\n\\n const unsigned int nSigChs = timeWindow->getNumberOfEvents();\\n\\n for (unsigned int i = 0; i < nSigChs; i++) {\\n\\n auto sigCh = dynamic_cast<const JPetSigCh&>(timeWindow->operator[](i));\\n\\n // If it is set not to use Corrupted SigChs, such flagged objects will be skipped\\n\\n // Here we ignore the corrupted flag of signals from Refference detector\\n\\n // since removing them results in double peak structures in the calibration spectra\\n\\n int pmtID = sigCh.getPM().getID();\\n\\n if(pmtID == refPMID) {\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 16,\n \"score\": 17.903688730836873\n },\n {\n \"content\": \" }\\n\\n if (fOrderThresholdsByValue){\\n\\n INFO(\\\"Threshold reordering was requested. Thresholds will be ordered by their values according to provided detector setup file.\\\");\\n\\n fThresholdOrderings = SignalFinderTools::findThresholdOrders(getParamBank());\\n\\n }\\n\\n\\n\\n // Creating control histograms\\n\\n if(fSaveControlHistos) { initialiseHistograms(); }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SignalFinder::exec()\\n\\n{\\n\\n // Getting the data from event in an apropriate format\\n\\n if(auto timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\\n\\n // Distribute signal channels by PM IDs and filter out Corrupted SigChs if requested\\n\\n auto& sigChByPM = SignalFinderTools::getSigChByPM(timeWindow, fUseCorruptedSigCh, fRefPMID);\\n\\n // Building signals\\n\\n auto allSignals = SignalFinderTools::buildAllSignals(\\n\\n sigChByPM, fSigChEdgeMaxTime, fSigChLeadTrailMaxTime,\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinder.cpp\",\n \"rank\": 17,\n \"score\": 17.856048227284617\n },\n {\n \"content\": \" void fitAndSaveParametersToFile(const std::string& filename, const std::string& filenameTmp);\\n\\n bool CheckIfExit(int Niter);\\n\\n\\n\\n /// Required options to be loaded from the json file.\\n\\n const std::string kPMIdRefOptName = \\\"TimeCalibration_PMIdRef_int\\\";\\n\\n const std::string kTOTCutLowOptName = \\\"TimeCalibration_TOTCutLow_float\\\";\\n\\n const std::string kTOTCutHighOptName = \\\"TimeCalibration_TOTCutHigh_float\\\";\\n\\n // const std::string kMainStripOptName = \\\"TimeCalibration_MainStrip_int\\\";\\n\\n const std::string kMainStripOptName = \\\"TimeWindowCreator_MainStrip_int\\\"; \\n\\n const std::string kLoadConstantsOptName = \\\"TimeCalibration_LoadConstants_bool\\\";\\n\\n const std::string kCalibFileTmpOptName = \\\"TimeCalibration_OutputFileTmp_std::string\\\";\\n\\n const std::string kCalibFileFinalOptName = \\\"TimeCalibration_OutputFileFinal_std::string\\\";\\n\\n const std::string MaxIterNumOptName = \\\"TimeCalibration_NiterMax_int\\\";\\n\\n int kPMIdRef = 385;\\n\\n std::array<float, 2> TOTcut{{ -300000000., 300000000.}}; //TOT cuts for slot hits (sum of TOTs from both sides)\\n\\n int fLayerToCalib = -1; //Layer of calibrated slot\\n\\n int fStripToCalib = -1; //Slot to be calibrated\\n\\n bool fIsCorrection = true; //Flag for choosing the correction of times at the level of calibration module (use only if the calibration loader is not used)\\n\\n std::string fTimeConstantsCalibFileName = \\\"TimeConstantsCalib.txt\\\";\\n\\n std::string fTimeConstantsCalibFileNameTmp = \\\"TimeConstantsCalibTmp.txt\\\";\\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.h\",\n \"rank\": 18,\n \"score\": 17.594180555451818\n },\n {\n \"content\": \"# Large Barrel Analysis parameters description\\n\\n\\n\\n## Contents\\n\\nDescription of available parameters in LargeBarrelAnalysis example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\\n\\n\\n\\n- `Save_Control_Histograms_bool` \\n\\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms are not needed.\\n\\n\\n\\n- `Unpacker_TOToffsetCalib_std::string` \\n\\nPath to and name of a `ROOT` file with `TOT` offset calibrations (stretcher) applied during unpacking of `HLD` file.\\n\\n\\n\\n- `Unpacker_TDCnonlinearityCalib_std::string` \\n\\nPath to and name of a `ROOT` file with calibrations of nonlinearities occurring on `TDC` boards, applied during unpacking of `HLD` file.\\n\\n\\n\\n- `TimeWindowCreator_MainStrip_int` \\n\\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the scintillator we calibrate. If option is absent in the user parameters file, part with reference detector is ignored\\n\\n\\n\\n- `TimeWindowCreator_MinTime_float` \\n\\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\\n\\n\\n\\n- `TimeWindowCreator_MaxTime_float` \\n\\ndefault value `0.0 ps`\\n\\n\\n\\n- `TimeCalibLoader_ConfigFile_std::string` \\n\\nPath to and name of ASCII file of required structure, containing time calibrations, specific for each run\\n\\n\\n\\n- `SignalFinder_UseCorruptedSigCh_bool` \\n\\nIndication if Signal Finder module should use signal channels flagged as Corrupted in the previous task. Default value: `false`\\n\\n\\n\\n- `SignalFinder_EdgeMaxTime_float` \\n\\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\\n\\n\\n\\n- `SignalFinder_LeadTrailMaxTime_float` \\n\",\n \"file_path\": \"LargeBarrelAnalysis/PARAMETERS.md\",\n \"rank\": 19,\n \"score\": 17.525536875290165\n },\n {\n \"content\": \"\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SinogramCreator::atenuation(const float value) { return distribution(generator) <= value; }\\n\\n\\n\\nvoid SinogramCreator::setUpOptions()\\n\\n{\\n\\n auto opts = getOptions();\\n\\n if (isOptionSet(opts, kOutFileNameKey))\\n\\n {\\n\\n fOutFileName = getOptionAsString(opts, kOutFileNameKey);\\n\\n }\\n\\n if (isOptionSet(opts, kReconstructionDistanceAccuracy))\\n\\n {\\n\\n fReconstructionDistanceAccuracy = getOptionAsFloat(opts, kReconstructionDistanceAccuracy);\\n\\n }\\n\\n if (isOptionSet(opts, kZSplitNumber))\\n\\n {\\n\\n fZSplitNumber = getOptionAsInt(opts, kZSplitNumber);\\n\",\n \"file_path\": \"ImageReconstruction/SinogramCreator.cpp\",\n \"rank\": 20,\n \"score\": 16.97201160822847\n },\n {\n \"content\": \" // Build a list of allowed channels\\n\\n JPetGeomMapping mapper(getParamBank());\\n\\n for (int thr = 1; thr <= 4; ++thr) {\\n\\n int tombNumber = mapper.getTOMB(fMainStrip.first, fMainStrip.second,\\n\\n JPetPM::SideA, thr);\\n\\n fAllowedChannels.insert(tombNumber);\\n\\n tombNumber = mapper.getTOMB(fMainStrip.first, fMainStrip.second,\\n\\n JPetPM::SideB, thr);\\n\\n fAllowedChannels.insert(tombNumber);\\n\\n }\\n\\n // Add all reference detector channels to allowed channels list\\n\\n for (int thr = 1; thr <= 4; ++thr) {\\n\\n int tombNumber = mapper.getTOMB(4, 1, JPetPM::SideA, thr);\\n\\n fAllowedChannels.insert(tombNumber);\\n\\n tombNumber = mapper.getTOMB(4, 1, JPetPM::SideB, thr);\\n\\n fAllowedChannels.insert(tombNumber);\\n\\n }\\n\\n }\\n\\n\\n\\n // Control histograms\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreator.cpp\",\n \"rank\": 21,\n \"score\": 16.938193135179212\n },\n {\n \"content\": \" std::map<std::tuple<int, int, JPetPM::Side, int>, int> fCorrectTombMap = {\\n\\n {std::make_tuple(1, 1, JPetPM::SideA, 1), 22},\\n\\n {std::make_tuple(3, 2, JPetPM::SideB, 4), 13},\\n\\n {std::make_tuple(2, 90, JPetPM::SideB, 2), 73}};\\n\\n};\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(UniversalFileLoaderSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(getConfigurationParameter) {\\n\\n UniversalFileLoader::TOMBChToParameter configuration = {\\n\\n {0, std::vector<double>{0.5, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\\n\\n {1, std::vector<double>{-1.2, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\\n\\n {3, std::vector<double>{0.2, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}},\\n\\n {4, std::vector<double>{-0.1, 0.1, 0.0, 0.5, 0.0, 6.1, 0.0, 2.1}}};\\n\\n auto epsilon = 0.00001;\\n\\n BOOST_REQUIRE_CLOSE(\\n\\n UniversalFileLoader::getConfigurationParameter(configuration, 0), 0.5,\\n\\n epsilon);\\n\\n BOOST_REQUIRE_CLOSE(\\n\\n UniversalFileLoader::getConfigurationParameter(configuration, 1), -1.2,\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/UniversalFileLoaderTest.cpp\",\n \"rank\": 22,\n \"score\": 16.204589928387737\n },\n {\n \"content\": \"\\tstd::map<unsigned int, std::vector<double>> fTimeCalibration;\\n\\n\\tstd::map<unsigned int, std::vector<double>> fThresholds;\\n\\n\\tbool fSetTHRValuesFromChannels = true;\\n\\n\\tlong long int fCurrEventNumber = 0;\\n\\n\\tstd::set<int> fAllowedChannels;\\n\\n\\tbool fSaveControlHistos = true;\\n\\n\\tstd::pair<int,int> fMainStrip;\\n\\n\\tbool fMainStripSet = false;\\n\\n\\tdouble fMinTime = -1.e6;\\n\\n\\tdouble fMaxTime = 0.;\\n\\n};\\n\\n\\n\\n#endif /* !TIMEWINDOWCREATOR_H */\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreator.h\",\n \"rank\": 23,\n \"score\": 16.196220822938358\n },\n {\n \"content\": \" JPetPM pm2(JPetPM::SideB, 222, 32, 64, std::make_pair(16.f, 32.f), \\\"test_pm2\\\");\\n\\n\\n\\n bank.addPM(pm1);\\n\\n bank.addPM(pm2);\\n\\n\\n\\n SignalFinderTools::ThresholdValues values_pm1 = {40., 3., 20., 10.};\\n\\n SignalFinderTools::ThresholdValues values_pm2 = {100., 400., 200., 300.};\\n\\n\\n\\n JPetTOMBChannel channels[8];\\n\\n\\n\\n for(int i=0;i<4;++i){\\n\\n\\n\\n channels[i] = JPetTOMBChannel(i);\\n\\n channels[4+i] = JPetTOMBChannel(4+i);\\n\\n\\n\\n channels[i].setLocalChannelNumber(i+1);\\n\\n channels[4+i].setLocalChannelNumber(i+1);\\n\\n\\n\\n channels[i].setThreshold(values_pm1[i]);\\n\\n channels[4+i].setThreshold(values_pm2[i]);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp\",\n \"rank\": 24,\n \"score\": 16.082361296142814\n },\n {\n \"content\": \"--- Default value: 5 000 ps.\\n\\n\\n\\nSignalFinder_LeadTrailMaxTime_float\\n\\n--- time window for matching Signal Channels on the same thresholds from\\n\\nLeading and Trailing edge. Default value: 25 000 ps.\\n\\n\\n\\nSignalFinder_UseCorruptedSigCh_bool\\n\\n---Indication if Signal Finder module should use signal channels flagged as Corrupted in the previous task.\\n\\nDefault value: false\\n\\n\\n\\nHitFinder_VelocityFile_std::string\\n\\n--- name of ASCII file of required format, containing values of effective velocities\\n\\nof light in each scintillator.\\n\\n\\n\\nHitFinder_ABTimeDiff_float\\n\\n--- time window for matching Signals on the same scintillator and different sides\\n\\n--- Default value: 6 000 ps.\\n\\n\\n\\nHitFinder_RefDetScinID_int\\n\\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\\n\\n--- The only value used so far: 193\\n\\n\\n\\nHitFinder_UseCorruptedSignals_bool \\n\\n--- Indication if Hit Finder module should use signals flagged as Corrupted in the previous task.\\n\\n--- Default value: `false`\\n\\n\\n\\nTimeCalibration_PMIdRef_int\\n\\n--- Id of the photomultiplier of the refference detector.\\n\\n--- So far we used always number 385\\n\\n\\n\\nTimeCalibration_TOTCutLow_float (in the older versions\\tof Framework: TOTCutLow)\\n\\n--- Lower bound of TOT for signals used to calibrate slots with refference detector.\\n\\nWe do not use it so far since the results with cuts were not better then without.\\n\\n--- Default value: -300000000\\n\\n\\n\\nTimeCalibration_TOTCutHigh_float (in the older versions of Framework: TOTCutHigh)\\n\\n---Upper bound of TOT for signals used to calibrate slots with refference detector.\\n\\nWe do not use it so far since the results with cuts were not better then without.\\n\",\n \"file_path\": \"TimeCalibration_iter/PARAMETERS.md\",\n \"rank\": 25,\n \"score\": 16.050410921436136\n },\n {\n \"content\": \" return true;\\n\\n}\\n\\n\\n\\nvoid TimeWindowCreator::saveSigChs(const vector<JPetSigCh> &sigChVec) {\\n\\n for (auto &sigCh : sigChVec) {\\n\\n fOutputEvents->add<JPetSigCh>(sigCh);\\n\\n }\\n\\n}\\n\\n\\n\\n/**\\n\\n * Reference Detector\\n\\n * Returns true if signal from the channel given as argument should be passed\\n\\n */\\n\\nbool TimeWindowCreator::isAllowedChannel(JPetTOMBChannel &tombChannel) const {\\n\\n // If main strip was not defined, pass all channels\\n\\n if (!fMainStripSet)\\n\\n return true;\\n\\n if (fAllowedChannels.find(tombChannel.getChannel()) !=\\n\\n fAllowedChannels.end()) {\\n\\n return true;\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreator.cpp\",\n \"rank\": 26,\n \"score\": 16.03121131713219\n },\n {\n \"content\": \"# Imaging stream parameters description\\n\\n\\n\\n## Contents\\n\\nDescription of available parameters in Imaging example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\\n\\n\\n\\n- `Save_Control_Histograms_bool` \\n\\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\\n\\n\\n\\n- `TimeWindowCreator_MainStrip_int` \\n\\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\\n\\n\\n\\n- `TimeWindowCreator_MinTime_float` \\n\\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\\n\\n\\n\\n- `TimeWindowCreator_MaxTime_float` \\n\\ndefault value `0.0 ps`\\n\\n\\n\\n- `TimeCalibLoader_ConfigFile_std::string` \\n\\nname of ASCII file of required structure, containing time calibrations, specific for each run\\n\\n\\n\\n- `SignalFinder_EdgeMaxTime_float` \\n\\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\\n\\n\\n\\n- `SignalFinder_LeadTrailMaxTime_float` \\n\\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\\n\\n\\n\\n- `HitFinder_VelocityFile_std::string` \\n\\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\\n\\n\\n\\n- `HitFinder_ABTimeDiff_float` \\n\\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\\n\\n\\n\\n- `HitFinder_RefDetScinID_int` \\n\\n`ID` of Reference Detector Scintillator, needed for creating reference hits\\n\\n\\n\\n- `EventFinder_EventTime_float` \\n\\ntime window for grouping hits in one event. Default value `5 000 ps`\\n\\n\\n\\n- `EventFinder_MinEventMultiplicity_int` \\n\",\n \"file_path\": \"Imaging/PARAMETERS.md\",\n \"rank\": 27,\n \"score\": 16.003532185469403\n },\n {\n \"content\": \"\\n\\n std::string fOutFileName = \\\"mlem_reconstruction_output.txt\\\";\\n\\n float fHalfStripLenght = 0.f;\\n\\n\\n\\n Scanner2D fScanner;\\n\\n\\n\\n std::ofstream fOutputStream; // outputs data in format accepted by 3d_hybrid_reconstruction\\n\\n std::stringstream fReconstructionStringStream; // connection between parsing events and reconstruction\\n\\n\\n\\n int fNumberOfPixelsInOneDimension = 160; // Dimension of 1 axis in 3d reconstructed image(n-pixels)\\n\\n double fPixelSize = 0.004; // Size of 1 pixel in m(s-pixel)\\n\\n unsigned int fStartPixelForPartialMatrix = 0u; // Starting position of matrix\\n\\n unsigned int fNumberOfEmissionsPerPixel = 100000000; // Number of emissions per pixel for system matrix\\n\\n double fTOFStep = 0.;\\n\\n float fTOFSigmaAxis = 0.06f;\\n\\n float fTOFSigmaAlongZAxis = 0.015f;\\n\\n\\n\\n bool fVerbose = true; // if true prints extra information about reconstruction to cerr\\n\\n bool fSystemMatrixSaveFull = true; // if true generate and save full system matrix, if not only 1/8 of it and then converts to full\\n\\n int fReconstructionIterations = 10; // number of iterations in reconstruction\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.h\",\n \"rank\": 28,\n \"score\": 15.891667004458919\n },\n {\n \"content\": \"# Physics stream parameters description\\n\\n\\n\\n## Contents\\n\\nDescription of available parameters in Physics example. Note that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\\n\\n\\n\\n- `Save_Control_Histograms_bool` \\n\\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\\n\\n\\n\\n- `TimeWindowCreator_MainStrip_int` \\n\\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\\n\\n\\n\\n- `TimeWindowCreator_MinTime_float` \\n\\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\\n\\n\\n\\n- `TimeWindowCreator_MaxTime_float` \\n\\ndefault value `0.0 ps`\\n\\n\\n\\n- `TimeCalibLoader_ConfigFile_std::string` \\n\\nname of ASCII file of required structure, containing time calibrations, specific for each run\\n\\n\\n\\n- `SignalFinder_EdgeMaxTime_float` \\n\\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\\n\\n\\n\\n- `SignalFinder_LeadTrailMaxTime_float` \\n\\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\\n\\n\\n\\n- `HitFinder_VelocityFile_std::string` \\n\\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\\n\\n\\n\\n- `HitFinder_ABTimeDiff_float` \\n\\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\\n\\n\\n\\n- `HitFinder_RefDetScinID_int` \\n\",\n \"file_path\": \"PhysicAnalysis/PARAMETERS.md\",\n \"rank\": 29,\n \"score\": 15.862252954976382\n },\n {\n \"content\": \"# Cosmics stream - data selection of cosmic radiation events parameters\\n\\n\\n\\n## Contents\\n\\nDescription of available parameters in CosmicAnalysis example.\\n\\nNote that configuration/calibration files can be obtained from [PetWiki](http://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses)\\n\\n\\n\\n- `Save_Control_Histograms_bool` \\n\\nCommon for each module, if set to `true`, in the output `ROOT` files folder with statistics will contain control histograms. Set to `false` if histograms not needed.\\n\\n\\n\\n- `TimeWindowCreator_MainStrip_int` \\n\\nDedicated for files with data from measurement with Reference Detector - it denotes which `ID` has the reference scintillator. If option not set, part with reference detector is ignored\\n\\n\\n\\n- `TimeWindowCreator_MinTime_float` \\n\\nTime Slots have certain duration for specific runs, minimum time is usually negative, default value `-1*10^6 ps`\\n\\n\\n\\n- `TimeWindowCreator_MaxTime_float` \\n\\ndefault value `0.0 ps`\\n\\n\\n\\n- `TimeCalibLoader_ConfigFile_std::string` \\n\\nname of ASCII file of required structure, containing time calibrations, specific for each run\\n\\n\\n\\n- `SignalFinder_EdgeMaxTime_float` \\n\\ntime window for matching Signal Channels on Leading Edge. Default value: `5 000 ps`\\n\\n\\n\\n- `SignalFinder_LeadTrailMaxTime_float` \\n\\ntime window for matching Signal Channels on the same thresholds from Leading and Trailing edge. Default value: `25 000 ps`\\n\\n\\n\\n- `HitFinder_VelocityFile_std::string` \\n\\nname of ASCII file of required format, containing values of effective velocities of light in each scintillator\\n\\n\\n\\n- `HitFinder_ABTimeDiff_float` \\n\\ntime window for matching Signals on the same scintillator and different sides. Default value: `6 000 ps`\\n\\n\\n\\n- `HitFinder_RefDetScinID_int` \\n\",\n \"file_path\": \"CosmicAnalysis/PARAMETERS.md\",\n \"rank\": 30,\n \"score\": 15.745731457498097\n },\n {\n \"content\": \"#include \\\"JPetLoggerInclude.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(SignalFinderTestSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(getSigChByPM_nullPointer_test)\\n\\n{\\n\\n auto results = SignalFinderTools::getSigChByPM(nullptr, false, -1);\\n\\n BOOST_REQUIRE(results.empty());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(getSigChByPM_Test) {\\n\\n JPetPM pm1(1, \\\"first\\\");\\n\\n JPetSigCh sigChA1(JPetSigCh::Leading, 10.0);\\n\\n JPetSigCh sigChA2(JPetSigCh::Leading, 11.0);\\n\\n JPetSigCh sigChA3(JPetSigCh::Leading, 12.5);\\n\\n sigChA1.setPM(pm1);\\n\\n sigChA2.setPM(pm1);\\n\\n sigChA3.setPM(pm1);\\n\\n sigChA1.setRecoFlag(JPetSigCh::Good);\\n\\n sigChA2.setRecoFlag(JPetSigCh::Good);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp\",\n \"rank\": 31,\n \"score\": 15.669096718678173\n },\n {\n \"content\": \"--- Default value 0.0 ps\\n\\n\\n\\nSignalFinder_EdgeMaxTime_float\\n\\n--- time window for matching Signal Channels on Leading Edge.\\n\\n--- Default value: 5 000 ps.\\n\\n\\n\\nSignalFinder_LeadTrailMaxTime_float\\n\\n--- time window for matching Signal Channels on the same thresholds from\\n\\nLeading and Trailing edge. Default value: 25 000 ps.\\n\\n\\n\\nSignalFinder_UseCorruptedSigCh_bool\\n\\n--- Indication if Signal Finder module should use signal channels flagged as Corrupted in the previous task.\\n\\nDefault value: false\\n\\n\\n\\nHitFinder_VelocityFile_std::string\\n\\n--- name of ASCII file of required format, containing values of effective velocities\\n\\nof light in each scintillator.\\n\\n\\n\\nHitFinder_ABTimeDiff_float\\n\\n--- time window for matching Signals on the same scintillator and different sides\\n\\n--- Default value: 6 000 ps.\\n\\n\\n\\nHitFinder_RefDetScinID_int\\n\\n--- ID of Reference Detector Scintillator, needed for creating reference hits.\\n\\n--- The only value used so far: -1\\n\\n\\n\\nHitFinder_UseCorruptedSignals_bool\\n\\n--- Indication if Hit Finder module should use signals flagged as Corrupted in the previous task.\\n\\n--- Default value: `false`\\n\\n\\n\\nPALSCalibrationTask_Anni_TOT_Cut_Min_float\\n\\n--- minimal TOT for the hit that come from the annihilation of the positron-electron\\n\\n--- Default value: 23 000 ps\\n\\n\\n\\nPALSCalibrationTask_Anni_TOT_Cut_Max_float\\n\\n--- maximal TOT for the hit that come from the annihilation of the positron-electron\\n\\n--- Default value: 30 000 ps\\n\\n\\n\\nPALSCalibrationTask_Deex_TOT_Cut_Min_float\\n\\n--- minimal TOT for the hit that come from the deexcitation of the source\\n\\n--- Default value: 35 000 ps\\n\\n\\n\\nPALSCalibrationTask_Deex_TOT_Cut_Max_float\\n\\n--- maximal TOT for the hit that come from the deexcitation of the source\\n\\n--- Default value: 35 000 ps\\n\\n\\n\\nPALSCalibrationTask_ZpositionCut_float\\n\\n--- maximal Z position accepted for a hit\\n\\n--- Default value: 23 cm\\n\\n\\n\\nPALSCalibrationTask_EffectiveLength_float\\n\\n--- effective length assumed for a first threshold\\n\",\n \"file_path\": \"TimeCalibration_lifetime/PARAMETERS.md\",\n \"rank\": 32,\n \"score\": 15.569662733507785\n },\n {\n \"content\": \"BOOST_AUTO_TEST_CASE(test_angle_middle)\\n\\n{\\n\\n const float EPSILON = 0.01f;\\n\\n const float r = 10;\\n\\n const float maxDistance = 20.f;\\n\\n const float accuracy = 0.1f;\\n\\n\\n\\n for (int i = 0; i < 360; i++)\\n\\n {\\n\\n const float x1 = r * std::cos((i) * (M_PI / 180.f));\\n\\n const float y1 = r * std::sin((i) * (M_PI / 180.f));\\n\\n const float x2 = r * std::cos((i + 180) * (M_PI / 180.f));\\n\\n const float y2 = r * std::sin((i + 180) * (M_PI / 180.f));\\n\\n const auto result =\\n\\n SinogramCreatorTools::getSinogramRepresentation(x1, y1, x2, y2, maxDistance, accuracy, std::ceil(maxDistance * 2.f * (1.f / accuracy)), 180);\\n\\n int resultAngle = i < 90 ? 90 + i : i < 180 ? i - 90 : i < 270 ? i - 90 : i - 270;\\n\\n BOOST_REQUIRE_EQUAL(result.second, resultAngle);\\n\\n const float distanceResult = SinogramCreatorTools::roundToNearesMultiplicity(maxDistance, accuracy);\\n\\n BOOST_REQUIRE_CLOSE(result.first, distanceResult, EPSILON);\\n\\n }\\n\",\n \"file_path\": \"ImageReconstruction/SinogramCreatorToolsTest.cpp\",\n \"rank\": 34,\n \"score\": 15.532147583678151\n },\n {\n \"content\": \"#include \\\"JPetLoggerInclude.h\\\"\\n\\n\\n\\n/**\\n\\n * Method returns a patameter for given TOMB channel\\n\\n */\\n\\ndouble UniversalFileLoader::getConfigurationParameter(\\n\\n const TOMBChToParameter& confParameters,\\n\\n const unsigned int channel)\\n\\n{\\n\\n if (confParameters.find(channel) == confParameters.end()) {\\n\\n DEBUG(\\\"No parameter available for the channel\\\" + std::to_string(channel));\\n\\n return 0.0;\\n\\n } else {\\n\\n return confParameters.at(channel)[0];\\n\\n }\\n\\n}\\n\\n\\n\\n/**\\n\\n * Method loading parameters from ASCII file\\n\\n * Arguments: file name string, TOMBChMap object containing the dependency\\n\",\n \"file_path\": \"LargeBarrelAnalysis/UniversalFileLoader.cpp\",\n \"rank\": 35,\n \"score\": 15.401899210684807\n },\n {\n \"content\": \"\\n\\n BOOST_REQUIRE_EQUAL(result1.size(), 2);\\n\\n BOOST_REQUIRE_EQUAL(result2.size(), 1);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(createHit_test)\\n\\n{\\n\\n JPetLayer layer1(1, true, \\\"layer1\\\", 10.0);\\n\\n JPetBarrelSlot slot1(2, true, \\\"barel1\\\", 30.0, 23);\\n\\n slot1.setLayer(layer1);\\n\\n\\n\\n JPetScin scin1(1);\\n\\n scin1.setBarrelSlot(slot1);\\n\\n\\n\\n JPetPM pmA(11, \\\"first\\\"), pmB(22, \\\"second\\\");\\n\\n pmA.setScin(scin1);\\n\\n pmB.setScin(scin1);\\n\\n pmA.setBarrelSlot(slot1);\\n\\n pmB.setBarrelSlot(slot1);\\n\\n pmA.setSide(JPetPM::SideA);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp\",\n \"rank\": 36,\n \"score\": 15.05575782067111\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\\n\\n#include <boost/test/unit_test.hpp>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <utility>\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"JPetCommonTools/JPetCommonTools.h\\\"\\n\\n#include \\\"./JPetFilterCosine.h\\\"\\n\\n#include \\\"./JPetFilterHamming.h\\\"\\n\\n#include \\\"./JPetFilterNone.h\\\"\\n\\n#include \\\"./JPetFilterRamLak.h\\\"\\n\\n#include \\\"./JPetFilterRidgelet.h\\\"\\n\\n#include \\\"./JPetFilterSheppLogan.h\\\"\\n\\n#include \\\"./JPetRecoImageTools.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(FirstSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(rescale_0)\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp\",\n \"rank\": 37,\n \"score\": 14.950708237928836\n },\n {\n \"content\": \" in >> height;\\n\\n int val;\\n\\n in >> val; // skip max val\\n\\n JPetRecoImageTools::Matrix2DProj sinogram(height, std::vector<double>(width));\\n\\n for (unsigned int i = 0; i < height; i++) {\\n\\n for (unsigned int j = 0; j < width; j++) {\\n\\n in >> val;\\n\\n sinogram[i][j] = val;\\n\\n }\\n\\n }\\n\\n return sinogram;\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(FirstSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(backProjectSinogramNone)\\n\\n{\\n\\n const auto outFile = \\\"backprojectSinogramNone.ppm\\\";\\n\\n\\n\\n JPetRecoImageTools::Matrix2DProj sinogram = readFile(inFile);\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoTest.cpp\",\n \"rank\": 38,\n \"score\": 14.889937444152798\n },\n {\n \"content\": \"--- Default value: 300000000.\\n\\n\\n\\nTimeCalibration_LoadConstants_bool\\n\\n---The flag indicating if the temporary calibration constants should be loaded after each iteration of the calibration.\\n\\nUse it only if You disable the calibration loading module (by default it is off), by default it is set to \\\"true\\\"\\n\\nsince this is much faster than the full analysis done starting from unpacker stage. If You really want to use corrections\\n\\nat that level first uncomment in main.cpp the CalibLoader module and change TimeCalibration_LoadConstants_bool to false.\\n\\n--- Default value: true\\n\\n\\n\\nTimeCalibration_OutputFileTmp_std::string\\n\\n---The file which is used to store the temporary calibration constants after each iteration.\\n\\n--- Default value: TimeConstantsCalibTmp.txt\\n\\n\\n\\nTimeCalibration_OutputFileFinal_std::string\\n\\n---The final output file with calibration constants\\n\\n--- Default value: TimeConstantsCalib.txt\\n\\n\\n\\nTimeCalibration_NiterMax_int\\n\\n--- The user defined number of iterations of calibration. Use it with option \\\"StopIteration_bool\\\" set to false and with\\n\\nmanager.useTask(\\\"TimeCalibration\\\", \\\"hits\\\", \\\"calib\\\",-1) in the main.cpp\\n\\n--- Default value: 1\\n\",\n \"file_path\": \"TimeCalibration_iter/PARAMETERS.md\",\n \"rank\": 39,\n \"score\": 14.870611137440049\n },\n {\n \"content\": \" //take slot number for the hit\\n\\n int slot_number = hit.getBarrelSlot().getID();\\n\\n int layer_number = hit.getBarrelSlot().getLayer().getID();\\n\\n int slot_nr;\\n\\n\\n\\n if (layer_number == 1) slot_nr = slot_number;\\n\\n if (layer_number == 2) slot_nr = slot_number - 48;\\n\\n if (layer_number == 3) slot_nr = slot_number - 96;\\n\\n\\n\\n double thr_time_diff_t_A[5], thr_time_diff_A[5];\\n\\n double thr_time_diff_t_B[5], thr_time_diff_B[5];\\n\\n double lead_times_first_A, lead_times_first_B;\\n\\n double trail_times_first_A, trail_times_first_B;\\n\\n\\n\\n // leading edge\\n\\n\\n\\n // A\\n\\n for (auto& thr_time_pair : lead_times_A) {\\n\\n \\n\\n int thr = thr_time_pair.first;\\n\",\n \"file_path\": \"InterThresholdCalibration/InterThresholdCalibration.cpp\",\n \"rank\": 40,\n \"score\": 14.748995863703433\n },\n {\n \"content\": \" std::vector <JPetHit> histCalib;\\n\\n std::vector <double> refTimesL;\\n\\n std::vector <double> refTimesT;\\n\\n\\n\\n if (auto timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\\n\\n auto n = timeWindow->getNumberOfEvents();\\n\\n for (auto i = 0u; i < n; ++i) {\\n\\n const JPetHit& hit = dynamic_cast<const JPetHit&>(timeWindow->operator[](i));\\n\\n int PMid = hit.getSignalB().getRecoSignal().getRawSignal().getPM().getID();\\n\\n if (PMid == kPMIdRef) {\\n\\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n //\\n\\n for (auto& thr_time_pair : lead_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\\n RefTimeLead[thr] = thr_time_pair.second;\\n\\n\\n\\n }\\n\\n for (auto& thr_time_pair : trail_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.cpp\",\n \"rank\": 41,\n \"score\": 14.668530202343074\n },\n {\n \"content\": \" auto trail_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n\\n\\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n//\\n\\n//-----------TOT calculation for the slot hit\\n\\n float TOT_A = 0.;\\n\\n float TOT_B = 0.;\\n\\n double timeDiffTmin = 0;\\n\\n double timeDiffLmin = 0;\\n\\n //\\n\\n\\n\\n //**\\tint StripToCalibTemp = hit.getScintillator().getID();\\n\\n //**\\tint LayerToCalibTemp = hit.getBarrelSlot().getLayer().getID();\\n\\n //\\n\\n for (auto& thr_time_pair : lead_times_A) {\\n\\n int thr = thr_time_pair.first;\\n\\n\\n\\n if (trail_times_A.count(thr) > 0 ) {\\n\\n TOT_A = TOT_A + trail_times_A[thr] - lead_times_A[thr];\\n\",\n \"file_path\": \"TimeCalibration/TimeCalibration.cpp\",\n \"rank\": 42,\n \"score\": 14.505673206255912\n },\n {\n \"content\": \"BOOST_AUTO_TEST_CASE(generateConfigurationParameters_empty) {\\n\\n std::vector<ConfRecord> records;\\n\\n std::map<std::tuple<int, int, JPetPM::Side, int>, int> tombMap;\\n\\n auto configuration =\\n\\n UniversalFileLoader::generateConfigurationParameters(records, tombMap);\\n\\n BOOST_REQUIRE(configuration.empty());\\n\\n}\\n\\n\\n\\nBOOST_FIXTURE_TEST_CASE(generateConfigurationParameters, myFixtures) {\\n\\n auto epsilon = 0.0001;\\n\\n auto configuration = UniversalFileLoader::generateConfigurationParameters(\\n\\n fCorrectRecords, fCorrectTombMap);\\n\\n BOOST_REQUIRE_EQUAL(configuration.size(), 3);\\n\\n BOOST_REQUIRE_EQUAL(configuration.count(22), 1);\\n\\n BOOST_REQUIRE_EQUAL(configuration.count(13), 1);\\n\\n BOOST_REQUIRE_EQUAL(configuration.count(73), 1);\\n\\n BOOST_REQUIRE_CLOSE(configuration.at(22).at(0), 7, epsilon);\\n\\n BOOST_REQUIRE_CLOSE(configuration.at(13).at(0), 5, epsilon);\\n\\n BOOST_REQUIRE_CLOSE(configuration.at(73).at(0), -3, epsilon);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/UniversalFileLoaderTest.cpp\",\n \"rank\": 43,\n \"score\": 14.499584647583427\n },\n {\n \"content\": \" BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.01f, 0.01f), 1u);\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.02f, 0.01f), 2u);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(test_angle_middle) {\\n\\n const float EPSILON = 0.01f;\\n\\n const float r = 10;\\n\\n const float maxDistance = 20.f;\\n\\n const float accuracy = 0.1f;\\n\\n \\n\\n float distanceSign = 1;\\n\\n\\n\\n for (int i = 0; i < 360; i++) {\\n\\n const float angle1 = (i + 45) * 0.0174532925;\\n\\n const float angle2 = (i + 135) * 0.0174532925;\\n\\n const float x1 = r * std::cos(angle1);\\n\\n const float y1 = r * std::sin(angle1);\\n\\n const float x2 = r * std::cos(angle2);\\n\",\n \"file_path\": \"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp\",\n \"rank\": 44,\n \"score\": 14.474039325348091\n },\n {\n \"content\": \" if (signal1.getPM().getSide() == JPetPM::SideA) {\\n\\n signalA = signal1;\\n\\n signalB = signal2;\\n\\n } else {\\n\\n signalA = signal2;\\n\\n signalB = signal1;\\n\\n }\\n\\n auto radius = signalA.getPM().getBarrelSlot().getLayer().getRadius();\\n\\n auto theta = TMath::DegToRad() * signalA.getPM().getBarrelSlot().getTheta();\\n\\n auto velocity = UniversalFileLoader::getConfigurationParameter(\\n\\n velocitiesMap, getProperChannel(signalA)\\n\\n );\\n\\n checkTheta(theta);\\n\\n\\n\\n JPetHit hit;\\n\\n hit.setSignalA(signalA);\\n\\n hit.setSignalB(signalB);\\n\\n hit.setTime((signalA.getTime() + signalB.getTime()) / 2.0);\\n\\n hit.setQualityOfTime(-1.0);\\n\\n hit.setTimeDiff(signalB.getTime() - signalA.getTime());\\n\",\n \"file_path\": \"LargeBarrelAnalysis/HitFinderTools.cpp\",\n \"rank\": 45,\n \"score\": 14.424227693923761\n },\n {\n \"content\": \" BOOST_REQUIRE_EQUAL(results1[234].size(), 3);\\n\\n BOOST_REQUIRE_EQUAL(results2[234].size(), 3);\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(buildRawSignals_empty)\\n\\n{\\n\\n JPetStatistics stats;\\n\\n std::vector<JPetSigCh> sigChByPM;\\n\\n auto results = SignalFinderTools::buildRawSignals(\\n\\n sigChByPM, 5.0, 5.0, stats, false\\n\\n );\\n\\n BOOST_REQUIRE(results.empty());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(buildRawSignals_one_signal) {\\n\\n JPetStatistics stats;\\n\\n JPetBarrelSlot bs1(1, true, \\\"some_slot\\\", 57.7, 123);\\n\\n JPetPM pm1(1, \\\"first\\\");\\n\\n pm1.setBarrelSlot(bs1);\\n\\n JPetSigCh sigCh1(JPetSigCh::Leading, 10);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/SignalFinderToolsTest.cpp\",\n \"rank\": 46,\n \"score\": 14.377741937844704\n },\n {\n \"content\": \" map<unsigned int, vector<double>>& thresholdsMap,\\n\\n JPetSigCh::EdgeType edge, bool setTHRValuesFromChannels\\n\\n) {\\n\\n JPetSigCh sigCh;\\n\\n sigCh.setValue(1000.*(tdcChannelTime\\n\\n + UniversalFileLoader::getConfigurationParameter(timeCalibrationMap, channel.getChannel())\\n\\n ));\\n\\n sigCh.setType(edge);\\n\\n sigCh.setTOMBChannel(channel);\\n\\n sigCh.setPM(channel.getPM());\\n\\n sigCh.setFEB(channel.getFEB());\\n\\n sigCh.setTRB(channel.getTRB());\\n\\n sigCh.setDAQch(channel.getChannel());\\n\\n sigCh.setThresholdNumber(channel.getLocalChannelNumber());\\n\\n if(setTHRValuesFromChannels) {\\n\\n sigCh.setThreshold(channel.getThreshold());\\n\\n } else {\\n\\n sigCh.setThreshold(\\n\\n UniversalFileLoader::getConfigurationParameter(thresholdsMap, channel.getChannel())\\n\\n );\\n\\n }\\n\\n return sigCh;\\n\\n}\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp\",\n \"rank\": 47,\n \"score\": 14.321017928654936\n },\n {\n \"content\": \"\\n\\nBOOST_AUTO_TEST_CASE(matchAllSignals_test_refDetID)\\n\\n{\\n\\n JPetBarrelSlot slot(1, true, \\\"one\\\", 15.0, 1);\\n\\n JPetBarrelSlot refSlot(193, true, \\\"refDet\\\", 15.0, 1);\\n\\n JPetPM pm(11, \\\"first\\\");\\n\\n JPetPM refPM(385, \\\"reference\\\");\\n\\n pm.setBarrelSlot(slot);\\n\\n refPM.setBarrelSlot(refSlot);\\n\\n JPetPhysSignal physSig1, physSig2, physSig3;\\n\\n physSig1.setBarrelSlot(slot);\\n\\n physSig2.setBarrelSlot(refSlot);\\n\\n physSig3.setBarrelSlot(refSlot);\\n\\n physSig1.setPM(pm);\\n\\n physSig2.setPM(refPM);\\n\\n physSig3.setPM(refPM);\\n\\n physSig1.setTime(1.0);\\n\\n physSig2.setTime(2.0);\\n\\n physSig3.setTime(3.0);\\n\\n std::vector<JPetPhysSignal> slotSignals;\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp\",\n \"rank\": 48,\n \"score\": 14.307804276716565\n },\n {\n \"content\": \" for (int x = 0; x < imageSize; x++)\\n\\n {\\n\\n for (int y = 0; y < imageSize; y++) { reconstructedProjection(y, x) *= M_PI / 360.; }\\n\\n }\\n\\n rescaleFunc(reconstructedProjection, rescaleMinCutoff, rescaleFactor);\\n\\n return reconstructedProjection;\\n\\n}\\n\\n\\n\\nJPetSinogramType::SparseMatrix JPetRecoImageTools::backProjectMatlab(const JPetSinogramType::Matrix3D& sinogram, float sinogramAccuracy, float tofWindow,\\n\\n float lorTOFSigma, FilteredBackProjectionWeightingFunction fbpwf, RescaleFunc rescaleFunc,\\n\\n int rescaleMinCutoff, int rescaleFactor)\\n\\n{\\n\\n if (sinogram.size() == 0)\\n\\n return JPetSinogramType::SparseMatrix(0, 0);\\n\\n const auto sinogramBegin = sinogram.cbegin();\\n\\n const int projectionLenght = sinogramBegin->second.size1();\\n\\n const int projectionAngles = sinogramBegin->second.size2();\\n\\n const double angleStep = M_PI / (double)projectionAngles;\\n\\n\\n\\n const int N = 2 * std::floor((double)projectionLenght / (2. * std::sqrt(2)));\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageTools.cpp\",\n \"rank\": 49,\n \"score\": 14.284457795598964\n },\n {\n \"content\": \" if(rawSignal.getRecoFlag()==JPetBaseSignal::Good){\\n\\n getStatistics().fillHistogram(\\\"good_vs_bad_signals\\\", 1);\\n\\n for(unsigned int i=0;i<leads.size();i++){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_good\\\", 2*i+1);\\n\\n }\\n\\n for(unsigned int i=0;i<trails.size();i++){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_good\\\", 2*(i+1));\\n\\n }\\n\\n } else if(rawSignal.getRecoFlag()==JPetBaseSignal::Corrupted){\\n\\n\\t //\\n\\n\\t int PMid = leads.at(0).getPM().getID();\\n\\n\\t \\n\\n\\t getStatistics().fillHistogram(\\\"PmIdCorrupted\\\", PMid);\\n\\n getStatistics().fillHistogram(\\\"good_vs_bad_signals\\\", 2);\\n\\n for(unsigned int i=0;i<leads.size();i++){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr\\\", 2*i+1);\\n\\n if(leads.at(i).getRecoFlag()==JPetSigCh::Good){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr_sigch_good\\\", 2*i+1);\\n\\n } else if(leads.at(i).getRecoFlag()==JPetSigCh::Corrupted){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr_sigch_corr\\\", 2*i+1);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalTransformer.cpp\",\n \"rank\": 50,\n \"score\": 14.277748136198081\n },\n {\n \"content\": \" int layer = -1;\\n\\n int slot = -1;\\n\\n char side = 'A';\\n\\n int thr = -1;\\n\\n vector<double> inputParameters = {0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0};\\n\\n istringstream stream(input);\\n\\n stream >> layer >> slot >> side >> thr\\n\\n >> inputParameters.at(0) >> inputParameters.at(1) >> inputParameters.at(2)\\n\\n >> inputParameters.at(3) >> inputParameters.at(4) >> inputParameters.at(5)\\n\\n >> inputParameters.at(6) >> inputParameters.at(7);\\n\\n if (stream.fail() || (side != 'A' && side != 'B')) return false;\\n\\n else {\\n\\n outRecord.layer = layer;\\n\\n outRecord.slot = slot;\\n\\n if (side == 'A') outRecord.side = JPetPM::SideA;\\n\\n else outRecord.side = JPetPM::SideB;\\n\\n outRecord.thresholdNumber = thr;\\n\\n outRecord.parameters = inputParameters;\\n\\n return true;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"LargeBarrelAnalysis/UniversalFileLoader.cpp\",\n \"rank\": 51,\n \"score\": 14.275677279217163\n },\n {\n \"content\": \" getStatistics().createHistogram(new TH1D(\\\"annihilation_point_z\\\",\\n\\n \\\"Annihilation point Z\\\",\\n\\n fZRange, -fZRange, fZRange));\\n\\n\\n\\n getStatistics().createHistogram(new TH1D(\\\"annihilation_point_z_cutted\\\",\\n\\n \\\"Annihilation point Z\\\",\\n\\n fZRange, -fZRange, fZRange));\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool ImageReco::exec()\\n\\n{\\n\\n if (const auto &timeWindow = dynamic_cast<const JPetTimeWindow *const>(fEvent))\\n\\n {\\n\\n unsigned int numberOfEventsInTimeWindow = timeWindow->getNumberOfEvents();\\n\\n for (unsigned int i = 0; i < numberOfEventsInTimeWindow; i++)\\n\\n {\\n\\n auto event = dynamic_cast<const JPetEvent &>(timeWindow->operator[](static_cast<int>(i)));\\n\\n auto numberOfHits = event.getHits().size();\\n\",\n \"file_path\": \"ImageReconstruction/ImageReco.cpp\",\n \"rank\": 52,\n \"score\": 14.136689056779321\n },\n {\n \"content\": \" if (trailTime > maxTime || trailTime < minTime ) { continue; }\\n\\n auto trailSigCh = generateSigCh(\\n\\n trailTime, tombChannel, timeCalibrationMap, thresholdsMap,\\n\\n JPetSigCh::Trailing, setTHRValuesFromChannels\\n\\n );\\n\\n allTDCSigChs.push_back(trailSigCh);\\n\\n if (saveHistos){\\n\\n stats.fillHistogram(Form(\\\"pm_occupation_thr%d\\\", tombChannel.getLocalChannelNumber()),\\n\\n tombChannel.getPM().getID());\\n\\n }\\n\\n }\\n\\n return allTDCSigChs;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Method for investigation of repetated edges - setting RecoFlag for each SigCh.\\n\\n * SigChs are flagged as GOOD if they appear in the sequence LTLTLTLT ->\\n\\n * in other words, each found LT pair is marked as GOOD. If sequence of one type of\\n\\n * the edge is encountered, repeated ones are flagged CORRUPTED. Examples:\\n\\n * edge type -> LTLTLT LLT LLTT LLLLTTTT LLTTLTLTTTLLLLTT\\n\",\n \"file_path\": \"LargeBarrelAnalysis/TimeWindowCreatorTools.cpp\",\n \"rank\": 53,\n \"score\": 14.117021650393113\n },\n {\n \"content\": \" 4, cos, sin, imageSize, center, length, matrixGet),\\n\\n 15, epsilon); // 5 + 4 + 3 + 2 + 1\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(projection4)\\n\\n{\\n\\n double epsilon = 0.00001;\\n\\n JPetRecoImageTools::Matrix2D matrix = {\\n\\n {1, 10, 100, 1000, 10000, 100000, 1000000},\\n\\n {2, 20, 200, 2000, 20000, 200000, 2000000},\\n\\n {3, 30, 300, 3000, 30000, 300000, 3000000},\\n\\n {4, 40, 400, 4000, 40000, 400000, 4000000},\\n\\n {5, 50, 500, 5000, 50000, 500000, 5000000},\\n\\n {6, 60, 600, 6000, 60000, 600000, 6000000},\\n\\n {7, 70, 700, 7000, 70000, 700000, 7000000}\\n\\n };\\n\\n int imageSize = matrix.size();\\n\\n double center = (float)(imageSize - 1) / 2.0;\\n\\n double length = center * center;\\n\\n std::function< double(int, int) > matrixGet;\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp\",\n \"rank\": 54,\n \"score\": 14.0667316648606\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE SinogramCreatorTest\\n\\n#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"../SinogramCreatorTools.h\\\"\\n\\n#include <iostream>\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(FirstSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(roundToNearesMultiplicity_test) {\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.0f, 1.f), 0u);\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.4f, 1.f), 0u);\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.5f, 1.f), 1u);\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(30.f, 1.f), 30u);\\n\\n BOOST_REQUIRE_EQUAL(\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(0.00f, 0.01f), 0u);\\n\",\n \"file_path\": \"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp\",\n \"rank\": 55,\n \"score\": 14.06310799028819\n },\n {\n \"content\": \"//nevertheless it's needed for checking if the structure of project is correct\\n\\n#define override\\n\\n#endif\\n\\n\\n\\n#include \\\"JPetUserTask/JPetUserTask.h\\\"\\n\\n#include <memory>\\n\\n\\n\\n/**\\n\\n * @brief Image reconstruction module which should be used for quick, rough data tests.\\n\\n *\\n\\n * It implements a simple image reconstruction algorithm adapted from G. Korcyl's code.\\n\\n * It is equivalent to one back-projection without any filtering but including TOF information,\\n\\n * with the assumption that TOF error = 0. Before reconstructruction, the data are not preselected\\n\\n * it should be preselected using FilterEvents Task.\\n\\n * The point of annihilation is reconstructed for all combination of registered hits in given events.\\n\\n * Additional optional options:\\n\\n * - ImageReco_Annihilation_Point_Z_float\\n\\n * - ImageReco_Xrange_On_3D_Histogram_int\\n\\n * - ImageReco_Yrange_On_3D_Histogram_int\\n\\n * - ImageReco_Zrange_On_3D_Histogram_int\\n\\n * - ImageReco_Bin_Multiplier_double\\n\\n */\\n\",\n \"file_path\": \"ImageReconstruction/ImageReco.h\",\n \"rank\": 56,\n \"score\": 13.999653401099762\n },\n {\n \"content\": \" getStatistics().getObject<TH1I>(\\\"number_of_hits_filtered_by_condition\\\")->Fill(\\\"Cut on delta angle\\\", 1);\\n\\n getStatistics().getObject<TH1I>(\\\"number_of_hits_filtered_by_condition\\\")->Fill(\\\"Cut on first hit TOT\\\", 1);\\n\\n getStatistics().getObject<TH1I>(\\\"number_of_hits_filtered_by_condition\\\")->Fill(\\\"Cut on second hit TOT\\\", 1);\\n\\n getStatistics().getObject<TH1I>(\\\"number_of_hits_filtered_by_condition\\\")->Fill(\\\"Cut on annihilation point Z\\\", 1);\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool FilterEvents::exec()\\n\\n{\\n\\n if (const auto& timeWindow = dynamic_cast<const JPetTimeWindow* const>(fEvent)) {\\n\\n unsigned int numberOfEventsInTimeWindow = timeWindow->getNumberOfEvents();\\n\\n for (unsigned int i = 0; i < numberOfEventsInTimeWindow; i++) {\\n\\n auto event = dynamic_cast<const JPetEvent&>(timeWindow->operator[](static_cast<int>(i)));\\n\\n auto numberOfHits = event.getHits().size();\\n\\n if (numberOfHits <= 1)\\n\\n continue;\\n\\n else {\\n\\n auto hits = event.getHits();\\n\\n for (unsigned int i = 0; i < hits.size() - 1; i++) {\\n\",\n \"file_path\": \"ImageReconstruction/FilterEvents.cpp\",\n \"rank\": 57,\n \"score\": 13.96828816992743\n },\n {\n \"content\": \"\\n\\n\\n\\nJPetSinogramType::SparseMatrix JPetRecoImageTools::backProject(const JPetSinogramType::Matrix3D& sinogram, float sinogramAccuracy, float tofWindow,\\n\\n float lorTOFSigma, FilteredBackProjectionWeightingFunction fbpwf,\\n\\n RescaleFunc rescaleFunc, int rescaleMinCutoff, int rescaleFactor)\\n\\n{\\n\\n if (sinogram.size() == 0)\\n\\n return JPetSinogramType::SparseMatrix(0, 0);\\n\\n const auto sinogramBegin = sinogram.cbegin();\\n\\n int imageSize = sinogramBegin->second.size1();\\n\\n double center = (double)(imageSize - 1) / 2.0;\\n\\n double center2 = center * center;\\n\\n double angleStep = M_PI / (double)sinogramBegin->second.size2();\\n\\n\\n\\n JPetSinogramType::SparseMatrix reconstructedProjection(imageSize, imageSize);\\n\\n const double speed_of_light = 2.99792458 * sinogramAccuracy; // in reconstruction space, accuracy * ps/cm\\n\\n\\n\\n const int max_sigma_multi = 3;\\n\\n\\n\\n for (int angle = 0; angle < sinogramBegin->second.size2(); angle++)\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageTools.cpp\",\n \"rank\": 58,\n \"score\": 13.878744032409815\n },\n {\n \"content\": \"\\tbuf << strip << \\\"_\\\" << thresholdLabel;\\n\\n\\tc->SaveAs( (buf.str() + \\\".png\\\").c_str() );\\n\\n\\tstd::pair<double,double> resultOfFit = std::make_pair<double,double> ( (fit->GetParameter(1))*-0.2, (fit->GetParError(1))*-0.2 );\\n\\n\\treturn resultOfFit;\\n\\n}\\n\\n\\n\\nbool ifScintillatorIsIn( std::vector<scintData>& data, int ID)\\n\\n{\\n\\n\\tfor( auto scintillator : data )\\n\\n\\t{\\n\\n\\t\\tif( ID == scintillator.ID )\\n\\n\\t\\t\\treturn true;\\n\\n\\t}\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nint findScintillatorIn( std::vector<scintData>& data, int ID)\\n\\n{\\n\\n\\tfor( unsigned int i = 0; i < data.size(); i++ )\\n\\n\\t{\\n\",\n \"file_path\": \"VelocityCalibration/estimateVelocity.cpp\",\n \"rank\": 59,\n \"score\": 13.846879208178517\n },\n {\n \"content\": \"using namespace std;\\n\\nSDARecoDrawAllCharges::SDARecoDrawAllCharges(const char *name)\\n\\n : JPetUserTask(name) {}\\n\\nSDARecoDrawAllCharges::~SDARecoDrawAllCharges() {}\\n\\n\\n\\nbool SDARecoDrawAllCharges::init() {\\n\\n DEBUG(\\\"bool SDARecoDrawAllCharges::init\\\");\\n\\n const auto ¶mBank = getParamBank();\\n\\n fNumberOfPMTs = paramBank.getPMsSize();\\n\\n for (const auto &id_pm_pair : getParamBank().getPMs()) {\\n\\n fIDs.push_back(id_pm_pair.first);\\n\\n std::vector<double> k;\\n\\n fCharges[id_pm_pair.first] = k;\\n\\n }\\n\\n fOutputEvents = new JPetTimeWindow(\\\"JPetRecoSignal\\\");\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SDARecoDrawAllCharges::exec() {\\n\\n DEBUG(\\\"bool SDARecoDrawAllCharges::exec\\\");\\n\",\n \"file_path\": \"modules/SDA/JPetRecoDrawAllCharges/SDARecoDrawAllCharges.cpp\",\n \"rank\": 60,\n \"score\": 13.78209511238317\n },\n {\n \"content\": \" const float y2 = r * std::sin(angle2);\\n\\n const auto result = SinogramCreatorTools::getSinogramRepresentation(\\n\\n x1, y1, x2, y2, maxDistance, accuracy,\\n\\n std::ceil(maxDistance * 2.f * (1.f / accuracy)), 180);\\n\\n int resultAngle =\\n\\n i < 90 ? 90 + i : i < 180 ? i - 90 : i < 270 ? i - 90 : i - 270;\\n\\n BOOST_REQUIRE_EQUAL(result.second, resultAngle);\\n\\n if(i > 0 && i <= 180)\\n\\n distanceSign = -1;\\n\\n else\\n\\n distanceSign = 1;\\n\\n const float distanceResult =\\n\\n SinogramCreatorTools::roundToNearesMultiplicity(maxDistance + distanceSign * (r / std::sqrt(2)), accuracy);\\n\\n \\n\\n\\n\\n BOOST_REQUIRE_CLOSE(result.first, distanceResult, EPSILON);\\n\\n }\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(test_lor_slice) {\\n\",\n \"file_path\": \"ImageReconstruction/tests/SinogramCreatorToolsTest.cpp\",\n \"rank\": 61,\n \"score\": 13.76305430045695\n },\n {\n \"content\": \" }\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool MLEMRunner::terminate()\\n\\n{\\n\\n INFO(\\\"Reconstructed \\\" + std::to_string(fReconstructedEvents) + \\\" events out of \\\" + std::to_string(fReconstructedEvents + fMissedEvents) +\\n\\n \\\" total(\\\" + std::to_string(fMissedEvents) + \\\" missed)\\\");\\n\\n runReconstruction();\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool MLEMRunner::parseEvent(const JPetEvent& event)\\n\\n{\\n\\n const auto hits = event.getHits();\\n\\n if (hits.size() != 2) {\\n\\n return false;\\n\\n }\\n\\n const float x1 = hits[0].getPosX();\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.cpp\",\n \"rank\": 62,\n \"score\": 13.730287804673775\n },\n {\n \"content\": \"}\\n\\n\\n\\nbool TimeCalibration::terminate()\\n\\n{\\n\\n fitAndSaveParametersToFile(fTimeConstantsCalibFileName, fTimeConstantsCalibFileNameTmp);\\n\\n if (CheckIfExit(Niter)) {\\n\\n auto newOpts = getOptions();\\n\\n newOpts[\\\"StopIteration_bool\\\"] = true;\\n\\n fParams = JPetParams(newOpts, fParams.getParamManagerAsShared());\\n\\n}\\n\\n return true;\\n\\n}\\n\\nbool TimeCalibration::CheckIfExit(int Niter)\\n\\n{\\n\\n if(Niter>=NiterMax){\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n return false; \\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.cpp\",\n \"rank\": 63,\n \"score\": 13.71634225471987\n },\n {\n \"content\": \" * \\\"MLEMRunner_PixelSize_double\\\" : size of single pixel (in meters: e.g: 0.004 means 1 px corresponds 4mm)\\n\\n * \\\"MLEMRunner_StartPixelForPartialMatrix_int\\\" : start pixel for system matrix\\n\\n * \\\"MLEMRunner_NumberOfEmissionsPerPixel_int\\\" : number of emmisions per pixel for system matrix\\n\\n * \\\"MLEMRunner_TOFStepSize_double\\\" : TOF step size\\n\\n * \\\"MLEMRunner_DisplayInfo_bool\\\" : if true prints extra information about reconstruction on terminal\\n\\n * \\\"MLEMRunner_SystemMatrixOutputPath_std::string\\\" : path where system matrix will be/is saved\\n\\n * \\\"MLEMRunner_SystemMatrixSaveFull_bool\\\" : if true full system matrix will be saved\\n\\n * \\\"MLEMRunner_ReconstructionOutputPath_std::string\\\" : path where reconstructed image will be saved\\n\\n * \\\"MLEMRunner_ReconstuctionIterations_int\\\" : number of iterations in reconstruction\\n\\n * \\\"MLEMRunner_TOFSigmaAlongZAxis_float\\\" : error of measurement of Z position along scintillator in meters\\n\\n * \\\"MLEMRunner_TOFSigmaAxis_float\\\" : error of measurement TOF along LOR (or TOR in case of 3D) in meters\\n\\n */\\n\\n\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.h\",\n \"rank\": 64,\n \"score\": 13.702346145944711\n },\n {\n \"content\": \" auto opts = getOptions();\\n\\n if (isOptionSet(opts, kOutFileNameKey)) {\\n\\n fOutFileName = getOptionAsString(opts, kOutFileNameKey);\\n\\n }\\n\\n\\n\\n fOutputStream.open(fOutFileName, std::ofstream::out | std::ofstream::app);\\n\\n std::vector<float> radius;\\n\\n radius.reserve(3);\\n\\n std::vector<int> scintillators;\\n\\n scintillators.reserve(3);\\n\\n\\n\\n const std::vector<float> rotation{0.f, 0.5f, 0.5f}; // rotation for BigBarrel\\n\\n\\n\\n const JPetParamBank& bank = getParamBank();\\n\\n const JPetGeomMapping mapping(bank);\\n\\n for (unsigned int i = 1; i < mapping.getLayersCount(); i++) {\\n\\n radius.push_back(mapping.getRadiusOfLayer(i) * kCentimetersToMeters);\\n\\n scintillators.push_back(static_cast<int>(mapping.getSlotsCount(i)));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.cpp\",\n \"rank\": 65,\n \"score\": 13.67774957006402\n },\n {\n \"content\": \" fHitsArray)); // create LORs from Hits from the same Time Window\\n\\n } else {\\n\\n return false;\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SDAMatchLORs::terminate() {\\n\\n int fEventNb = fCurrentEventNumber;\\n\\n INFO(Form(\\\"Matching complete \\\\nAmount of LORs mathed: %d out of %d hits\\\",\\n\\n fMatched, fEventNb));\\n\\n double goodPercent = fMatched * 100.0 / fEventNb;\\n\\n INFO(Form(\\\"%f %% of data was matched \\\\n \\\", goodPercent));\\n\\n return true;\\n\\n}\\n\\n\\n\\nvector<JPetLOR> SDAMatchLORs::createLORs(vector<JPetHit> &hits) {\\n\\n vector<JPetLOR> lors;\\n\\n for (auto i = hits.begin(); i != hits.end(); ++i) {\\n\\n for (auto j = i + 1; j != hits.end(); ++j) {\\n\",\n \"file_path\": \"modules/SDA/JPetMatchLORs/SDAMatchLORs.cpp\",\n \"rank\": 66,\n \"score\": 13.628598460704149\n },\n {\n \"content\": \" if (auto oldTimeWindow = dynamic_cast<const JPetTimeWindow *const>(fEvent)) {\\n\\n auto n = oldTimeWindow->getNumberOfEvents();\\n\\n for (uint i = 0; i < n; ++i) {\\n\\n auto signal =\\n\\n dynamic_cast<const JPetRecoSignal &>(oldTimeWindow->operator[](i));\\n\\n fCharges[signal.getPM().getID()].push_back(signal.getCharge());\\n\\n }\\n\\n } else {\\n\\n return false;\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SDARecoDrawAllCharges::terminate() {\\n\\n DEBUG(\\\"bool SDARecoDrawAllCharges::terminate\\\");\\n\\n auto c1 = new TCanvas();\\n\\n // looking for max and min value for all offsets\\n\\n double maximum = -1.e20;\\n\\n double minimum = 1.e20;\\n\\n for (const auto &id_vec_pair : fCharges) {\\n\",\n \"file_path\": \"modules/SDA/JPetRecoDrawAllCharges/SDARecoDrawAllCharges.cpp\",\n \"rank\": 67,\n \"score\": 13.594304329573305\n },\n {\n \"content\": \"Aim\\n\\n---\\n\\nThis is an example analysis producing J-PET time calibration using data taken with a reference detector with option of iterative calibration constants determination. \\n\\n\\n\\nInput Data\\n\\n-----------\\n\\nFor a single execution of the program, a HLD file should be used, recorded when a single scintillator strip of the J-PET barrel was targeted by the reference detector.\\n\\n\\n\\nExpected output\\n\\n---------------\\n\\nNo output to stdout.\\n\\nJPet.log file appears with the log of the processing and ROOT files with the following etensions are produced:\\n\\n *.tslot.raw.root\\n\\n *.raw.sig.root\\n\\n *.phys.sig.root\\n\\n *.hits.root\\n\\n *.calib.root\\n\\nwhere \\\"*\\\" stands for the name of the output file (constructed as LayerId_slotId_FileId, e.g. for the first file measured for first scintillator in the first layer: \\\"Layer1_slot01_1\\\")\\n\\n\\n\\nMoreover, a text file \\\"TimeConstantsCalib.txt\\\" is created in the working directory, which contains time calibration information.\\n\\nFor the iterative version we create also temporary file \\\"ScintId_LayerId_TimeConstantsCalibTmp.txt\\\" where we save calibration constants after each iteration\\n\\n(again for the first scintillator in the first layer the filename is 1_1_TimeConstantsCalibTmp.txt.)\\n\\n\\n\\nDescription\\n\\n--------------\\n\\nThe analysis is using the same set of tasks as the \\\"LargeBarrelAnalysis\\\" example up to the level of creation of hits (included). On top of these tasks, an additional module called\\n\\n\\\"TimeCalibration\\\" is run, which prepares spectra of time differences between signals on the left and fight side of a scintillator and determines the necessary shifts of\\n\\ntimes at respective TDC channels.\\n\\n\\n\\nAdditional info\\n\\n--------------\\n\\nIn order to speed up the processing of a single position from a reference detector scan, one can provide a user option indicating which scintillator strip was targeted by the reference detector.\\n\\nThis was, signals from any other strips will be ignored at the lowest possible level, resulting in much faster processing.\\n\\n\\n\\nThis user option is:\\n\",\n \"file_path\": \"TimeCalibration_iter/README.md\",\n \"rank\": 68,\n \"score\": 13.561762586339011\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE SinogramCreatorTest\\n\\n#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"SinogramCreatorTools.h\\\"\\n\\n#include <iostream>\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(FirstSuite)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(roundToNearesMultiplicity_test)\\n\\n{\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.0f, 1.f), 0u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.4f, 1.f), 0u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.5f, 1.f), 1u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(30.f, 1.f), 30u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.00f, 0.01f), 0u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.01f, 0.01f), 1u);\\n\\n BOOST_REQUIRE_EQUAL(SinogramCreatorTools::roundToNearesMultiplicity(0.02f, 0.01f), 2u);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ImageReconstruction/SinogramCreatorToolsTest.cpp\",\n \"rank\": 69,\n \"score\": 13.549932336466233\n },\n {\n \"content\": \" auto n_iterations = fReconstructionIterations;\\n\\n int start_iteration = 0;\\n\\n util::progress progress(fVerbose, n_iterations, 1, start_iteration);\\n\\n\\n\\n for (int block = 0; block < n_blocks; ++block) {\\n\\n for (int i = 0; i < n_iterations_in_block; i++) {\\n\\n const auto iteration = block * n_iterations_in_block + i;\\n\\n if (iteration < start_iteration)\\n\\n continue;\\n\\n progress(iteration);\\n\\n (*fReconstruction)();\\n\\n progress(iteration, true);\\n\\n }\\n\\n const auto iteration = (block + 1) * n_iterations_in_block;\\n\\n if (iteration <= start_iteration)\\n\\n continue;\\n\\n util::nrrd_writer nrrd(fReconstructionOutputPath + \\\"_\\\" + std::to_string(iteration) + \\\".nrrd\\\",\\n\\n fReconstructionOutputPath + \\\"_\\\" + std::to_string(iteration), false);\\n\\n nrrd << fReconstruction->rho;\\n\\n util::obstream bin(fReconstructionOutputPath + \\\"_\\\" + std::to_string(iteration));\\n\\n bin << fReconstruction->rho;\\n\\n }\\n\\n // final reconstruction statistics\\n\\n const auto st = fReconstruction->statistics();\\n\\n std::cerr << \\\" event count = \\\" << st.used_events << std::endl;\\n\\n std::cerr << \\\" voxel count = \\\" << st.used_voxels << \\\"(\\\" << (double)st.used_voxels / st.used_events << \\\" / event)\\\" << std::endl;\\n\\n std::cerr << \\\" pixel count = \\\" << st.used_pixels << \\\"(\\\" << (double)st.used_pixels / st.used_events << \\\" / event)\\\" << std::endl;\\n\\n}\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.cpp\",\n \"rank\": 70,\n \"score\": 13.499894100118915\n },\n {\n \"content\": \" int PMid = hit.getSignalB().getRecoSignal().getRawSignal().getPM().getID();\\n\\n //\\n\\n //taking refference detector hits times (scin=193, Pmt=385)\\n\\n //\\n\\n\\n\\n if (PMid == kPMidRef) {\\n\\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n //\\n\\n for (auto& thr_time_pair : lead_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\\n RefTimeLead[thr] = thr_time_pair.second;\\n\\n\\n\\n }\\n\\n\\n\\n for (auto& thr_time_pair : trail_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\\n RefTimeTrail[thr] = thr_time_pair.second;\\n\\n }\\n\\n fRefTimesL.push_back(RefTimeLead[1]);\\n\",\n \"file_path\": \"TimeCalibration/TimeCalibration.cpp\",\n \"rank\": 71,\n \"score\": 13.497965049109517\n },\n {\n \"content\": \" slotSignals.push_back(physSig2);\\n\\n slotSignals.push_back(physSig3);\\n\\n\\n\\n JPetStatistics stats;\\n\\n std::map<unsigned int, std::vector<double>> velocitiesMap;\\n\\n JPetCachedFunctionParams params(\\\"pol1\\\", {0.0, 10.0});\\n\\n ToTEnergyConverter conv(params, Range(10000, 0., 100.));\\n\\n\\n\\n auto result = HitFinderTools::matchSignals(\\n\\n slotSignals, velocitiesMap, 5.0, false, conv, stats, false\\n\\n );\\n\\n BOOST_REQUIRE(result.empty());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(matchSignals_test)\\n\\n{\\n\\n JPetLayer layer1(1, true, \\\"layer1\\\", 10.0);\\n\\n JPetBarrelSlot slot1(23, true, \\\"barel1\\\", 30.0, 23);\\n\\n slot1.setLayer(layer1);\\n\\n\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp\",\n \"rank\": 72,\n \"score\": 13.406944163188179\n },\n {\n \"content\": \" sigCh.setRecoFlag(JPetSigCh::Good);\\n\\n }\\n\\n\\n\\n if(!useCorrupts && sigCh.getRecoFlag() == JPetSigCh::Corrupted) { continue; }\\n\\n\\n\\n auto search = sigChsPMMap.find(pmtID);\\n\\n if (search == sigChsPMMap.end()) {\\n\\n vector<JPetSigCh> tmp;\\n\\n tmp.push_back(sigCh);\\n\\n sigChsPMMap.insert(pair<int, vector<JPetSigCh>>(pmtID, tmp));\\n\\n } else {\\n\\n search->second.push_back(sigCh);\\n\\n }\\n\\n }\\n\\n return sigChsPMMap;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Method invoking Raw Signal building method for each PM separately\\n\\n */\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 73,\n \"score\": 13.37446026478975\n },\n {\n \"content\": \" map<int, vector<JPetPhysSignal>> signalsBySlot;\\n\\n for (auto const &signal : signals) {\\n\\n int barrelSlotID = signal.getRecoSignal().getBarrelSlot().getID();\\n\\n signalsBySlot[barrelSlotID].push_back(signal);\\n\\n }\\n\\n\\n\\n // discard entries for PMTs with smalller number of signals than two for each\\n\\n // barrel slot since they cannot be merged into JPetHit and later for JPetLOR\\n\\n for (auto it = signalsBySlot.begin(); it != signalsBySlot.end(); ++it) {\\n\\n if (it->second.size() < 2) {\\n\\n signalsBySlot.erase(it);\\n\\n }\\n\\n }\\n\\n\\n\\n // iterate over barrel slots which had a sufficient number\\n\\n // of signals to match a hit\\n\\n for (auto it = signalsBySlot.begin(); it != signalsBySlot.end(); ++it) {\\n\\n vector<JPetHit> hitsFromSingleSlot = matchHitsWithinSlot(it->second);\\n\\n // append the hits found for one specific barrel slot to all hits from this\\n\\n // time window\\n\",\n \"file_path\": \"modules/SDA/JPetMatchHits/SDAMatchHits.cpp\",\n \"rank\": 74,\n \"score\": 13.347729969200405\n },\n {\n \"content\": \" getStatistics().getObject<TH1I>(\\\"number_of_events\\\")->Fill(numberOfHits);\\n\\n if (numberOfHits <= 1)\\n\\n continue;\\n\\n else\\n\\n {\\n\\n auto hits = event.getHits();\\n\\n for (unsigned int i = 0; i < hits.size() - 1; i++)\\n\\n {\\n\\n calculateAnnihilationPoint(hits[i], hits[i + 1]);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n else\\n\\n {\\n\\n ERROR(\\\"Returned event is not TimeWindow\\\");\\n\\n return false;\\n\\n }\\n\\n return true;\\n\\n}\\n\",\n \"file_path\": \"ImageReconstruction/ImageReco.cpp\",\n \"rank\": 75,\n \"score\": 13.301100990885233\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\\n\\n#include <boost/test/unit_test.hpp>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <utility>\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"./JPetFilterCosine.h\\\"\\n\\n#include \\\"./JPetFilterHamming.h\\\"\\n\\n#include \\\"./JPetFilterNone.h\\\"\\n\\n#include \\\"./JPetFilterRamLak.h\\\"\\n\\n#include \\\"./JPetFilterRidgelet.h\\\"\\n\\n#include \\\"./JPetFilterSheppLogan.h\\\"\\n\\n#include \\\"./JPetRecoImageTools.h\\\"\\n\\n#include \\\"JPetCommonTools/JPetCommonTools.h\\\"\\n\\n\\n\\nconst auto inFile = \\\"unitTestData/JPetRecoImageToolsTest/sinogramBackproject.ppm\\\";\\n\\n\\n\\nint getMaxValue(const JPetRecoImageTools::Matrix2DProj& result)\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoSheppLoganThresholdsTest.cpp\",\n \"rank\": 76,\n \"score\": 13.270982547352563\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE JPetRecoImageToolsTests\\n\\n#include <boost/test/unit_test.hpp>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <utility>\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"JPetCommonTools/JPetCommonTools.h\\\"\\n\\n#include \\\"./JPetFilterCosine.h\\\"\\n\\n#include \\\"./JPetFilterHamming.h\\\"\\n\\n#include \\\"./JPetFilterNone.h\\\"\\n\\n#include \\\"./JPetFilterRamLak.h\\\"\\n\\n#include \\\"./JPetFilterRidgelet.h\\\"\\n\\n#include \\\"./JPetFilterSheppLogan.h\\\"\\n\\n#include \\\"./JPetRecoImageTools.h\\\"\\n\\n\\n\\nconst auto inFile = \\\"unitTestData/JPetRecoImageToolsTest/sinogramBackproject.ppm\\\";\\n\\n\\n\\nint getMaxValue(const JPetRecoImageTools::Matrix2DProj& result)\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoTest.cpp\",\n \"rank\": 77,\n \"score\": 13.270982547352562\n },\n {\n \"content\": \" If true generate full system matrix, not faster 1/8 of the system matrix and using symetries reconstruct full matrix\\n\\n\\n\\n- `MLEMRunner_ReconstructionOutputPath_std::string`\\n\\n Path to file where reconstruction will be saved\\n\\n\\n\\n- `MLEMRunner_ReconstuctionIterations_int`\\n\\n Number of MLEM iterations\\n\\n\\n\\n- `ImageReco_Annihilation_Point_Z_float`\\n\\n Maximum value of Z of reconstructed annihilation point to be included in reconstruction\\n\\n\\n\\n- `ImageReco_Xrange_On_3D_Histogram_int`\\n\\n Range of X axis on 3D Histogram\\n\\n\\n\\n- `ImageReco_Yrange_On_3D_Histogram_int`\\n\\n Range of Y axis on 3D Histogram\\n\\n\\n\\n- `ImageReco_Zrange_On_3D_Histogram_int`\\n\\n Range of Z axis on 3D Histogram\\n\\n\\n\\n- `ImageReco_Bin_Multiplier_double`\\n\\n Used to decrease size of bin, if bin multiplier is 1: 1 bin correspondes to 1 cm.\\n\\n\\n\\n- `SinogramCreator_OutFileName_std::string`\\n\\n Path to file where sinogram will be saved.\\n\\n\\n\\n- `SinogramCreator_ReconstructionDistanceAccuracy_float`\\n\\n Used to decrease size of bin, if reconstruction distance accuracy is 1: 1 bin correspondes to 1cm\\n\\n\\n\\n- `SinogramCreator_SinogramZSplitNumber_int`\\n\\n Number of sinograms along Z axis. Z axis is divided by this number and then evenly split.\\n\\n\\n\\n- `SinogramCreator_ScintillatorLenght_float`\\n\\n Lenght of the scintillator. [cm]\\n\\n\\n\\n- `SinogramCreatorMC_OutFileName_std::string`\\n\\n Path to file where sinogram will be saved.\\n\\n\\n\\n- `SinogramCreatorMC_ReconstructionDistanceAccuracy_float`\\n\\n Used to decrease size of bin, if reconstruction distance accuracy is 1: 1 bin correspondes to 1cm\\n\\n\\n\\n- `SinogramCreatorMC_SinogramZSplitNumber_int`\\n\\n Number of sinograms along Z axis. Z axis is divided by this number and then evenly split.\\n\\n\\n\\n- `SinogramCreatorMC_ScintillatorLenght_float`\\n\\n Lenght of the scintillator. [cm]\\n\\n\\n\\n- `SinogramCreatorMC_MaxReconstructionRadius_float`\\n\\n Maximal possible reconstruction radius. [cm]\\n\\n\\n\\n- `SinogramCreatorMC_InputDataPath_std::string`\\n\\n Path to file where input data is stored.\\n\",\n \"file_path\": \"ImageReconstruction/PARAMETERS.md\",\n \"rank\": 78,\n \"score\": 13.267429366375119\n },\n {\n \"content\": \"--- Default value: 192\\n\\n\\n\\nNumber_of_points_to_filter_int\\n\\n--- Number of points that linear filter should work on. Filter is used to smooth derivatives and to estimate corrections better\\n\\n--- Default value: 6\\n\\n\\n\\nThreshold_for_derivative_int\\n\\n--- Value used for finding the first estimation of the extremum on the derivatives. If it is too high, Calibrate.exe would\\n\\nshow for many modules that the threshold is too high. If it is too low, extremum estimates will be wrongly estimated.\\n\\n--- Default value: 6\\n\\n\\n\\nEffective_Length_float\\n\\n--- Value of the effective length that are used to estimate velocity of every module. It can be changed and different PALS\\n\\ncorrections can be calculated. So, the effective length scan can be done from the EventFinder taks, speeding up the whole process\\n\\n\\n\\n-------------------------effLenParams.json-------------------------\\n\\n\\n\\nNumber_of_files_int\\n\\n--- Number of files that are used for the effective length scan. Every file should ocrrespond to different effective length value\\n\\nfor which calibration was done. It is used to scan the effLenParams.json file in order to find every file and length. \\n\\nIf the number will be equal to 3, EstimateEffectiveLength.exe will look for options:\\n\\nFile_1_std::string\\n\\nFile_2_std::string\\n\\nFile_3_std::string\\n\\nLength_1_float\\n\\nLength_2_float\\n\\nLength_3_float\\n\\nif it will be equal to 2:\\n\\nFile_1_std::string\\n\\nFile_2_std::string\\n\\nLength_1_float\\n\\nLength_2_float\\n\\nso the number of options are fluent and can change with different number of files\\n\\n\\n\\nFile_%d_std::string\\n\\n--- Path to and name of a `txt` file that contains corrections for a given effective length indicated by \\n\\nLength_%d_float option. %d should be equal to the number of a given file, for example: File_1_std::string\\n\\n\\n\\nLength_%d_float\\n\\n--- value of a effective length that was used during calibration. %d should be equal to the number of a given file\\n\",\n \"file_path\": \"TimeCalibration_lifetime/PARAMETERS.md\",\n \"rank\": 79,\n \"score\": 13.25426386114881\n },\n {\n \"content\": \" std::map<int, double> leadingPoints, trailingPoints;\\n\\n leadingPoints = signal.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n trailingPoints = signal.getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n for (int i = 1; i < 5; i++) {\\n\\n auto leadSearch = leadingPoints.find(i);\\n\\n auto trailSearch = trailingPoints.find(i);\\n\\n\\n\\n if (leadSearch != leadingPoints.end() && trailSearch != trailingPoints.end())\\n\\n tot += (trailSearch->second - leadSearch->second);\\n\\n }\\n\\n return tot / 1000.;\\n\\n}\\n\\n\\n\\nvoid FilterEvents::setUpOptions()\\n\\n{\\n\\n auto opts = getOptions();\\n\\n\\n\\n if (isOptionSet(opts, kCutOnZValueKey)) {\\n\\n fCutOnZValue = getOptionAsFloat(opts, kCutOnZValueKey);\\n\\n }\\n\",\n \"file_path\": \"ImageReconstruction/FilterEvents.cpp\",\n \"rank\": 80,\n \"score\": 13.248660836640846\n },\n {\n \"content\": \" }\\n\\n }\\n\\n // Adding created Raw Signal to vector\\n\\n rawSigVec.push_back(rawSig);\\n\\n thrLeadingSigCh.at(0).erase(thrLeadingSigCh.at(0).begin());\\n\\n }\\n\\n // Filling control histograms\\n\\n if(saveHistos){\\n\\n for(unsigned int jj=0;jj<kNumberOfThresholds;jj++){\\n\\n for(auto sigCh : thrLeadingSigCh.at(jj)){\\n\\n stats.fillHistogram(\\\"unused_sigch_all\\\", 2*sigCh.getThresholdNumber()-1);\\n\\n if(sigCh.getRecoFlag()==JPetSigCh::Good){\\n\\n stats.fillHistogram(\\\"unused_sigch_good\\\", 2*sigCh.getThresholdNumber()-1);\\n\\n } else if(sigCh.getRecoFlag()==JPetSigCh::Corrupted){\\n\\n stats.fillHistogram(\\\"unused_sigch_corr\\\", 2*sigCh.getThresholdNumber()-1);\\n\\n }\\n\\n }\\n\\n for(auto sigCh : thrTrailingSigCh.at(jj)){\\n\\n stats.fillHistogram(\\\"unused_sigch_all\\\", 2*sigCh.getThresholdNumber());\\n\\n if(sigCh.getRecoFlag()==JPetSigCh::Good){\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 81,\n \"score\": 13.248516387959569\n },\n {\n \"content\": \" * between layer, barrel slot, PM side, threshold and TOMB channel number.\\n\\n */\\n\\nUniversalFileLoader::TOMBChToParameter UniversalFileLoader::loadConfigurationParameters(\\n\\n const std::string& confFile,\\n\\n const UniversalFileLoader::TOMBChMap& tombMap)\\n\\n{\\n\\n INFO(\\\"Loading parameters from file: \\\" + confFile);\\n\\n if (!boost::filesystem::exists(confFile)) {\\n\\n ERROR(\\\"Configuration file does not exist: \\\" + confFile + \\\" Returning empty configuration.\\\");\\n\\n TOMBChToParameter cofigurationParamteres;\\n\\n return cofigurationParamteres;\\n\\n }\\n\\n auto confRecords = readConfigurationParametersFromFile(confFile);\\n\\n return generateConfigurationParameters(confRecords, tombMap);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Method generates a dependedce map between TOMB channel numbers and\\n\\n * configuration paramters. Arguments: vector of configuration records,\\n\\n * map of TOMBs with dependency between layer, barrel slot, PM side, threshold\\n\",\n \"file_path\": \"LargeBarrelAnalysis/UniversalFileLoader.cpp\",\n \"rank\": 82,\n \"score\": 13.143244579388517\n },\n {\n \"content\": \" epsilon); // 3* 0.6 + 4 * 0.4\\n\\n auto getterT =\\n\\n JPetRecoImageTools::matrixGetterFactory(matrix, true); /// transposed\\n\\n /// first argument is j second i (j,i)\\n\\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(0, 0, getterT), 1, epsilon);\\n\\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(1, 0, getterT), 2, epsilon);\\n\\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::linear(0, 0.6, getterT), 2.2,\\n\\n epsilon); // 1*0.4 + 3 *0.6\\n\\n}\\n\\n/*\\n\\nBOOST_AUTO_TEST_CASE(calculateProjection)\\n\\n{\\n\\n double epsilon = 0.00001;\\n\\n JPetRecoImageTools::Matrix2D matrix = {{4}};\\n\\n //static double calculateProjection(const Matrix2D& emissionMatrix,\\n\\n //double phi,\\n\\n //int scanNumber,\\n\\n //int nScans,\\n\\n //InterpolationFunc& interpolationFunction\\n\\n //);\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp\",\n \"rank\": 83,\n \"score\": 13.11012578417714\n },\n {\n \"content\": \" if (trailingFoundIdices.size() == 0) { return -1; }\\n\\n sort(trailingFoundIdices.begin(), trailingFoundIdices.end());\\n\\n return trailingFoundIdices.at(0);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Method finds a 4-element permutation which has to be applied to threshold numbers\\n\\n * to have them sorted by increasing threshold values.\\n\\n *\\n\\n * The ordering may be different for each PMT, therefore the method creates a map\\n\\n * with PMT ID numbers as keys and 4-element permutations as values.\\n\\n */\\n\\nSignalFinderTools::ThresholdOrderings SignalFinderTools::findThresholdOrders(const JPetParamBank& bank){\\n\\n\\n\\n ThresholdOrderings orderings;\\n\\n std::map<PMid, ThresholdValues> thr_values_per_pm;\\n\\n\\n\\n for(auto& tc: bank.getTOMBChannels()){\\n\\n PMid pm_id = tc.second->getPM().getID();\\n\\n\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 84,\n \"score\": 12.988924568371967\n },\n {\n \"content\": \" JPetEvent event3;\\n\\n event3.addHit(firstHit);\\n\\n event3.addHit(secondHit);\\n\\n event3.addHit(thirdHit);\\n\\n event3.addHit(fourthHit);\\n\\n\\n\\n JPetStatistics stats;\\n\\n BOOST_REQUIRE(!EventCategorizerTools::checkFor3Gamma(event0, stats, false));\\n\\n BOOST_REQUIRE(!EventCategorizerTools::checkFor3Gamma(event1, stats, false));\\n\\n BOOST_REQUIRE(EventCategorizerTools::checkFor3Gamma(event2, stats, false));\\n\\n BOOST_REQUIRE(EventCategorizerTools::checkFor3Gamma(event3, stats, false));\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(checkForPromptTest) {\\n\\n JPetBarrelSlot barrelSlot(666, true, \\\"Some Slot\\\", 66.0, 666);\\n\\n JPetPM pmA(1, \\\"A\\\");\\n\\n JPetPM pmB(2, \\\"B\\\");\\n\\n pmA.setSide(JPetPM::SideA);\\n\\n pmB.setSide(JPetPM::SideB);\\n\\n pmA.setBarrelSlot(barrelSlot);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/EventCategorizerToolsTest.cpp\",\n \"rank\": 85,\n \"score\": 12.976447481115112\n },\n {\n \"content\": \"#include <TCanvas.h>\\n\\n#include <TFile.h>\\n\\n#include <TLegend.h>\\n\\n#include <TLine.h>\\n\\n#include <TUnixSystem.h>\\n\\n\\n\\nvoid JPetRecoSignalTools::saveBadSignalIntoRootFile(\\n\\n const JPetRecoSignal &signal, const int numberOfBadSignals,\\n\\n const std::string fileName) {\\n\\n TCanvas *c1 = new TCanvas();\\n\\n TGraph *badSignal = JPetRecoSignalTools::plotJPetRecoSignal(signal);\\n\\n badSignal->Draw(\\\"AP\\\");\\n\\n std::string title;\\n\\n std::stringstream ss;\\n\\n ss << numberOfBadSignals;\\n\\n std::string str = ss.str();\\n\\n ss.str(std::string());\\n\\n ss.clear();\\n\\n ss << signal.getPM().getID();\\n\\n std::string PMT = ss.str();\\n\",\n \"file_path\": \"modules/tools/JPetRecoSignalTools/JPetRecoSignalTools.cpp\",\n \"rank\": 86,\n \"score\": 12.968290378059923\n },\n {\n \"content\": \" }\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SinogramCreator::analyzeHits(const JPetHit& firstHit, const JPetHit& secondHit)\\n\\n{\\n\\n return analyzeHits(firstHit.getPos(), firstHit.getTime(), secondHit.getPos(), secondHit.getTime());\\n\\n}\\n\\n\\n\\nbool SinogramCreator::analyzeHits(const float firstX, const float firstY, const float firstZ, const double firstTOF, const float secondX,\\n\\n const float secondY, const float secondZ, const double secondTOF)\\n\\n{\\n\\n int i = -1;\\n\\n if (!fEnableObliqueLORRemapping)\\n\\n {\\n\\n i = SinogramCreatorTools::getSplitRangeNumber(firstZ, secondZ, fZSplitRange);\\n\\n }\\n\\n else\\n\\n {\\n\\n i = SinogramCreatorTools::getSinogramSlice(firstX, firstY, firstZ, firstTOF, secondX, secondY, secondZ, secondTOF, fZSplitRange);\\n\",\n \"file_path\": \"ImageReconstruction/SinogramCreator.cpp\",\n \"rank\": 87,\n \"score\": 12.872541592803795\n },\n {\n \"content\": \" bool convertToT, const ToTEnergyConverter& totConverter, JPetStatistics& stats,\\n\\n bool saveHistos\\n\\n) {\\n\\n vector<JPetHit> slotHits;\\n\\n vector<JPetPhysSignal> remainSignals;\\n\\n sortByTime(slotSignals);\\n\\n while (slotSignals.size() > 0) {\\n\\n auto physSig = slotSignals.at(0);\\n\\n if(slotSignals.size() == 1){\\n\\n remainSignals.push_back(physSig);\\n\\n break;\\n\\n }\\n\\n for (unsigned int j = 1; j < slotSignals.size(); j++) {\\n\\n if (slotSignals.at(j).getTime() - physSig.getTime() < timeDiffAB) {\\n\\n if (physSig.getPM().getSide() != slotSignals.at(j).getPM().getSide()) {\\n\\n auto hit = createHit(\\n\\n physSig, slotSignals.at(j), velocitiesMap,\\n\\n convertToT, totConverter, stats, saveHistos\\n\\n );\\n\\n slotHits.push_back(hit);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/HitFinderTools.cpp\",\n \"rank\": 88,\n \"score\": 12.869554684497407\n },\n {\n \"content\": \"vector<JPetRawSignal> SignalFinderTools::buildAllSignals(\\n\\n const map<int, vector<JPetSigCh>>& sigChByPM,\\n\\n double sigChEdgeMaxTime, double sigChLeadTrailMaxTime,\\n\\n JPetStatistics& stats, bool saveHistos,\\n\\n ThresholdOrderings thresholdOrderings\\n\\n) {\\n\\n vector<JPetRawSignal> allSignals;\\n\\n \\n\\n for (auto& sigChPair : sigChByPM) {\\n\\n Permutation P;\\n\\n if(thresholdOrderings.empty()){\\n\\n P = kIdentity;\\n\\n }else{\\n\\n P = thresholdOrderings.at(sigChPair.first);\\n\\n }\\n\\n\\n\\n auto signals = buildRawSignals(\\n\\n sigChPair.second, sigChEdgeMaxTime, sigChLeadTrailMaxTime, stats, saveHistos, P\\n\\n );\\n\\n allSignals.insert(allSignals.end(), signals.begin(), signals.end());\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalFinderTools.cpp\",\n \"rank\": 89,\n \"score\": 12.841124653548093\n },\n {\n \"content\": \" }\\n\\n }\\n\\n for(unsigned int i=0;i<trails.size();i++){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr\\\", 2*(i+1));\\n\\n if(trails.at(i).getRecoFlag()==JPetSigCh::Good){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr_sigch_good\\\", 2*(i+1));\\n\\n } else if(trails.at(i).getRecoFlag()==JPetSigCh::Corrupted){\\n\\n getStatistics().fillHistogram(\\\"raw_sigs_multi_corr_sigch_corr\\\", 2*(i+1));\\n\\n }\\n\\n }\\n\\n } else if(rawSignal.getRecoFlag()==JPetBaseSignal::Unknown){\\n\\n getStatistics().fillHistogram(\\\"good_vs_bad_signals\\\", 3);\\n\\n }\\n\\n }\\n\\n // Make Reco Signal from Raw Signal\\n\\n auto recoSignal = createRecoSignal(rawSignal);\\n\\n // Make Phys Signal from Reco Signal and save\\n\\n auto physSignal = createPhysSignal(recoSignal);\\n\\n fOutputEvents->add<JPetPhysSignal>(physSignal);\\n\\n }\\n\",\n \"file_path\": \"LargeBarrelAnalysis/SignalTransformer.cpp\",\n \"rank\": 90,\n \"score\": 12.826642499972085\n },\n {\n \"content\": \"\\n\\n if (lead_times_A.count(thr) > 0 && trail_times_A.count(thr) > 0 && lead_times_A.size() == 4 && trail_times_A.size() == 4) { //exactly 4 thresholds\\n\\n\\n\\n lead_times_first_A = lead_times_A[1];\\n\\n\\n\\n if (thr >= 2) {\\n\\n\\t\\n\\n thr_time_diff_A[thr] = lead_times_A[thr] / 1000 - lead_times_first_A / 1000;\\n\\n\\t\\n\\n char* histo_name_l_A = Form(\\\"timeDiffA_leading_layer_%d_slot_%d_thr_1%d\\\", layer_number, slot_nr, thr);\\n\\n getStatistics().fillHistogram(histo_name_l_A, thr_time_diff_A[thr]);\\n\\n }\\n\\n }\\n\\n }\\n\\n \\n\\n // B\\n\\n for (auto& thr_time_pair : lead_times_B) {\\n\\n\\n\\n int thr = thr_time_pair.first;\\n\\n\\n\",\n \"file_path\": \"InterThresholdCalibration/InterThresholdCalibration.cpp\",\n \"rank\": 91,\n \"score\": 12.81444601138087\n },\n {\n \"content\": \"BOOST_AUTO_TEST_CASE(matchSignals_test_sameSide)\\n\\n{\\n\\n JPetBarrelSlot slot1(1, true, \\\"one\\\", 15.0, 1);\\n\\n JPetScin scin1(1);\\n\\n JPetPM pm1(11, \\\"first\\\");\\n\\n pm1.setBarrelSlot(slot1);\\n\\n pm1.setScin(scin1);\\n\\n pm1.setSide(JPetPM::SideA);\\n\\n JPetPhysSignal physSig1, physSig2, physSig3;\\n\\n physSig1.setBarrelSlot(slot1);\\n\\n physSig2.setBarrelSlot(slot1);\\n\\n physSig3.setBarrelSlot(slot1);\\n\\n physSig1.setPM(pm1);\\n\\n physSig2.setPM(pm1);\\n\\n physSig3.setPM(pm1);\\n\\n physSig1.setTime(1.0);\\n\\n physSig2.setTime(2.0);\\n\\n physSig3.setTime(3.0);\\n\\n std::vector<JPetPhysSignal> slotSignals;\\n\\n slotSignals.push_back(physSig1);\\n\",\n \"file_path\": \"LargeBarrelAnalysis/tests/HitFinderToolsTest.cpp\",\n \"rank\": 92,\n \"score\": 12.789320182082593\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nvoid TimeCalibration::fillHistosForHit(const JPetHit& hit, const std::vector<double>& refTimesL, const std::vector<double>& refTimesT)\\n\\n{\\n\\n auto lead_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n auto trail_times_A = hit.getSignalA().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n\\n\\n auto lead_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Leading);\\n\\n auto trail_times_B = hit.getSignalB().getRecoSignal().getRawSignal().getTimesVsThresholdNumber(JPetSigCh::Trailing);\\n\\n float TOT_A = 0.;\\n\\n float TOT_B = 0.;\\n\\n double timeDiffTmin = 0;\\n\\n double timeDiffLmin = 0;\\n\\n\\n\\n for (auto& thr_time_pair : lead_times_A) {\\n\\n int thr = thr_time_pair.first;\\n\\n\\n\\n if (trail_times_A.count(thr) > 0 ) {\\n\\n TOT_A = TOT_A + trail_times_A[thr] - lead_times_A[thr];\\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.cpp\",\n \"rank\": 93,\n \"score\": 12.713150699337715\n },\n {\n \"content\": \" const auto scin = bank.getScintillator(1);\\n\\n\\n\\n const float detectorWidth = scin.getScinSize(JPetScin::Dimension::kWidth);\\n\\n const float detectorHeight = scin.getScinSize(JPetScin::Dimension::kHeight);\\n\\n fHalfStripLenght = scin.getScinSize(JPetScin::Dimension::kLength) / 2.f;\\n\\n const float detectorD = 0.f;\\n\\n const float fowRadius = 0.4f;\\n\\n\\n\\n fScanner = ScannerBuilder<SquareScanner>::build_multiple_rings(__PET2D_BARREL(radius, // radius\\n\\n rotation, // rotation\\n\\n scintillators, // n-detectors\\n\\n detectorWidth, // w-detector\\n\\n detectorHeight, // h-detector\\n\\n detectorD, // should be d-detector\\n\\n fowRadius // fow radius\\n\\n ));\\n\\n\\n\\n if (isOptionSet(opts, kNumberOfPixelsInOneDimensionKey)) {\\n\\n fNumberOfPixelsInOneDimension = getOptionAsInt(opts, kNumberOfPixelsInOneDimensionKey);\\n\\n }\\n\",\n \"file_path\": \"ImageReconstruction/MLEMRunner.cpp\",\n \"rank\": 94,\n \"score\": 12.697429506737837\n },\n {\n \"content\": \" \\\"badOffsets.root\\\");\\n\\n fBadSignals++;\\n\\n } else {\\n\\n auto signalWithOffset = signal;\\n\\n signalWithOffset.setOffset(fOffset);\\n\\n fOutputEvents->add<JPetRecoSignal>(signalWithOffset);\\n\\n }\\n\\n fCurrentEventNumber++;\\n\\n }\\n\\n } else {\\n\\n return false;\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool SDARecoOffsetsCalc::terminate() {\\n\\n int fEventNb = fCurrentEventNumber;\\n\\n double goodPercent = (fEventNb - fBadSignals) * 100.0 / fEventNb;\\n\\n INFO(Form(\\\"Amount of signals in input file: %d\\\", fEventNb));\\n\\n INFO(Form(\\\"Offset calculation complete \\\\nAmount of bad signals: %d \\\\n %f %% \\\"\\n\\n \\\"of data is good\\\",\\n\\n fBadSignals, goodPercent));\\n\\n return true;\\n\\n}\\n\",\n \"file_path\": \"modules/SDA/JPetRecoOffsetCalc/SDARecoOffsetsCalc.cpp\",\n \"rank\": 95,\n \"score\": 12.689247375228579\n },\n {\n \"content\": \" }\\n\\n }\\n\\n for (auto& thr_time_pair : lead_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\\n if ( trail_times_B.count(thr) > 0 ) {\\n\\n TOT_B = TOT_B + trail_times_B[thr] - lead_times_B[thr];\\n\\n }\\n\\n }\\n\\n float tTOT = (TOT_A + TOT_B) / 1000.; //total TOT in ns\\n\\n//\\n\\n//----------cut the hit if TOT is out of accepted range (cuts given in ns)\\n\\n if (tTOT >= TOTcut[0] && tTOT <= TOTcut[1]) {\\n\\n//\\n\\n//leading edge\\n\\n for (auto& thr_time_pair : lead_times_A) {\\n\\n\\n\\n int thr = thr_time_pair.first;\\n\\n //**\\t\\tconst char * histo_name_l = Form(\\\"%slayer_%d_slot_%d_thr_%d\\\",\\\"timeDiffAB_leading_\\\",LayerToCalib,StripToCalib,thr);\\n\\n //**const char * histo_name_Ref_l = Form(\\\"%slayer_%d_slot_%d_thr_%d\\\",\\\"timeDiffRef_leading_\\\",LayerToCalib,StripToCalib,thr);\\n\\n //**std::cout << histo_name_l<<\\\" \\\"<<histo_name_l<< std::endl;\\n\",\n \"file_path\": \"TimeCalibration/TimeCalibration.cpp\",\n \"rank\": 96,\n \"score\": 12.678112044542154\n },\n {\n \"content\": \"BOOST_AUTO_TEST_CASE(projection2)\\n\\n{\\n\\n double epsilon = 0.00001;\\n\\n JPetRecoImageTools::Matrix2D matrix = {{1, 2}, {3, 4}};\\n\\n /// 1 2\\n\\n /// 3 4\\n\\n\\n\\n int imageSize = matrix.size();\\n\\n double center = (float)(imageSize - 1) / 2.0;\\n\\n double length = center * center;\\n\\n std::function< double(int, int) > matrixGet;\\n\\n matrixGet = JPetRecoImageTools::matrixGetterFactory(\\n\\n matrix, false); // The matrix elements will be taken as (x,y).\\n\\n double step = (M_PI / 180);\\n\\n\\n\\n double cos = std::cos(step * 0); // 0 degree\\n\\n double sin = std::sin(step * 0); // 0 degree\\n\\n BOOST_REQUIRE_CLOSE(JPetRecoImageTools::calculateProjection2(\\n\\n 0, cos, sin, imageSize, center, length, matrixGet),\\n\\n 4, epsilon); // 1 + 3\\n\",\n \"file_path\": \"ImageReconstruction/Reconstruction/JPetRecoImageTools/JPetRecoImageToolsTest.cpp\",\n \"rank\": 97,\n \"score\": 12.611482405460636\n },\n {\n \"content\": \" auto opts = getOptions();\\n\\n\\n\\n if (isOptionSet(opts, kXRangeOn3DHistogramKey))\\n\\n {\\n\\n fXRange = getOptionAsInt(opts, kXRangeOn3DHistogramKey);\\n\\n }\\n\\n\\n\\n if (isOptionSet(opts, kYRangeOn3DHistogramKey))\\n\\n {\\n\\n fYRange = getOptionAsInt(opts, kYRangeOn3DHistogramKey);\\n\\n }\\n\\n\\n\\n if (isOptionSet(opts, kZRangeOn3DHistogramKey))\\n\\n {\\n\\n fZRange = getOptionAsInt(opts, kZRangeOn3DHistogramKey);\\n\\n }\\n\\n\\n\\n if (isOptionSet(opts, kCutOnAnnihilationPointZKey))\\n\\n {\\n\\n fANNIHILATION_POINT_Z = getOptionAsFloat(opts, kCutOnAnnihilationPointZKey);\\n\",\n \"file_path\": \"ImageReconstruction/ImageReco.cpp\",\n \"rank\": 98,\n \"score\": 12.611482405460636\n },\n {\n \"content\": \" }\\n\\n }\\n\\n for (auto& thr_time_pair : lead_times_B) {\\n\\n int thr = thr_time_pair.first;\\n\\n if ( trail_times_B.count(thr) > 0 ) {\\n\\n TOT_B = TOT_B + trail_times_B[thr] - lead_times_B[thr];\\n\\n }\\n\\n }\\n\\n float tTOT = (TOT_A + TOT_B) / 1000.;\\n\\n if (tTOT >= TOTcut[0] && tTOT <= TOTcut[1]) {\\n\\n for (auto& thr_time_pair : lead_times_A) {\\n\\n\\n\\n int thr = thr_time_pair.first;\\n\\n if ( lead_times_B.count(thr) > 0 ) {\\n\\n double timeDiffAB_l = (lead_times_B[thr] / 1000. + CBlCor[thr]) - (lead_times_A[thr] / 1000. + CAlCor[thr]);\\n\\n const char* histo_name_l = formatUniqueSlotDescription(hit.getBarrelSlot(), thr, \\\"timeDiffAB_leading_\\\");\\n\\n getStatistics().fillHistogram(histo_name_l, timeDiffAB_l);\\n\\n timeDiffLmin = 10000000000000.;\\n\\n for (unsigned int i = 0; i < refTimesL.size(); i++) {\\n\\n double timeDiffHit_L = (lead_times_A[thr] / 1000. + CAlCor[thr]) + (lead_times_B[thr] / 1000. + CBlCor[thr]);\\n\",\n \"file_path\": \"TimeCalibration_iter/TimeCalibration.cpp\",\n \"rank\": 99,\n \"score\": 12.553968654819666\n }\n]","isConversational":false}}},{"rowIdx":395,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"UnitTests/Physics/HeightFieldShapeTests.cpp"},"repo_name":{"kind":"string","value":"All8Up/JoltPhysics"},"commit":{"kind":"string","value":"751d13891f5bd8850863ad236eaa3c340e90de9a"},"file_code":{"kind":"string","value":"\n\n#include \"UnitTestFramework.h\"\n#include \"PhysicsTestContext.h\"\n#include <Physics/Collision/RayCast.h>\n#include <Physics/Collision/CastResult.h>\n#include <Physics/Collision/Shape/HeightFieldShape.h>\n#include <Physics/Collision/PhysicsMaterialSimple.h>\n\nTEST_SUITE(\"HeightFieldShapeTests\")\n{\n\tstatic void sRandomizeMaterials(HeightFieldShapeSettings &ioSettings, uint inMaxMaterials)\n\t{\n\t\t\n\t\tfor (uint i = 0; i < inMaxMaterials; ++i)\n\t\t\tioSettings.mMaterials.push_back(new PhysicsMaterialSimple(\"Material \" + ConvertToString(i), Color::sGetDistinctColor(i)));\n\t\t\n\t\tif (inMaxMaterials > 1)\n\t\t{\n\t\t\t\n\t\t\tUnitTestRandom random;\n\t\t\tuniform_int_distribution<uint> index_distribution(0, inMaxMaterials - 1);\n\t\t\tioSettings.mMaterialIndices.resize(Square(ioSettings.mSampleCount - 1));\n\t\t\tfor (uint y = 0; y < ioSettings.mSampleCount - 1; ++y)\n\t\t\t\tfor (uint x = 0; x < ioSettings.mSampleCount - 1; ++x)\n\t\t\t\t\tioSettings.mMaterialIndices[y * (ioSettings.mSampleCount - 1) + x] = uint8(index_distribution(random));\n\t\t}\n\t}\n\n\tstatic Ref<HeightFieldShape> sValidateGetPosition(const HeightFieldShapeSettings &inSettings, float inMaxError)\n\t{\n\t\t\n\t\tRef<HeightFieldShape> shape = static_cast<HeightFieldShape *>(inSettings.Create().Get().GetPtr());\n\n\t\t\n\t\tfloat max_diff = -1.0f;\n\t\tfor (uint y = 0; y < inSettings.mSampleCount; ++y)\n\t\t\tfor (uint x = 0; x < inSettings.mSampleCount; ++x)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tRayCast ray { inSettings.mOffset + inSettings.mScale * Vec3((float)x, 100.0f, (float)y), inSettings.mScale.GetY() * Vec3(0, -200, 0) };\n\t\t\t\tRayCastResult hit;\n\t\t\t\tshape->CastRay(ray, SubShapeIDCreator(), hit);\n\n\t\t\t\t\n\t\t\t\tfloat height = inSettings.mHeightSamples[y * inSettings.mSampleCount + x];\n\t\t\t\tif (height != HeightFieldShapeConstants::cNoCollisionValue)\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tCHECK(!shape->IsNoCollision(x, y));\n\n\t\t\t\t\t\n\t\t\t\t\tVec3 original_pos = inSettings.mOffset + inSettings.mScale * Vec3((float)x, height, (float)y);\n\n\t\t\t\t\t\n\t\t\t\t\tVec3 shape_pos = shape->GetPosition(x, y);\n\n\t\t\t\t\t\n\t\t\t\t\tfloat diff = (original_pos - shape_pos).Length();\n\t\t\t\t\tmax_diff = max(max_diff, diff);\n\n\t\t\t\t\t\n\t\t\t\t\tif (x < inSettings.mSampleCount - 1 && y < inSettings.mSampleCount - 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst PhysicsMaterial *m1 = PhysicsMaterial::sDefault;\n\t\t\t\t\t\tif (!inSettings.mMaterialIndices.empty())\n\t\t\t\t\t\t\tm1 = inSettings.mMaterials[inSettings.mMaterialIndices[y * (inSettings.mSampleCount - 1) + x]];\n\t\t\t\t\t\telse if (!inSettings.mMaterials.empty())\n\t\t\t\t\t\t\tm1 = inSettings.mMaterials.front();\n\n\t\t\t\t\t\tconst PhysicsMaterial *m2 = shape->GetMaterial(x, y);\n\t\t\t\t\t\tCHECK(m1 == m2);\n\t\t\t\t\t}\n\n\t\t\t\t\t\n\t\t\t\t\tif (x > 0 && y > 0 && x < inSettings.mSampleCount - 1 && y < inSettings.mSampleCount - 1)\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tVec3 hit_pos = ray.mOrigin + ray.mDirection * hit.mFraction;\n\t\t\t\t\t\tCHECK_APPROX_EQUAL(hit_pos, shape_pos, 1.0e-3f);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tCHECK(shape->IsNoCollision(x, y));\n\n\t\t\t\t\t\n\t\t\t\t\tCHECK(hit.mFraction > 1.0f);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\n\t\tCHECK(max_diff <= inMaxError);\n\n\t\treturn shape;\n\t}\n\n\tTEST_CASE(\"TestPlane\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mOffset = Vec3(3, 5, 7);\n\t\tsettings.mScale = Vec3(9, 13, 17);\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 1;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = 1.0f;\n\n\t\t\n\t\tUnitTestRandom random;\n\t\tuniform_int_distribution<uint> index_distribution(0, (uint)settings.mHeightSamples.size() - 1);\n\t\tfor (int i = 0; i < 10; ++i)\n\t\t\tsettings.mHeightSamples[index_distribution(random)] = HeightFieldShapeConstants::cNoCollisionValue;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 256);\n\t\tsValidateGetPosition(settings, 0.0f);\n\t}\n\t\n\tTEST_CASE(\"TestPlaneCloseToOrigin\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 1;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = 1.0e-6f;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 50);\n\t\tsValidateGetPosition(settings, 0.0f);\n\t}\n\n\tTEST_CASE(\"TestRandomHeightField\")\n\t{\n\t\tconst float cMinHeight = -5.0f;\n\t\tconst float cMaxHeight = 10.0f;\n\n\t\tUnitTestRandom random;\n\t\tuniform_real_distribution<float> height_distribution(cMinHeight, cMaxHeight);\n\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mOffset = Vec3(0.3f, 0.5f, 0.7f);\n\t\tsettings.mScale = Vec3(1.1f, 1.2f, 1.3f);\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 8;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = height_distribution(random);\n\n\t\t\n\t\tfor (uint32 bits_per_sample = 1; bits_per_sample <= 8; ++bits_per_sample)\n\t\t{\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tfloat max_error = 0.5f * (cMaxHeight - cMinHeight) / ((1 << bits_per_sample) - 1);\n\t\t\tuint32 calculated_bits_per_sample = settings.CalculateBitsPerSampleForError(max_error);\n\t\t\tCHECK(calculated_bits_per_sample <= bits_per_sample);\n\t\t}\n\n\t\tsRandomizeMaterials(settings, 1);\n\t\tsValidateGetPosition(settings, settings.mScale.GetY() * (cMaxHeight - cMinHeight) / ((1 << settings.mBitsPerSample) - 1));\n\t}\n\n\tTEST_CASE(\"TestEmptyHeightField\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = HeightFieldShapeConstants::cNoCollisionValue;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 50);\n\t\tRef<HeightFieldShape> shape = sValidateGetPosition(settings, 0.0f);\n\n\t\t\n\t\tShape::Stats stats = shape->GetStats();\n\t\tCHECK(stats.mNumTriangles == 0);\n\t\tCHECK(stats.mSizeBytes == sizeof(HeightFieldShape));\n\t}\n}"},"prefix":{"kind":"string","value":"\n\n#include \"UnitTestFramework.h\"\n#include \"PhysicsTestContext.h\"\n#include <Physics/Collision/RayCast.h>\n#include <Physics/Collision/CastResult.h>\n#include <Physics/Collision/Shape/HeightFieldShape.h>\n#include <Physics/Collision/PhysicsMaterialSimple.h>\n\nTEST_SUITE(\"HeightFieldShapeTests\")\n{\n\tstatic void sRandomizeMaterials(HeightFieldShapeSettings &ioSettings, uint inMaxMaterials)\n\t{\n\t\t\n\t\tfor (uint i = 0; i < inMaxMaterials; ++i)\n\t\t\tioSettings.mMaterials.push_back(new PhysicsMaterialSimple(\"Material \" + ConvertToString(i), Color::sGetDistinctColor(i)));\n\t\t\n\t\tif (inMaxMaterials > 1)\n\t\t{\n\t\t\t\n\t\t\tUnitTestRandom random;\n\t\t\tuniform_int_distribution<uint> index_distribution(0, inMaxMaterials - 1);\n\t\t\tioSettings.mMaterialIndices.resize(Square(ioSettings.mSampleCount - 1));\n\t\t\tfor (uint y = 0; y < ioSettings.mSampleCount - 1; ++y)\n\t\t\t\tfor (uint x = 0; x < ioSettings.mSampleCount - 1; ++x)\n\t\t\t\t\tioSettings.mMaterialIndices[y * (ioSettings.mSampleCount - 1) + x] = uint8(index_distribution(random));\n\t\t}\n\t}\n\n\tstatic Ref<HeightFieldShape> sValidateGetPosition(const HeightFieldShapeSettings &inSettings, float inMaxError)\n\t{\n\t\t\n\t\tRef<HeightFieldShape> shape = static_cast<HeightFieldShape *>(inSettings.Create().Get().GetPtr());\n\n\t\t\n\t\tfloat max_diff = -1.0f;\n\t\tfor (uint y = 0; y < inSettings.mSampleCount; ++y)\n\t\t\tfor (uint x = 0; x < inSettings.mSampleCount; ++x)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tRayCast ray { inSettings.mOffset + inSettings.mScale * Vec3((float)x, 100.0f, (float)y), inSettings.mScale.GetY() * Vec3(0, -200, 0) };\n\t\t\t\tRayCastResult hit;\n\t\t\t\tshape->CastRay(ray, SubShapeIDCreator(), hit);\n\n\t\t\t\t\n\t\t\t\tfloat height = inSettings.mHeightSamples[y * inSettings.mSampleCount + x];\n\t\t\t\tif (height != HeightFieldShapeConstants::cNoCollisionValue)\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tCHECK(!shape->IsNoCollision(x, y));\n\n\t\t\t\t\t\n\t\t\t\t\tVec3 original_pos = inSettings.mOffset + inSettings.mScale * Vec3((float)x, height, (float)y);\n\n\t\t\t\t\t\n\t\t\t\t\tVec3 shape_pos = shape->GetPosition(x, y);\n\n\t\t\t\t\t\n\t\t\t\t\tfloat diff = (original_pos - shape_pos).Length();\n\t\t\t\t\tmax_diff = max(max_diff, diff);\n\n\t\t\t\t\t\n\t\t\t\t\tif (x < inSettings.mSampleCount - 1 && y < inSettings.mSampleCount - 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst PhysicsMaterial *m1 = PhysicsMaterial::sDefault;\n\t\t\t\t\t\tif (!inSettings.mMaterialIndices.empty())\n\t\t\t\t\t\t\tm1 = inSettings.mMaterials[inSettings.mMaterialIndices[y * (inSettings.mSampleCount - 1) + x]];\n\t\t\t\t\t\t"},"suffix":{"kind":"string","value":"\n\n\tTEST_CASE(\"TestPlane\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mOffset = Vec3(3, 5, 7);\n\t\tsettings.mScale = Vec3(9, 13, 17);\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 1;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = 1.0f;\n\n\t\t\n\t\tUnitTestRandom random;\n\t\tuniform_int_distribution<uint> index_distribution(0, (uint)settings.mHeightSamples.size() - 1);\n\t\tfor (int i = 0; i < 10; ++i)\n\t\t\tsettings.mHeightSamples[index_distribution(random)] = HeightFieldShapeConstants::cNoCollisionValue;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 256);\n\t\tsValidateGetPosition(settings, 0.0f);\n\t}\n\t\n\tTEST_CASE(\"TestPlaneCloseToOrigin\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 1;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = 1.0e-6f;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 50);\n\t\tsValidateGetPosition(settings, 0.0f);\n\t}\n\n\tTEST_CASE(\"TestRandomHeightField\")\n\t{\n\t\tconst float cMinHeight = -5.0f;\n\t\tconst float cMaxHeight = 10.0f;\n\n\t\tUnitTestRandom random;\n\t\tuniform_real_distribution<float> height_distribution(cMinHeight, cMaxHeight);\n\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mOffset = Vec3(0.3f, 0.5f, 0.7f);\n\t\tsettings.mScale = Vec3(1.1f, 1.2f, 1.3f);\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mBitsPerSample = 8;\n\t\tsettings.mBlockSize = 4;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = height_distribution(random);\n\n\t\t\n\t\tfor (uint32 bits_per_sample = 1; bits_per_sample <= 8; ++bits_per_sample)\n\t\t{\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tfloat max_error = 0.5f * (cMaxHeight - cMinHeight) / ((1 << bits_per_sample) - 1);\n\t\t\tuint32 calculated_bits_per_sample = settings.CalculateBitsPerSampleForError(max_error);\n\t\t\tCHECK(calculated_bits_per_sample <= bits_per_sample);\n\t\t}\n\n\t\tsRandomizeMaterials(settings, 1);\n\t\tsValidateGetPosition(settings, settings.mScale.GetY() * (cMaxHeight - cMinHeight) / ((1 << settings.mBitsPerSample) - 1));\n\t}\n\n\tTEST_CASE(\"TestEmptyHeightField\")\n\t{\n\t\t\n\t\tHeightFieldShapeSettings settings;\n\t\tsettings.mSampleCount = 32;\n\t\tsettings.mHeightSamples.resize(Square(settings.mSampleCount));\n\t\tfor (float &h : settings.mHeightSamples)\n\t\t\th = HeightFieldShapeConstants::cNoCollisionValue;\n\n\t\t\n\t\tCHECK(settings.CalculateBitsPerSampleForError(0.0f) == 1);\n\n\t\tsRandomizeMaterials(settings, 50);\n\t\tRef<HeightFieldShape> shape = sValidateGetPosition(settings, 0.0f);\n\n\t\t\n\t\tShape::Stats stats = shape->GetStats();\n\t\tCHECK(stats.mNumTriangles == 0);\n\t\tCHECK(stats.mSizeBytes == sizeof(HeightFieldShape));\n\t}\n}"},"middle":{"kind":"string","value":"else if (!inSettings.mMaterials.empty())\n\t\t\t\t\t\t\tm1 = inSettings.mMaterials.front();\n\n\t\t\t\t\t\tconst PhysicsMaterial *m2 = shape->GetMaterial(x, y);\n\t\t\t\t\t\tCHECK(m1 == m2);\n\t\t\t\t\t}\n\n\t\t\t\t\t\n\t\t\t\t\tif (x > 0 && y > 0 && x < inSettings.mSampleCount - 1 && y < inSettings.mSampleCount - 1)\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tVec3 hit_pos = ray.mOrigin + ray.mDirection * hit.mFraction;\n\t\t\t\t\t\tCHECK_APPROX_EQUAL(hit_pos, shape_pos, 1.0e-3f);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tCHECK(shape->IsNoCollision(x, y));\n\n\t\t\t\t\t\n\t\t\t\t\tCHECK(hit.mFraction > 1.0f);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\n\t\tCHECK(max_diff <= inMaxError);\n\n\t\treturn shape;\n\t}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// A height field shape. Cannot be used as a dynamic object.\n\nclass HeightFieldShape final : public Shape\n\n{\n\npublic:\n\n\t/// Constructor\n\n\t\t\t\t\t\t\t\t\tHeightFieldShape() : Shape(EShapeType::HeightField, EShapeSubType::HeightField) { }\n\n\t\t\t\t\t\t\t\t\tHeightFieldShape(const HeightFieldShapeSettings &inSettings, ShapeResult &outResult);\n\n\n\n\t// See Shape::MustBeStatic\n\n\tvirtual bool\t\t\t\t\tMustBeStatic() const override\t\t\t\t\t\t\t\t\t\t{ return true; }\n\n\n\n\t// See Shape::GetLocalBounds\n\n\tvirtual AABox\t\t\t\t\tGetLocalBounds() const override;\n\n\n\n\t// See Shape::GetSubShapeIDBitsRecursive\n\n\tvirtual uint\t\t\t\t\tGetSubShapeIDBitsRecursive() const override\t\t\t\t\t\t\t{ return GetSubShapeIDBits(); }\n\n\n\n\t// See Shape::GetInnerRadius\n\n\tvirtual float\t\t\t\t\tGetInnerRadius() const override\t\t\t\t\t\t\t\t\t\t{ return 0.0f; }\n\n\n\n\t// See Shape::GetMassProperties\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":0,"score":154733.17245788907},{"content":"struct RayCast;\n","file_path":"Jolt/Physics/Collision/Shape/Shape.h","rank":1,"score":154289.84104420443},{"content":"class RayCastResult;\n","file_path":"Jolt/Physics/Collision/Shape/Shape.h","rank":2,"score":151533.85942643584},{"content":"struct RayCast;\n","file_path":"Jolt/Physics/Collision/TransformedShape.h","rank":3,"score":141128.41801112692},{"content":"class RayCastResult;\n\n\n","file_path":"Jolt/Physics/Collision/TransformedShape.h","rank":4,"score":138099.12036171422},{"content":"\t\t// A collector that just counts the number of hits\n\n\t\tclass HitCountCollector : public CastRayCollector\t\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tvirtual void\tAddHit(const RayCastResult &inResult) override\n\n\t\t\t{\n\n\t\t\t\t// Store the last sub shape ID so that we can provide something to our outer hit collector\n\n\t\t\t\tmSubShapeID = inResult.mSubShapeID2;\n\n\n\n\t\t\t\t++mHitCount;\n\n\t\t\t}\n\n\n\n\t\t\tint\t\t\t\tmHitCount = 0;\n\n\t\t\tSubShapeID\t\tmSubShapeID;\n\n\t\t};\n\n\t\tHitCountCollector collector;\n\n\n\n\t\t// Configure the raycast\n\n\t\tRayCastSettings settings;\n\n\t\tsettings.mBackFaceMode = EBackFaceMode::CollideWithBackFaces;\n\n\n","file_path":"Jolt/Physics/Collision/Shape/MeshShape.cpp","rank":5,"score":134980.19997187192},{"content":"/// A compound shape, sub shapes can be rotated and translated.\n\n/// Sub shapes cannot be modified once the shape is constructed.\n\n/// Shifts all child objects so that they're centered around the center of mass.\n\nclass StaticCompoundShape final : public CompoundShape\n\n{\n\npublic:\n\n\t/// Constructor\n\n\t\t\t\t\t\t\t\t\tStaticCompoundShape() : CompoundShape(EShapeSubType::StaticCompound) { }\n\n\t\t\t\t\t\t\t\t\tStaticCompoundShape(const StaticCompoundShapeSettings &inSettings, TempAllocator &inTempAllocator, ShapeResult &outResult);\n\n\n\n\t// See Shape::CastRay\n\n\tvirtual bool\t\t\t\t\tCastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const override;\n\n\tvirtual void\t\t\t\t\tCastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const override;\n\n\n\n\t// See: Shape::CollidePoint\n\n\tvirtual void\t\t\t\t\tCollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const override;\n\n\n\n\t// See Shape::CollectTransformedShapes\n\n\tvirtual void\t\t\t\t\tCollectTransformedShapes(const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale, const SubShapeIDCreator &inSubShapeIDCreator, TransformedShapeCollector &ioCollector) const override;\n\n\n\n\t// See: CompoundShape::GetIntersectingSubShapes\n\n\tvirtual int\t\t\t\t\t\tGetIntersectingSubShapes(const AABox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const override;\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":6,"score":121047.48369150463},{"content":"/// Class that constructs a HeightFieldShape\n\nclass HeightFieldShapeSettings final : public ShapeSettings\n\n{\n\npublic:\n\n\tJPH_DECLARE_SERIALIZABLE_VIRTUAL(HeightFieldShapeSettings)\n\n\n\n\t/// Default constructor for deserialization\n\n\t\t\t\t\t\t\t\t\tHeightFieldShapeSettings() = default;\n\n\n\n\t/// Create a height field shape of inSampleCount * inSampleCount vertices.\n\n\t/// The height field is a surface defined by: inOffset + inScale * (x, inSamples[y * inSampleCount + x], y).\n\n\t/// where x and y are integers in the range x and y e [0, inSampleCount - 1].\n\n\t/// inSampleCount: inSampleCount / mBlockSize must be a power of 2 and minimally 2.\n\n\t/// inSamples: inSampleCount^2 vertices.\n\n\t/// inMaterialIndices: (inSampleCount - 1)^2 indices that index into inMaterialList.\n\n\t\t\t\t\t\t\t\t\tHeightFieldShapeSettings(const float *inSamples, Vec3Arg inOffset, Vec3Arg inScale, uint32 inSampleCount, const uint8 *inMaterialIndices = nullptr, const PhysicsMaterialList &inMaterialList = PhysicsMaterialList());\n\n\n\n\t// See: ShapeSettings\n\n\tvirtual ShapeResult\t\t\t\tCreate() const override;\n\n\n\n\t/// Determine the minimal and maximal value of mHeightSamples (will ignore cNoCollisionValue)\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":7,"score":119301.00293122137},{"content":"class StaticCompoundShapeTest : public Test\n\n{\n\npublic:\n\n\tJPH_DECLARE_RTTI_VIRTUAL(StaticCompoundShapeTest)\n\n\n\n\t// See: Test\n\n\tvirtual void\tInitialize() override;\n\n};","file_path":"Samples/Tests/Shapes/StaticCompoundShapeTest.h","rank":8,"score":118351.96146518998},{"content":"class HeightFieldShapeTest : public Test\n\n{\n\npublic:\n\n\tJPH_DECLARE_RTTI_VIRTUAL(HeightFieldShapeTest)\n\n\n\n\t// Initialize the test\n\n\tvirtual void\t\tInitialize() override;\n\n\n\n\t// Update the test, called before the physics update\n\n\tvirtual void\t\tPrePhysicsUpdate(const PreUpdateParams &inParams) override;\n\n\n\n\t// Override to specify the initial camera state (local to GetCameraPivot)\n\n\tvirtual void\t\tGetInitialCamera(CameraState &ioState) const override;\n\n\n\n\t// Optional settings menu\n\n\tvirtual bool\t\tHasSettingsMenu() const\toverride\t\t\t\t\t\t\t{ return true; }\n\n\tvirtual void\t\tCreateSettingsMenu(DebugUI *inUI, UIElement *inSubMenu) override;\n\n\n\n\t// Original (uncompressed) terrain\n\n\tvector<float>\t\tmTerrain;\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.h","rank":9,"score":118266.76385489863},{"content":"class HeightFieldShape::DecodingContext\n\n{\n\npublic:\n\n\tJPH_INLINE explicit\t\t\tDecodingContext(const HeightFieldShape *inShape) :\n\n\t\tmShape(inShape)\n\n\t{\n\n\t\tstatic_assert(sizeof(sGridOffsets) / sizeof(uint) == cNumBitsXY + 1, \"Offsets array is not long enough\");\n\n\t\n\n\t\t// Construct root stack entry\n\n\t\tmPropertiesStack[0] = 0; // level: 0, x: 0, y: 0\n\n\t}\n\n\n\n\ttemplate <class Visitor>\n\n\tJPH_INLINE void\t\t\t\tWalkHeightField(Visitor &ioVisitor)\n\n\t{\n\n\t\t// Early out if there's no collision\n\n\t\tif (mShape->mHeightSamples.empty())\n\n\t\t\treturn;\n\n\n\n\t\t// Precalculate values relating to sample count\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":10,"score":118266.76385489863},{"content":"/// Class that constructs a StaticCompoundShape. Note that if you only want a compound of 1 shape, use a RotatedTranslatedShape instead.\n\nclass StaticCompoundShapeSettings final : public CompoundShapeSettings\n\n{\n\npublic:\n\n\tJPH_DECLARE_SERIALIZABLE_VIRTUAL(StaticCompoundShapeSettings)\n\n\n\n\t// See: ShapeSettings\n\n\tvirtual ShapeResult\t\t\t\tCreate() const override;\n\n\n\n\t/// Specialization of Create() function that allows specifying a temp allocator to avoid temporary memory allocations on the heap\n\n\tShapeResult\t\t\t\t\t\tCreate(TempAllocator &inTempAllocator) const;\n\n};\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":11,"score":117762.51919873337},{"content":"struct HeightFieldShape::HSGetTrianglesContext\n\n{\n\n\t\t\tHSGetTrianglesContext(const HeightFieldShape *inShape, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) : \n\n\t\tmDecodeCtx(inShape),\n\n\t\tmShape(inShape),\n\n\t\tmLocalBox(Mat44::sInverseRotationTranslation(inRotation, inPositionCOM), inBox),\n\n\t\tmHeightFieldScale(inScale),\n\n\t\tmLocalToWorld(Mat44::sRotationTranslation(inRotation, inPositionCOM) * Mat44::sScale(inScale)),\n\n\t\tmIsInsideOut(ScaleHelpers::IsInsideOut(inScale))\n\n\t{\n\n\t}\n\n\n\n\tbool\tShouldAbort() const\n\n\t{\n\n\t\treturn mShouldAbort;\n\n\t}\n\n\n\n\tbool\tShouldVisitRangeBlock([[maybe_unused]] int inStackTop) const\n\n\t{\n\n\t\treturn true;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":12,"score":114656.86230015199},{"content":"// Tests a lot of random rays against convex shapes\n\nclass RandomRayTest : public Test\n\n{\n\npublic:\n\n\tJPH_DECLARE_RTTI_VIRTUAL(RandomRayTest)\n\n\n\n\t// Update the test, called before the physics update\n\n\tvirtual void\tPrePhysicsUpdate(const PreUpdateParams &inParams) override;\n\n\n\nprivate:\n\n\ttemplate <typename A, typename Context>\n\n\tvoid\t\t\tTestRay(const char *inTestName, Vec3Arg inRenderOffset, const A &inA, const Context &inContext, float (*inCompareFunc)(const Context &inContext, Vec3Arg inRayOrigin, Vec3Arg inRayDirection));\n\n};","file_path":"Samples/Tests/ConvexCollision/RandomRayTest.h","rank":13,"score":114411.08751886727},{"content":"/// Base class for all shapes (collision volume of a body). Defines a virtual interface for collision detection.\n\nclass Shape : public RefTarget<Shape>\n\n{\n\npublic:\n\n\tusing ShapeResult = ShapeSettings::ShapeResult;\n\n\n\n\t/// Constructor\n\n\t\t\t\t\t\t\t\t\tShape(EShapeType inType, EShapeSubType inSubType) : mShapeType(inType), mShapeSubType(inSubType) { }\n\n\t\t\t\t\t\t\t\t\tShape(EShapeType inType, EShapeSubType inSubType, const ShapeSettings &inSettings, [[maybe_unused]] ShapeResult &outResult) : mUserData(inSettings.mUserData), mShapeType(inType), mShapeSubType(inSubType) { }\n\n\n\n\t/// Destructor\n\n\tvirtual\t\t\t\t\t\t\t~Shape() = default;\n\n\n\n\t/// Get type\n\n\tinline EShapeType\t\t\t\tGetType() const\t\t\t\t\t\t\t\t\t\t\t\t\t\t{ return mShapeType; }\n\n\tinline EShapeSubType\t\t\tGetSubType() const\t\t\t\t\t\t\t\t\t\t\t\t\t{ return mShapeSubType; }\n\n\n\n\t/// User data (to be used freely by the application)\n\n\tuint64\t\t\t\t\t\t\tGetUserData() const\t\t\t\t\t\t\t\t\t\t\t\t\t{ return mUserData; }\n\n\tvoid\t\t\t\t\t\t\tSetUserData(uint64 inUserData)\t\t\t\t\t\t\t\t\t\t{ mUserData = inUserData; }\n\n\n","file_path":"Jolt/Physics/Collision/Shape/Shape.h","rank":14,"score":113410.11042640018},{"content":"class ScaledStaticCompoundShapeTest : public Test\n\n{\n\npublic:\n\n\tJPH_DECLARE_RTTI_VIRTUAL(ScaledStaticCompoundShapeTest)\n\n\n\n\t// See: Test\n\n\tvirtual void\tInitialize() override;\n\n};","file_path":"Samples/Tests/ScaledShapes/ScaledStaticCompoundShapeTest.h","rank":15,"score":113015.5879773088},{"content":"class ScaledHeightFieldShapeTest : public Test\n\n{\n\npublic:\n\n\tJPH_DECLARE_RTTI_VIRTUAL(ScaledHeightFieldShapeTest)\n\n\n\n\t// See: Test\n\n\tvirtual void\tInitialize() override;\n\n};","file_path":"Samples/Tests/ScaledShapes/ScaledHeightFieldShapeTest.h","rank":16,"score":112934.77451971255},{"content":"class ConvexShape;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":17,"score":112288.8555352129},{"content":"class Shape;\n","file_path":"Jolt/Physics/Collision/Shape/Shape.h","rank":18,"score":111918.09116121448},{"content":"\t\tINVALID_NODE\t\t\t\t= 0x7fffffff,\t\t\t\t\t\t\t\t\t\t\t///< Signifies an invalid node\n\n\t};\n\n\n\n\t/// Node structure\n\n\tstruct Node\n\n\t{\n\n\t\tvoid\t\t\t\t\t\tSetChildBounds(uint inIndex, const AABox &inBounds);\t///< Set bounding box for child inIndex to inBounds\n\n\t\tvoid\t\t\t\t\t\tSetChildInvalid(uint inIndex);\t\t\t\t\t\t\t///< Mark the child inIndex as invalid and set its bounding box to invalid\n\n\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMinX[4];\t\t\t\t\t\t\t\t\t\t\t///< 4 child bounding boxes\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMinY[4];\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMinZ[4];\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMaxX[4];\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMaxY[4];\n\n\t\tHalfFloat\t\t\t\t\tmBoundsMaxZ[4];\n\n\t\tuint32\t\t\t\t\t\tmNodeProperties[4];\t\t\t\t\t\t\t\t\t\t///< 4 child node properties\n\n\t};\n\n\t\n\n\tstatic_assert(sizeof(Node) == 64, \"Node should be 64 bytes\");\n\n\n\n\tusing Nodes = vector<Node>;\n\n\n\n\tNodes\t\t\t\t\t\t\tmNodes;\t\t\t\t\t\t\t\t\t\t\t\t\t///< Quad tree node structure\n\n};\n\n\n\n} // JPH","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":19,"score":111178.70432124006},{"content":"\t/// Sorts ioBodyIdx from inBegin to (but excluding) inEnd spatially into 4 groups. \n\n\t/// outSplit needs to be 5 ints long, when the function returns each group runs from outSplit[i] to (but excluding) outSplit[i + 1]\n\n\t/// After the function returns ioBodyIdx and ioBounds will be shuffled\n\n\tstatic void\t\t\t\t\t\tsPartition4(uint *ioBodyIdx, AABox *ioBounds, int inBegin, int inEnd, int *outSplit);\n\n\n\n\t// Helper functions called by CollisionDispatch\n\n\tstatic void\t\t\t\t\t\tsCollideCompoundVsShape(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\n\n\tstatic void\t\t\t\t\t\tsCollideShapeVsCompound(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\n\n\tstatic void\t\t\t\t\t\tsCastShapeVsCompound(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\n\n\n\n\t// Maximum size of the stack during tree walk\n\n\tstatic constexpr int\t\t\tcStackSize = 128;\n\n\n\n\ttemplate <class Visitor>\n\n\tJPH_INLINE void\t\t\t\t\tWalkTree(Visitor &ioVisitor) const;\t\t\t\t\t\t///< Walk the node tree calling the Visitor::VisitNodes for each node encountered and Visitor::VisitShape for each sub shape encountered\n\n\n\n\t/// Bits used in Node::mNodeProperties\n\n\tenum : uint32\n\n\t{\n\n\t\tIS_SUBSHAPE\t\t\t\t\t= 0x80000000,\t\t\t\t\t\t\t\t\t\t\t///< If this bit is set, the other bits index in mSubShape, otherwise in mNodes\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":20,"score":111178.16836016592},{"content":"\t// See: CompoundShape::GetIntersectingSubShapes\n\n\tvirtual int\t\t\t\t\t\tGetIntersectingSubShapes(const OrientedBox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const override;\n\n\n\n\t// See Shape\n\n\tvirtual void\t\t\t\t\tSaveBinaryState(StreamOut &inStream) const override;\n\n\n\n\t// See Shape::GetStats\n\n\tvirtual Stats\t\t\t\t\tGetStats() const override\t\t\t\t\t\t\t\t{ return Stats(sizeof(*this) + mSubShapes.size() * sizeof(SubShape) + mNodes.size() * sizeof(Node), 0); }\n\n\n\n\t// Register shape functions with the registry\n\n\tstatic void\t\t\t\t\t\tsRegister();\n\n\n\nprotected:\n\n\t// See: Shape::RestoreBinaryState\n\n\tvirtual void\t\t\t\t\tRestoreBinaryState(StreamIn &inStream) override;\n\n\n\nprivate:\n\n\t// Visitor for GetIntersectingSubShapes\n\n\ttemplate <class BoxType>\n\n\tstruct GetIntersectingSubShapesVisitorSC : public GetIntersectingSubShapesVisitor<BoxType>\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":21,"score":111173.51102115902},{"content":"\t{\n\n\t\tusing GetIntersectingSubShapesVisitor<BoxType>::GetIntersectingSubShapesVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\t\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn true;\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\t\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test if point overlaps with box\n\n\t\t\tUVec4 collides = GetIntersectingSubShapesVisitor<BoxType>::TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\t};\n\n\n\n\t/// Sorts ioBodyIdx spatially into 2 groups. Second groups starts at ioBodyIdx + outMidPoint.\n\n\t/// After the function returns ioBodyIdx and ioBounds will be shuffled\n\n\tstatic void\t\t\t\t\t\tsPartition(uint *ioBodyIdx, AABox *ioBounds, int inNumber, int &outMidPoint);\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":22,"score":111172.82280417481},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#pragma once\n\n\n\n#include <Physics/Collision/Shape/CompoundShape.h>\n\n#include <Physics/Collision/SortReverseAndStore.h>\n\n#include <Math/HalfFloat.h>\n\n\n\nnamespace JPH {\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":23,"score":111171.74471369457},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#pragma once\n\n\n\n#include <Tests/Test.h>\n\n\n","file_path":"Samples/Tests/Shapes/StaticCompoundShapeTest.h","rank":24,"score":111159.11117166236},{"content":"\tvirtual bool\t\t\t\t\tCastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const override;\n\n\tvirtual void\t\t\t\t\tCastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const override;\n\n\n\n\t// See: Shape::CollidePoint\n\n\tvirtual void\t\t\t\t\tCollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const override;\n\n\n\n\t// See Shape::GetTrianglesStart\n\n\tvirtual void\t\t\t\t\tGetTrianglesStart(GetTrianglesContext &ioContext, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) const override;\n\n\n\n\t// See Shape::GetTrianglesNext\n\n\tvirtual int\t\t\t\t\t\tGetTrianglesNext(GetTrianglesContext &ioContext, int inMaxTrianglesRequested, Float3 *outTriangleVertices, const PhysicsMaterial **outMaterials = nullptr) const override;\n\n\n\n\t/// Get height field position at sampled location (inX, inY).\n\n\t/// where inX and inY are integers in the range inX e [0, mSampleCount - 1] and inY e [0, mSampleCount - 1].\n\n\tVec3\t\t\t\t\t\t\tGetPosition(uint inX, uint inY) const;\n\n\n\n\t/// Check if height field at sampled location (inX, inY) has collision (has a hole or not)\n\n\tbool\t\t\t\t\t\t\tIsNoCollision(uint inX, uint inY) const;\n\n\n\n\t/// Projects inLocalPosition (a point in the space of the shape) along the Y axis onto the surface and returns it in outSurfacePosition.\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":25,"score":111119.47679227329},{"content":"\n\n\t/// For block (inBlockX, inBlockY) get the offset and scale needed to decode a uint8 height sample to a uint16\n\n\tinline void\t\t\t\t\t\tGetBlockOffsetAndScale(uint inBlockX, uint inBlockY, uint inRangeBlockOffset, uint inRangeBlockStride, float &outBlockOffset, float &outBlockScale) const;\n\n\n\n\t/// Get the height sample at position (inX, inY)\n\n\tinline uint8\t\t\t\t\tGetHeightSample(uint inX, uint inY) const;\n\n\n\n\t/// Faster version of GetPosition when block offset and scale are already known\n\n\tinline Vec3\t\t\t\t\t\tGetPosition(uint inX, uint inY, float inBlockOffset, float inBlockScale, bool &outNoCollision) const;\n\n\t\t\n\n\t/// Determine amount of bits needed to encode sub shape id\n\n\tuint\t\t\t\t\t\t\tGetSubShapeIDBits() const;\n\n\n\n\t/// En/decode a sub shape ID. inX and inY specify the coordinate of the triangle. inTriangle == 0 is the lower triangle, inTriangle == 1 is the upper triangle.\n\n\tinline SubShapeID\t\t\t\tEncodeSubShapeID(const SubShapeIDCreator &inCreator, uint inX, uint inY, uint inTriangle) const;\n\n\tinline void\t\t\t\t\t\tDecodeSubShapeID(const SubShapeID &inSubShapeID, uint &outX, uint &outY, uint &outTriangle) const;\n\n\n\n\t/// Get the edge flags for a triangle\n\n\tinline uint8\t\t\t\t\tGetEdgeFlags(uint inX, uint inY, uint inTriangle) const;\n\n\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":26,"score":111116.3906726541},{"content":"\tPhysicsMaterialList mMaterials;\n\n\tvector<uint8>\t\tmMaterialIndices;\n\n\tuint\t\t\t\tmTerrainSize;\n\n\tVec3\t\t\t\tmTerrainOffset;\n\n\tVec3\t\t\t\tmTerrainScale;\n\n\n\n\t// Block size = 1 << sBlockSizeShift\n\n\tinline static int\tsBlockSizeShift = 2;\n\n\n\n\t// Bits per sample\n\n\tinline static int\tsBitsPerSample = 8;\n\n\n\n\t// Draw the terrain\n\n\tinline static bool\tsShowOriginalTerrain = false;\n\n\n\n\tRefConst<HeightFieldShape> mHeightField;\n\n\n\n\tVec3\t\t\t\tmHitPos = Vec3::sZero();\n\n};","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.h","rank":27,"score":111114.2980293988},{"content":"\tvirtual MassProperties\t\t\tGetMassProperties() const override;\n\n\t\n\n\t// See Shape::GetMaterial\n\n\tvirtual const PhysicsMaterial *\tGetMaterial(const SubShapeID &inSubShapeID) const override;\n\n\n\n\t/// Overload to get the material at a particular location\n\n\tconst PhysicsMaterial *\t\t\tGetMaterial(uint inX, uint inY) const;\n\n\n\n\t// See Shape::GetSurfaceNormal\n\n\tvirtual Vec3\t\t\t\t\tGetSurfaceNormal(const SubShapeID &inSubShapeID, Vec3Arg inLocalSurfacePosition) const override;\n\n\n\n\t// See Shape::GetSubmergedVolume\n\n\tvirtual void\t\t\t\t\tGetSubmergedVolume(Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, const Plane &inSurface, float &outTotalVolume, float &outSubmergedVolume, Vec3 &outCenterOfBuoyancy) const override { JPH_ASSERT(false, \"Not supported\"); }\n\n\n\n#ifdef JPH_DEBUG_RENDERER\n\n\t// See Shape::Draw\n\n\tvirtual void\t\t\t\t\tDraw(DebugRenderer *inRenderer, Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, ColorArg inColor, bool inUseMaterialColors, bool inDrawWireframe) const override;\n\n#endif // JPH_DEBUG_RENDERER\n\n\n\n\t// See Shape::CastRay\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":28,"score":111110.56537759176},{"content":"\t// Helper functions called by CollisionDispatch\n\n\tstatic void\t\t\t\t\t\tsCollideConvexVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\n\n\tstatic void\t\t\t\t\t\tsCollideSphereVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\n\n\tstatic void\t\t\t\t\t\tsCastConvexVsHeightField(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\n\n\tstatic void\t\t\t\t\t\tsCastSphereVsHeightField(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\n\n\n\n\t/// Visit the entire height field using a visitor pattern\n\n\ttemplate <class Visitor>\n\n\tJPH_INLINE void\t\t\t\t\tWalkHeightField(Visitor &ioVisitor) const;\n\n\n\n\t/// A block of 2x2 ranges used to form a hierarchical grid, ordered left top, right top, left bottom, right bottom\n\n\tstruct alignas(16) RangeBlock\n\n\t{\n\n\t\tuint16\t\t\t\t\t\tmMin[4];\n\n\t\tuint16\t\t\t\t\t\tmMax[4];\n\n\t};\n\n\n\n\t/// Offset of first RangedBlock in grid per level\n\n\tstatic const uint\t\t\t\tsGridOffsets[];\n\n\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":29,"score":111108.63441200678},{"content":"\t/// When there is no surface position (because of a hole or because the point is outside the heightfield) the function will return false.\n\n\tbool\t\t\t\t\t\t\tProjectOntoSurface(Vec3Arg inLocalPosition, Vec3 &outSurfacePosition, SubShapeID &outSubShapeID) const;\n\n\n\n\t// See Shape\n\n\tvirtual void\t\t\t\t\tSaveBinaryState(StreamOut &inStream) const override;\n\n\tvirtual void\t\t\t\t\tSaveMaterialState(PhysicsMaterialList &outMaterials) const override;\n\n\tvirtual void\t\t\t\t\tRestoreMaterialState(const PhysicsMaterialRefC *inMaterials, uint inNumMaterials) override;\n\n\n\n\t// See Shape::GetStats\n\n\tvirtual Stats\t\t\t\t\tGetStats() const override;\n\n\n\n\t// See Shape::GetVolume\n\n\tvirtual float\t\t\t\t\tGetVolume() const override\t\t\t\t\t\t\t\t\t\t\t{ return 0; }\n\n\n\n#ifdef JPH_DEBUG_RENDERER\n\n\t// Settings\n\n\tstatic bool\t\t\t\t\t\tsDrawTriangleOutlines;\n\n#endif // JPH_DEBUG_RENDERER\n\n\n\n\t// Register shape functions with the registry\n\n\tstatic void\t\t\t\t\t\tsRegister();\n\n\n\nprotected:\n\n\t// See: Shape::RestoreBinaryState\n\n\tvirtual void\t\t\t\t\tRestoreBinaryState(StreamIn &inStream) override;\n\n\n\nprivate:\t\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":30,"score":111107.22149466866},{"content":"\t/// @param outMinValue The minimal value fo mHeightSamples or FLT_MAX if no samples have collision\n\n\t/// @param outMaxValue The maximal value fo mHeightSamples or -FLT_MAX if no samples have collision\n\n\t/// @param outQuantizationScale (value - outMinValue) * outQuantizationScale quantizes a height sample to 16 bits\n\n\tvoid\t\t\t\t\t\t\tDetermineMinAndMaxSample(float &outMinValue, float &outMaxValue, float &outQuantizationScale) const;\n\n\n\n\t/// Given mBlockSize, mSampleCount and mHeightSamples, calculate the amount of bits needed to stay below absolute error inMaxError\n\n\t/// @param inMaxError Maximum allowed error in mHeightSamples after compression (note that this does not take mScale.Y into account)\n\n\t/// @return Needed bits per sample in the range [1, 8].\n\n\tuint32\t\t\t\t\t\t\tCalculateBitsPerSampleForError(float inMaxError) const;\n\n\n\n\t/// The height field is a surface defined by: mOffset + mScale * (x, mHeightSamples[y * mSampleCount + x], y).\n\n\t/// where x and y are integers in the range x and y e [0, mSampleCount - 1].\n\n\tVec3\t\t\t\t\t\t\tmOffset = Vec3::sZero();\n\n\tVec3\t\t\t\t\t\t\tmScale = Vec3::sReplicate(1.0f);\n\n\tuint32\t\t\t\t\t\t\tmSampleCount = 0;\n\n\n\n\t/// The heightfield is divided in blocks of mBlockSize * mBlockSize * 2 triangles and the acceleration structure culls blocks only, \n\n\t/// bigger block sizes reduce memory consumption but also reduce query performance. Sensible values are [2, 8], does not need to be\n\n\t/// a power of 2. Note that at run-time we'll perform one more grid subdivision, so the effective block size is half of what is provided here.\n\n\tuint32\t\t\t\t\t\t\tmBlockSize = 2;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":31,"score":111098.10744080409},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#pragma once\n\n\n\n#include <Tests/Test.h>\n\n#include <Physics/Collision/Shape/HeightFieldShape.h>\n\n\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.h","rank":32,"score":111096.89901669824},{"content":"\t/// The height field is a surface defined by: mOffset + mScale * (x, mHeightSamples[y * mSampleCount + x], y).\n\n\t/// where x and y are integers in the range x and y e [0, mSampleCount - 1].\n\n\tVec3\t\t\t\t\t\t\tmOffset = Vec3::sZero();\n\n\tVec3\t\t\t\t\t\t\tmScale = Vec3::sReplicate(1.0f);\n\n\n\n\t/// Height data\n\n\tuint32\t\t\t\t\t\t\tmSampleCount = 0;\t\t\t\t\t///< See HeightFieldShapeSettings::mSampleCount\n\n\tuint32\t\t\t\t\t\t\tmBlockSize = 2;\t\t\t\t\t\t///< See HeightFieldShapeSettings::mBlockSize\n\n\tuint8\t\t\t\t\t\t\tmBitsPerSample = 8;\t\t\t\t\t///< See HeightFieldShapeSettings::mBitsPerSample\n\n\tuint8\t\t\t\t\t\t\tmSampleMask = 0xff;\t\t\t\t\t///< All bits set for a sample: (1 << mBitsPerSample) - 1, used to indicate that there's no collision\n\n\tuint16\t\t\t\t\t\t\tmMinSample = HeightFieldShapeConstants::cNoCollisionValue16;\t///< Min and max value in mHeightSamples quantized to 16 bit, for calculating bounding box\n\n\tuint16\t\t\t\t\t\t\tmMaxSample = HeightFieldShapeConstants::cNoCollisionValue16;\n\n\tvector<RangeBlock>\t\t\t\tmRangeBlocks;\t\t\t\t\t\t///< Hierarchical grid of range data describing the height variations within 1 block. The grid for level <level> starts at offset sGridOffsets[<level>]\n\n\tvector<uint8>\t\t\t\t\tmHeightSamples;\t\t\t\t\t\t///< mBitsPerSample-bit height samples. Value [0, mMaxHeightValue] maps to highest detail grid in mRangeBlocks [mMin, mMax]. mNoCollisionValue is reserved to indicate no collision.\n\n\tvector<uint8>\t\t\t\t\tmActiveEdges;\t\t\t\t\t\t///< (mSampleCount - 1)^2 * 3-bit active edge flags. \n\n\n\n\t/// Materials\n\n\tPhysicsMaterialList\t\t\t\tmMaterials;\t\t\t\t\t\t\t///< The materials of square at (x, y) is: mMaterials[mMaterialIndices[x + y * (mSampleCount - 1)]]\n\n\tvector<uint8>\t\t\t\t\tmMaterialIndices;\t\t\t\t\t///< Compressed to the minimum amount of bits per material index (mSampleCount - 1) * (mSampleCount - 1) * mNumBitsPerMaterialIndex bits of data\n\n\tuint32\t\t\t\t\t\t\tmNumBitsPerMaterialIndex = 0;\t\t///< Number of bits per material index\n\n\n\n#ifdef JPH_DEBUG_RENDERER\n\n\t/// Temporary rendering data\n\n\tmutable vector<DebugRenderer::GeometryRef>\tmGeometry;\n\n\tmutable bool\t\t\t\t\tmCachedUseMaterialColors = false;\t///< This is used to regenerate the triangle batch if the drawing settings change\n\n#endif // JPH_DEBUG_RENDERER\n\n};\n\n\n\n} // JPH","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":33,"score":111095.09913134854},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#pragma once\n\n\n\n#include <Physics/Collision/Shape/Shape.h>\n\n#include <Physics/Collision/PhysicsMaterial.h>\n\n#ifdef JPH_DEBUG_RENDERER\n\n\t#include <Renderer/DebugRenderer.h>\n\n#endif // JPH_DEBUG_RENDERER\n\n\n\nnamespace JPH {\n\n\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":34,"score":111091.22170916334},{"content":"\n\n\t/// How many bits per sample to use to compress the height field. Can be in the range [1, 8].\n\n\t/// Note that each sample is compressed relative to the min/max value of its block of mBlockSize * mBlockSize pixels so the effective precision is higher.\n\n\t/// Also note that increasing mBlockSize saves more memory than reducing the amount of bits per sample.\n\n\tuint32\t\t\t\t\t\t\tmBitsPerSample = 8;\n\n\n\n\tvector<float>\t\t\t\t\tmHeightSamples;\n\n\tvector<uint8>\t\t\t\t\tmMaterialIndices;\n\n\n\n\t/// The materials of square at (x, y) is: mMaterials[mMaterialIndices[x + y * (mSampleCount - 1)]]\n\n\tPhysicsMaterialList\t\t\t\tmMaterials;\n\n};\n\n\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":35,"score":111088.05795907565},{"content":"class CollideShapeSettings;\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.h","rank":36,"score":110067.31164693854},{"content":"class CollideShapeSettings;\n\n\n\n/// Constants for HeightFieldShape, this was moved out of the HeightFieldShape because of a linker bug\n\nnamespace HeightFieldShapeConstants\n\n{\n\n\t/// Value used to create gaps in the height field\n\n\tconstexpr float\t\t\tcNoCollisionValue = FLT_MAX;\n\n\n\n\t/// Stack size to use during WalkHeightField\n\n\tconstexpr int\t\t\tcStackSize = 128;\n\n\n\n\t/// A position in the hierarchical grid is defined by a level (which grid), x and y position. We encode this in a single uint32 as: level << 28 | y << 14 | x\n\n\tconstexpr uint\t\t\tcNumBitsXY = 14;\n\n\tconstexpr uint\t\t\tcMaskBitsXY = (1 << cNumBitsXY) - 1;\n\n\tconstexpr uint\t\t\tcLevelShift = 2 * cNumBitsXY;\n\n\n\n\t/// When height samples are converted to 16 bit:\n\n\tconstexpr uint16\t\tcNoCollisionValue16 = 0xffff;\t\t///< This is the magic value for 'no collision'\n\n\tconstexpr uint16\t\tcMaxHeightValue16 = 0xfffe;\t\t\t///< This is the maximum allowed height value\n\n};\n\n\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.h","rank":37,"score":109998.71897121661},{"content":"\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test bounds of 4 children\n\n\t\t\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mHit.mFraction, ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tfloat\t\t\t\tmDistanceStack[cStackSize];\n\n\t};\n\n\n\n\tVisitor visitor(inRay, this, inSubShapeIDCreator, ioHit);\n\n\tWalkTree(visitor);\n\n\treturn visitor.mReturnValue;\n\n}\n\n\n\nvoid StaticCompoundShape::CastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":38,"score":108428.69570280617},{"content":"void StaticCompoundShapeTest::Initialize() \n\n{\n\n\t// Floor\n\n\tCreateFloor();\n\n\t\t\n\n\t// Simple compound\n\n\tRef<StaticCompoundShapeSettings> compound_shape1 = new StaticCompoundShapeSettings;\n\n\tcompound_shape1->AddShape(Vec3::sZero(), Quat::sIdentity(), new CapsuleShape(5, 1));\n\n\tcompound_shape1->AddShape(Vec3(0, -5, 0), Quat::sIdentity(), new SphereShape(2));\n\n\tcompound_shape1->AddShape(Vec3(0, 5, 0), Quat::sIdentity(), new SphereShape(2));\n\n\n\n\t// Compound with sub compound and rotation\n\n\tRef<StaticCompoundShapeSettings> sub_compound = new StaticCompoundShapeSettings;\n\n\tsub_compound->AddShape(Vec3(0, 1.5f, 0), Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI), new BoxShape(Vec3(1.5f, 0.25f, 0.2f)));\n\n\tsub_compound->AddShape(Vec3(1.5f, 0, 0), Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI), new CylinderShape(1.5f, 0.2f));\n\n\tsub_compound->AddShape(Vec3(0, 0, 1.5f), Quat::sRotation(Vec3::sAxisX(), 0.5f * JPH_PI), new TaperedCapsuleShapeSettings(1.5f, 0.25f, 0.2f));\n\n\n\n\tRef<StaticCompoundShapeSettings> compound_shape2 = new StaticCompoundShapeSettings;\n\n\tcompound_shape2->AddShape(Vec3(0, 0, 0), Quat::sRotation(Vec3::sAxisX(), -0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), 0.25f * JPH_PI), sub_compound);\n\n\tcompound_shape2->AddShape(Vec3(0, -0.1f, 0), Quat::sRotation(Vec3::sAxisX(), 0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), -0.75f * JPH_PI), sub_compound);\n","file_path":"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp","rank":39,"score":108425.37867068152},{"content":"\t};\n\n\n\n\tVisitor visitor(inRay, inRayCastSettings, this, inSubShapeIDCreator, ioCollector);\n\n\tWalkTree(visitor);\n\n}\n\n\n\nvoid StaticCompoundShape::CollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor : public CollidePointVisitor\n\n\t{\n\n\t\tusing CollidePointVisitor::CollidePointVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn true;\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":40,"score":108422.97853669533},{"content":"\n\n\t// Compound with large amount of sub shapes\n\n\tRef<StaticCompoundShapeSettings> compound_shape3 = new StaticCompoundShapeSettings;\n\n\tfor (int y = -2; y <= 2; ++y)\n\n\t\tfor (int x = -2; x <= 2; ++x)\n\n\t\t\tfor (int z = -2; z <= 2; ++z)\n\n\t\t\t\tcompound_shape3->AddShape(Vec3(0.5f * x, 0.5f * y, 0.5f * z), Quat::sRotation(Vec3::sAxisX(), -0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), 0.25f * JPH_PI), new BoxShape(Vec3::sReplicate(0.5f)));\n\n\n\n\tRef<StaticCompoundShapeSettings> shapes[] = { compound_shape1, compound_shape2, compound_shape3 };\n\n\n\n\tfor (int i = 0; i < 10; ++i)\n\n\t\tfor (int j = 0; j < 3; ++j)\n\n\t\t{\n\n\t\t\tQuat rotation;\n\n\t\t\tif ((i & 1) == 0)\n\n\t\t\t\trotation = Quat::sRotation(Vec3::sAxisX(), 0.5f * JPH_PI);\n\n\t\t\telse\n\n\t\t\t\trotation = Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI);\n\n\t\t\tBody &body = *mBodyInterface->CreateBody(BodyCreationSettings(shapes[j], Vec3(0, 10.0f + 4.0f * i, j * 20.0f), rotation, EMotionType::Dynamic, Layers::MOVING));\n\n\t\t\tmBodyInterface->AddBody(body.GetID(), EActivation::Activate);\n\n\t\t}\n\n}","file_path":"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp","rank":41,"score":108421.22275961464},{"content":"\n\n\t// Make bounding box invalid\n\n\tmBoundsMinX[inIndex] = HALF_FLT_MAX;\n\n\tmBoundsMinY[inIndex] = HALF_FLT_MAX;\n\n\tmBoundsMinZ[inIndex] = HALF_FLT_MAX;\n\n\tmBoundsMaxX[inIndex] = HALF_FLT_MAX;\n\n\tmBoundsMaxY[inIndex] = HALF_FLT_MAX;\n\n\tmBoundsMaxZ[inIndex] = HALF_FLT_MAX;\n\n}\n\n\n\nvoid StaticCompoundShape::Node::SetChildBounds(uint inIndex, const AABox &inBounds)\n\n{\n\n\tmBoundsMinX[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetX());\n\n\tmBoundsMinY[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetY());\n\n\tmBoundsMinZ[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetZ());\n\n\tmBoundsMaxX[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetX());\n\n\tmBoundsMaxY[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetY());\n\n\tmBoundsMaxZ[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetZ());\n\n}\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":42,"score":108421.0398308562},{"content":"\n\nStaticCompoundShape::StaticCompoundShape(const StaticCompoundShapeSettings &inSettings, TempAllocator &inTempAllocator, ShapeResult &outResult) :\n\n\tCompoundShape(EShapeSubType::StaticCompound, inSettings, outResult)\n\n{\n\n\t// Check that there's at least 1 shape\n\n\tuint num_subshapes = (uint)inSettings.mSubShapes.size();\n\n\tif (num_subshapes < 2)\n\n\t{\n\n\t\toutResult.SetError(\"Compound needs at least 2 sub shapes, otherwise you should use a RotatedTranslatedShape!\");\n\n\t\treturn;\n\n\t}\n\n\n\n\t// Keep track of total mass to calculate center of mass\n\n\tfloat mass = 0.0f;\n\n\n\n\tmSubShapes.resize(num_subshapes);\n\n\tfor (uint i = 0; i < num_subshapes; ++i)\n\n\t{\n\n\t\tconst CompoundShapeSettings::SubShapeSettings &shape = inSettings.mSubShapes[i];\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":43,"score":108420.84090981471},{"content":"\t\t{\n\n\t\t\treturn mDistanceStack[inStackTop] < mCollector.GetEarlyOutFraction();\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test bounds of 4 children\n\n\t\t\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tfloat\t\t\t\tmDistanceStack[cStackSize];\n\n\t};\n\n\n\n\tJPH_ASSERT(inShape->GetSubType() == EShapeSubType::StaticCompound);\n\n\tconst StaticCompoundShape *shape = static_cast<const StaticCompoundShape *>(inShape);\n\n\n\n\tVisitor visitor(inShapeCast, inShapeCastSettings, shape, inScale, inShapeFilter, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, ioCollector);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":44,"score":108420.76646505923},{"content":"\t\tdo \n\n\t\t\t--top;\n\n\t\twhile (top >= 0 && !ioVisitor.ShouldVisitNode(top));\n\n\t}\n\n\twhile (top >= 0);\n\n}\n\n\n\nbool StaticCompoundShape::CastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor : public CastRayVisitor\n\n\t{\n\n\t\tusing CastRayVisitor::CastRayVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn mDistanceStack[inStackTop] < mHit.mFraction;\n\n\t\t}\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":45,"score":108420.74494302599},{"content":"\tshape->WalkTree(visitor);\n\n}\n\n\n\nvoid StaticCompoundShape::CollectTransformedShapes(const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale, const SubShapeIDCreator &inSubShapeIDCreator, TransformedShapeCollector &ioCollector) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor : public CollectTransformedShapesVisitor\n\n\t{\n\n\t\tusing CollectTransformedShapesVisitor::CollectTransformedShapesVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn true;\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test which nodes collide\n\n\t\t\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":46,"score":108420.03245934602},{"content":"\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\t// Build a regular compound shape\n\n\t\t\tRef<Shape> shape = new StaticCompoundShape(*this, inTempAllocator, mCachedResult); \n\n\t\t}\n\n\t}\n\n\treturn mCachedResult;\n\n}\n\n\n\nShapeSettings::ShapeResult StaticCompoundShapeSettings::Create() const\n\n{\n\n\tTempAllocatorMalloc allocator;\n\n\treturn Create(allocator);\n\n}\n\n\n\nvoid StaticCompoundShape::Node::SetChildInvalid(uint inIndex)\n\n{\n\n\t// Make this an invalid node\n\n\tmNodeProperties[inIndex] = INVALID_NODE;\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":47,"score":108419.8885175681},{"content":"void StaticCompoundShape::sPartition(uint *ioBodyIdx, AABox *ioBounds, int inNumber, int &outMidPoint)\n\n{\n\n\t// Handle trivial case\n\n\tif (inNumber <= 4)\n\n\t{\n\n\t\toutMidPoint = inNumber / 2;\n\n\t\treturn;\n\n\t}\n\n\n\n\t// Calculate bounding box of box centers\n\n\tVec3 center_min = Vec3::sReplicate(FLT_MAX);\n\n\tVec3 center_max = Vec3::sReplicate(-FLT_MAX);\n\n\tfor (AABox *b = ioBounds, *b_end = ioBounds + inNumber; b < b_end; ++b)\n\n\t{\n\n\t\tVec3 center = b->GetCenter();\n\n\t\tcenter_min = Vec3::sMin(center_min, center);\n\n\t\tcenter_max = Vec3::sMax(center_max, center);\n\n\t}\n\n\n\n\t// Calculate split plane\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":48,"score":108419.63428147406},{"content":"\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test which nodes collide\n\n\t\t\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\t};\n\n\n\n\tVisitor visitor(shape1, inShape2, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, inCollideShapeSettings, ioCollector);\n\n\tshape1->WalkTree(visitor);\n\n}\n\n\n\nvoid StaticCompoundShape::sCollideShapeVsCompound(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor : public CollideShapeVsCompoundVisitor\n\n\t{\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":49,"score":108418.77231983165},{"content":"\t\t{\n\n\t\t\t// Test if point overlaps with box\n\n\t\t\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\t};\n\n\n\n\tVisitor visitor(inPoint, this, inSubShapeIDCreator, ioCollector);\n\n\tWalkTree(visitor);\n\n}\n\n\n\nvoid StaticCompoundShape::sCastShapeVsCompound(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector)\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor : public CastShapeVisitor\n\n\t{\n\n\t\tusing CastShapeVisitor::CastShapeVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":50,"score":108418.53156109058},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#include <TestFramework.h>\n\n\n\n#include <Tests/Shapes/StaticCompoundShapeTest.h>\n\n#include <Physics/Collision/Shape/StaticCompoundShape.h>\n\n#include <Physics/Collision/Shape/SphereShape.h>\n\n#include <Physics/Collision/Shape/BoxShape.h>\n\n#include <Physics/Collision/Shape/CapsuleShape.h>\n\n#include <Physics/Collision/Shape/TaperedCapsuleShape.h>\n\n#include <Physics/Collision/Shape/CylinderShape.h>\n\n#include <Physics/Body/BodyCreationSettings.h>\n\n#include <Layers.h>\n\n\n\nJPH_IMPLEMENT_RTTI_VIRTUAL(StaticCompoundShapeTest) \n\n{ \n\n\tJPH_ADD_BASE_CLASS(StaticCompoundShapeTest, Test) \n\n}\n\n\n","file_path":"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp","rank":51,"score":108418.52677373457},{"content":"\n\n\tGetIntersectingSubShapesVisitorSC<OrientedBox> visitor(inBox, outSubShapeIndices, inMaxSubShapeIndices);\n\n\tWalkTree(visitor);\n\n\treturn visitor.GetNumResults();\n\n}\n\n\n\nvoid StaticCompoundShape::sCollideCompoundVsShape(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\n\n{\t\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tJPH_ASSERT(inShape1->GetSubType() == EShapeSubType::StaticCompound);\n\n\tconst StaticCompoundShape *shape1 = static_cast<const StaticCompoundShape *>(inShape1);\n\n\n\n\tstruct Visitor : public CollideCompoundVsShapeVisitor\n\n\t{\n\n\t\tusing CollideCompoundVsShapeVisitor::CollideCompoundVsShapeVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn true;\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":52,"score":108418.07552255676},{"content":"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\n\n// SPDX-License-Identifier: MIT\n\n\n\n#include <Jolt.h>\n\n\n\n#include <Physics/Collision/Shape/StaticCompoundShape.h>\n\n#include <Physics/Collision/Shape/RotatedTranslatedShape.h>\n\n#include <Physics/Collision/Shape/CompoundShapeVisitors.h>\n\n#include <Core/Profiler.h>\n\n#include <Core/StreamIn.h>\n\n#include <Core/StreamOut.h>\n\n#include <Core/TempAllocator.h>\n\n#include <ObjectStream/TypeDeclarations.h>\n\n\n\nnamespace JPH {\n\n\n\nJPH_IMPLEMENT_SERIALIZABLE_VIRTUAL(StaticCompoundShapeSettings)\n\n{\n\n\tJPH_ADD_BASE_CLASS(StaticCompoundShapeSettings, CompoundShapeSettings)\n\n}\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":53,"score":108417.91966160572},{"content":"}\n\n\n\nvoid StaticCompoundShape::SaveBinaryState(StreamOut &inStream) const\n\n{\n\n\tCompoundShape::SaveBinaryState(inStream);\n\n\n\n\tinStream.Write(mNodes);\n\n}\n\n\n\nvoid StaticCompoundShape::RestoreBinaryState(StreamIn &inStream)\n\n{\n\n\tCompoundShape::RestoreBinaryState(inStream);\n\n\n\n\tinStream.Read(mNodes);\n\n}\n\n\n\nvoid StaticCompoundShape::sRegister()\n\n{\n\n\tShapeFunctions &f = ShapeFunctions::sGet(EShapeSubType::StaticCompound);\n\n\tf.mConstruct = []() -> Shape * { return new StaticCompoundShape; };\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":54,"score":108417.77671222363},{"content":"\t\t\t++start;\n\n\t\t\t--end;\n\n\t\t}\n\n\t}\n\n\tJPH_ASSERT(start == end);\n\n\n\n\tif (start > 0 && start < inNumber)\n\n\t{\n\n\t\t// Success!\n\n\t\toutMidPoint = start;\n\n\t}\n\n\telse\n\n\t{\n\n\t\t// Failed to divide bodies\n\n\t\toutMidPoint = inNumber / 2; \n\n\t}\n\n}\n\n\n\nvoid StaticCompoundShape::sPartition4(uint *ioBodyIdx, AABox *ioBounds, int inBegin, int inEnd, int *outSplit)\n\n{\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":55,"score":108416.48948187707},{"content":"\t\tusing CollideShapeVsCompoundVisitor::CollideShapeVsCompoundVisitor;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn true;\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test which nodes collide\n\n\t\t\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\t};\n\n\n\n\tJPH_ASSERT(inShape2->GetSubType() == EShapeSubType::StaticCompound);\n\n\tconst StaticCompoundShape *shape2 = static_cast<const StaticCompoundShape *>(inShape2);\n\n\n\n\tVisitor visitor(inShape1, shape2, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, inCollideShapeSettings, ioCollector);\n\n\tshape2->WalkTree(visitor);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":56,"score":108414.95319980249},{"content":"\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\t};\n\n\n\n\tVisitor visitor(inBox, this, inPositionCOM, inRotation, inScale, inSubShapeIDCreator, ioCollector);\n\n\tWalkTree(visitor);\n\n}\n\n\n\nint StaticCompoundShape::GetIntersectingSubShapes(const AABox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tGetIntersectingSubShapesVisitorSC<AABox> visitor(inBox, outSubShapeIndices, inMaxSubShapeIndices);\n\n\tWalkTree(visitor);\n\n\treturn visitor.GetNumResults();\n\n}\n\n\n\nint StaticCompoundShape::GetIntersectingSubShapes(const OrientedBox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":57,"score":108414.48661286227},{"content":"\tuint bounds_size = num_subshapes * sizeof(AABox);\n\n\tAABox *bounds = (AABox *)inTempAllocator.Allocate(bounds_size);\n\n\n\n\t// Temporary storage for body indexes (we're shuffling them)\n\n\tuint body_idx_size = num_subshapes * sizeof(uint);\n\n\tuint *body_idx = (uint *)inTempAllocator.Allocate(body_idx_size);\n\n\n\n\t// Shift all shapes so that the center of mass is now at the origin and calculate bounds\n\n\tfor (uint i = 0; i < num_subshapes; ++i)\n\n\t{\n\n\t\tSubShape &shape = mSubShapes[i];\n\n\n\n\t\t// Shift the shape so it's centered around our center of mass\n\n\t\tshape.SetPositionCOM(shape.GetPositionCOM() - mCenterOfMass);\n\n\n\n\t\t// Transform the shape's bounds into our local space\n\n\t\tMat44 transform = Mat44::sRotationTranslation(shape.GetRotation(), shape.GetPositionCOM());\n\n\t\tAABox shape_bounds = shape.mShape->GetWorldSpaceBounds(transform, Vec3::sReplicate(1.0f));\n\n\n\n\t\t// Store bounds and body index for tree construction\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":58,"score":108414.2992298553},{"content":"\n\n\tstruct Visitor : public CastRayVisitorCollector\n\n\t{\n\n\t\tusing CastRayVisitorCollector::CastRayVisitorCollector;\n\n\n\n\t\tJPH_INLINE bool\t\tShouldVisitNode(int inStackTop) const\n\n\t\t{\n\n\t\t\treturn mDistanceStack[inStackTop] < mCollector.GetEarlyOutFraction();\n\n\t\t}\n\n\n\n\t\tJPH_INLINE int\t\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test bounds of 4 children\n\n\t\t\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tfloat\t\t\t\tmDistanceStack[cStackSize];\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":59,"score":108414.2610892973},{"content":"\tf.mColor = Color::sOrange;\n\n\n\n\tfor (EShapeSubType s : sAllSubShapeTypes)\n\n\t{\n\n\t\tCollisionDispatch::sRegisterCollideShape(EShapeSubType::StaticCompound, s, sCollideCompoundVsShape);\n\n\t\tCollisionDispatch::sRegisterCollideShape(s, EShapeSubType::StaticCompound, sCollideShapeVsCompound);\n\n\t\tCollisionDispatch::sRegisterCastShape(s, EShapeSubType::StaticCompound, sCastShapeVsCompound);\n\n\t}\n\n}\n\n\n\n} // JPH","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":60,"score":108410.95747871911},{"content":"}\n\n\n\ntemplate <class Visitor>\n\ninline void StaticCompoundShape::WalkTree(Visitor &ioVisitor) const\n\n{\n\n\tuint32 node_stack[cStackSize];\n\n\tnode_stack[0] = 0;\n\n\tint top = 0;\n\n\tdo\n\n\t{\n\n\t\t// Test if the node is valid, the node should rarely be invalid but it is possible when testing\n\n\t\t// a really large box against the tree that the invalid nodes will intersect with the box\n\n\t\tuint32 node_properties = node_stack[top];\n\n\t\tif (node_properties != INVALID_NODE)\n\n\t\t{\n\n\t\t\t// Test if node contains triangles\n\n\t\t\tbool is_node = (node_properties & IS_SUBSHAPE) == 0;\n\n\t\t\tif (is_node)\n\n\t\t\t{\n\n\t\t\t\tconst Node &node = mNodes[node_properties];\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":61,"score":108409.28728085596},{"content":"\n\nShapeSettings::ShapeResult StaticCompoundShapeSettings::Create(TempAllocator &inTempAllocator) const\n\n{ \n\n\tif (mCachedResult.IsEmpty())\n\n\t{\n\n\t\tif (mSubShapes.size() == 0)\n\n\t\t{\n\n\t\t\t// It's an error to create a compound with no subshapes (the compound cannot encode this)\n\n\t\t\tmCachedResult.SetError(\"Compound needs a sub shape!\");\n\n\t\t}\n\n\t\telse if (mSubShapes.size() == 1)\n\n\t\t{\n\n\t\t\t// If there's only 1 part, we can use a RotatedTranslatedShape instead\n\n\t\t\tRotatedTranslatedShapeSettings settings;\n\n\t\t\tconst SubShapeSettings &s = mSubShapes[0];\n\n\t\t\tsettings.mPosition = s.mPosition;\n\n\t\t\tsettings.mRotation = s.mRotation;\n\n\t\t\tsettings.mInnerShape = s.mShape;\n\n\t\t\tsettings.mInnerShapePtr = s.mShapePtr;\n\n\t\t\tRef<Shape> shape = new RotatedTranslatedShape(settings, mCachedResult);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":62,"score":108408.47582005018},{"content":"\n\n\t\t\t\t// Unpack bounds\n\n\t\t\t\tUVec4 bounds_minxy = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMinX[0]));\n\n\t\t\t\tVec4 bounds_minx = HalfFloatConversion::ToFloat(bounds_minxy);\n\n\t\t\t\tVec4 bounds_miny = HalfFloatConversion::ToFloat(bounds_minxy.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\n\n\t\t\t\t\t\n\n\t\t\t\tUVec4 bounds_minzmaxx = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMinZ[0]));\n\n\t\t\t\tVec4 bounds_minz = HalfFloatConversion::ToFloat(bounds_minzmaxx);\n\n\t\t\t\tVec4 bounds_maxx = HalfFloatConversion::ToFloat(bounds_minzmaxx.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\n\n\n\n\t\t\t\tUVec4 bounds_maxyz = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMaxY[0]));\n\n\t\t\t\tVec4 bounds_maxy = HalfFloatConversion::ToFloat(bounds_maxyz);\n\n\t\t\t\tVec4 bounds_maxz = HalfFloatConversion::ToFloat(bounds_maxyz.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\n\n\n\n\t\t\t\t// Load properties for 4 children\n\n\t\t\t\tUVec4 properties = UVec4::sLoadInt4(&node.mNodeProperties[0]);\n\n\n\n\t\t\t\t// Check which sub nodes to visit\n\n\t\t\t\tint num_results = ioVisitor.VisitNodes(bounds_minx, bounds_miny, bounds_minz, bounds_maxx, bounds_maxy, bounds_maxz, properties, top);\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":63,"score":108406.60847207396},{"content":"\t\tbounds[i] = shape_bounds;\n\n\t\tbody_idx[i] = i;\n\n\n\n\t\t// Update our local bounds\n\n\t\tmLocalBounds.Encapsulate(shape_bounds);\n\n\t}\n\n\n\n\t// The algorithm is a recursive tree build, but to avoid the call overhead we keep track of a stack here\n\n\tstruct StackEntry\n\n\t{\n\n\t\tuint32\t\t\tmNodeIdx;\t\t\t\t\t// Node index of node that is generated\n\n\t\tint\t\t\t\tmChildIdx;\t\t\t\t\t// Index of child that we're currently processing\n\n\t\tint\t\t\t\tmSplit[5];\t\t\t\t\t// Indices where the node ID's have been split to form 4 partitions\n\n\t\tAABox\t\t\tmBounds;\t\t\t\t\t// Bounding box of this node\n\n\t};\n\n\tuint stack_size = num_subshapes * sizeof(StackEntry);\n\n\tStackEntry *stack = (StackEntry *)inTempAllocator.Allocate(stack_size);\n\n\tint top = 0;\n\n\n\n\t// Reserve enough space so that every sub shape gets its own leaf node\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":64,"score":108406.586844244},{"content":"\t\t// Start constructing the runtime sub shape\n\n\t\tSubShape &out_shape = mSubShapes[i];\n\n\t\tif (!out_shape.FromSettings(shape, outResult))\n\n\t\t\treturn;\n\n\n\n\t\t// Calculate mass properties of child\n\n\t\tMassProperties child = out_shape.mShape->GetMassProperties();\n\n\t\n\n\t\t// Accumulate center of mass\n\n\t\tmass += child.mMass;\n\n\t\tmCenterOfMass += out_shape.GetPositionCOM() * child.mMass;\n\n\t}\n\n\n\n\tif (mass > 0.0f)\n\n\t\tmCenterOfMass /= mass;\n\n\n\n\t// Cache the inner radius as it can take a while to recursively iterate over all sub shapes\n\n\tCalculateInnerRadius();\n\n\n\n\t// Temporary storage for the bounding boxes of all shapes\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":65,"score":108404.48787587178},{"content":"\t\t\t\t// Push them onto the stack\n\n\t\t\t\tJPH_ASSERT(top + 4 < cStackSize);\n\n\t\t\t\tproperties.StoreInt4(&node_stack[top]);\n\n\t\t\t\ttop += num_results;\n\n\t\t\t}\n\n\t\t\telse\n\n\t\t\t{\t\n\n\t\t\t\t// Points to a sub shape\n\n\t\t\t\tuint32 sub_shape_idx = node_properties ^ IS_SUBSHAPE;\n\n\t\t\t\tconst SubShape &sub_shape = mSubShapes[sub_shape_idx];\n\n\n\n\t\t\t\tioVisitor.VisitShape(sub_shape, sub_shape_idx);\n\n\t\t\t}\n\n\n\n\t\t\t// Check if we're done\n\n\t\t\tif (ioVisitor.ShouldAbort())\n\n\t\t\t\tbreak;\n\n\t\t}\n\n\n\n\t\t// Fetch next node until we find one that the visitor wants to see\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":66,"score":108404.35931180207},{"content":"\t// Free temporary memory\n\n\tinTempAllocator.Free(stack, stack_size);\n\n\tinTempAllocator.Free(body_idx, body_idx_size);\n\n\tinTempAllocator.Free(bounds, bounds_size);\n\n\n\n\t// Check if we ran out of bits for addressing a node\n\n\tif (next_node_idx > IS_SUBSHAPE)\n\n\t{\n\n\t\toutResult.SetError(\"Compound hierarchy has too many nodes\");\n\n\t\treturn;\n\n\t}\n\n\n\n\t// Check if we're not exceeding the amount of sub shape id bits\n\n\tif (GetSubShapeIDBitsRecursive() > SubShapeID::MaxBits)\n\n\t{\n\n\t\toutResult.SetError(\"Compound hierarchy is too deep and exceeds the amount of available sub shape ID bits\");\n\n\t\treturn;\n\n\t}\n\n\n\n\toutResult.Set(this);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":67,"score":108403.35169552793},{"content":"\tuint next_node_idx = 0;\n\n\tmNodes.resize(num_subshapes + (num_subshapes + 2) / 3); // = Sum(num_subshapes * 4^-i) with i = [0, Inf].\n\n\n\n\t// Create root node\n\n\tstack[0].mNodeIdx = next_node_idx++;\n\n\tstack[0].mChildIdx = -1;\n\n\tstack[0].mBounds = AABox();\n\n\tsPartition4(body_idx, bounds, 0, num_subshapes, stack[0].mSplit);\n\n\n\n\tfor (;;)\n\n\t{\n\n\t\tStackEntry &cur_stack = stack[top];\n\n\n\n\t\t// Next child\n\n\t\tcur_stack.mChildIdx++;\n\n\n\n\t\t// Check if all children processed\n\n\t\tif (cur_stack.mChildIdx >= 4)\n\n\t\t{\n\n\t\t\t// Terminate if there's nothing left to pop\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":68,"score":108401.15101523967},{"content":"\tuint *body_idx = ioBodyIdx + inBegin;\n\n\tAABox *node_bounds = ioBounds + inBegin;\n\n\tint number = inEnd - inBegin;\n\n\n\n\t// Partition entire range\n\n\tsPartition(body_idx, node_bounds, number, outSplit[2]); \n\n\t\n\n\t// Partition lower half\n\n\tsPartition(body_idx, node_bounds, outSplit[2], outSplit[1]); \n\n\n\n\t// Partition upper half\n\n\tsPartition(body_idx + outSplit[2], node_bounds + outSplit[2], number - outSplit[2], outSplit[3]); \n\n\n\n\t// Convert to proper range \n\n\toutSplit[0] = inBegin;\n\n\toutSplit[1] += inBegin;\n\n\toutSplit[2] += inBegin;\n\n\toutSplit[3] += outSplit[2];\n\n\toutSplit[4] = inEnd;\n\n}\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":69,"score":108401.07938904181},{"content":"\t\t\tint num_bodies = high - low;\n\n\n\n\t\t\tif (num_bodies == 0)\n\n\t\t\t{\n\n\t\t\t\t// Mark invalid\n\n\t\t\t\tNode &node = mNodes[cur_stack.mNodeIdx];\n\n\t\t\t\tnode.SetChildInvalid(cur_stack.mChildIdx);\n\n\t\t\t}\n\n\t\t\telse if (num_bodies == 1)\n\n\t\t\t{\n\n\t\t\t\t// Get body info\n\n\t\t\t\tuint child_node_idx = body_idx[low];\n\n\t\t\t\tconst AABox &child_bounds = bounds[low];\n\n\n\n\t\t\t\t// Update node\n\n\t\t\t\tNode &node = mNodes[cur_stack.mNodeIdx];\n\n\t\t\t\tnode.mNodeProperties[cur_stack.mChildIdx] = child_node_idx | IS_SUBSHAPE;\n\n\t\t\t\tnode.SetChildBounds(cur_stack.mChildIdx, child_bounds);\n\n\n\n\t\t\t\t// Encapsulate bounding box in parent\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":70,"score":108400.81536669329},{"content":"\tint dimension = (center_max - center_min).GetHighestComponentIndex();\n\n\tfloat split = 0.5f * (center_min + center_max)[dimension];\n\n\n\n\t// Divide bodies\n\n\tint start = 0, end = inNumber;\n\n\twhile (start < end)\n\n\t{\n\n\t\t// Search for first element that is on the right hand side of the split plane\n\n\t\twhile (start < end && ioBounds[start].GetCenter()[dimension] < split)\n\n\t\t\t++start;\n\n\n\n\t\t// Search for the first element that is on the left hand side of the split plane\n\n\t\twhile (start < end && ioBounds[end - 1].GetCenter()[dimension] >= split)\n\n\t\t\t--end;\n\n\n\n\t\tif (start < end)\n\n\t\t{\n\n\t\t\t// Swap the two elements\n\n\t\t\tswap(ioBodyIdx[start], ioBodyIdx[end - 1]);\n\n\t\t\tswap(ioBounds[start], ioBounds[end - 1]);\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":71,"score":108400.80032987935},{"content":"\t\t\tif (top <= 0)\n\n\t\t\t\tbreak;\n\n\n\n\t\t\t// Add our bounds to our parents bounds\n\n\t\t\tStackEntry &prev_stack = stack[top - 1];\n\n\t\t\tprev_stack.mBounds.Encapsulate(cur_stack.mBounds);\n\n\n\n\t\t\t// Store this node's properties in the parent node\n\n\t\t\tNode &parent_node = mNodes[prev_stack.mNodeIdx];\n\n\t\t\tparent_node.mNodeProperties[prev_stack.mChildIdx] = cur_stack.mNodeIdx;\n\n\t\t\tparent_node.SetChildBounds(prev_stack.mChildIdx, cur_stack.mBounds);\n\n\n\n\t\t\t// Pop entry from stack\n\n\t\t\t--top;\n\n\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\t// Get low and high index to bodies to process\n\n\t\t\tint low = cur_stack.mSplit[cur_stack.mChildIdx];\n\n\t\t\tint high = cur_stack.mSplit[cur_stack.mChildIdx + 1];\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":72,"score":108396.87368126915},{"content":"\t\t\t\tcur_stack.mBounds.Encapsulate(child_bounds);\n\n\t\t\t}\n\n\t\t\telse \n\n\t\t\t{\n\n\t\t\t\t// Allocate new node\n\n\t\t\t\tStackEntry &new_stack = stack[++top];\n\n\t\t\t\tJPH_ASSERT(top < (int)num_subshapes);\n\n\t\t\t\tnew_stack.mNodeIdx = next_node_idx++;\n\n\t\t\t\tnew_stack.mChildIdx = -1;\n\n\t\t\t\tnew_stack.mBounds = AABox();\n\n\t\t\t\tsPartition4(body_idx, bounds, low, high, new_stack.mSplit);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Resize nodes to actual size\n\n\tJPH_ASSERT(next_node_idx <= mNodes.size());\n\n\tmNodes.resize(next_node_idx);\n\n\tmNodes.shrink_to_fit();\n\n\n","file_path":"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp","rank":73,"score":108396.87368126915},{"content":"class RayCastSettings;\n","file_path":"Jolt/Physics/Collision/Shape/Shape.h","rank":74,"score":108382.1865124542},{"content":"\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mHit.mFraction, ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tJPH_INLINE void\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2) \n\n\t\t{\t\t\t\n\n\t\t\tfloat fraction = RayTriangle(mRayOrigin, mRayDirection, inV0, inV1, inV2);\n\n\t\t\tif (fraction < mHit.mFraction)\n\n\t\t\t{\n\n\t\t\t\t// It's a closer hit\n\n\t\t\t\tmHit.mFraction = fraction;\n\n\t\t\t\tmHit.mSubShapeID2 = mShape->EncodeSubShapeID(mSubShapeIDCreator, inX, inY, inTriangle);\n\n\t\t\t\tmReturnValue = true;\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\tRayCastResult &\t\t\tmHit;\n\n\t\tVec3\t\t\t\t\tmRayOrigin;\n\n\t\tVec3\t\t\t\t\tmRayDirection;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":75,"score":108368.8081986479},{"content":"\t\tJPH_INLINE void\t\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\n\n\t\t{\t\t\t\n\n\t\t\t// Create sub shape id for this part\n\n\t\t\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\n\n\n\n\t\t\t// Determine active edges\n\n\t\t\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\n\n\n\n\t\t\tCast(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\n\n\t\t}\n\n\n\n\t\tconst HeightFieldShape *\tmShape2;\n\n\t\tRayInvDirection\t\t\t\tmInvDirection;\n\n\t\tVec3\t\t\t\t\t\tmBoxCenter;\n\n\t\tVec3\t\t\t\t\t\tmBoxExtent;\n\n\t\tSubShapeIDCreator\t\t\tmSubShapeIDCreator2;\n\n\t\tfloat\t\t\t\t\t\tmDistanceStack[cStackSize];\n\n\t};\n\n\n\n\tJPH_ASSERT(inShape->GetSubType() == EShapeSubType::HeightField);\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":76,"score":108363.83555649094},{"content":"\t\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tJPH_INLINE void\t\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\n\n\t\t{\t\t\t\n\n\t\t\t// Create sub shape id for this part\n\n\t\t\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\n\n\n\n\t\t\t// Determine active edges\n\n\t\t\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\n\n\n\n\t\t\tCast(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\n\n\t\t}\n\n\n\n\t\tconst HeightFieldShape *\tmShape2;\n\n\t\tRayInvDirection\t\t\t\tmInvDirection;\n\n\t\tSubShapeIDCreator\t\t\tmSubShapeIDCreator2;\n\n\t\tfloat\t\t\t\t\t\tmDistanceStack[cStackSize];\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":77,"score":108363.63969211439},{"content":"\t\t\t\thit.mBodyID = TransformedShape::sGetBodyID(mCollector.GetContext());\n\n\t\t\t\thit.mFraction = fraction;\n\n\t\t\t\thit.mSubShapeID2 = mShape->EncodeSubShapeID(mSubShapeIDCreator, inX, inY, inTriangle);\n\n\t\t\t\tmCollector.AddHit(hit);\n\n\t\t\t}\n\n\t\t}\n\n\t\t\n\n\t\tCastRayCollector &\t\tmCollector;\n\n\t\tVec3\t\t\t\t\tmRayOrigin;\n\n\t\tVec3\t\t\t\t\tmRayDirection;\n\n\t\tRayInvDirection\t\t\tmRayInvDirection;\n\n\t\tEBackFaceMode\t\t\tmBackFaceMode;\n\n\t\tconst HeightFieldShape *mShape;\n\n\t\tSubShapeIDCreator\t\tmSubShapeIDCreator;\n\n\t\tfloat\t\t\t\t\tmDistanceStack[cStackSize];\n\n\t};\n\n\n\n\tVisitor visitor(this, inRay, inRayCastSettings, inSubShapeIDCreator, ioCollector);\n\n\tWalkHeightField(visitor);\n\n}\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":78,"score":108362.65282022684},{"content":"{ \n\n\t// Get quantized value\n\n\tuint8 height_sample = GetHeightSample(inX, inY);\n\n\toutNoCollision = height_sample == mSampleMask;\n\n\n\n\t// Add 0.5 to the quantized value to minimize the error (see constructor)\n\n\treturn mOffset + mScale * Vec3(float(inX), inBlockOffset + (0.5f + height_sample) * inBlockScale, float(inY)); \n\n}\n\n\n\nVec3 HeightFieldShape::GetPosition(uint inX, uint inY) const\n\n{\n\n\t// Test if there are any samples\n\n\tif (mHeightSamples.empty())\n\n\t\treturn mOffset + mScale * Vec3(float(inX), 0.0f, float(inY));\n\n\n\n\t// Get block location\n\n\tuint bx = inX / mBlockSize;\n\n\tuint by = inY / mBlockSize;\n\n\n\n\t// Calculate offset and stride\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":79,"score":108361.18644834006},{"content":"}\n\n\n\ninline uint8 HeightFieldShape::GetHeightSample(uint inX, uint inY) const\n\n{\n\n\tJPH_ASSERT(inX < mSampleCount); \n\n\tJPH_ASSERT(inY < mSampleCount); \n\n\t\n\n\t// Determine bit position of sample\n\n\tuint sample = (inY * mSampleCount + inX) * uint(mBitsPerSample);\n\n\tuint byte_pos = sample >> 3;\n\n\tuint bit_pos = sample & 0b111;\n\n\n\n\t// Fetch the height sample value\n\n\tJPH_ASSERT(byte_pos + 1 < mHeightSamples.size());\n\n\tconst uint8 *height_samples = mHeightSamples.data() + byte_pos;\n\n\tuint16 height_sample = uint16(height_samples[0]) | uint16(uint16(height_samples[1]) << 8);\n\n\treturn uint8(height_sample >> bit_pos) & mSampleMask; \n\n}\n\n\n\ninline Vec3 HeightFieldShape::GetPosition(uint inX, uint inY, float inBlockOffset, float inBlockScale, bool &outNoCollision) const\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":80,"score":108358.13968268623},{"content":"\n\ninline void HeightFieldShape::sGetRangeBlockOffsetAndStride(uint inNumBlocks, uint inMaxLevel, uint &outRangeBlockOffset, uint &outRangeBlockStride)\n\n{\n\n\toutRangeBlockOffset = sGridOffsets[inMaxLevel - 1];\n\n\toutRangeBlockStride = inNumBlocks >> 1;\n\n}\n\n\n\ninline void HeightFieldShape::GetBlockOffsetAndScale(uint inBlockX, uint inBlockY, uint inRangeBlockOffset, uint inRangeBlockStride, float &outBlockOffset, float &outBlockScale) const\n\n{\n\n\tJPH_ASSERT(inBlockX < GetNumBlocks() && inBlockY < GetNumBlocks());\n\n\n\n\t// Convert to location of range block\n\n\tuint rbx = inBlockX >> 1;\n\n\tuint rby = inBlockY >> 1;\n\n\tuint n = ((inBlockY & 1) << 1) + (inBlockX & 1);\n\n\n\n\t// Calculate offset and scale\n\n\tconst RangeBlock &block = mRangeBlocks[inRangeBlockOffset + rby * inRangeBlockStride + rbx];\n\n\toutBlockOffset = float(block.mMin[n]);\n\n\toutBlockScale = float(block.mMax[n] - block.mMin[n]) / float(mSampleMask);\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":81,"score":108357.05655234962},{"content":"\tuint num_blocks = GetNumBlocks();\n\n\tuint range_block_offset, range_block_stride;\n\n\tsGetRangeBlockOffsetAndStride(num_blocks, sGetMaxLevel(num_blocks), range_block_offset, range_block_stride);\n\n\n\n\tfloat offset, scale;\n\n\tGetBlockOffsetAndScale(bx, by, range_block_offset, range_block_stride, offset, scale);\n\n\n\n\tbool no_collision;\n\n\treturn GetPosition(inX, inY, offset, scale, no_collision);\n\n}\n\n\n\nbool HeightFieldShape::IsNoCollision(uint inX, uint inY) const\n\n{ \n\n\treturn mHeightSamples.empty() || GetHeightSample(inX, inY) == mSampleMask;\n\n}\n\n\n\nbool HeightFieldShape::ProjectOntoSurface(Vec3Arg inLocalPosition, Vec3 &outSurfacePosition, SubShapeID &outSubShapeID) const\n\n{\n\n\t// Check if we have collision\n\n\tif (mHeightSamples.empty())\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":82,"score":108357.02784852013},{"content":"\t// Calculate amount of memory used\n\n\tShape::Stats stats = mHeightField->GetStats();\n\n\n\n\t// Trace stats\n\n\tTrace(\"Block size: %d, bits per sample: %d, min height: %g, max height: %g, avg diff: %g, max diff: %g at (%d, %d), relative error: %g%%, size: %u bytes\", 1 << sBlockSizeShift, sBitsPerSample, (double)min_height, (double)max_height, (double)avg_diff, (double)max_diff, max_diff_x, max_diff_y, (double)rel_error, stats.mSizeBytes);\n\n\tif (rel_error > max_error)\n\n\t\tFatalError(\"Error too big!\");\n\n\n\n\t// Determine terrain height\n\n\tRayCastResult result;\n\n\tVec3 start(0, 1000, 0);\n\n\tVec3 direction(0, -2000, 0);\n\n\tRayCast ray { start, direction };\n\n\tif (mPhysicsSystem->GetNarrowPhaseQuery().CastRay(ray, result, SpecifiedBroadPhaseLayerFilter(BroadPhaseLayers::NON_MOVING), SpecifiedObjectLayerFilter(Layers::NON_MOVING)))\n\n\t\tmHitPos = start + result.mFraction * direction;\n\n\n\n\t// Dynamic body\n\n\tBody &body1 = *mBodyInterface->CreateBody(BodyCreationSettings(new BoxShape(Vec3(0.5f, 1.0f, 2.0f)), mHitPos + Vec3(0, 10, 0), Quat::sIdentity(), EMotionType::Dynamic, Layers::MOVING));\n\n\tmBodyInterface->AddBody(body1.GetID(), EActivation::Activate);\n\n}\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":83,"score":108356.75077274762},{"content":"\t\t\t\tif (h == HeightFieldShapeConstants::cNoCollisionValue)\n\n\t\t\t\t\tcontinue;\n\n\n\n\t\t\t\t// Get original position\n\n\t\t\t\tVec3 original = mTerrainOffset + mTerrainScale * Vec3(float(x), h, float(y));\n\n\n\n\t\t\t\t// Get compressed position\n\n\t\t\t\tVec3 compressed = mHeightField->GetPosition(x, y);\n\n\n\n\t\t\t\t// Draw marker that is red when error is too big and green when not\n\n\t\t\t\tconst float cMaxError = 0.1f;\n\n\t\t\t\tfloat error = (original - compressed).Length();\n\n\t\t\t\tuint8 c = uint8(round(255.0f * min(error / cMaxError, 1.0f)));\n\n\t\t\t\tmDebugRenderer->DrawMarker(original, Color(c, 255 - c, 0, 255), 0.1f);\n\n\t\t\t}\n\n}\n\n\n\nvoid HeightFieldShapeTest::GetInitialCamera(CameraState &ioState) const\n\n{\n\n\t// Correct camera pos for hit position\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":84,"score":108356.03882892412},{"content":"\t\tJPH_INLINE int\t\t\tVisitRangeBlock(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \n\n\t\t{\n\n\t\t\t// Test bounds of 4 children\n\n\t\t\tVec4 distance = RayAABox4(mRayOrigin, mRayInvDirection, inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\n\n\t\n\n\t\t\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\n\n\t\t\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\n\n\t\t}\n\n\n\n\t\tJPH_INLINE void\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2) const\n\n\t\t{\t\t\t\n\n\t\t\t// Back facing check\n\n\t\t\tif (mBackFaceMode == EBackFaceMode::IgnoreBackFaces && (inV2 - inV0).Cross(inV1 - inV0).Dot(mRayDirection) < 0)\n\n\t\t\t\treturn;\n\n\n\n\t\t\t// Check the triangle\n\n\t\t\tfloat fraction = RayTriangle(mRayOrigin, mRayDirection, inV0, inV1, inV2);\n\n\t\t\tif (fraction < mCollector.GetEarlyOutFraction())\n\n\t\t\t{\n\n\t\t\t\tRayCastResult hit;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":85,"score":108355.79972495987},{"content":"\t\tJPH_INLINE void\t\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\n\n\t\t{\t\t\t\n\n\t\t\t// Create ID for triangle\n\n\t\t\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\n\n\n\n\t\t\t// Determine active edges\n\n\t\t\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\n\n\n\n\t\t\tCollide(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\n\n\t\t}\n\n\n\n\t\tconst HeightFieldShape *\tmShape2;\n\n\t\tSubShapeIDCreator\t\t\tmSubShapeIDCreator2;\n\n\t};\n\n\n\n\tVisitor visitor(shape1, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1.GetID(), inCollideShapeSettings, ioCollector);\n\n\tvisitor.mShape2 = shape2;\n\n\tvisitor.mSubShapeIDCreator2 = inSubShapeIDCreator2;\n\n\tshape2->WalkHeightField(visitor);\n\n}\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":86,"score":108355.64803024755},{"content":"\tuint32\t\t\t\t\t\tmPropertiesStack[cStackSize];\n\n};\n\n\n\ntemplate <class Visitor>\n\nJPH_INLINE void HeightFieldShape::WalkHeightField(Visitor &ioVisitor) const\n\n{\n\n\tDecodingContext ctx(this);\n\n\tctx.WalkHeightField(ioVisitor);\n\n}\n\n\n\nbool HeightFieldShape::CastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor\n\n\t{\n\n\t\tJPH_INLINE explicit\t\tVisitor(const HeightFieldShape *inShape, const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) : \n\n\t\t\tmHit(ioHit),\n\n\t\t\tmRayOrigin(inRay.mOrigin),\n\n\t\t\tmRayDirection(inRay.mDirection),\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":87,"score":108355.53824931107},{"content":"\tfloat max_diff = -1.0f;\n\n\tuint max_diff_x = 0, max_diff_y = 0;\n\n\tfloat min_height = FLT_MAX, max_height = -FLT_MAX, avg_diff = 0.0f;\n\n\tfor (uint y = 0; y < mTerrainSize; ++y)\n\n\t\tfor (uint x = 0; x < mTerrainSize; ++x)\n\n\t\t{\n\n\t\t\tfloat h1 = mTerrain[y * mTerrainSize + x];\n\n\t\t\tif (h1 != HeightFieldShapeConstants::cNoCollisionValue)\n\n\t\t\t{\n\n\t\t\t\th1 = mTerrainOffset.GetY() + mTerrainScale.GetY() * h1;\n\n\t\t\t\tif (mHeightField->IsNoCollision(x, y))\n\n\t\t\t\t\tFatalError(\"No collision where there should be\");\n\n\t\t\t\tfloat h2 = mHeightField->GetPosition(x, y).GetY();\n\n\t\t\t\tfloat diff = abs(h2 - h1);\n\n\t\t\t\tif (diff > max_diff)\n\n\t\t\t\t{\n\n\t\t\t\t\tmax_diff = diff;\n\n\t\t\t\t\tmax_diff_x = x;\n\n\t\t\t\t\tmax_diff_y = y;\n\n\t\t\t\t}\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":88,"score":108355.46342261702},{"content":"\t\tRayInvDirection\t\t\tmRayInvDirection;\n\n\t\tconst HeightFieldShape *mShape;\n\n\t\tSubShapeIDCreator\t\tmSubShapeIDCreator;\n\n\t\tbool\t\t\t\t\tmReturnValue = false;\n\n\t\tfloat\t\t\t\t\tmDistanceStack[cStackSize];\n\n\t};\n\n\n\n\tVisitor visitor(this, inRay, inSubShapeIDCreator, ioHit);\n\n\tWalkHeightField(visitor);\n\n\n\n\treturn visitor.mReturnValue;\n\n}\n\n\n\nvoid HeightFieldShape::CastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\tstruct Visitor\n\n\t{\n\n\t\tJPH_INLINE explicit\t\tVisitor(const HeightFieldShape *inShape, const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) : \n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":89,"score":108355.43434601183},{"content":"\tJPH_ADD_BASE_CLASS(HeightFieldShapeTest, Test) \n\n}\n\n\n\nstatic int sTerrainType = 0;\n\n\n\nstatic const char *sTerrainTypes[] = {\n\n\t\"Procedural Terrain\",\n\n\t\"Heightfield 1\",\n\n\t\"Flat\",\n\n\t\"No Collision\"\n\n};\n\n\n\nvoid HeightFieldShapeTest::Initialize()\n\n{\n\n\tif (sTerrainType == 0)\n\n\t{\n\n\t\tconst int n = 128;\n\n\t\tconst float cell_size = 1.0f;\n\n\t\tconst float max_height = 5.0f;\n\n\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":90,"score":108354.15547969351},{"content":"\tuint16 material_index = uint16(material_indices[0]) + uint16(uint16(material_indices[1]) << 8);\n\n\tmaterial_index >>= bit_pos;\n\n\tmaterial_index &= (1 << mNumBitsPerMaterialIndex) - 1;\n\n\n\n\t// Return the material\n\n\treturn mMaterials[material_index];\n\n}\n\n\n\nuint HeightFieldShape::GetSubShapeIDBits() const\n\n{\n\n\t// Need to store X, Y and 1 extra bit to specify the triangle number in the quad\n\n\treturn 2 * (32 - CountLeadingZeros(mSampleCount - 1)) + 1;\n\n}\n\n\n\nSubShapeID HeightFieldShape::EncodeSubShapeID(const SubShapeIDCreator &inCreator, uint inX, uint inY, uint inTriangle) const\n\n{\n\n\treturn inCreator.PushID((inX + inY * mSampleCount) * 2 + inTriangle, GetSubShapeIDBits()).GetID();\n\n}\n\n\n\nvoid HeightFieldShape::DecodeSubShapeID(const SubShapeID &inSubShapeID, uint &outX, uint &outY, uint &outTriangle) const\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":91,"score":108353.50600731463},{"content":"\n\nvoid HeightFieldShapeTest::PrePhysicsUpdate(const PreUpdateParams &inParams)\n\n{\n\n\t// Test the 'GetHeight' function and draw a marker on the surface\n\n\tVec3 test_pos = inParams.mCameraState.mPos + 10.0f * inParams.mCameraState.mForward, surface_pos;\n\n\tSubShapeID sub_shape_id;\n\n\tif (mHeightField->ProjectOntoSurface(test_pos, surface_pos, sub_shape_id))\n\n\t{\n\n\t\tVec3 surface_normal = mHeightField->GetSurfaceNormal(sub_shape_id, surface_pos);\n\n\t\tmDebugRenderer->DrawMarker(surface_pos, Color::sWhite, 1.0f);\n\n\t\tmDebugRenderer->DrawArrow(surface_pos, surface_pos + surface_normal, Color::sRed, 0.1f);\n\n\t}\n\n\n\n\t// Draw the original uncompressed terrain\n\n\tif (sShowOriginalTerrain)\n\n\t\tfor (uint y = 0; y < mTerrainSize; ++y)\n\n\t\t\tfor (uint x = 0; x < mTerrainSize; ++x)\n\n\t\t\t{\n\n\t\t\t\t// Get original height\n\n\t\t\t\tfloat h = mTerrain[y * mTerrainSize + x];\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":92,"score":108353.44660591616},{"content":"\t\t\tUVec4 collides = AABox4VsBox(mBoundsOf1InSpaceOf2, bounds_min_x, bounds_min_y, bounds_min_z, bounds_max_x, bounds_max_y, bounds_max_z);\n\n\t\t\treturn CountAndSortTrues(collides, ioProperties);\n\n\t\t}\n\n\n\n\t\tJPH_INLINE void\t\t\t\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\n\n\t\t{\t\t\t\n\n\t\t\t// Create ID for triangle\n\n\t\t\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\n\n\n\n\t\t\t// Determine active edges\n\n\t\t\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\n\n\n\n\t\t\tCollide(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\n\n\t\t}\n\n\n\n\t\tconst HeightFieldShape *\tmShape2;\n\n\t\tSubShapeIDCreator\t\t\tmSubShapeIDCreator2;\n\n\t};\n\n\n\n\tVisitor visitor(shape1, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1.GetID(), inCollideShapeSettings, ioCollector);\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":93,"score":108353.15604323454},{"content":"\treturn mCachedResult;\n\n}\n\n\n\nvoid HeightFieldShapeSettings::DetermineMinAndMaxSample(float &outMinValue, float &outMaxValue, float &outQuantizationScale) const\n\n{\n\n\t// Determine min and max value\n\n\toutMinValue = FLT_MAX;\n\n\toutMaxValue = -FLT_MAX;\n\n\tfor (float h : mHeightSamples)\n\n\t\tif (h != cNoCollisionValue)\n\n\t\t{\n\n\t\t\toutMinValue = min(outMinValue, h);\n\n\t\t\toutMaxValue = max(outMaxValue, h);\n\n\t\t}\n\n\n\n\t// Prevent dividing by zero by setting a minimal height difference\n\n\tfloat height_diff = max(outMaxValue - outMinValue, 1.0e-6f);\n\n\n\n\t// Calculate the scale factor to quantize to 16 bits\n\n\toutQuantizationScale = float(cMaxHeightValue16) / height_diff;\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":94,"score":108351.34052571692},{"content":"\t\t\t*mMaterials++ = mShape->GetMaterial(inX, inY);\n\n\n\n\t\t// Accumulate triangles found\n\n\t\tmNumTrianglesFound++;\n\n\t}\n\n\n\n\tDecodingContext\t\t\t\tmDecodeCtx;\n\n\tconst HeightFieldShape *\tmShape;\n\n\tOrientedBox\t\t\t\t\tmLocalBox;\n\n\tVec3\t\t\t\t\t\tmHeightFieldScale;\n\n\tMat44\t\t\t\t\t\tmLocalToWorld;\n\n\tint\t\t\t\t\t\t\tmMaxTrianglesRequested;\n\n\tFloat3 *\t\t\t\t\tmTriangleVertices;\n\n\tint\t\t\t\t\t\t\tmNumTrianglesFound;\n\n\tconst PhysicsMaterial **\tmMaterials;\n\n\tbool\t\t\t\t\t\tmShouldAbort;\n\n\tbool\t\t\t\t\t\tmIsInsideOut;\n\n};\n\n\n\nvoid HeightFieldShape::GetTrianglesStart(GetTrianglesContext &ioContext, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) const\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":95,"score":108350.48418782894},{"content":"\t\treturn AABox(center, center);\n\n\t}\n\n\telse\n\n\t{\n\n\t\t// Bounding box based on min and max sample height\n\n\t\tVec3 bmin = mOffset + mScale * Vec3(0.0f, float(mMinSample), 0.0f);\n\n\t\tVec3 bmax = mOffset + mScale * Vec3(float(mSampleCount - 1), float(mMaxSample), float(mSampleCount - 1));\n\n\t\treturn AABox(bmin, bmax);\n\n\t}\n\n}\n\n\n\n#ifdef JPH_DEBUG_RENDERER\n\nvoid HeightFieldShape::Draw(DebugRenderer *inRenderer, Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, ColorArg inColor, bool inUseMaterialColors, bool inDrawWireframe) const\n\n{\n\n\t// Don't draw anything if we don't have any collision\n\n\tif (mHeightSamples.empty())\n\n\t\treturn;\n\n\n\n\t// Reset the batch if we switch coloring mode\n\n\tif (mCachedUseMaterialColors != inUseMaterialColors)\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":96,"score":108350.19670162618},{"content":"\tcontext.mMaterials = outMaterials;\n\n\tcontext.mShouldAbort = false; // Reset the abort flag\n\n\tcontext.mNumTrianglesFound = 0;\n\n\t\n\n\t// Continue (or start) walking the height field\n\n\tcontext.mDecodeCtx.WalkHeightField(context);\n\n\treturn context.mNumTrianglesFound;\n\n}\n\n\n\nvoid HeightFieldShape::sCollideConvexVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\t// Get the shapes\n\n\tJPH_ASSERT(inShape1->GetType() == EShapeType::Convex);\n\n\tJPH_ASSERT(inShape2->GetType() == EShapeType::HeightField);\n\n\tconst ConvexShape *shape1 = static_cast<const ConvexShape *>(inShape1);\n\n\tconst HeightFieldShape *shape2 = static_cast<const HeightFieldShape *>(inShape2);\n\n\n\n\tstruct Visitor : public CollideConvexVsTriangles\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":97,"score":108350.07447916297},{"content":"\tvisitor.mShape2 = shape2;\n\n\tvisitor.mSubShapeIDCreator2 = inSubShapeIDCreator2;\n\n\tshape2->WalkHeightField(visitor);\n\n}\n\n\n\nvoid HeightFieldShape::sCollideSphereVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\n\n{\n\n\tJPH_PROFILE_FUNCTION();\n\n\n\n\t// Get the shapes\n\n\tJPH_ASSERT(inShape1->GetSubType() == EShapeSubType::Sphere);\n\n\tJPH_ASSERT(inShape2->GetType() == EShapeType::HeightField);\n\n\tconst SphereShape *shape1 = static_cast<const SphereShape *>(inShape1);\n\n\tconst HeightFieldShape *shape2 = static_cast<const HeightFieldShape *>(inShape2);\n\n\n\n\tstruct Visitor : public CollideSphereVsTriangles\n\n\t{\n\n\t\tusing CollideSphereVsTriangles::CollideSphereVsTriangles;\n\n\n\n\t\tJPH_INLINE bool\t\t\t\tShouldAbort() const\n","file_path":"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp","rank":98,"score":108349.77392748058},{"content":"\t\t// Determine scale and offset\n\n\t\tmTerrainOffset = Vec3(-0.5f * cell_size * n, 0.0f, -0.5f * cell_size * n);\n\n\t\tmTerrainScale = Vec3(cell_size, 1.0f, cell_size);\n\n\n\n\t\t// Mark the entire terrain as no collision\n\n\t\tmTerrainSize = n;\n\n\t\tmTerrain.resize(n * n);\n\n\t\tfor (float &v : mTerrain)\n\n\t\t\tv = HeightFieldShapeConstants::cNoCollisionValue;\n\n\t}\n\n\n\n\t// Create height field\n\n\tHeightFieldShapeSettings settings(mTerrain.data(), mTerrainOffset, mTerrainScale, mTerrainSize, mMaterialIndices.data(), mMaterials);\n\n\tsettings.mBlockSize = 1 << sBlockSizeShift;\n\n\tsettings.mBitsPerSample = sBitsPerSample;\n\n\tmHeightField = static_cast<const HeightFieldShape *>(settings.Create().Get().GetPtr());\n\n\tBody &terrain = *mBodyInterface->CreateBody(BodyCreationSettings(mHeightField, Vec3::sZero(), Quat::sIdentity(), EMotionType::Static, Layers::NON_MOVING));\n\n\tmBodyInterface->AddBody(terrain.GetID(), EActivation::DontActivate);\n\n\n\n\t// Validate it\n","file_path":"Samples/Tests/Shapes/HeightFieldShapeTest.cpp","rank":99,"score":108349.64390883422}],"string":"[\n {\n \"content\": \"/// A height field shape. Cannot be used as a dynamic object.\\n\\nclass HeightFieldShape final : public Shape\\n\\n{\\n\\npublic:\\n\\n\\t/// Constructor\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tHeightFieldShape() : Shape(EShapeType::HeightField, EShapeSubType::HeightField) { }\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tHeightFieldShape(const HeightFieldShapeSettings &inSettings, ShapeResult &outResult);\\n\\n\\n\\n\\t// See Shape::MustBeStatic\\n\\n\\tvirtual bool\\t\\t\\t\\t\\tMustBeStatic() const override\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return true; }\\n\\n\\n\\n\\t// See Shape::GetLocalBounds\\n\\n\\tvirtual AABox\\t\\t\\t\\t\\tGetLocalBounds() const override;\\n\\n\\n\\n\\t// See Shape::GetSubShapeIDBitsRecursive\\n\\n\\tvirtual uint\\t\\t\\t\\t\\tGetSubShapeIDBitsRecursive() const override\\t\\t\\t\\t\\t\\t\\t{ return GetSubShapeIDBits(); }\\n\\n\\n\\n\\t// See Shape::GetInnerRadius\\n\\n\\tvirtual float\\t\\t\\t\\t\\tGetInnerRadius() const override\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return 0.0f; }\\n\\n\\n\\n\\t// See Shape::GetMassProperties\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 0,\n \"score\": 154733.17245788907\n },\n {\n \"content\": \"struct RayCast;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/Shape.h\",\n \"rank\": 1,\n \"score\": 154289.84104420443\n },\n {\n \"content\": \"class RayCastResult;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/Shape.h\",\n \"rank\": 2,\n \"score\": 151533.85942643584\n },\n {\n \"content\": \"struct RayCast;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/TransformedShape.h\",\n \"rank\": 3,\n \"score\": 141128.41801112692\n },\n {\n \"content\": \"class RayCastResult;\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/TransformedShape.h\",\n \"rank\": 4,\n \"score\": 138099.12036171422\n },\n {\n \"content\": \"\\t\\t// A collector that just counts the number of hits\\n\\n\\t\\tclass HitCountCollector : public CastRayCollector\\t\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tvirtual void\\tAddHit(const RayCastResult &inResult) override\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Store the last sub shape ID so that we can provide something to our outer hit collector\\n\\n\\t\\t\\t\\tmSubShapeID = inResult.mSubShapeID2;\\n\\n\\n\\n\\t\\t\\t\\t++mHitCount;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tint\\t\\t\\t\\tmHitCount = 0;\\n\\n\\t\\t\\tSubShapeID\\t\\tmSubShapeID;\\n\\n\\t\\t};\\n\\n\\t\\tHitCountCollector collector;\\n\\n\\n\\n\\t\\t// Configure the raycast\\n\\n\\t\\tRayCastSettings settings;\\n\\n\\t\\tsettings.mBackFaceMode = EBackFaceMode::CollideWithBackFaces;\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/MeshShape.cpp\",\n \"rank\": 5,\n \"score\": 134980.19997187192\n },\n {\n \"content\": \"/// A compound shape, sub shapes can be rotated and translated.\\n\\n/// Sub shapes cannot be modified once the shape is constructed.\\n\\n/// Shifts all child objects so that they're centered around the center of mass.\\n\\nclass StaticCompoundShape final : public CompoundShape\\n\\n{\\n\\npublic:\\n\\n\\t/// Constructor\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tStaticCompoundShape() : CompoundShape(EShapeSubType::StaticCompound) { }\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tStaticCompoundShape(const StaticCompoundShapeSettings &inSettings, TempAllocator &inTempAllocator, ShapeResult &outResult);\\n\\n\\n\\n\\t// See Shape::CastRay\\n\\n\\tvirtual bool\\t\\t\\t\\t\\tCastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const override;\\n\\n\\tvirtual void\\t\\t\\t\\t\\tCastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const override;\\n\\n\\n\\n\\t// See: Shape::CollidePoint\\n\\n\\tvirtual void\\t\\t\\t\\t\\tCollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const override;\\n\\n\\n\\n\\t// See Shape::CollectTransformedShapes\\n\\n\\tvirtual void\\t\\t\\t\\t\\tCollectTransformedShapes(const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale, const SubShapeIDCreator &inSubShapeIDCreator, TransformedShapeCollector &ioCollector) const override;\\n\\n\\n\\n\\t// See: CompoundShape::GetIntersectingSubShapes\\n\\n\\tvirtual int\\t\\t\\t\\t\\t\\tGetIntersectingSubShapes(const AABox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const override;\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 6,\n \"score\": 121047.48369150463\n },\n {\n \"content\": \"/// Class that constructs a HeightFieldShape\\n\\nclass HeightFieldShapeSettings final : public ShapeSettings\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_SERIALIZABLE_VIRTUAL(HeightFieldShapeSettings)\\n\\n\\n\\n\\t/// Default constructor for deserialization\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tHeightFieldShapeSettings() = default;\\n\\n\\n\\n\\t/// Create a height field shape of inSampleCount * inSampleCount vertices.\\n\\n\\t/// The height field is a surface defined by: inOffset + inScale * (x, inSamples[y * inSampleCount + x], y).\\n\\n\\t/// where x and y are integers in the range x and y e [0, inSampleCount - 1].\\n\\n\\t/// inSampleCount: inSampleCount / mBlockSize must be a power of 2 and minimally 2.\\n\\n\\t/// inSamples: inSampleCount^2 vertices.\\n\\n\\t/// inMaterialIndices: (inSampleCount - 1)^2 indices that index into inMaterialList.\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tHeightFieldShapeSettings(const float *inSamples, Vec3Arg inOffset, Vec3Arg inScale, uint32 inSampleCount, const uint8 *inMaterialIndices = nullptr, const PhysicsMaterialList &inMaterialList = PhysicsMaterialList());\\n\\n\\n\\n\\t// See: ShapeSettings\\n\\n\\tvirtual ShapeResult\\t\\t\\t\\tCreate() const override;\\n\\n\\n\\n\\t/// Determine the minimal and maximal value of mHeightSamples (will ignore cNoCollisionValue)\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 7,\n \"score\": 119301.00293122137\n },\n {\n \"content\": \"class StaticCompoundShapeTest : public Test\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_RTTI_VIRTUAL(StaticCompoundShapeTest)\\n\\n\\n\\n\\t// See: Test\\n\\n\\tvirtual void\\tInitialize() override;\\n\\n};\",\n \"file_path\": \"Samples/Tests/Shapes/StaticCompoundShapeTest.h\",\n \"rank\": 8,\n \"score\": 118351.96146518998\n },\n {\n \"content\": \"class HeightFieldShapeTest : public Test\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_RTTI_VIRTUAL(HeightFieldShapeTest)\\n\\n\\n\\n\\t// Initialize the test\\n\\n\\tvirtual void\\t\\tInitialize() override;\\n\\n\\n\\n\\t// Update the test, called before the physics update\\n\\n\\tvirtual void\\t\\tPrePhysicsUpdate(const PreUpdateParams &inParams) override;\\n\\n\\n\\n\\t// Override to specify the initial camera state (local to GetCameraPivot)\\n\\n\\tvirtual void\\t\\tGetInitialCamera(CameraState &ioState) const override;\\n\\n\\n\\n\\t// Optional settings menu\\n\\n\\tvirtual bool\\t\\tHasSettingsMenu() const\\toverride\\t\\t\\t\\t\\t\\t\\t{ return true; }\\n\\n\\tvirtual void\\t\\tCreateSettingsMenu(DebugUI *inUI, UIElement *inSubMenu) override;\\n\\n\\n\\n\\t// Original (uncompressed) terrain\\n\\n\\tvector<float>\\t\\tmTerrain;\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.h\",\n \"rank\": 9,\n \"score\": 118266.76385489863\n },\n {\n \"content\": \"class HeightFieldShape::DecodingContext\\n\\n{\\n\\npublic:\\n\\n\\tJPH_INLINE explicit\\t\\t\\tDecodingContext(const HeightFieldShape *inShape) :\\n\\n\\t\\tmShape(inShape)\\n\\n\\t{\\n\\n\\t\\tstatic_assert(sizeof(sGridOffsets) / sizeof(uint) == cNumBitsXY + 1, \\\"Offsets array is not long enough\\\");\\n\\n\\t\\n\\n\\t\\t// Construct root stack entry\\n\\n\\t\\tmPropertiesStack[0] = 0; // level: 0, x: 0, y: 0\\n\\n\\t}\\n\\n\\n\\n\\ttemplate <class Visitor>\\n\\n\\tJPH_INLINE void\\t\\t\\t\\tWalkHeightField(Visitor &ioVisitor)\\n\\n\\t{\\n\\n\\t\\t// Early out if there's no collision\\n\\n\\t\\tif (mShape->mHeightSamples.empty())\\n\\n\\t\\t\\treturn;\\n\\n\\n\\n\\t\\t// Precalculate values relating to sample count\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 10,\n \"score\": 118266.76385489863\n },\n {\n \"content\": \"/// Class that constructs a StaticCompoundShape. Note that if you only want a compound of 1 shape, use a RotatedTranslatedShape instead.\\n\\nclass StaticCompoundShapeSettings final : public CompoundShapeSettings\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_SERIALIZABLE_VIRTUAL(StaticCompoundShapeSettings)\\n\\n\\n\\n\\t// See: ShapeSettings\\n\\n\\tvirtual ShapeResult\\t\\t\\t\\tCreate() const override;\\n\\n\\n\\n\\t/// Specialization of Create() function that allows specifying a temp allocator to avoid temporary memory allocations on the heap\\n\\n\\tShapeResult\\t\\t\\t\\t\\t\\tCreate(TempAllocator &inTempAllocator) const;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 11,\n \"score\": 117762.51919873337\n },\n {\n \"content\": \"struct HeightFieldShape::HSGetTrianglesContext\\n\\n{\\n\\n\\t\\t\\tHSGetTrianglesContext(const HeightFieldShape *inShape, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) : \\n\\n\\t\\tmDecodeCtx(inShape),\\n\\n\\t\\tmShape(inShape),\\n\\n\\t\\tmLocalBox(Mat44::sInverseRotationTranslation(inRotation, inPositionCOM), inBox),\\n\\n\\t\\tmHeightFieldScale(inScale),\\n\\n\\t\\tmLocalToWorld(Mat44::sRotationTranslation(inRotation, inPositionCOM) * Mat44::sScale(inScale)),\\n\\n\\t\\tmIsInsideOut(ScaleHelpers::IsInsideOut(inScale))\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tbool\\tShouldAbort() const\\n\\n\\t{\\n\\n\\t\\treturn mShouldAbort;\\n\\n\\t}\\n\\n\\n\\n\\tbool\\tShouldVisitRangeBlock([[maybe_unused]] int inStackTop) const\\n\\n\\t{\\n\\n\\t\\treturn true;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 12,\n \"score\": 114656.86230015199\n },\n {\n \"content\": \"// Tests a lot of random rays against convex shapes\\n\\nclass RandomRayTest : public Test\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_RTTI_VIRTUAL(RandomRayTest)\\n\\n\\n\\n\\t// Update the test, called before the physics update\\n\\n\\tvirtual void\\tPrePhysicsUpdate(const PreUpdateParams &inParams) override;\\n\\n\\n\\nprivate:\\n\\n\\ttemplate <typename A, typename Context>\\n\\n\\tvoid\\t\\t\\tTestRay(const char *inTestName, Vec3Arg inRenderOffset, const A &inA, const Context &inContext, float (*inCompareFunc)(const Context &inContext, Vec3Arg inRayOrigin, Vec3Arg inRayDirection));\\n\\n};\",\n \"file_path\": \"Samples/Tests/ConvexCollision/RandomRayTest.h\",\n \"rank\": 13,\n \"score\": 114411.08751886727\n },\n {\n \"content\": \"/// Base class for all shapes (collision volume of a body). Defines a virtual interface for collision detection.\\n\\nclass Shape : public RefTarget<Shape>\\n\\n{\\n\\npublic:\\n\\n\\tusing ShapeResult = ShapeSettings::ShapeResult;\\n\\n\\n\\n\\t/// Constructor\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tShape(EShapeType inType, EShapeSubType inSubType) : mShapeType(inType), mShapeSubType(inSubType) { }\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tShape(EShapeType inType, EShapeSubType inSubType, const ShapeSettings &inSettings, [[maybe_unused]] ShapeResult &outResult) : mUserData(inSettings.mUserData), mShapeType(inType), mShapeSubType(inSubType) { }\\n\\n\\n\\n\\t/// Destructor\\n\\n\\tvirtual\\t\\t\\t\\t\\t\\t\\t~Shape() = default;\\n\\n\\n\\n\\t/// Get type\\n\\n\\tinline EShapeType\\t\\t\\t\\tGetType() const\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return mShapeType; }\\n\\n\\tinline EShapeSubType\\t\\t\\tGetSubType() const\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return mShapeSubType; }\\n\\n\\n\\n\\t/// User data (to be used freely by the application)\\n\\n\\tuint64\\t\\t\\t\\t\\t\\t\\tGetUserData() const\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return mUserData; }\\n\\n\\tvoid\\t\\t\\t\\t\\t\\t\\tSetUserData(uint64 inUserData)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ mUserData = inUserData; }\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/Shape.h\",\n \"rank\": 14,\n \"score\": 113410.11042640018\n },\n {\n \"content\": \"class ScaledStaticCompoundShapeTest : public Test\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_RTTI_VIRTUAL(ScaledStaticCompoundShapeTest)\\n\\n\\n\\n\\t// See: Test\\n\\n\\tvirtual void\\tInitialize() override;\\n\\n};\",\n \"file_path\": \"Samples/Tests/ScaledShapes/ScaledStaticCompoundShapeTest.h\",\n \"rank\": 15,\n \"score\": 113015.5879773088\n },\n {\n \"content\": \"class ScaledHeightFieldShapeTest : public Test\\n\\n{\\n\\npublic:\\n\\n\\tJPH_DECLARE_RTTI_VIRTUAL(ScaledHeightFieldShapeTest)\\n\\n\\n\\n\\t// See: Test\\n\\n\\tvirtual void\\tInitialize() override;\\n\\n};\",\n \"file_path\": \"Samples/Tests/ScaledShapes/ScaledHeightFieldShapeTest.h\",\n \"rank\": 16,\n \"score\": 112934.77451971255\n },\n {\n \"content\": \"class ConvexShape;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 17,\n \"score\": 112288.8555352129\n },\n {\n \"content\": \"class Shape;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/Shape.h\",\n \"rank\": 18,\n \"score\": 111918.09116121448\n },\n {\n \"content\": \"\\t\\tINVALID_NODE\\t\\t\\t\\t= 0x7fffffff,\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t///< Signifies an invalid node\\n\\n\\t};\\n\\n\\n\\n\\t/// Node structure\\n\\n\\tstruct Node\\n\\n\\t{\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tSetChildBounds(uint inIndex, const AABox &inBounds);\\t///< Set bounding box for child inIndex to inBounds\\n\\n\\t\\tvoid\\t\\t\\t\\t\\t\\tSetChildInvalid(uint inIndex);\\t\\t\\t\\t\\t\\t\\t///< Mark the child inIndex as invalid and set its bounding box to invalid\\n\\n\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMinX[4];\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t///< 4 child bounding boxes\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMinY[4];\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMinZ[4];\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMaxX[4];\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMaxY[4];\\n\\n\\t\\tHalfFloat\\t\\t\\t\\t\\tmBoundsMaxZ[4];\\n\\n\\t\\tuint32\\t\\t\\t\\t\\t\\tmNodeProperties[4];\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t///< 4 child node properties\\n\\n\\t};\\n\\n\\t\\n\\n\\tstatic_assert(sizeof(Node) == 64, \\\"Node should be 64 bytes\\\");\\n\\n\\n\\n\\tusing Nodes = vector<Node>;\\n\\n\\n\\n\\tNodes\\t\\t\\t\\t\\t\\t\\tmNodes;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t///< Quad tree node structure\\n\\n};\\n\\n\\n\\n} // JPH\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 19,\n \"score\": 111178.70432124006\n },\n {\n \"content\": \"\\t/// Sorts ioBodyIdx from inBegin to (but excluding) inEnd spatially into 4 groups. \\n\\n\\t/// outSplit needs to be 5 ints long, when the function returns each group runs from outSplit[i] to (but excluding) outSplit[i + 1]\\n\\n\\t/// After the function returns ioBodyIdx and ioBounds will be shuffled\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsPartition4(uint *ioBodyIdx, AABox *ioBounds, int inBegin, int inEnd, int *outSplit);\\n\\n\\n\\n\\t// Helper functions called by CollisionDispatch\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCollideCompoundVsShape(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCollideShapeVsCompound(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCastShapeVsCompound(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\\n\\n\\n\\n\\t// Maximum size of the stack during tree walk\\n\\n\\tstatic constexpr int\\t\\t\\tcStackSize = 128;\\n\\n\\n\\n\\ttemplate <class Visitor>\\n\\n\\tJPH_INLINE void\\t\\t\\t\\t\\tWalkTree(Visitor &ioVisitor) const;\\t\\t\\t\\t\\t\\t///< Walk the node tree calling the Visitor::VisitNodes for each node encountered and Visitor::VisitShape for each sub shape encountered\\n\\n\\n\\n\\t/// Bits used in Node::mNodeProperties\\n\\n\\tenum : uint32\\n\\n\\t{\\n\\n\\t\\tIS_SUBSHAPE\\t\\t\\t\\t\\t= 0x80000000,\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t///< If this bit is set, the other bits index in mSubShape, otherwise in mNodes\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 20,\n \"score\": 111178.16836016592\n },\n {\n \"content\": \"\\t// See: CompoundShape::GetIntersectingSubShapes\\n\\n\\tvirtual int\\t\\t\\t\\t\\t\\tGetIntersectingSubShapes(const OrientedBox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const override;\\n\\n\\n\\n\\t// See Shape\\n\\n\\tvirtual void\\t\\t\\t\\t\\tSaveBinaryState(StreamOut &inStream) const override;\\n\\n\\n\\n\\t// See Shape::GetStats\\n\\n\\tvirtual Stats\\t\\t\\t\\t\\tGetStats() const override\\t\\t\\t\\t\\t\\t\\t\\t{ return Stats(sizeof(*this) + mSubShapes.size() * sizeof(SubShape) + mNodes.size() * sizeof(Node), 0); }\\n\\n\\n\\n\\t// Register shape functions with the registry\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsRegister();\\n\\n\\n\\nprotected:\\n\\n\\t// See: Shape::RestoreBinaryState\\n\\n\\tvirtual void\\t\\t\\t\\t\\tRestoreBinaryState(StreamIn &inStream) override;\\n\\n\\n\\nprivate:\\n\\n\\t// Visitor for GetIntersectingSubShapes\\n\\n\\ttemplate <class BoxType>\\n\\n\\tstruct GetIntersectingSubShapesVisitorSC : public GetIntersectingSubShapesVisitor<BoxType>\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 21,\n \"score\": 111173.51102115902\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tusing GetIntersectingSubShapesVisitor<BoxType>::GetIntersectingSubShapesVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\t\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\t\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test if point overlaps with box\\n\\n\\t\\t\\tUVec4 collides = GetIntersectingSubShapesVisitor<BoxType>::TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\t/// Sorts ioBodyIdx spatially into 2 groups. Second groups starts at ioBodyIdx + outMidPoint.\\n\\n\\t/// After the function returns ioBodyIdx and ioBounds will be shuffled\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsPartition(uint *ioBodyIdx, AABox *ioBounds, int inNumber, int &outMidPoint);\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 22,\n \"score\": 111172.82280417481\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <Physics/Collision/Shape/CompoundShape.h>\\n\\n#include <Physics/Collision/SortReverseAndStore.h>\\n\\n#include <Math/HalfFloat.h>\\n\\n\\n\\nnamespace JPH {\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 23,\n \"score\": 111171.74471369457\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <Tests/Test.h>\\n\\n\\n\",\n \"file_path\": \"Samples/Tests/Shapes/StaticCompoundShapeTest.h\",\n \"rank\": 24,\n \"score\": 111159.11117166236\n },\n {\n \"content\": \"\\tvirtual bool\\t\\t\\t\\t\\tCastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const override;\\n\\n\\tvirtual void\\t\\t\\t\\t\\tCastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const override;\\n\\n\\n\\n\\t// See: Shape::CollidePoint\\n\\n\\tvirtual void\\t\\t\\t\\t\\tCollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const override;\\n\\n\\n\\n\\t// See Shape::GetTrianglesStart\\n\\n\\tvirtual void\\t\\t\\t\\t\\tGetTrianglesStart(GetTrianglesContext &ioContext, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) const override;\\n\\n\\n\\n\\t// See Shape::GetTrianglesNext\\n\\n\\tvirtual int\\t\\t\\t\\t\\t\\tGetTrianglesNext(GetTrianglesContext &ioContext, int inMaxTrianglesRequested, Float3 *outTriangleVertices, const PhysicsMaterial **outMaterials = nullptr) const override;\\n\\n\\n\\n\\t/// Get height field position at sampled location (inX, inY).\\n\\n\\t/// where inX and inY are integers in the range inX e [0, mSampleCount - 1] and inY e [0, mSampleCount - 1].\\n\\n\\tVec3\\t\\t\\t\\t\\t\\t\\tGetPosition(uint inX, uint inY) const;\\n\\n\\n\\n\\t/// Check if height field at sampled location (inX, inY) has collision (has a hole or not)\\n\\n\\tbool\\t\\t\\t\\t\\t\\t\\tIsNoCollision(uint inX, uint inY) const;\\n\\n\\n\\n\\t/// Projects inLocalPosition (a point in the space of the shape) along the Y axis onto the surface and returns it in outSurfacePosition.\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 25,\n \"score\": 111119.47679227329\n },\n {\n \"content\": \"\\n\\n\\t/// For block (inBlockX, inBlockY) get the offset and scale needed to decode a uint8 height sample to a uint16\\n\\n\\tinline void\\t\\t\\t\\t\\t\\tGetBlockOffsetAndScale(uint inBlockX, uint inBlockY, uint inRangeBlockOffset, uint inRangeBlockStride, float &outBlockOffset, float &outBlockScale) const;\\n\\n\\n\\n\\t/// Get the height sample at position (inX, inY)\\n\\n\\tinline uint8\\t\\t\\t\\t\\tGetHeightSample(uint inX, uint inY) const;\\n\\n\\n\\n\\t/// Faster version of GetPosition when block offset and scale are already known\\n\\n\\tinline Vec3\\t\\t\\t\\t\\t\\tGetPosition(uint inX, uint inY, float inBlockOffset, float inBlockScale, bool &outNoCollision) const;\\n\\n\\t\\t\\n\\n\\t/// Determine amount of bits needed to encode sub shape id\\n\\n\\tuint\\t\\t\\t\\t\\t\\t\\tGetSubShapeIDBits() const;\\n\\n\\n\\n\\t/// En/decode a sub shape ID. inX and inY specify the coordinate of the triangle. inTriangle == 0 is the lower triangle, inTriangle == 1 is the upper triangle.\\n\\n\\tinline SubShapeID\\t\\t\\t\\tEncodeSubShapeID(const SubShapeIDCreator &inCreator, uint inX, uint inY, uint inTriangle) const;\\n\\n\\tinline void\\t\\t\\t\\t\\t\\tDecodeSubShapeID(const SubShapeID &inSubShapeID, uint &outX, uint &outY, uint &outTriangle) const;\\n\\n\\n\\n\\t/// Get the edge flags for a triangle\\n\\n\\tinline uint8\\t\\t\\t\\t\\tGetEdgeFlags(uint inX, uint inY, uint inTriangle) const;\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 26,\n \"score\": 111116.3906726541\n },\n {\n \"content\": \"\\tPhysicsMaterialList mMaterials;\\n\\n\\tvector<uint8>\\t\\tmMaterialIndices;\\n\\n\\tuint\\t\\t\\t\\tmTerrainSize;\\n\\n\\tVec3\\t\\t\\t\\tmTerrainOffset;\\n\\n\\tVec3\\t\\t\\t\\tmTerrainScale;\\n\\n\\n\\n\\t// Block size = 1 << sBlockSizeShift\\n\\n\\tinline static int\\tsBlockSizeShift = 2;\\n\\n\\n\\n\\t// Bits per sample\\n\\n\\tinline static int\\tsBitsPerSample = 8;\\n\\n\\n\\n\\t// Draw the terrain\\n\\n\\tinline static bool\\tsShowOriginalTerrain = false;\\n\\n\\n\\n\\tRefConst<HeightFieldShape> mHeightField;\\n\\n\\n\\n\\tVec3\\t\\t\\t\\tmHitPos = Vec3::sZero();\\n\\n};\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.h\",\n \"rank\": 27,\n \"score\": 111114.2980293988\n },\n {\n \"content\": \"\\tvirtual MassProperties\\t\\t\\tGetMassProperties() const override;\\n\\n\\t\\n\\n\\t// See Shape::GetMaterial\\n\\n\\tvirtual const PhysicsMaterial *\\tGetMaterial(const SubShapeID &inSubShapeID) const override;\\n\\n\\n\\n\\t/// Overload to get the material at a particular location\\n\\n\\tconst PhysicsMaterial *\\t\\t\\tGetMaterial(uint inX, uint inY) const;\\n\\n\\n\\n\\t// See Shape::GetSurfaceNormal\\n\\n\\tvirtual Vec3\\t\\t\\t\\t\\tGetSurfaceNormal(const SubShapeID &inSubShapeID, Vec3Arg inLocalSurfacePosition) const override;\\n\\n\\n\\n\\t// See Shape::GetSubmergedVolume\\n\\n\\tvirtual void\\t\\t\\t\\t\\tGetSubmergedVolume(Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, const Plane &inSurface, float &outTotalVolume, float &outSubmergedVolume, Vec3 &outCenterOfBuoyancy) const override { JPH_ASSERT(false, \\\"Not supported\\\"); }\\n\\n\\n\\n#ifdef JPH_DEBUG_RENDERER\\n\\n\\t// See Shape::Draw\\n\\n\\tvirtual void\\t\\t\\t\\t\\tDraw(DebugRenderer *inRenderer, Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, ColorArg inColor, bool inUseMaterialColors, bool inDrawWireframe) const override;\\n\\n#endif // JPH_DEBUG_RENDERER\\n\\n\\n\\n\\t// See Shape::CastRay\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 28,\n \"score\": 111110.56537759176\n },\n {\n \"content\": \"\\t// Helper functions called by CollisionDispatch\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCollideConvexVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCollideSphereVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector);\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCastConvexVsHeightField(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsCastSphereVsHeightField(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector);\\n\\n\\n\\n\\t/// Visit the entire height field using a visitor pattern\\n\\n\\ttemplate <class Visitor>\\n\\n\\tJPH_INLINE void\\t\\t\\t\\t\\tWalkHeightField(Visitor &ioVisitor) const;\\n\\n\\n\\n\\t/// A block of 2x2 ranges used to form a hierarchical grid, ordered left top, right top, left bottom, right bottom\\n\\n\\tstruct alignas(16) RangeBlock\\n\\n\\t{\\n\\n\\t\\tuint16\\t\\t\\t\\t\\t\\tmMin[4];\\n\\n\\t\\tuint16\\t\\t\\t\\t\\t\\tmMax[4];\\n\\n\\t};\\n\\n\\n\\n\\t/// Offset of first RangedBlock in grid per level\\n\\n\\tstatic const uint\\t\\t\\t\\tsGridOffsets[];\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 29,\n \"score\": 111108.63441200678\n },\n {\n \"content\": \"\\t/// When there is no surface position (because of a hole or because the point is outside the heightfield) the function will return false.\\n\\n\\tbool\\t\\t\\t\\t\\t\\t\\tProjectOntoSurface(Vec3Arg inLocalPosition, Vec3 &outSurfacePosition, SubShapeID &outSubShapeID) const;\\n\\n\\n\\n\\t// See Shape\\n\\n\\tvirtual void\\t\\t\\t\\t\\tSaveBinaryState(StreamOut &inStream) const override;\\n\\n\\tvirtual void\\t\\t\\t\\t\\tSaveMaterialState(PhysicsMaterialList &outMaterials) const override;\\n\\n\\tvirtual void\\t\\t\\t\\t\\tRestoreMaterialState(const PhysicsMaterialRefC *inMaterials, uint inNumMaterials) override;\\n\\n\\n\\n\\t// See Shape::GetStats\\n\\n\\tvirtual Stats\\t\\t\\t\\t\\tGetStats() const override;\\n\\n\\n\\n\\t// See Shape::GetVolume\\n\\n\\tvirtual float\\t\\t\\t\\t\\tGetVolume() const override\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{ return 0; }\\n\\n\\n\\n#ifdef JPH_DEBUG_RENDERER\\n\\n\\t// Settings\\n\\n\\tstatic bool\\t\\t\\t\\t\\t\\tsDrawTriangleOutlines;\\n\\n#endif // JPH_DEBUG_RENDERER\\n\\n\\n\\n\\t// Register shape functions with the registry\\n\\n\\tstatic void\\t\\t\\t\\t\\t\\tsRegister();\\n\\n\\n\\nprotected:\\n\\n\\t// See: Shape::RestoreBinaryState\\n\\n\\tvirtual void\\t\\t\\t\\t\\tRestoreBinaryState(StreamIn &inStream) override;\\n\\n\\n\\nprivate:\\t\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 30,\n \"score\": 111107.22149466866\n },\n {\n \"content\": \"\\t/// @param outMinValue The minimal value fo mHeightSamples or FLT_MAX if no samples have collision\\n\\n\\t/// @param outMaxValue The maximal value fo mHeightSamples or -FLT_MAX if no samples have collision\\n\\n\\t/// @param outQuantizationScale (value - outMinValue) * outQuantizationScale quantizes a height sample to 16 bits\\n\\n\\tvoid\\t\\t\\t\\t\\t\\t\\tDetermineMinAndMaxSample(float &outMinValue, float &outMaxValue, float &outQuantizationScale) const;\\n\\n\\n\\n\\t/// Given mBlockSize, mSampleCount and mHeightSamples, calculate the amount of bits needed to stay below absolute error inMaxError\\n\\n\\t/// @param inMaxError Maximum allowed error in mHeightSamples after compression (note that this does not take mScale.Y into account)\\n\\n\\t/// @return Needed bits per sample in the range [1, 8].\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tCalculateBitsPerSampleForError(float inMaxError) const;\\n\\n\\n\\n\\t/// The height field is a surface defined by: mOffset + mScale * (x, mHeightSamples[y * mSampleCount + x], y).\\n\\n\\t/// where x and y are integers in the range x and y e [0, mSampleCount - 1].\\n\\n\\tVec3\\t\\t\\t\\t\\t\\t\\tmOffset = Vec3::sZero();\\n\\n\\tVec3\\t\\t\\t\\t\\t\\t\\tmScale = Vec3::sReplicate(1.0f);\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmSampleCount = 0;\\n\\n\\n\\n\\t/// The heightfield is divided in blocks of mBlockSize * mBlockSize * 2 triangles and the acceleration structure culls blocks only, \\n\\n\\t/// bigger block sizes reduce memory consumption but also reduce query performance. Sensible values are [2, 8], does not need to be\\n\\n\\t/// a power of 2. Note that at run-time we'll perform one more grid subdivision, so the effective block size is half of what is provided here.\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmBlockSize = 2;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 31,\n \"score\": 111098.10744080409\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <Tests/Test.h>\\n\\n#include <Physics/Collision/Shape/HeightFieldShape.h>\\n\\n\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.h\",\n \"rank\": 32,\n \"score\": 111096.89901669824\n },\n {\n \"content\": \"\\t/// The height field is a surface defined by: mOffset + mScale * (x, mHeightSamples[y * mSampleCount + x], y).\\n\\n\\t/// where x and y are integers in the range x and y e [0, mSampleCount - 1].\\n\\n\\tVec3\\t\\t\\t\\t\\t\\t\\tmOffset = Vec3::sZero();\\n\\n\\tVec3\\t\\t\\t\\t\\t\\t\\tmScale = Vec3::sReplicate(1.0f);\\n\\n\\n\\n\\t/// Height data\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmSampleCount = 0;\\t\\t\\t\\t\\t///< See HeightFieldShapeSettings::mSampleCount\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmBlockSize = 2;\\t\\t\\t\\t\\t\\t///< See HeightFieldShapeSettings::mBlockSize\\n\\n\\tuint8\\t\\t\\t\\t\\t\\t\\tmBitsPerSample = 8;\\t\\t\\t\\t\\t///< See HeightFieldShapeSettings::mBitsPerSample\\n\\n\\tuint8\\t\\t\\t\\t\\t\\t\\tmSampleMask = 0xff;\\t\\t\\t\\t\\t///< All bits set for a sample: (1 << mBitsPerSample) - 1, used to indicate that there's no collision\\n\\n\\tuint16\\t\\t\\t\\t\\t\\t\\tmMinSample = HeightFieldShapeConstants::cNoCollisionValue16;\\t///< Min and max value in mHeightSamples quantized to 16 bit, for calculating bounding box\\n\\n\\tuint16\\t\\t\\t\\t\\t\\t\\tmMaxSample = HeightFieldShapeConstants::cNoCollisionValue16;\\n\\n\\tvector<RangeBlock>\\t\\t\\t\\tmRangeBlocks;\\t\\t\\t\\t\\t\\t///< Hierarchical grid of range data describing the height variations within 1 block. The grid for level <level> starts at offset sGridOffsets[<level>]\\n\\n\\tvector<uint8>\\t\\t\\t\\t\\tmHeightSamples;\\t\\t\\t\\t\\t\\t///< mBitsPerSample-bit height samples. Value [0, mMaxHeightValue] maps to highest detail grid in mRangeBlocks [mMin, mMax]. mNoCollisionValue is reserved to indicate no collision.\\n\\n\\tvector<uint8>\\t\\t\\t\\t\\tmActiveEdges;\\t\\t\\t\\t\\t\\t///< (mSampleCount - 1)^2 * 3-bit active edge flags. \\n\\n\\n\\n\\t/// Materials\\n\\n\\tPhysicsMaterialList\\t\\t\\t\\tmMaterials;\\t\\t\\t\\t\\t\\t\\t///< The materials of square at (x, y) is: mMaterials[mMaterialIndices[x + y * (mSampleCount - 1)]]\\n\\n\\tvector<uint8>\\t\\t\\t\\t\\tmMaterialIndices;\\t\\t\\t\\t\\t///< Compressed to the minimum amount of bits per material index (mSampleCount - 1) * (mSampleCount - 1) * mNumBitsPerMaterialIndex bits of data\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmNumBitsPerMaterialIndex = 0;\\t\\t///< Number of bits per material index\\n\\n\\n\\n#ifdef JPH_DEBUG_RENDERER\\n\\n\\t/// Temporary rendering data\\n\\n\\tmutable vector<DebugRenderer::GeometryRef>\\tmGeometry;\\n\\n\\tmutable bool\\t\\t\\t\\t\\tmCachedUseMaterialColors = false;\\t///< This is used to regenerate the triangle batch if the drawing settings change\\n\\n#endif // JPH_DEBUG_RENDERER\\n\\n};\\n\\n\\n\\n} // JPH\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 33,\n \"score\": 111095.09913134854\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <Physics/Collision/Shape/Shape.h>\\n\\n#include <Physics/Collision/PhysicsMaterial.h>\\n\\n#ifdef JPH_DEBUG_RENDERER\\n\\n\\t#include <Renderer/DebugRenderer.h>\\n\\n#endif // JPH_DEBUG_RENDERER\\n\\n\\n\\nnamespace JPH {\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 34,\n \"score\": 111091.22170916334\n },\n {\n \"content\": \"\\n\\n\\t/// How many bits per sample to use to compress the height field. Can be in the range [1, 8].\\n\\n\\t/// Note that each sample is compressed relative to the min/max value of its block of mBlockSize * mBlockSize pixels so the effective precision is higher.\\n\\n\\t/// Also note that increasing mBlockSize saves more memory than reducing the amount of bits per sample.\\n\\n\\tuint32\\t\\t\\t\\t\\t\\t\\tmBitsPerSample = 8;\\n\\n\\n\\n\\tvector<float>\\t\\t\\t\\t\\tmHeightSamples;\\n\\n\\tvector<uint8>\\t\\t\\t\\t\\tmMaterialIndices;\\n\\n\\n\\n\\t/// The materials of square at (x, y) is: mMaterials[mMaterialIndices[x + y * (mSampleCount - 1)]]\\n\\n\\tPhysicsMaterialList\\t\\t\\t\\tmMaterials;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 35,\n \"score\": 111088.05795907565\n },\n {\n \"content\": \"class CollideShapeSettings;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.h\",\n \"rank\": 36,\n \"score\": 110067.31164693854\n },\n {\n \"content\": \"class CollideShapeSettings;\\n\\n\\n\\n/// Constants for HeightFieldShape, this was moved out of the HeightFieldShape because of a linker bug\\n\\nnamespace HeightFieldShapeConstants\\n\\n{\\n\\n\\t/// Value used to create gaps in the height field\\n\\n\\tconstexpr float\\t\\t\\tcNoCollisionValue = FLT_MAX;\\n\\n\\n\\n\\t/// Stack size to use during WalkHeightField\\n\\n\\tconstexpr int\\t\\t\\tcStackSize = 128;\\n\\n\\n\\n\\t/// A position in the hierarchical grid is defined by a level (which grid), x and y position. We encode this in a single uint32 as: level << 28 | y << 14 | x\\n\\n\\tconstexpr uint\\t\\t\\tcNumBitsXY = 14;\\n\\n\\tconstexpr uint\\t\\t\\tcMaskBitsXY = (1 << cNumBitsXY) - 1;\\n\\n\\tconstexpr uint\\t\\t\\tcLevelShift = 2 * cNumBitsXY;\\n\\n\\n\\n\\t/// When height samples are converted to 16 bit:\\n\\n\\tconstexpr uint16\\t\\tcNoCollisionValue16 = 0xffff;\\t\\t///< This is the magic value for 'no collision'\\n\\n\\tconstexpr uint16\\t\\tcMaxHeightValue16 = 0xfffe;\\t\\t\\t///< This is the maximum allowed height value\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.h\",\n \"rank\": 37,\n \"score\": 109998.71897121661\n },\n {\n \"content\": \"\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test bounds of 4 children\\n\\n\\t\\t\\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mHit.mFraction, ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(inRay, this, inSubShapeIDCreator, ioHit);\\n\\n\\tWalkTree(visitor);\\n\\n\\treturn visitor.mReturnValue;\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::CastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 38,\n \"score\": 108428.69570280617\n },\n {\n \"content\": \"void StaticCompoundShapeTest::Initialize() \\n\\n{\\n\\n\\t// Floor\\n\\n\\tCreateFloor();\\n\\n\\t\\t\\n\\n\\t// Simple compound\\n\\n\\tRef<StaticCompoundShapeSettings> compound_shape1 = new StaticCompoundShapeSettings;\\n\\n\\tcompound_shape1->AddShape(Vec3::sZero(), Quat::sIdentity(), new CapsuleShape(5, 1));\\n\\n\\tcompound_shape1->AddShape(Vec3(0, -5, 0), Quat::sIdentity(), new SphereShape(2));\\n\\n\\tcompound_shape1->AddShape(Vec3(0, 5, 0), Quat::sIdentity(), new SphereShape(2));\\n\\n\\n\\n\\t// Compound with sub compound and rotation\\n\\n\\tRef<StaticCompoundShapeSettings> sub_compound = new StaticCompoundShapeSettings;\\n\\n\\tsub_compound->AddShape(Vec3(0, 1.5f, 0), Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI), new BoxShape(Vec3(1.5f, 0.25f, 0.2f)));\\n\\n\\tsub_compound->AddShape(Vec3(1.5f, 0, 0), Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI), new CylinderShape(1.5f, 0.2f));\\n\\n\\tsub_compound->AddShape(Vec3(0, 0, 1.5f), Quat::sRotation(Vec3::sAxisX(), 0.5f * JPH_PI), new TaperedCapsuleShapeSettings(1.5f, 0.25f, 0.2f));\\n\\n\\n\\n\\tRef<StaticCompoundShapeSettings> compound_shape2 = new StaticCompoundShapeSettings;\\n\\n\\tcompound_shape2->AddShape(Vec3(0, 0, 0), Quat::sRotation(Vec3::sAxisX(), -0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), 0.25f * JPH_PI), sub_compound);\\n\\n\\tcompound_shape2->AddShape(Vec3(0, -0.1f, 0), Quat::sRotation(Vec3::sAxisX(), 0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), -0.75f * JPH_PI), sub_compound);\\n\",\n \"file_path\": \"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp\",\n \"rank\": 39,\n \"score\": 108425.37867068152\n },\n {\n \"content\": \"\\t};\\n\\n\\n\\n\\tVisitor visitor(inRay, inRayCastSettings, this, inSubShapeIDCreator, ioCollector);\\n\\n\\tWalkTree(visitor);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::CollidePoint(Vec3Arg inPoint, const SubShapeIDCreator &inSubShapeIDCreator, CollidePointCollector &ioCollector) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor : public CollidePointVisitor\\n\\n\\t{\\n\\n\\t\\tusing CollidePointVisitor::CollidePointVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 40,\n \"score\": 108422.97853669533\n },\n {\n \"content\": \"\\n\\n\\t// Compound with large amount of sub shapes\\n\\n\\tRef<StaticCompoundShapeSettings> compound_shape3 = new StaticCompoundShapeSettings;\\n\\n\\tfor (int y = -2; y <= 2; ++y)\\n\\n\\t\\tfor (int x = -2; x <= 2; ++x)\\n\\n\\t\\t\\tfor (int z = -2; z <= 2; ++z)\\n\\n\\t\\t\\t\\tcompound_shape3->AddShape(Vec3(0.5f * x, 0.5f * y, 0.5f * z), Quat::sRotation(Vec3::sAxisX(), -0.25f * JPH_PI) * Quat::sRotation(Vec3::sAxisZ(), 0.25f * JPH_PI), new BoxShape(Vec3::sReplicate(0.5f)));\\n\\n\\n\\n\\tRef<StaticCompoundShapeSettings> shapes[] = { compound_shape1, compound_shape2, compound_shape3 };\\n\\n\\n\\n\\tfor (int i = 0; i < 10; ++i)\\n\\n\\t\\tfor (int j = 0; j < 3; ++j)\\n\\n\\t\\t{\\n\\n\\t\\t\\tQuat rotation;\\n\\n\\t\\t\\tif ((i & 1) == 0)\\n\\n\\t\\t\\t\\trotation = Quat::sRotation(Vec3::sAxisX(), 0.5f * JPH_PI);\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t\\trotation = Quat::sRotation(Vec3::sAxisZ(), 0.5f * JPH_PI);\\n\\n\\t\\t\\tBody &body = *mBodyInterface->CreateBody(BodyCreationSettings(shapes[j], Vec3(0, 10.0f + 4.0f * i, j * 20.0f), rotation, EMotionType::Dynamic, Layers::MOVING));\\n\\n\\t\\t\\tmBodyInterface->AddBody(body.GetID(), EActivation::Activate);\\n\\n\\t\\t}\\n\\n}\",\n \"file_path\": \"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp\",\n \"rank\": 41,\n \"score\": 108421.22275961464\n },\n {\n \"content\": \"\\n\\n\\t// Make bounding box invalid\\n\\n\\tmBoundsMinX[inIndex] = HALF_FLT_MAX;\\n\\n\\tmBoundsMinY[inIndex] = HALF_FLT_MAX;\\n\\n\\tmBoundsMinZ[inIndex] = HALF_FLT_MAX;\\n\\n\\tmBoundsMaxX[inIndex] = HALF_FLT_MAX;\\n\\n\\tmBoundsMaxY[inIndex] = HALF_FLT_MAX;\\n\\n\\tmBoundsMaxZ[inIndex] = HALF_FLT_MAX;\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::Node::SetChildBounds(uint inIndex, const AABox &inBounds)\\n\\n{\\n\\n\\tmBoundsMinX[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetX());\\n\\n\\tmBoundsMinY[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetY());\\n\\n\\tmBoundsMinZ[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_NEG_INF>(inBounds.mMin.GetZ());\\n\\n\\tmBoundsMaxX[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetX());\\n\\n\\tmBoundsMaxY[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetY());\\n\\n\\tmBoundsMaxZ[inIndex] = HalfFloatConversion::FromFloat<HalfFloatConversion::ROUND_TO_POS_INF>(inBounds.mMax.GetZ());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 42,\n \"score\": 108421.0398308562\n },\n {\n \"content\": \"\\n\\nStaticCompoundShape::StaticCompoundShape(const StaticCompoundShapeSettings &inSettings, TempAllocator &inTempAllocator, ShapeResult &outResult) :\\n\\n\\tCompoundShape(EShapeSubType::StaticCompound, inSettings, outResult)\\n\\n{\\n\\n\\t// Check that there's at least 1 shape\\n\\n\\tuint num_subshapes = (uint)inSettings.mSubShapes.size();\\n\\n\\tif (num_subshapes < 2)\\n\\n\\t{\\n\\n\\t\\toutResult.SetError(\\\"Compound needs at least 2 sub shapes, otherwise you should use a RotatedTranslatedShape!\\\");\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\t// Keep track of total mass to calculate center of mass\\n\\n\\tfloat mass = 0.0f;\\n\\n\\n\\n\\tmSubShapes.resize(num_subshapes);\\n\\n\\tfor (uint i = 0; i < num_subshapes; ++i)\\n\\n\\t{\\n\\n\\t\\tconst CompoundShapeSettings::SubShapeSettings &shape = inSettings.mSubShapes[i];\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 43,\n \"score\": 108420.84090981471\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\treturn mDistanceStack[inStackTop] < mCollector.GetEarlyOutFraction();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test bounds of 4 children\\n\\n\\t\\t\\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\\n\\t};\\n\\n\\n\\n\\tJPH_ASSERT(inShape->GetSubType() == EShapeSubType::StaticCompound);\\n\\n\\tconst StaticCompoundShape *shape = static_cast<const StaticCompoundShape *>(inShape);\\n\\n\\n\\n\\tVisitor visitor(inShapeCast, inShapeCastSettings, shape, inScale, inShapeFilter, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, ioCollector);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 44,\n \"score\": 108420.76646505923\n },\n {\n \"content\": \"\\t\\tdo \\n\\n\\t\\t\\t--top;\\n\\n\\t\\twhile (top >= 0 && !ioVisitor.ShouldVisitNode(top));\\n\\n\\t}\\n\\n\\twhile (top >= 0);\\n\\n}\\n\\n\\n\\nbool StaticCompoundShape::CastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor : public CastRayVisitor\\n\\n\\t{\\n\\n\\t\\tusing CastRayVisitor::CastRayVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn mDistanceStack[inStackTop] < mHit.mFraction;\\n\\n\\t\\t}\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 45,\n \"score\": 108420.74494302599\n },\n {\n \"content\": \"\\tshape->WalkTree(visitor);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::CollectTransformedShapes(const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale, const SubShapeIDCreator &inSubShapeIDCreator, TransformedShapeCollector &ioCollector) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor : public CollectTransformedShapesVisitor\\n\\n\\t{\\n\\n\\t\\tusing CollectTransformedShapesVisitor::CollectTransformedShapesVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test which nodes collide\\n\\n\\t\\t\\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 46,\n \"score\": 108420.03245934602\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t\\telse\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Build a regular compound shape\\n\\n\\t\\t\\tRef<Shape> shape = new StaticCompoundShape(*this, inTempAllocator, mCachedResult); \\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn mCachedResult;\\n\\n}\\n\\n\\n\\nShapeSettings::ShapeResult StaticCompoundShapeSettings::Create() const\\n\\n{\\n\\n\\tTempAllocatorMalloc allocator;\\n\\n\\treturn Create(allocator);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::Node::SetChildInvalid(uint inIndex)\\n\\n{\\n\\n\\t// Make this an invalid node\\n\\n\\tmNodeProperties[inIndex] = INVALID_NODE;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 47,\n \"score\": 108419.8885175681\n },\n {\n \"content\": \"void StaticCompoundShape::sPartition(uint *ioBodyIdx, AABox *ioBounds, int inNumber, int &outMidPoint)\\n\\n{\\n\\n\\t// Handle trivial case\\n\\n\\tif (inNumber <= 4)\\n\\n\\t{\\n\\n\\t\\toutMidPoint = inNumber / 2;\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\t// Calculate bounding box of box centers\\n\\n\\tVec3 center_min = Vec3::sReplicate(FLT_MAX);\\n\\n\\tVec3 center_max = Vec3::sReplicate(-FLT_MAX);\\n\\n\\tfor (AABox *b = ioBounds, *b_end = ioBounds + inNumber; b < b_end; ++b)\\n\\n\\t{\\n\\n\\t\\tVec3 center = b->GetCenter();\\n\\n\\t\\tcenter_min = Vec3::sMin(center_min, center);\\n\\n\\t\\tcenter_max = Vec3::sMax(center_max, center);\\n\\n\\t}\\n\\n\\n\\n\\t// Calculate split plane\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 48,\n \"score\": 108419.63428147406\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test which nodes collide\\n\\n\\t\\t\\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(shape1, inShape2, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, inCollideShapeSettings, ioCollector);\\n\\n\\tshape1->WalkTree(visitor);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::sCollideShapeVsCompound(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor : public CollideShapeVsCompoundVisitor\\n\\n\\t{\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 49,\n \"score\": 108418.77231983165\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\t// Test if point overlaps with box\\n\\n\\t\\t\\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(inPoint, this, inSubShapeIDCreator, ioCollector);\\n\\n\\tWalkTree(visitor);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::sCastShapeVsCompound(const ShapeCast &inShapeCast, const ShapeCastSettings &inShapeCastSettings, const Shape *inShape, Vec3Arg inScale, const ShapeFilter &inShapeFilter, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, CastShapeCollector &ioCollector)\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor : public CastShapeVisitor\\n\\n\\t{\\n\\n\\t\\tusing CastShapeVisitor::CastShapeVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 50,\n \"score\": 108418.53156109058\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#include <TestFramework.h>\\n\\n\\n\\n#include <Tests/Shapes/StaticCompoundShapeTest.h>\\n\\n#include <Physics/Collision/Shape/StaticCompoundShape.h>\\n\\n#include <Physics/Collision/Shape/SphereShape.h>\\n\\n#include <Physics/Collision/Shape/BoxShape.h>\\n\\n#include <Physics/Collision/Shape/CapsuleShape.h>\\n\\n#include <Physics/Collision/Shape/TaperedCapsuleShape.h>\\n\\n#include <Physics/Collision/Shape/CylinderShape.h>\\n\\n#include <Physics/Body/BodyCreationSettings.h>\\n\\n#include <Layers.h>\\n\\n\\n\\nJPH_IMPLEMENT_RTTI_VIRTUAL(StaticCompoundShapeTest) \\n\\n{ \\n\\n\\tJPH_ADD_BASE_CLASS(StaticCompoundShapeTest, Test) \\n\\n}\\n\\n\\n\",\n \"file_path\": \"Samples/Tests/Shapes/StaticCompoundShapeTest.cpp\",\n \"rank\": 51,\n \"score\": 108418.52677373457\n },\n {\n \"content\": \"\\n\\n\\tGetIntersectingSubShapesVisitorSC<OrientedBox> visitor(inBox, outSubShapeIndices, inMaxSubShapeIndices);\\n\\n\\tWalkTree(visitor);\\n\\n\\treturn visitor.GetNumResults();\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::sCollideCompoundVsShape(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\\n\\n{\\t\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tJPH_ASSERT(inShape1->GetSubType() == EShapeSubType::StaticCompound);\\n\\n\\tconst StaticCompoundShape *shape1 = static_cast<const StaticCompoundShape *>(inShape1);\\n\\n\\n\\n\\tstruct Visitor : public CollideCompoundVsShapeVisitor\\n\\n\\t{\\n\\n\\t\\tusing CollideCompoundVsShapeVisitor::CollideCompoundVsShapeVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn true;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 52,\n \"score\": 108418.07552255676\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: 2021 Jorrit Rouwe\\n\\n// SPDX-License-Identifier: MIT\\n\\n\\n\\n#include <Jolt.h>\\n\\n\\n\\n#include <Physics/Collision/Shape/StaticCompoundShape.h>\\n\\n#include <Physics/Collision/Shape/RotatedTranslatedShape.h>\\n\\n#include <Physics/Collision/Shape/CompoundShapeVisitors.h>\\n\\n#include <Core/Profiler.h>\\n\\n#include <Core/StreamIn.h>\\n\\n#include <Core/StreamOut.h>\\n\\n#include <Core/TempAllocator.h>\\n\\n#include <ObjectStream/TypeDeclarations.h>\\n\\n\\n\\nnamespace JPH {\\n\\n\\n\\nJPH_IMPLEMENT_SERIALIZABLE_VIRTUAL(StaticCompoundShapeSettings)\\n\\n{\\n\\n\\tJPH_ADD_BASE_CLASS(StaticCompoundShapeSettings, CompoundShapeSettings)\\n\\n}\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 53,\n \"score\": 108417.91966160572\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid StaticCompoundShape::SaveBinaryState(StreamOut &inStream) const\\n\\n{\\n\\n\\tCompoundShape::SaveBinaryState(inStream);\\n\\n\\n\\n\\tinStream.Write(mNodes);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::RestoreBinaryState(StreamIn &inStream)\\n\\n{\\n\\n\\tCompoundShape::RestoreBinaryState(inStream);\\n\\n\\n\\n\\tinStream.Read(mNodes);\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::sRegister()\\n\\n{\\n\\n\\tShapeFunctions &f = ShapeFunctions::sGet(EShapeSubType::StaticCompound);\\n\\n\\tf.mConstruct = []() -> Shape * { return new StaticCompoundShape; };\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 54,\n \"score\": 108417.77671222363\n },\n {\n \"content\": \"\\t\\t\\t++start;\\n\\n\\t\\t\\t--end;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tJPH_ASSERT(start == end);\\n\\n\\n\\n\\tif (start > 0 && start < inNumber)\\n\\n\\t{\\n\\n\\t\\t// Success!\\n\\n\\t\\toutMidPoint = start;\\n\\n\\t}\\n\\n\\telse\\n\\n\\t{\\n\\n\\t\\t// Failed to divide bodies\\n\\n\\t\\toutMidPoint = inNumber / 2; \\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid StaticCompoundShape::sPartition4(uint *ioBodyIdx, AABox *ioBounds, int inBegin, int inEnd, int *outSplit)\\n\\n{\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 55,\n \"score\": 108416.48948187707\n },\n {\n \"content\": \"\\t\\tusing CollideShapeVsCompoundVisitor::CollideShapeVsCompoundVisitor;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test which nodes collide\\n\\n\\t\\t\\tUVec4 collides = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\tJPH_ASSERT(inShape2->GetSubType() == EShapeSubType::StaticCompound);\\n\\n\\tconst StaticCompoundShape *shape2 = static_cast<const StaticCompoundShape *>(inShape2);\\n\\n\\n\\n\\tVisitor visitor(inShape1, shape2, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1, inSubShapeIDCreator2, inCollideShapeSettings, ioCollector);\\n\\n\\tshape2->WalkTree(visitor);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 56,\n \"score\": 108414.95319980249\n },\n {\n \"content\": \"\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(inBox, this, inPositionCOM, inRotation, inScale, inSubShapeIDCreator, ioCollector);\\n\\n\\tWalkTree(visitor);\\n\\n}\\n\\n\\n\\nint StaticCompoundShape::GetIntersectingSubShapes(const AABox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tGetIntersectingSubShapesVisitorSC<AABox> visitor(inBox, outSubShapeIndices, inMaxSubShapeIndices);\\n\\n\\tWalkTree(visitor);\\n\\n\\treturn visitor.GetNumResults();\\n\\n}\\n\\n\\n\\nint StaticCompoundShape::GetIntersectingSubShapes(const OrientedBox &inBox, uint *outSubShapeIndices, int inMaxSubShapeIndices) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 57,\n \"score\": 108414.48661286227\n },\n {\n \"content\": \"\\tuint bounds_size = num_subshapes * sizeof(AABox);\\n\\n\\tAABox *bounds = (AABox *)inTempAllocator.Allocate(bounds_size);\\n\\n\\n\\n\\t// Temporary storage for body indexes (we're shuffling them)\\n\\n\\tuint body_idx_size = num_subshapes * sizeof(uint);\\n\\n\\tuint *body_idx = (uint *)inTempAllocator.Allocate(body_idx_size);\\n\\n\\n\\n\\t// Shift all shapes so that the center of mass is now at the origin and calculate bounds\\n\\n\\tfor (uint i = 0; i < num_subshapes; ++i)\\n\\n\\t{\\n\\n\\t\\tSubShape &shape = mSubShapes[i];\\n\\n\\n\\n\\t\\t// Shift the shape so it's centered around our center of mass\\n\\n\\t\\tshape.SetPositionCOM(shape.GetPositionCOM() - mCenterOfMass);\\n\\n\\n\\n\\t\\t// Transform the shape's bounds into our local space\\n\\n\\t\\tMat44 transform = Mat44::sRotationTranslation(shape.GetRotation(), shape.GetPositionCOM());\\n\\n\\t\\tAABox shape_bounds = shape.mShape->GetWorldSpaceBounds(transform, Vec3::sReplicate(1.0f));\\n\\n\\n\\n\\t\\t// Store bounds and body index for tree construction\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 58,\n \"score\": 108414.2992298553\n },\n {\n \"content\": \"\\n\\n\\tstruct Visitor : public CastRayVisitorCollector\\n\\n\\t{\\n\\n\\t\\tusing CastRayVisitorCollector::CastRayVisitorCollector;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\tShouldVisitNode(int inStackTop) const\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn mDistanceStack[inStackTop] < mCollector.GetEarlyOutFraction();\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE int\\t\\tVisitNodes(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test bounds of 4 children\\n\\n\\t\\t\\tVec4 distance = TestBounds(inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 59,\n \"score\": 108414.2610892973\n },\n {\n \"content\": \"\\tf.mColor = Color::sOrange;\\n\\n\\n\\n\\tfor (EShapeSubType s : sAllSubShapeTypes)\\n\\n\\t{\\n\\n\\t\\tCollisionDispatch::sRegisterCollideShape(EShapeSubType::StaticCompound, s, sCollideCompoundVsShape);\\n\\n\\t\\tCollisionDispatch::sRegisterCollideShape(s, EShapeSubType::StaticCompound, sCollideShapeVsCompound);\\n\\n\\t\\tCollisionDispatch::sRegisterCastShape(s, EShapeSubType::StaticCompound, sCastShapeVsCompound);\\n\\n\\t}\\n\\n}\\n\\n\\n\\n} // JPH\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 60,\n \"score\": 108410.95747871911\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <class Visitor>\\n\\ninline void StaticCompoundShape::WalkTree(Visitor &ioVisitor) const\\n\\n{\\n\\n\\tuint32 node_stack[cStackSize];\\n\\n\\tnode_stack[0] = 0;\\n\\n\\tint top = 0;\\n\\n\\tdo\\n\\n\\t{\\n\\n\\t\\t// Test if the node is valid, the node should rarely be invalid but it is possible when testing\\n\\n\\t\\t// a really large box against the tree that the invalid nodes will intersect with the box\\n\\n\\t\\tuint32 node_properties = node_stack[top];\\n\\n\\t\\tif (node_properties != INVALID_NODE)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test if node contains triangles\\n\\n\\t\\t\\tbool is_node = (node_properties & IS_SUBSHAPE) == 0;\\n\\n\\t\\t\\tif (is_node)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tconst Node &node = mNodes[node_properties];\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 61,\n \"score\": 108409.28728085596\n },\n {\n \"content\": \"\\n\\nShapeSettings::ShapeResult StaticCompoundShapeSettings::Create(TempAllocator &inTempAllocator) const\\n\\n{ \\n\\n\\tif (mCachedResult.IsEmpty())\\n\\n\\t{\\n\\n\\t\\tif (mSubShapes.size() == 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// It's an error to create a compound with no subshapes (the compound cannot encode this)\\n\\n\\t\\t\\tmCachedResult.SetError(\\\"Compound needs a sub shape!\\\");\\n\\n\\t\\t}\\n\\n\\t\\telse if (mSubShapes.size() == 1)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// If there's only 1 part, we can use a RotatedTranslatedShape instead\\n\\n\\t\\t\\tRotatedTranslatedShapeSettings settings;\\n\\n\\t\\t\\tconst SubShapeSettings &s = mSubShapes[0];\\n\\n\\t\\t\\tsettings.mPosition = s.mPosition;\\n\\n\\t\\t\\tsettings.mRotation = s.mRotation;\\n\\n\\t\\t\\tsettings.mInnerShape = s.mShape;\\n\\n\\t\\t\\tsettings.mInnerShapePtr = s.mShapePtr;\\n\\n\\t\\t\\tRef<Shape> shape = new RotatedTranslatedShape(settings, mCachedResult);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 62,\n \"score\": 108408.47582005018\n },\n {\n \"content\": \"\\n\\n\\t\\t\\t\\t// Unpack bounds\\n\\n\\t\\t\\t\\tUVec4 bounds_minxy = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMinX[0]));\\n\\n\\t\\t\\t\\tVec4 bounds_minx = HalfFloatConversion::ToFloat(bounds_minxy);\\n\\n\\t\\t\\t\\tVec4 bounds_miny = HalfFloatConversion::ToFloat(bounds_minxy.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\\n\\n\\t\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tUVec4 bounds_minzmaxx = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMinZ[0]));\\n\\n\\t\\t\\t\\tVec4 bounds_minz = HalfFloatConversion::ToFloat(bounds_minzmaxx);\\n\\n\\t\\t\\t\\tVec4 bounds_maxx = HalfFloatConversion::ToFloat(bounds_minzmaxx.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\\n\\n\\n\\n\\t\\t\\t\\tUVec4 bounds_maxyz = UVec4::sLoadInt4(reinterpret_cast<const uint32 *>(&node.mBoundsMaxY[0]));\\n\\n\\t\\t\\t\\tVec4 bounds_maxy = HalfFloatConversion::ToFloat(bounds_maxyz);\\n\\n\\t\\t\\t\\tVec4 bounds_maxz = HalfFloatConversion::ToFloat(bounds_maxyz.Swizzle<SWIZZLE_Z, SWIZZLE_W, SWIZZLE_UNUSED, SWIZZLE_UNUSED>());\\n\\n\\n\\n\\t\\t\\t\\t// Load properties for 4 children\\n\\n\\t\\t\\t\\tUVec4 properties = UVec4::sLoadInt4(&node.mNodeProperties[0]);\\n\\n\\n\\n\\t\\t\\t\\t// Check which sub nodes to visit\\n\\n\\t\\t\\t\\tint num_results = ioVisitor.VisitNodes(bounds_minx, bounds_miny, bounds_minz, bounds_maxx, bounds_maxy, bounds_maxz, properties, top);\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 63,\n \"score\": 108406.60847207396\n },\n {\n \"content\": \"\\t\\tbounds[i] = shape_bounds;\\n\\n\\t\\tbody_idx[i] = i;\\n\\n\\n\\n\\t\\t// Update our local bounds\\n\\n\\t\\tmLocalBounds.Encapsulate(shape_bounds);\\n\\n\\t}\\n\\n\\n\\n\\t// The algorithm is a recursive tree build, but to avoid the call overhead we keep track of a stack here\\n\\n\\tstruct StackEntry\\n\\n\\t{\\n\\n\\t\\tuint32\\t\\t\\tmNodeIdx;\\t\\t\\t\\t\\t// Node index of node that is generated\\n\\n\\t\\tint\\t\\t\\t\\tmChildIdx;\\t\\t\\t\\t\\t// Index of child that we're currently processing\\n\\n\\t\\tint\\t\\t\\t\\tmSplit[5];\\t\\t\\t\\t\\t// Indices where the node ID's have been split to form 4 partitions\\n\\n\\t\\tAABox\\t\\t\\tmBounds;\\t\\t\\t\\t\\t// Bounding box of this node\\n\\n\\t};\\n\\n\\tuint stack_size = num_subshapes * sizeof(StackEntry);\\n\\n\\tStackEntry *stack = (StackEntry *)inTempAllocator.Allocate(stack_size);\\n\\n\\tint top = 0;\\n\\n\\n\\n\\t// Reserve enough space so that every sub shape gets its own leaf node\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 64,\n \"score\": 108406.586844244\n },\n {\n \"content\": \"\\t\\t// Start constructing the runtime sub shape\\n\\n\\t\\tSubShape &out_shape = mSubShapes[i];\\n\\n\\t\\tif (!out_shape.FromSettings(shape, outResult))\\n\\n\\t\\t\\treturn;\\n\\n\\n\\n\\t\\t// Calculate mass properties of child\\n\\n\\t\\tMassProperties child = out_shape.mShape->GetMassProperties();\\n\\n\\t\\n\\n\\t\\t// Accumulate center of mass\\n\\n\\t\\tmass += child.mMass;\\n\\n\\t\\tmCenterOfMass += out_shape.GetPositionCOM() * child.mMass;\\n\\n\\t}\\n\\n\\n\\n\\tif (mass > 0.0f)\\n\\n\\t\\tmCenterOfMass /= mass;\\n\\n\\n\\n\\t// Cache the inner radius as it can take a while to recursively iterate over all sub shapes\\n\\n\\tCalculateInnerRadius();\\n\\n\\n\\n\\t// Temporary storage for the bounding boxes of all shapes\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 65,\n \"score\": 108404.48787587178\n },\n {\n \"content\": \"\\t\\t\\t\\t// Push them onto the stack\\n\\n\\t\\t\\t\\tJPH_ASSERT(top + 4 < cStackSize);\\n\\n\\t\\t\\t\\tproperties.StoreInt4(&node_stack[top]);\\n\\n\\t\\t\\t\\ttop += num_results;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t{\\t\\n\\n\\t\\t\\t\\t// Points to a sub shape\\n\\n\\t\\t\\t\\tuint32 sub_shape_idx = node_properties ^ IS_SUBSHAPE;\\n\\n\\t\\t\\t\\tconst SubShape &sub_shape = mSubShapes[sub_shape_idx];\\n\\n\\n\\n\\t\\t\\t\\tioVisitor.VisitShape(sub_shape, sub_shape_idx);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t// Check if we're done\\n\\n\\t\\t\\tif (ioVisitor.ShouldAbort())\\n\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// Fetch next node until we find one that the visitor wants to see\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 66,\n \"score\": 108404.35931180207\n },\n {\n \"content\": \"\\t// Free temporary memory\\n\\n\\tinTempAllocator.Free(stack, stack_size);\\n\\n\\tinTempAllocator.Free(body_idx, body_idx_size);\\n\\n\\tinTempAllocator.Free(bounds, bounds_size);\\n\\n\\n\\n\\t// Check if we ran out of bits for addressing a node\\n\\n\\tif (next_node_idx > IS_SUBSHAPE)\\n\\n\\t{\\n\\n\\t\\toutResult.SetError(\\\"Compound hierarchy has too many nodes\\\");\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\t// Check if we're not exceeding the amount of sub shape id bits\\n\\n\\tif (GetSubShapeIDBitsRecursive() > SubShapeID::MaxBits)\\n\\n\\t{\\n\\n\\t\\toutResult.SetError(\\\"Compound hierarchy is too deep and exceeds the amount of available sub shape ID bits\\\");\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\toutResult.Set(this);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 67,\n \"score\": 108403.35169552793\n },\n {\n \"content\": \"\\tuint next_node_idx = 0;\\n\\n\\tmNodes.resize(num_subshapes + (num_subshapes + 2) / 3); // = Sum(num_subshapes * 4^-i) with i = [0, Inf].\\n\\n\\n\\n\\t// Create root node\\n\\n\\tstack[0].mNodeIdx = next_node_idx++;\\n\\n\\tstack[0].mChildIdx = -1;\\n\\n\\tstack[0].mBounds = AABox();\\n\\n\\tsPartition4(body_idx, bounds, 0, num_subshapes, stack[0].mSplit);\\n\\n\\n\\n\\tfor (;;)\\n\\n\\t{\\n\\n\\t\\tStackEntry &cur_stack = stack[top];\\n\\n\\n\\n\\t\\t// Next child\\n\\n\\t\\tcur_stack.mChildIdx++;\\n\\n\\n\\n\\t\\t// Check if all children processed\\n\\n\\t\\tif (cur_stack.mChildIdx >= 4)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Terminate if there's nothing left to pop\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 68,\n \"score\": 108401.15101523967\n },\n {\n \"content\": \"\\tuint *body_idx = ioBodyIdx + inBegin;\\n\\n\\tAABox *node_bounds = ioBounds + inBegin;\\n\\n\\tint number = inEnd - inBegin;\\n\\n\\n\\n\\t// Partition entire range\\n\\n\\tsPartition(body_idx, node_bounds, number, outSplit[2]); \\n\\n\\t\\n\\n\\t// Partition lower half\\n\\n\\tsPartition(body_idx, node_bounds, outSplit[2], outSplit[1]); \\n\\n\\n\\n\\t// Partition upper half\\n\\n\\tsPartition(body_idx + outSplit[2], node_bounds + outSplit[2], number - outSplit[2], outSplit[3]); \\n\\n\\n\\n\\t// Convert to proper range \\n\\n\\toutSplit[0] = inBegin;\\n\\n\\toutSplit[1] += inBegin;\\n\\n\\toutSplit[2] += inBegin;\\n\\n\\toutSplit[3] += outSplit[2];\\n\\n\\toutSplit[4] = inEnd;\\n\\n}\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 69,\n \"score\": 108401.07938904181\n },\n {\n \"content\": \"\\t\\t\\tint num_bodies = high - low;\\n\\n\\n\\n\\t\\t\\tif (num_bodies == 0)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Mark invalid\\n\\n\\t\\t\\t\\tNode &node = mNodes[cur_stack.mNodeIdx];\\n\\n\\t\\t\\t\\tnode.SetChildInvalid(cur_stack.mChildIdx);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (num_bodies == 1)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Get body info\\n\\n\\t\\t\\t\\tuint child_node_idx = body_idx[low];\\n\\n\\t\\t\\t\\tconst AABox &child_bounds = bounds[low];\\n\\n\\n\\n\\t\\t\\t\\t// Update node\\n\\n\\t\\t\\t\\tNode &node = mNodes[cur_stack.mNodeIdx];\\n\\n\\t\\t\\t\\tnode.mNodeProperties[cur_stack.mChildIdx] = child_node_idx | IS_SUBSHAPE;\\n\\n\\t\\t\\t\\tnode.SetChildBounds(cur_stack.mChildIdx, child_bounds);\\n\\n\\n\\n\\t\\t\\t\\t// Encapsulate bounding box in parent\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 70,\n \"score\": 108400.81536669329\n },\n {\n \"content\": \"\\tint dimension = (center_max - center_min).GetHighestComponentIndex();\\n\\n\\tfloat split = 0.5f * (center_min + center_max)[dimension];\\n\\n\\n\\n\\t// Divide bodies\\n\\n\\tint start = 0, end = inNumber;\\n\\n\\twhile (start < end)\\n\\n\\t{\\n\\n\\t\\t// Search for first element that is on the right hand side of the split plane\\n\\n\\t\\twhile (start < end && ioBounds[start].GetCenter()[dimension] < split)\\n\\n\\t\\t\\t++start;\\n\\n\\n\\n\\t\\t// Search for the first element that is on the left hand side of the split plane\\n\\n\\t\\twhile (start < end && ioBounds[end - 1].GetCenter()[dimension] >= split)\\n\\n\\t\\t\\t--end;\\n\\n\\n\\n\\t\\tif (start < end)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Swap the two elements\\n\\n\\t\\t\\tswap(ioBodyIdx[start], ioBodyIdx[end - 1]);\\n\\n\\t\\t\\tswap(ioBounds[start], ioBounds[end - 1]);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 71,\n \"score\": 108400.80032987935\n },\n {\n \"content\": \"\\t\\t\\tif (top <= 0)\\n\\n\\t\\t\\t\\tbreak;\\n\\n\\n\\n\\t\\t\\t// Add our bounds to our parents bounds\\n\\n\\t\\t\\tStackEntry &prev_stack = stack[top - 1];\\n\\n\\t\\t\\tprev_stack.mBounds.Encapsulate(cur_stack.mBounds);\\n\\n\\n\\n\\t\\t\\t// Store this node's properties in the parent node\\n\\n\\t\\t\\tNode &parent_node = mNodes[prev_stack.mNodeIdx];\\n\\n\\t\\t\\tparent_node.mNodeProperties[prev_stack.mChildIdx] = cur_stack.mNodeIdx;\\n\\n\\t\\t\\tparent_node.SetChildBounds(prev_stack.mChildIdx, cur_stack.mBounds);\\n\\n\\n\\n\\t\\t\\t// Pop entry from stack\\n\\n\\t\\t\\t--top;\\n\\n\\t\\t}\\n\\n\\t\\telse\\n\\n\\t\\t{\\n\\n\\t\\t\\t// Get low and high index to bodies to process\\n\\n\\t\\t\\tint low = cur_stack.mSplit[cur_stack.mChildIdx];\\n\\n\\t\\t\\tint high = cur_stack.mSplit[cur_stack.mChildIdx + 1];\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 72,\n \"score\": 108396.87368126915\n },\n {\n \"content\": \"\\t\\t\\t\\tcur_stack.mBounds.Encapsulate(child_bounds);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse \\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Allocate new node\\n\\n\\t\\t\\t\\tStackEntry &new_stack = stack[++top];\\n\\n\\t\\t\\t\\tJPH_ASSERT(top < (int)num_subshapes);\\n\\n\\t\\t\\t\\tnew_stack.mNodeIdx = next_node_idx++;\\n\\n\\t\\t\\t\\tnew_stack.mChildIdx = -1;\\n\\n\\t\\t\\t\\tnew_stack.mBounds = AABox();\\n\\n\\t\\t\\t\\tsPartition4(body_idx, bounds, low, high, new_stack.mSplit);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t// Resize nodes to actual size\\n\\n\\tJPH_ASSERT(next_node_idx <= mNodes.size());\\n\\n\\tmNodes.resize(next_node_idx);\\n\\n\\tmNodes.shrink_to_fit();\\n\\n\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/StaticCompoundShape.cpp\",\n \"rank\": 73,\n \"score\": 108396.87368126915\n },\n {\n \"content\": \"class RayCastSettings;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/Shape.h\",\n \"rank\": 74,\n \"score\": 108382.1865124542\n },\n {\n \"content\": \"\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mHit.mFraction, ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE void\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2) \\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\tfloat fraction = RayTriangle(mRayOrigin, mRayDirection, inV0, inV1, inV2);\\n\\n\\t\\t\\tif (fraction < mHit.mFraction)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// It's a closer hit\\n\\n\\t\\t\\t\\tmHit.mFraction = fraction;\\n\\n\\t\\t\\t\\tmHit.mSubShapeID2 = mShape->EncodeSubShapeID(mSubShapeIDCreator, inX, inY, inTriangle);\\n\\n\\t\\t\\t\\tmReturnValue = true;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tRayCastResult &\\t\\t\\tmHit;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\tmRayOrigin;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\tmRayDirection;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 75,\n \"score\": 108368.8081986479\n },\n {\n \"content\": \"\\t\\tJPH_INLINE void\\t\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\t// Create sub shape id for this part\\n\\n\\t\\t\\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\t// Determine active edges\\n\\n\\t\\t\\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\tCast(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tconst HeightFieldShape *\\tmShape2;\\n\\n\\t\\tRayInvDirection\\t\\t\\t\\tmInvDirection;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\t\\tmBoxCenter;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\t\\tmBoxExtent;\\n\\n\\t\\tSubShapeIDCreator\\t\\t\\tmSubShapeIDCreator2;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\\n\\t};\\n\\n\\n\\n\\tJPH_ASSERT(inShape->GetSubType() == EShapeSubType::HeightField);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 76,\n \"score\": 108363.83555649094\n },\n {\n \"content\": \"\\t\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE void\\t\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\t// Create sub shape id for this part\\n\\n\\t\\t\\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\t// Determine active edges\\n\\n\\t\\t\\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\tCast(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tconst HeightFieldShape *\\tmShape2;\\n\\n\\t\\tRayInvDirection\\t\\t\\t\\tmInvDirection;\\n\\n\\t\\tSubShapeIDCreator\\t\\t\\tmSubShapeIDCreator2;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 77,\n \"score\": 108363.63969211439\n },\n {\n \"content\": \"\\t\\t\\t\\thit.mBodyID = TransformedShape::sGetBodyID(mCollector.GetContext());\\n\\n\\t\\t\\t\\thit.mFraction = fraction;\\n\\n\\t\\t\\t\\thit.mSubShapeID2 = mShape->EncodeSubShapeID(mSubShapeIDCreator, inX, inY, inTriangle);\\n\\n\\t\\t\\t\\tmCollector.AddHit(hit);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tCastRayCollector &\\t\\tmCollector;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\tmRayOrigin;\\n\\n\\t\\tVec3\\t\\t\\t\\t\\tmRayDirection;\\n\\n\\t\\tRayInvDirection\\t\\t\\tmRayInvDirection;\\n\\n\\t\\tEBackFaceMode\\t\\t\\tmBackFaceMode;\\n\\n\\t\\tconst HeightFieldShape *mShape;\\n\\n\\t\\tSubShapeIDCreator\\t\\tmSubShapeIDCreator;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(this, inRay, inRayCastSettings, inSubShapeIDCreator, ioCollector);\\n\\n\\tWalkHeightField(visitor);\\n\\n}\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 78,\n \"score\": 108362.65282022684\n },\n {\n \"content\": \"{ \\n\\n\\t// Get quantized value\\n\\n\\tuint8 height_sample = GetHeightSample(inX, inY);\\n\\n\\toutNoCollision = height_sample == mSampleMask;\\n\\n\\n\\n\\t// Add 0.5 to the quantized value to minimize the error (see constructor)\\n\\n\\treturn mOffset + mScale * Vec3(float(inX), inBlockOffset + (0.5f + height_sample) * inBlockScale, float(inY)); \\n\\n}\\n\\n\\n\\nVec3 HeightFieldShape::GetPosition(uint inX, uint inY) const\\n\\n{\\n\\n\\t// Test if there are any samples\\n\\n\\tif (mHeightSamples.empty())\\n\\n\\t\\treturn mOffset + mScale * Vec3(float(inX), 0.0f, float(inY));\\n\\n\\n\\n\\t// Get block location\\n\\n\\tuint bx = inX / mBlockSize;\\n\\n\\tuint by = inY / mBlockSize;\\n\\n\\n\\n\\t// Calculate offset and stride\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 79,\n \"score\": 108361.18644834006\n },\n {\n \"content\": \"}\\n\\n\\n\\ninline uint8 HeightFieldShape::GetHeightSample(uint inX, uint inY) const\\n\\n{\\n\\n\\tJPH_ASSERT(inX < mSampleCount); \\n\\n\\tJPH_ASSERT(inY < mSampleCount); \\n\\n\\t\\n\\n\\t// Determine bit position of sample\\n\\n\\tuint sample = (inY * mSampleCount + inX) * uint(mBitsPerSample);\\n\\n\\tuint byte_pos = sample >> 3;\\n\\n\\tuint bit_pos = sample & 0b111;\\n\\n\\n\\n\\t// Fetch the height sample value\\n\\n\\tJPH_ASSERT(byte_pos + 1 < mHeightSamples.size());\\n\\n\\tconst uint8 *height_samples = mHeightSamples.data() + byte_pos;\\n\\n\\tuint16 height_sample = uint16(height_samples[0]) | uint16(uint16(height_samples[1]) << 8);\\n\\n\\treturn uint8(height_sample >> bit_pos) & mSampleMask; \\n\\n}\\n\\n\\n\\ninline Vec3 HeightFieldShape::GetPosition(uint inX, uint inY, float inBlockOffset, float inBlockScale, bool &outNoCollision) const\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 80,\n \"score\": 108358.13968268623\n },\n {\n \"content\": \"\\n\\ninline void HeightFieldShape::sGetRangeBlockOffsetAndStride(uint inNumBlocks, uint inMaxLevel, uint &outRangeBlockOffset, uint &outRangeBlockStride)\\n\\n{\\n\\n\\toutRangeBlockOffset = sGridOffsets[inMaxLevel - 1];\\n\\n\\toutRangeBlockStride = inNumBlocks >> 1;\\n\\n}\\n\\n\\n\\ninline void HeightFieldShape::GetBlockOffsetAndScale(uint inBlockX, uint inBlockY, uint inRangeBlockOffset, uint inRangeBlockStride, float &outBlockOffset, float &outBlockScale) const\\n\\n{\\n\\n\\tJPH_ASSERT(inBlockX < GetNumBlocks() && inBlockY < GetNumBlocks());\\n\\n\\n\\n\\t// Convert to location of range block\\n\\n\\tuint rbx = inBlockX >> 1;\\n\\n\\tuint rby = inBlockY >> 1;\\n\\n\\tuint n = ((inBlockY & 1) << 1) + (inBlockX & 1);\\n\\n\\n\\n\\t// Calculate offset and scale\\n\\n\\tconst RangeBlock &block = mRangeBlocks[inRangeBlockOffset + rby * inRangeBlockStride + rbx];\\n\\n\\toutBlockOffset = float(block.mMin[n]);\\n\\n\\toutBlockScale = float(block.mMax[n] - block.mMin[n]) / float(mSampleMask);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 81,\n \"score\": 108357.05655234962\n },\n {\n \"content\": \"\\tuint num_blocks = GetNumBlocks();\\n\\n\\tuint range_block_offset, range_block_stride;\\n\\n\\tsGetRangeBlockOffsetAndStride(num_blocks, sGetMaxLevel(num_blocks), range_block_offset, range_block_stride);\\n\\n\\n\\n\\tfloat offset, scale;\\n\\n\\tGetBlockOffsetAndScale(bx, by, range_block_offset, range_block_stride, offset, scale);\\n\\n\\n\\n\\tbool no_collision;\\n\\n\\treturn GetPosition(inX, inY, offset, scale, no_collision);\\n\\n}\\n\\n\\n\\nbool HeightFieldShape::IsNoCollision(uint inX, uint inY) const\\n\\n{ \\n\\n\\treturn mHeightSamples.empty() || GetHeightSample(inX, inY) == mSampleMask;\\n\\n}\\n\\n\\n\\nbool HeightFieldShape::ProjectOntoSurface(Vec3Arg inLocalPosition, Vec3 &outSurfacePosition, SubShapeID &outSubShapeID) const\\n\\n{\\n\\n\\t// Check if we have collision\\n\\n\\tif (mHeightSamples.empty())\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 82,\n \"score\": 108357.02784852013\n },\n {\n \"content\": \"\\t// Calculate amount of memory used\\n\\n\\tShape::Stats stats = mHeightField->GetStats();\\n\\n\\n\\n\\t// Trace stats\\n\\n\\tTrace(\\\"Block size: %d, bits per sample: %d, min height: %g, max height: %g, avg diff: %g, max diff: %g at (%d, %d), relative error: %g%%, size: %u bytes\\\", 1 << sBlockSizeShift, sBitsPerSample, (double)min_height, (double)max_height, (double)avg_diff, (double)max_diff, max_diff_x, max_diff_y, (double)rel_error, stats.mSizeBytes);\\n\\n\\tif (rel_error > max_error)\\n\\n\\t\\tFatalError(\\\"Error too big!\\\");\\n\\n\\n\\n\\t// Determine terrain height\\n\\n\\tRayCastResult result;\\n\\n\\tVec3 start(0, 1000, 0);\\n\\n\\tVec3 direction(0, -2000, 0);\\n\\n\\tRayCast ray { start, direction };\\n\\n\\tif (mPhysicsSystem->GetNarrowPhaseQuery().CastRay(ray, result, SpecifiedBroadPhaseLayerFilter(BroadPhaseLayers::NON_MOVING), SpecifiedObjectLayerFilter(Layers::NON_MOVING)))\\n\\n\\t\\tmHitPos = start + result.mFraction * direction;\\n\\n\\n\\n\\t// Dynamic body\\n\\n\\tBody &body1 = *mBodyInterface->CreateBody(BodyCreationSettings(new BoxShape(Vec3(0.5f, 1.0f, 2.0f)), mHitPos + Vec3(0, 10, 0), Quat::sIdentity(), EMotionType::Dynamic, Layers::MOVING));\\n\\n\\tmBodyInterface->AddBody(body1.GetID(), EActivation::Activate);\\n\\n}\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 83,\n \"score\": 108356.75077274762\n },\n {\n \"content\": \"\\t\\t\\t\\tif (h == HeightFieldShapeConstants::cNoCollisionValue)\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\n\\n\\n\\t\\t\\t\\t// Get original position\\n\\n\\t\\t\\t\\tVec3 original = mTerrainOffset + mTerrainScale * Vec3(float(x), h, float(y));\\n\\n\\n\\n\\t\\t\\t\\t// Get compressed position\\n\\n\\t\\t\\t\\tVec3 compressed = mHeightField->GetPosition(x, y);\\n\\n\\n\\n\\t\\t\\t\\t// Draw marker that is red when error is too big and green when not\\n\\n\\t\\t\\t\\tconst float cMaxError = 0.1f;\\n\\n\\t\\t\\t\\tfloat error = (original - compressed).Length();\\n\\n\\t\\t\\t\\tuint8 c = uint8(round(255.0f * min(error / cMaxError, 1.0f)));\\n\\n\\t\\t\\t\\tmDebugRenderer->DrawMarker(original, Color(c, 255 - c, 0, 255), 0.1f);\\n\\n\\t\\t\\t}\\n\\n}\\n\\n\\n\\nvoid HeightFieldShapeTest::GetInitialCamera(CameraState &ioState) const\\n\\n{\\n\\n\\t// Correct camera pos for hit position\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 84,\n \"score\": 108356.03882892412\n },\n {\n \"content\": \"\\t\\tJPH_INLINE int\\t\\t\\tVisitRangeBlock(Vec4Arg inBoundsMinX, Vec4Arg inBoundsMinY, Vec4Arg inBoundsMinZ, Vec4Arg inBoundsMaxX, Vec4Arg inBoundsMaxY, Vec4Arg inBoundsMaxZ, UVec4 &ioProperties, int inStackTop) \\n\\n\\t\\t{\\n\\n\\t\\t\\t// Test bounds of 4 children\\n\\n\\t\\t\\tVec4 distance = RayAABox4(mRayOrigin, mRayInvDirection, inBoundsMinX, inBoundsMinY, inBoundsMinZ, inBoundsMaxX, inBoundsMaxY, inBoundsMaxZ);\\n\\n\\t\\n\\n\\t\\t\\t// Sort so that highest values are first (we want to first process closer hits and we process stack top to bottom)\\n\\n\\t\\t\\treturn SortReverseAndStore(distance, mCollector.GetEarlyOutFraction(), ioProperties, &mDistanceStack[inStackTop]);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE void\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2) const\\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\t// Back facing check\\n\\n\\t\\t\\tif (mBackFaceMode == EBackFaceMode::IgnoreBackFaces && (inV2 - inV0).Cross(inV1 - inV0).Dot(mRayDirection) < 0)\\n\\n\\t\\t\\t\\treturn;\\n\\n\\n\\n\\t\\t\\t// Check the triangle\\n\\n\\t\\t\\tfloat fraction = RayTriangle(mRayOrigin, mRayDirection, inV0, inV1, inV2);\\n\\n\\t\\t\\tif (fraction < mCollector.GetEarlyOutFraction())\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tRayCastResult hit;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 85,\n \"score\": 108355.79972495987\n },\n {\n \"content\": \"\\t\\tJPH_INLINE void\\t\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\t// Create ID for triangle\\n\\n\\t\\t\\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\t// Determine active edges\\n\\n\\t\\t\\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\tCollide(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tconst HeightFieldShape *\\tmShape2;\\n\\n\\t\\tSubShapeIDCreator\\t\\t\\tmSubShapeIDCreator2;\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(shape1, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1.GetID(), inCollideShapeSettings, ioCollector);\\n\\n\\tvisitor.mShape2 = shape2;\\n\\n\\tvisitor.mSubShapeIDCreator2 = inSubShapeIDCreator2;\\n\\n\\tshape2->WalkHeightField(visitor);\\n\\n}\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 86,\n \"score\": 108355.64803024755\n },\n {\n \"content\": \"\\tuint32\\t\\t\\t\\t\\t\\tmPropertiesStack[cStackSize];\\n\\n};\\n\\n\\n\\ntemplate <class Visitor>\\n\\nJPH_INLINE void HeightFieldShape::WalkHeightField(Visitor &ioVisitor) const\\n\\n{\\n\\n\\tDecodingContext ctx(this);\\n\\n\\tctx.WalkHeightField(ioVisitor);\\n\\n}\\n\\n\\n\\nbool HeightFieldShape::CastRay(const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor\\n\\n\\t{\\n\\n\\t\\tJPH_INLINE explicit\\t\\tVisitor(const HeightFieldShape *inShape, const RayCast &inRay, const SubShapeIDCreator &inSubShapeIDCreator, RayCastResult &ioHit) : \\n\\n\\t\\t\\tmHit(ioHit),\\n\\n\\t\\t\\tmRayOrigin(inRay.mOrigin),\\n\\n\\t\\t\\tmRayDirection(inRay.mDirection),\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 87,\n \"score\": 108355.53824931107\n },\n {\n \"content\": \"\\tfloat max_diff = -1.0f;\\n\\n\\tuint max_diff_x = 0, max_diff_y = 0;\\n\\n\\tfloat min_height = FLT_MAX, max_height = -FLT_MAX, avg_diff = 0.0f;\\n\\n\\tfor (uint y = 0; y < mTerrainSize; ++y)\\n\\n\\t\\tfor (uint x = 0; x < mTerrainSize; ++x)\\n\\n\\t\\t{\\n\\n\\t\\t\\tfloat h1 = mTerrain[y * mTerrainSize + x];\\n\\n\\t\\t\\tif (h1 != HeightFieldShapeConstants::cNoCollisionValue)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\th1 = mTerrainOffset.GetY() + mTerrainScale.GetY() * h1;\\n\\n\\t\\t\\t\\tif (mHeightField->IsNoCollision(x, y))\\n\\n\\t\\t\\t\\t\\tFatalError(\\\"No collision where there should be\\\");\\n\\n\\t\\t\\t\\tfloat h2 = mHeightField->GetPosition(x, y).GetY();\\n\\n\\t\\t\\t\\tfloat diff = abs(h2 - h1);\\n\\n\\t\\t\\t\\tif (diff > max_diff)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tmax_diff = diff;\\n\\n\\t\\t\\t\\t\\tmax_diff_x = x;\\n\\n\\t\\t\\t\\t\\tmax_diff_y = y;\\n\\n\\t\\t\\t\\t}\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 88,\n \"score\": 108355.46342261702\n },\n {\n \"content\": \"\\t\\tRayInvDirection\\t\\t\\tmRayInvDirection;\\n\\n\\t\\tconst HeightFieldShape *mShape;\\n\\n\\t\\tSubShapeIDCreator\\t\\tmSubShapeIDCreator;\\n\\n\\t\\tbool\\t\\t\\t\\t\\tmReturnValue = false;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tmDistanceStack[cStackSize];\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(this, inRay, inSubShapeIDCreator, ioHit);\\n\\n\\tWalkHeightField(visitor);\\n\\n\\n\\n\\treturn visitor.mReturnValue;\\n\\n}\\n\\n\\n\\nvoid HeightFieldShape::CastRay(const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) const\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\tstruct Visitor\\n\\n\\t{\\n\\n\\t\\tJPH_INLINE explicit\\t\\tVisitor(const HeightFieldShape *inShape, const RayCast &inRay, const RayCastSettings &inRayCastSettings, const SubShapeIDCreator &inSubShapeIDCreator, CastRayCollector &ioCollector) : \\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 89,\n \"score\": 108355.43434601183\n },\n {\n \"content\": \"\\tJPH_ADD_BASE_CLASS(HeightFieldShapeTest, Test) \\n\\n}\\n\\n\\n\\nstatic int sTerrainType = 0;\\n\\n\\n\\nstatic const char *sTerrainTypes[] = {\\n\\n\\t\\\"Procedural Terrain\\\",\\n\\n\\t\\\"Heightfield 1\\\",\\n\\n\\t\\\"Flat\\\",\\n\\n\\t\\\"No Collision\\\"\\n\\n};\\n\\n\\n\\nvoid HeightFieldShapeTest::Initialize()\\n\\n{\\n\\n\\tif (sTerrainType == 0)\\n\\n\\t{\\n\\n\\t\\tconst int n = 128;\\n\\n\\t\\tconst float cell_size = 1.0f;\\n\\n\\t\\tconst float max_height = 5.0f;\\n\\n\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 90,\n \"score\": 108354.15547969351\n },\n {\n \"content\": \"\\tuint16 material_index = uint16(material_indices[0]) + uint16(uint16(material_indices[1]) << 8);\\n\\n\\tmaterial_index >>= bit_pos;\\n\\n\\tmaterial_index &= (1 << mNumBitsPerMaterialIndex) - 1;\\n\\n\\n\\n\\t// Return the material\\n\\n\\treturn mMaterials[material_index];\\n\\n}\\n\\n\\n\\nuint HeightFieldShape::GetSubShapeIDBits() const\\n\\n{\\n\\n\\t// Need to store X, Y and 1 extra bit to specify the triangle number in the quad\\n\\n\\treturn 2 * (32 - CountLeadingZeros(mSampleCount - 1)) + 1;\\n\\n}\\n\\n\\n\\nSubShapeID HeightFieldShape::EncodeSubShapeID(const SubShapeIDCreator &inCreator, uint inX, uint inY, uint inTriangle) const\\n\\n{\\n\\n\\treturn inCreator.PushID((inX + inY * mSampleCount) * 2 + inTriangle, GetSubShapeIDBits()).GetID();\\n\\n}\\n\\n\\n\\nvoid HeightFieldShape::DecodeSubShapeID(const SubShapeID &inSubShapeID, uint &outX, uint &outY, uint &outTriangle) const\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 91,\n \"score\": 108353.50600731463\n },\n {\n \"content\": \"\\n\\nvoid HeightFieldShapeTest::PrePhysicsUpdate(const PreUpdateParams &inParams)\\n\\n{\\n\\n\\t// Test the 'GetHeight' function and draw a marker on the surface\\n\\n\\tVec3 test_pos = inParams.mCameraState.mPos + 10.0f * inParams.mCameraState.mForward, surface_pos;\\n\\n\\tSubShapeID sub_shape_id;\\n\\n\\tif (mHeightField->ProjectOntoSurface(test_pos, surface_pos, sub_shape_id))\\n\\n\\t{\\n\\n\\t\\tVec3 surface_normal = mHeightField->GetSurfaceNormal(sub_shape_id, surface_pos);\\n\\n\\t\\tmDebugRenderer->DrawMarker(surface_pos, Color::sWhite, 1.0f);\\n\\n\\t\\tmDebugRenderer->DrawArrow(surface_pos, surface_pos + surface_normal, Color::sRed, 0.1f);\\n\\n\\t}\\n\\n\\n\\n\\t// Draw the original uncompressed terrain\\n\\n\\tif (sShowOriginalTerrain)\\n\\n\\t\\tfor (uint y = 0; y < mTerrainSize; ++y)\\n\\n\\t\\t\\tfor (uint x = 0; x < mTerrainSize; ++x)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// Get original height\\n\\n\\t\\t\\t\\tfloat h = mTerrain[y * mTerrainSize + x];\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 92,\n \"score\": 108353.44660591616\n },\n {\n \"content\": \"\\t\\t\\tUVec4 collides = AABox4VsBox(mBoundsOf1InSpaceOf2, bounds_min_x, bounds_min_y, bounds_min_z, bounds_max_x, bounds_max_y, bounds_max_z);\\n\\n\\t\\t\\treturn CountAndSortTrues(collides, ioProperties);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tJPH_INLINE void\\t\\t\\t\\tVisitTriangle(uint inX, uint inY, uint inTriangle, Vec3Arg inV0, Vec3Arg inV1, Vec3Arg inV2)\\n\\n\\t\\t{\\t\\t\\t\\n\\n\\t\\t\\t// Create ID for triangle\\n\\n\\t\\t\\tSubShapeID triangle_sub_shape_id = mShape2->EncodeSubShapeID(mSubShapeIDCreator2, inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\t// Determine active edges\\n\\n\\t\\t\\tuint8 active_edges = mShape2->GetEdgeFlags(inX, inY, inTriangle);\\n\\n\\n\\n\\t\\t\\tCollide(inV0, inV1, inV2, active_edges, triangle_sub_shape_id);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tconst HeightFieldShape *\\tmShape2;\\n\\n\\t\\tSubShapeIDCreator\\t\\t\\tmSubShapeIDCreator2;\\n\\n\\t};\\n\\n\\n\\n\\tVisitor visitor(shape1, inScale1, inScale2, inCenterOfMassTransform1, inCenterOfMassTransform2, inSubShapeIDCreator1.GetID(), inCollideShapeSettings, ioCollector);\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 93,\n \"score\": 108353.15604323454\n },\n {\n \"content\": \"\\treturn mCachedResult;\\n\\n}\\n\\n\\n\\nvoid HeightFieldShapeSettings::DetermineMinAndMaxSample(float &outMinValue, float &outMaxValue, float &outQuantizationScale) const\\n\\n{\\n\\n\\t// Determine min and max value\\n\\n\\toutMinValue = FLT_MAX;\\n\\n\\toutMaxValue = -FLT_MAX;\\n\\n\\tfor (float h : mHeightSamples)\\n\\n\\t\\tif (h != cNoCollisionValue)\\n\\n\\t\\t{\\n\\n\\t\\t\\toutMinValue = min(outMinValue, h);\\n\\n\\t\\t\\toutMaxValue = max(outMaxValue, h);\\n\\n\\t\\t}\\n\\n\\n\\n\\t// Prevent dividing by zero by setting a minimal height difference\\n\\n\\tfloat height_diff = max(outMaxValue - outMinValue, 1.0e-6f);\\n\\n\\n\\n\\t// Calculate the scale factor to quantize to 16 bits\\n\\n\\toutQuantizationScale = float(cMaxHeightValue16) / height_diff;\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 94,\n \"score\": 108351.34052571692\n },\n {\n \"content\": \"\\t\\t\\t*mMaterials++ = mShape->GetMaterial(inX, inY);\\n\\n\\n\\n\\t\\t// Accumulate triangles found\\n\\n\\t\\tmNumTrianglesFound++;\\n\\n\\t}\\n\\n\\n\\n\\tDecodingContext\\t\\t\\t\\tmDecodeCtx;\\n\\n\\tconst HeightFieldShape *\\tmShape;\\n\\n\\tOrientedBox\\t\\t\\t\\t\\tmLocalBox;\\n\\n\\tVec3\\t\\t\\t\\t\\t\\tmHeightFieldScale;\\n\\n\\tMat44\\t\\t\\t\\t\\t\\tmLocalToWorld;\\n\\n\\tint\\t\\t\\t\\t\\t\\t\\tmMaxTrianglesRequested;\\n\\n\\tFloat3 *\\t\\t\\t\\t\\tmTriangleVertices;\\n\\n\\tint\\t\\t\\t\\t\\t\\t\\tmNumTrianglesFound;\\n\\n\\tconst PhysicsMaterial **\\tmMaterials;\\n\\n\\tbool\\t\\t\\t\\t\\t\\tmShouldAbort;\\n\\n\\tbool\\t\\t\\t\\t\\t\\tmIsInsideOut;\\n\\n};\\n\\n\\n\\nvoid HeightFieldShape::GetTrianglesStart(GetTrianglesContext &ioContext, const AABox &inBox, Vec3Arg inPositionCOM, QuatArg inRotation, Vec3Arg inScale) const\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 95,\n \"score\": 108350.48418782894\n },\n {\n \"content\": \"\\t\\treturn AABox(center, center);\\n\\n\\t}\\n\\n\\telse\\n\\n\\t{\\n\\n\\t\\t// Bounding box based on min and max sample height\\n\\n\\t\\tVec3 bmin = mOffset + mScale * Vec3(0.0f, float(mMinSample), 0.0f);\\n\\n\\t\\tVec3 bmax = mOffset + mScale * Vec3(float(mSampleCount - 1), float(mMaxSample), float(mSampleCount - 1));\\n\\n\\t\\treturn AABox(bmin, bmax);\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#ifdef JPH_DEBUG_RENDERER\\n\\nvoid HeightFieldShape::Draw(DebugRenderer *inRenderer, Mat44Arg inCenterOfMassTransform, Vec3Arg inScale, ColorArg inColor, bool inUseMaterialColors, bool inDrawWireframe) const\\n\\n{\\n\\n\\t// Don't draw anything if we don't have any collision\\n\\n\\tif (mHeightSamples.empty())\\n\\n\\t\\treturn;\\n\\n\\n\\n\\t// Reset the batch if we switch coloring mode\\n\\n\\tif (mCachedUseMaterialColors != inUseMaterialColors)\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 96,\n \"score\": 108350.19670162618\n },\n {\n \"content\": \"\\tcontext.mMaterials = outMaterials;\\n\\n\\tcontext.mShouldAbort = false; // Reset the abort flag\\n\\n\\tcontext.mNumTrianglesFound = 0;\\n\\n\\t\\n\\n\\t// Continue (or start) walking the height field\\n\\n\\tcontext.mDecodeCtx.WalkHeightField(context);\\n\\n\\treturn context.mNumTrianglesFound;\\n\\n}\\n\\n\\n\\nvoid HeightFieldShape::sCollideConvexVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\t// Get the shapes\\n\\n\\tJPH_ASSERT(inShape1->GetType() == EShapeType::Convex);\\n\\n\\tJPH_ASSERT(inShape2->GetType() == EShapeType::HeightField);\\n\\n\\tconst ConvexShape *shape1 = static_cast<const ConvexShape *>(inShape1);\\n\\n\\tconst HeightFieldShape *shape2 = static_cast<const HeightFieldShape *>(inShape2);\\n\\n\\n\\n\\tstruct Visitor : public CollideConvexVsTriangles\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 97,\n \"score\": 108350.07447916297\n },\n {\n \"content\": \"\\tvisitor.mShape2 = shape2;\\n\\n\\tvisitor.mSubShapeIDCreator2 = inSubShapeIDCreator2;\\n\\n\\tshape2->WalkHeightField(visitor);\\n\\n}\\n\\n\\n\\nvoid HeightFieldShape::sCollideSphereVsHeightField(const Shape *inShape1, const Shape *inShape2, Vec3Arg inScale1, Vec3Arg inScale2, Mat44Arg inCenterOfMassTransform1, Mat44Arg inCenterOfMassTransform2, const SubShapeIDCreator &inSubShapeIDCreator1, const SubShapeIDCreator &inSubShapeIDCreator2, const CollideShapeSettings &inCollideShapeSettings, CollideShapeCollector &ioCollector)\\n\\n{\\n\\n\\tJPH_PROFILE_FUNCTION();\\n\\n\\n\\n\\t// Get the shapes\\n\\n\\tJPH_ASSERT(inShape1->GetSubType() == EShapeSubType::Sphere);\\n\\n\\tJPH_ASSERT(inShape2->GetType() == EShapeType::HeightField);\\n\\n\\tconst SphereShape *shape1 = static_cast<const SphereShape *>(inShape1);\\n\\n\\tconst HeightFieldShape *shape2 = static_cast<const HeightFieldShape *>(inShape2);\\n\\n\\n\\n\\tstruct Visitor : public CollideSphereVsTriangles\\n\\n\\t{\\n\\n\\t\\tusing CollideSphereVsTriangles::CollideSphereVsTriangles;\\n\\n\\n\\n\\t\\tJPH_INLINE bool\\t\\t\\t\\tShouldAbort() const\\n\",\n \"file_path\": \"Jolt/Physics/Collision/Shape/HeightFieldShape.cpp\",\n \"rank\": 98,\n \"score\": 108349.77392748058\n },\n {\n \"content\": \"\\t\\t// Determine scale and offset\\n\\n\\t\\tmTerrainOffset = Vec3(-0.5f * cell_size * n, 0.0f, -0.5f * cell_size * n);\\n\\n\\t\\tmTerrainScale = Vec3(cell_size, 1.0f, cell_size);\\n\\n\\n\\n\\t\\t// Mark the entire terrain as no collision\\n\\n\\t\\tmTerrainSize = n;\\n\\n\\t\\tmTerrain.resize(n * n);\\n\\n\\t\\tfor (float &v : mTerrain)\\n\\n\\t\\t\\tv = HeightFieldShapeConstants::cNoCollisionValue;\\n\\n\\t}\\n\\n\\n\\n\\t// Create height field\\n\\n\\tHeightFieldShapeSettings settings(mTerrain.data(), mTerrainOffset, mTerrainScale, mTerrainSize, mMaterialIndices.data(), mMaterials);\\n\\n\\tsettings.mBlockSize = 1 << sBlockSizeShift;\\n\\n\\tsettings.mBitsPerSample = sBitsPerSample;\\n\\n\\tmHeightField = static_cast<const HeightFieldShape *>(settings.Create().Get().GetPtr());\\n\\n\\tBody &terrain = *mBodyInterface->CreateBody(BodyCreationSettings(mHeightField, Vec3::sZero(), Quat::sIdentity(), EMotionType::Static, Layers::NON_MOVING));\\n\\n\\tmBodyInterface->AddBody(terrain.GetID(), EActivation::DontActivate);\\n\\n\\n\\n\\t// Validate it\\n\",\n \"file_path\": \"Samples/Tests/Shapes/HeightFieldShapeTest.cpp\",\n \"rank\": 99,\n \"score\": 108349.64390883422\n }\n]","isConversational":false}}},{"rowIdx":396,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/sharpen/MemoryTable.hpp"},"repo_name":{"kind":"string","value":"TalexDreamSoul/Sharpen"},"commit":{"kind":"string","value":"9167c4080438a1f150232d733c4da878639d6f66"},"file_code":{"kind":"string","value":"#pragma once\n#ifndef _SHARPEN_MEMORYTABLE_HPP\n#define _SHARPEN_MEMORYTABLE_HPP\n\n#include <stdexcept>\n#include <map>\n#include <cassert>\n\n#include \"ByteBuffer.hpp\"\n#include \"CompressedPair.hpp\"\n#include \"MemoryTableConcepts.hpp\"\n#include \"Noncopyable.hpp\"\n#include \"Optional.hpp\"\n\nnamespace sharpen\n{ \n class MemoryTableItem\n {\n private:\n\n using Self = sharpen::MemoryTableItem;\n\n sharpen::Optional<sharpen::ByteBuffer> value_;\n public:\n MemoryTableItem() = default;\n\n explicit MemoryTableItem(sharpen::ByteBuffer value)\n :value_(std::move(value))\n {}\n \n MemoryTableItem(const Self &other) = default;\n \n MemoryTableItem(Self &&other) noexcept = default;\n \n inline Self &operator=(const Self &other)\n {\n Self tmp{other};\n std::swap(tmp,*this);\n return *this;\n }\n \n Self &operator=(Self &&other) noexcept = default;\n \n ~MemoryTableItem() noexcept = default;\n\n inline sharpen::ByteBuffer &Value() noexcept\n {\n assert(this->value_.Exist());\n return this->value_.Get();\n }\n\n inline const sharpen::ByteBuffer &Value() const noexcept\n {\n assert(this->value_.Exist());\n return this->value_.Get();\n }\n\n inline bool IsDeleted() const noexcept\n {\n return !this->value_.Exist();\n }\n\n void Delete() noexcept\n {\n this->value_.Reset();\n }\n };\n\n template<typename _Logger,typename _Check = void>\n class InternalMemoryTable;\n\n template<typename _Logger>\n class InternalMemoryTable<_Logger,sharpen::EnableIf<sharpen::IsMemoryTableLogger<_Logger>::Value>>:public sharpen::Noncopyable\n {\n private:\n using Self = sharpen::InternalMemoryTable<_Logger,sharpen::EnableIf<sharpen::IsMemoryTableLogger<_Logger>::Value>>;\n using StoreItem = sharpen::MemoryTableItem;\n using MapType = std::map<sharpen::ByteBuffer,StoreItem>;\n using ConstIterator = typename MapType::const_iterator;\n \n sharpen::CompressedPair<_Logger,MapType> pair_;\n\n _Logger &Logger() noexcept\n {\n return this->pair_.First();\n }\n\n const _Logger &Logger() const noexcept\n {\n return this->pair_.First();\n }\n\n MapType &Map() noexcept\n {\n return this->pair_.Second();\n }\n \n const MapType &Map() const noexcept\n {\n return this->pair_.Second();\n }\n\n void InternalPut(sharpen::ByteBuffer key,sharpen::ByteBuffer value)\n {\n this->Map()[std::move(key)] = StoreItem{std::move(value)};\n }\n\n void InternalDelete(sharpen::ByteBuffer key)\n {\n auto ite = this->Map().find(key);\n if(ite != this->Map().end())\n {\n ite->second.Delete();\n }\n else\n {\n this->Map().emplace(std::move(key),StoreItem{});\n }\n }\n\n void InternalAction(sharpen::WriteBatch &batch)\n {\n for (auto begin = batch.Begin(),end = batch.End(); begin != end; ++begin)\n {\n if (begin->type_ == sharpen::WriteBatch::ActionType::Put)\n {\n this->InternalPut(std::move(begin->key_),std::move(begin->value_));\n }\n else\n {\n this->InternalDelete(std::move(begin->key_));\n }\n }\n batch.Clear();\n }\n\n void InternalAction(const sharpen::WriteBatch &batch)\n {\n for (auto begin = batch.Begin(),end = batch.End(); begin != end; ++begin)\n {\n if (begin->type_ == sharpen::WriteBatch::ActionType::Put)\n {\n this->InternalPut(begin->key_,begin->value_);\n }\n else\n {\n this->InternalDelete(begin->key_);\n }\n }\n }\n public:\n\n enum class ExistStatus\n {\n Exist,\n Deleted,\n NotFound\n };\n \n template<typename ..._Args,typename _Check = decltype(_Logger{std::declval<_Args>()...})>\n explicit InternalMemoryTable(_Args &&...args)\n :pair_(_Logger{std::forward<_Args>(args)...},MapType{})\n {}\n \n InternalMemoryTable(Self &&other) noexcept = default;\n \n Self &operator=(Self &&other) noexcept\n {\n if(this != std::addressof(other))\n {\n this->pair_ = std::move(other.pair_);\n }\n return *this;\n }\n \n ~InternalMemoryTable() noexcept = default;\n\n inline void Restore()\n {\n auto batchs = this->Logger().GetWriteBatchs();\n for (auto begin = batchs.begin(),end = batchs.end(); begin != end; ++begin)\n {\n sharpen::WriteBatch &batch = *begin;\n this->InternalAction(batch);\n }\n }\n\n inline void Action(sharpen::WriteBatch &batch)\n {\n this->Logger().Log(batch);\n this->InternalAction(batch);\n }\n\n inline void Action(sharpen::WriteBatch &&batch)\n {\n this->Action(batch);\n }\n\n inline void Action(const sharpen::WriteBatch &batch)\n {\n this->Logger().Log(batch);\n this->InternalAction(batch);\n }\n\n inline void Put(sharpen::ByteBuffer key,sharpen::ByteBuffer value)\n {\n sharpen::WriteBatch batch;\n batch.Put(std::move(key),std::move(value));\n this->Action(std::move(batch));\n }\n\n inline void Delete(sharpen::ByteBuffer key)\n {\n sharpen::WriteBatch batch;\n batch.Delete(std::move(key));\n this->Action(std::move(batch));\n }\n\n void ClearLogs()\n {\n this->Logger().Clear();\n }\n\n void RemoveLogs()\n {\n this->Logger().Remove();\n }\n\n Self::ExistStatus Exist(const sharpen::ByteBuffer &key) const noexcept\n {\n auto ite = this->Map().find(key);\n if(ite == this->Map().end())\n {\n return Self::ExistStatus::NotFound;\n }\n else if(ite->second.IsDeleted())\n {\n return Self::ExistStatus::Deleted;\n }\n return Self::ExistStatus::Exist;\n }\n\n sharpen::ByteBuffer &Get(const sharpen::ByteBuffer &key)\n {\n auto &item = this->Map().at(key);\n if(item.IsDeleted())\n {\n throw std::out_of_range(\"key doesn't exists\");\n }\n return item.Value();\n }\n\n const sharpen::ByteBuffer &Get(const sharpen::ByteBuffer &key) const\n {\n auto &item = this->Map().at(key);\n if(item.deleteTag_)\n {\n throw std::out_of_range(\"key doesn't exists\");\n }\n return item.value_;\n }\n\n sharpen::ByteBuffer &operator[](const sharpen::ByteBuffer &key)\n {\n return this->Get(key);\n }\n\n const sharpen::ByteBuffer &operator[](const sharpen::ByteBuffer &key) const\n {\n return this->Get(key);\n }\n\n inline ConstIterator Begin() const noexcept\n {\n return this->Map().begin();\n }\n\n inline ConstIterator End() const noexcept\n {\n return this->Map().end();\n }\n };\n\n template<typename _Logger>\n using MemoryTable = sharpen::InternalMemoryTable<_Logger>;\n}\n\n#endif"},"prefix":{"kind":"string","value":"#pragma once\n#ifndef _SHARPEN_MEMORYTABLE_HPP\n#define _SHARPEN_MEMORYTABLE_HPP\n\n#include <stdexcept>\n#include <map>\n#include <cassert>\n\n#include \"ByteBuffer.hpp\"\n#include \"CompressedPair.hpp\"\n#include \"MemoryTableConcepts.hpp\"\n#include \"Noncopyable.hpp\"\n#include \"Optional.hpp\"\n\nnamespace sharpen\n{ \n class MemoryTableItem\n {\n private:\n\n using Self = sharpen::MemoryTableItem;\n\n sharpen::Optional<sharpen::ByteBuffer> value_;\n public:\n MemoryTableItem() = default;\n\n explicit MemoryTableItem(sharpen::ByteBuffer value)\n :value_(std::move(value))\n {}\n \n MemoryTableItem(const Self &other) = default;\n \n MemoryTableItem(Self &&other) noexcept = default;\n \n inline Self &operator=(const Self &other)\n {\n Self tmp{other};\n std::swap(tmp,*this);\n return *this;\n }\n \n Self &operator=(Self &&other) noexcept = default;\n \n ~MemoryTableItem() noexcept = default;\n\n inline sharpen::ByteBuffer &Value() noexcept\n {\n assert(this->value_.Exist());\n return this->value_.Get();\n }\n\n inline const sharpen::ByteBuffer &Value() const noexcept\n {\n assert(this->value_.Exist());\n return this->value_.Get();\n }\n\n inline bool IsDeleted() const noexcept\n {\n return !this->value_.Exist();\n }\n\n void Delete() noexcept\n {\n this->value_.Reset();\n }\n };\n\n template<typename _Logger,typename _Check = void>\n class InternalMemoryTable;\n\n template<typename _Logger>\n class InternalMemoryTable<_Logger,sharpen::EnableIf<sharpen::IsMemoryTableLogger<_Logger>::Value>>:public sharpen::Noncopyable\n {\n private:\n using Self = sharpen::InternalMemoryTable<_Logger,sharpen::EnableIf<sharpen::IsMemoryTableLogger<_Logger>::Value>>;\n using StoreItem = sharpen::MemoryTableItem;\n using MapType = std::map<sharpen::ByteBuffer,StoreItem>;\n using ConstIterator = typename MapType::const_iterator;\n \n sharpen::CompressedPair<_Logger,MapType> pair_;\n\n _Logger &Logger() noexcept\n {\n return this->pair_.First();\n }\n\n const _Logger &Logger() const noexcept\n {\n return this->pair_.First();\n }\n\n MapType &Map() noexcept\n {\n return this->pair_.Second();\n }\n \n const MapType &Map() const noexcept\n {\n return this->pair_.Second();\n }\n\n void InternalPut(sharpen::ByteBuffer key,sharpen::ByteBuffer value)\n {\n this->Map()[std::move(key)] = StoreItem{std::move(value)};\n }\n\n void InternalDelete(sharpen::ByteBuffer key)\n {\n auto ite = this->Map().find(key);\n if(ite != this->Map().end())\n {\n ite->second.Delete();\n }\n else\n {\n this->Map().emplace(std::move(key),StoreItem{});\n }\n }\n\n void InternalAction(sharpen::WriteBatch &batch)\n {\n for (auto begin = batch.Begin(),end = batch.End(); begin != end; ++begin)\n {\n if (begin->type_ == sharpen::WriteBatch::ActionType::Put)\n {\n this->InternalPut(std::move(begin->key_),std::move(begin->value_));\n }\n else\n {\n this->InternalDelete(std::move(begin->key_));\n }\n }\n batch.Clear();\n }\n\n void InternalAction(const sharpen::WriteBatch &batch)\n {\n for (auto begin = batch.Begin(),end = batch.End(); begin != end;"},"suffix":{"kind":"string","value":"key_,begin->value_);\n }\n else\n {\n this->InternalDelete(begin->key_);\n }\n }\n }\n public:\n\n enum class ExistStatus\n {\n Exist,\n Deleted,\n NotFound\n };\n \n template<typename ..._Args,typename _Check = decltype(_Logger{std::declval<_Args>()...})>\n explicit InternalMemoryTable(_Args &&...args)\n :pair_(_Logger{std::forward<_Args>(args)...},MapType{})\n {}\n \n InternalMemoryTable(Self &&other) noexcept = default;\n \n Self &operator=(Self &&other) noexcept\n {\n if(this != std::addressof(other))\n {\n this->pair_ = std::move(other.pair_);\n }\n return *this;\n }\n \n ~InternalMemoryTable() noexcept = default;\n\n inline void Restore()\n {\n auto batchs = this->Logger().GetWriteBatchs();\n for (auto begin = batchs.begin(),end = batchs.end(); begin != end; ++begin)\n {\n sharpen::WriteBatch &batch = *begin;\n this->InternalAction(batch);\n }\n }\n\n inline void Action(sharpen::WriteBatch &batch)\n {\n this->Logger().Log(batch);\n this->InternalAction(batch);\n }\n\n inline void Action(sharpen::WriteBatch &&batch)\n {\n this->Action(batch);\n }\n\n inline void Action(const sharpen::WriteBatch &batch)\n {\n this->Logger().Log(batch);\n this->InternalAction(batch);\n }\n\n inline void Put(sharpen::ByteBuffer key,sharpen::ByteBuffer value)\n {\n sharpen::WriteBatch batch;\n batch.Put(std::move(key),std::move(value));\n this->Action(std::move(batch));\n }\n\n inline void Delete(sharpen::ByteBuffer key)\n {\n sharpen::WriteBatch batch;\n batch.Delete(std::move(key));\n this->Action(std::move(batch));\n }\n\n void ClearLogs()\n {\n this->Logger().Clear();\n }\n\n void RemoveLogs()\n {\n this->Logger().Remove();\n }\n\n Self::ExistStatus Exist(const sharpen::ByteBuffer &key) const noexcept\n {\n auto ite = this->Map().find(key);\n if(ite == this->Map().end())\n {\n return Self::ExistStatus::NotFound;\n }\n else if(ite->second.IsDeleted())\n {\n return Self::ExistStatus::Deleted;\n }\n return Self::ExistStatus::Exist;\n }\n\n sharpen::ByteBuffer &Get(const sharpen::ByteBuffer &key)\n {\n auto &item = this->Map().at(key);\n if(item.IsDeleted())\n {\n throw std::out_of_range(\"key doesn't exists\");\n }\n return item.Value();\n }\n\n const sharpen::ByteBuffer &Get(const sharpen::ByteBuffer &key) const\n {\n auto &item = this->Map().at(key);\n if(item.deleteTag_)\n {\n throw std::out_of_range(\"key doesn't exists\");\n }\n return item.value_;\n }\n\n sharpen::ByteBuffer &operator[](const sharpen::ByteBuffer &key)\n {\n return this->Get(key);\n }\n\n const sharpen::ByteBuffer &operator[](const sharpen::ByteBuffer &key) const\n {\n return this->Get(key);\n }\n\n inline ConstIterator Begin() const noexcept\n {\n return this->Map().begin();\n }\n\n inline ConstIterator End() const noexcept\n {\n return this->Map().end();\n }\n };\n\n template<typename _Logger>\n using MemoryTable = sharpen::InternalMemoryTable<_Logger>;\n}\n\n#endif"},"middle":{"kind":"string","value":" ++begin)\n {\n if (begin->type_ == sharpen::WriteBatch::ActionType::Put)\n {\n this->InternalPut(begin->"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":397,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.cc"},"repo_name":{"kind":"string","value":"rtobar/askapsoft"},"commit":{"kind":"string","value":"6bae06071d7d24f41abe3f2b7f9ee06cb0a9445e"},"file_code":{"kind":"string","value":"\n\n#include <askap_swcorrelator.h>\n#include <swcorrelator/BasicMonitor.h>\n#include <askap/AskapLogging.h>\n#include <askap/AskapError.h>\n#include <askap/AskapUtil.h>\n#include <utils/DelayEstimator.h>\n\n#include <fstream>\n\nASKAP_LOGGER(logger, \".basicmonitor\");\n\nnamespace askap {\n\nnamespace swcorrelator {\n\nBasicMonitor::BasicMonitor() : itsLastHistPosition(-1), itsWrapped(false) {}\n\nboost::shared_ptr<IMonitor> BasicMonitor::setup(const LOFAR::ParameterSet &) \n{\n ASKAPLOG_INFO_STR(logger, \"Setting up Basic Data Monitor\"); \n boost::shared_ptr<BasicMonitor> result(new BasicMonitor);\n return result;\n}\n\nvoid BasicMonitor::initialise(const int nAnt, const int nBeam, const int nChan)\n{\n if (itsHistory.nelements() == 0) {\n const int nHistory = 620;\n ASKAPDEBUGASSERT(nAnt > 1);\n ASKAPDEBUGASSERT(nBeam > 0);\n ASKAPDEBUGASSERT(nChan > 0);\n const int nBaselines = nAnt * (nAnt - 1) / 2;\n itsLastHistPosition = -1;\n itsWrapped = false;\n itsHistory.resize(nHistory,nBeam,nBaselines);\n itsHistory.set(casa::Complex(0.,0.));\n itsDelayHistory.resize(nHistory, nBeam, nBaselines);\n itsDelayHistory.set(0.);\n itsControlHistory.resize(nHistory, nBeam, nBaselines);\n itsControlHistory.set(0u);\n itsBATs.resize(nHistory);\n itsBATs.set(0);\n }\n ASKAPDEBUGASSERT(itsHistory.shape() == itsDelayHistory.shape());\n ASKAPDEBUGASSERT(itsHistory.nrow() == itsBATs.nelements());\n}\n\nvoid BasicMonitor::advanceHistoryCursor(const uint64_t bat)\n{\n if (itsLastHistPosition >= 0) {\n if (bat == itsBATs[itsLastHistPosition]) {\n return;\n } else if (bat < itsBATs[itsLastHistPosition]) {\n ASKAPLOG_DEBUG_STR(logger, \"New BAT = \"<<bat<<\" is earlier than the last history item BAT=\"<<\n itsBATs[itsLastHistPosition]);\n }\n }\n ++itsLastHistPosition;\n if (itsLastHistPosition >= int(itsHistory.nrow())) {\n itsLastHistPosition = 0;\n itsWrapped = true;\n } \n ASKAPDEBUGASSERT(itsLastHistPosition >= 0);\n ASKAPDEBUGASSERT(itsLastHistPosition < int(itsBATs.nelements()));\n itsBATs[itsLastHistPosition] = bat;\n}\n \n\nvoid BasicMonitor::publish(const CorrProducts &buf) \n{\n advanceHistoryCursor(buf.itsBAT);\n {\n const std::string fname = \"spc_beam\" + utility::toString<int>(buf.itsBeam) + \".dat\";\n std::ofstream os(fname.c_str());\n for (casa::uInt chan=0; chan < buf.itsVisibility.ncolumn(); ++chan) {\n os<<chan<<\" \";\n for (casa::uInt baseline = 0; baseline < buf.itsVisibility.nrow(); ++baseline) {\n os<<abs(buf.itsVisibility(baseline,chan))<<\" \"<<arg(buf.itsVisibility(baseline,chan))/casa::C::pi*180.<<\" \"; \n }\n os<<std::endl;\n }\n }\n \n const casa::Vector<casa::Float> delays = estimateDelays(buf.itsVisibility);\n ASKAPLOG_DEBUG_STR(logger, \"Beam \"<<buf.itsBeam<<\": delays (s) = \"<<delays);\n ASKAPDEBUGASSERT(delays.nelements() == buf.itsVisibility.nrow());\n if (buf.itsBeam >= int(itsHistory.ncolumn())) {\n ASKAPLOG_DEBUG_STR(logger, \"Receive buffer corresponding to beam \"<<buf.itsBeam<<\n \" which exceeds the maximum number of beams \"<<itsHistory.ncolumn());\n return; \n }\n \n for (casa::uInt baseline = 0; baseline < buf.itsVisibility.nrow(); ++baseline) {\n \n itsDelayHistory(itsLastHistPosition, buf.itsBeam, baseline) = delays[baseline];\n \n \n itsControlHistory(itsLastHistPosition, buf.itsBeam, baseline) = buf.itsControl[baseline]; \n \n \n casa::Complex temp(0.,0.);\n for (casa::uInt chan=0; chan < buf.itsVisibility.ncolumn(); ++chan) {\n temp += buf.itsVisibility(baseline,chan);\n }\n itsHistory(itsLastHistPosition,buf.itsBeam,baseline) = temp / float(buf.itsVisibility.ncolumn());\n \n \n }\n \n}\n \n\nvoid BasicMonitor::finalise()\n{\n \n std::ofstream os(\"visplot.dat\");\n const int nHistory = int(itsBATs.nelements());\n for (int i=0, curPos = itsWrapped ? itsLastHistPosition + 1 : 0; i<nHistory; ++i,++curPos) {\n if (curPos >= nHistory) {\n curPos = 0;\n if (!itsWrapped) {\n break;\n }\n }\n os<<itsBATs[curPos]<<\" \";\n for (int beam=0; beam < int(itsHistory.ncolumn()); ++beam) {\n for (casa::uInt baseline = 0; baseline < itsHistory.nplane(); ++baseline) {\n os<<abs(itsHistory(curPos,beam,baseline))<<\" \"<<arg(itsHistory(curPos,beam,baseline))/casa::C::pi*180.<<\" \"\n <<itsDelayHistory(curPos,beam,baseline)*1e9<<\" \";\n }\n }\n \n for (casa::uInt baseline = 0; baseline < itsHistory.nplane(); ++baseline) {\n os<<itsControlHistory(curPos,0,baseline)<<\" \";\n }\n \n os<<std::endl;\n if (curPos == itsLastHistPosition) {\n break;\n }\n } \n}\n\ncasa::Vector<casa::Float> BasicMonitor::estimateDelays(const casa::Matrix<casa::Complex> &vis)\n{\n casa::Vector<casa::Float> result(vis.nrow(),0.);\n if (vis.ncolumn() >= 2) {\n scimath::DelayEstimator de(1e6); \n for (casa::uInt row = 0; row < vis.nrow(); ++row) {\n result[row] = float(de.getDelay(vis.row(row)));\n }\n } \n return result; \n}\n\n} \n\n} \n\n"},"prefix":{"kind":"string","value":"\n\n#include <askap_swcorrelator.h>\n#include <swcorrelator/BasicMonitor.h>\n#include <askap/AskapLogging.h>\n#include <askap/AskapError.h>\n#include <askap/AskapUtil.h>\n#include <utils/DelayEstimator.h>\n\n#include <fstream>\n\nASKAP_LOGGER(logger, \".basicmonitor\");\n\nnamespace askap {\n\nnamespace swcorrelator {\n\nBasicMonitor::BasicMonitor() : itsLastHistPosition(-1), itsWrapped(false) {}\n\nboost::shared_ptr<IMonitor> BasicMonitor::setup(const LOFAR::ParameterSet &) \n{\n ASKAPLOG_INFO_STR(logger, \"Setting up Basic Data Monitor\"); \n boost::shared_ptr<BasicMonitor> result(new BasicMonitor);\n return result;\n}\n\nvoid BasicMonitor::initialise(const int nAnt, const int nBeam, const int nChan)\n{\n if (itsHistory.nelements() == 0) {\n const int nHistory = 620;\n ASKAPDEBUGASSERT(nAnt > 1);\n ASKAPDEBUGASSERT(nBeam > 0);\n ASKAPDEBUGASSERT(nChan > 0);\n const int nBaselines = nAnt * (nAnt - 1) / 2;\n itsLastHistPosition = -1;\n itsWrapped = false;\n itsHistory.resize(nHistory,nBeam,nBaselines);\n itsHistory.set(casa::Complex(0.,0.));\n itsDelayHistory.resize(nHistory, nBeam, nBaselines);\n itsDelayHistory.set(0.);\n itsControlHistory.resize(nHistory, nBeam, nBaselines);\n itsControlHistory.set(0u);\n itsBATs.resize(nHistory);\n itsBATs.set(0);\n }\n ASKAPDEBUGASSERT(itsHistory.shape() == itsDelayHistory.shape());\n ASKAPDEBUGASSERT(itsHistory.nrow() == itsBATs.nelements());\n}\n\nvoid BasicMonitor::advanceHistoryCursor(const uint64_t bat)\n{\n if (itsLastHistPosition >= 0) {\n if (bat == itsBATs[itsLastHistPosition]) {\n return;\n } else if (bat < itsBATs[itsLastHistPosition]) {\n ASKAPLOG_DEBUG_STR(logger, \"New BAT = \"<<bat<<\" is earlier than the last history item BAT=\"<<\n itsBATs[itsLastHistPosition]);\n }\n }\n ++itsLastHistPosition;\n if (itsLastHistPosition >= int(itsHistory.nrow())) {\n itsLastHistPosition = 0;\n itsWrapped = true;\n } \n ASKAPDEBUGASSERT(itsLastHistPosition >= 0);\n ASKAPDEBUGASSERT(itsLastHistPosition < int(itsBATs.nelements()));\n itsBATs[itsLastHistPosition] = bat;\n}\n \n\nvoid BasicMonitor::publish(const CorrProducts &buf) \n{\n advanceHistoryCursor(buf.itsBAT);\n {\n const std::string fname = \"spc_beam\" + utility::toString<int>(buf.itsBeam) + \".dat\";\n std::ofstream os(fname.c_str());\n for (casa::uInt chan=0; chan < buf.itsVisibility.ncolumn(); ++chan) {\n os<<chan<<\" \";\n for (casa::uInt baseline = 0; baseline < buf.itsVisibility.nrow(); ++baseline) {\n os<<abs(buf.itsVisibility(baseline,chan))<<\" \"<<arg(buf.itsVisibility(baseline,chan))/casa::C::pi*180.<<\" \"; \n }\n os<<std::endl;\n }\n }\n \n const casa::Vector<casa::Float> delays = estimateDelays(buf.itsVisibility);\n ASKAPLOG_DEBUG_STR(logger, \"Beam \"<<buf.itsBeam<<\": delays (s) = \"<<delays);\n ASKAPDEBUGASSERT(delays.nelements() == buf.itsVisibility.nrow());\n if (buf.itsBeam >= int(itsHistory.ncolumn())) {\n ASKAPLOG_DEBUG_STR(logger, \"Receive buffer corresponding to beam \"<<buf.itsBeam<<\n \" which exceeds the maximum number of beams \"<<itsHistory.ncolumn());\n return; \n }\n \n for (casa::uInt baseline = 0; baseline < buf.itsVisibility.nrow(); ++baseline) {\n \n itsDelayHistory(itsLastHistPosition, buf.itsBeam, baseline) = delays[baseline];\n \n \n itsControlHistory(itsLastHistPosition, buf.itsBeam, baseline) = buf.itsControl[baseline]; \n \n \n casa::Complex temp(0.,0.);\n for (casa::uInt chan=0; chan < buf.itsVisibility.ncolumn(); ++chan) {\n temp += buf.itsVisibility(baseline,chan);\n }\n itsHistory(itsLastHistPosition,buf.itsBeam,baseline) = temp / float(buf.itsVisibility.ncolumn());\n \n \n }\n \n}\n \n\nvoid BasicMonitor::finalise()\n{\n \n std::ofstream os(\"visplot.dat\");\n const int nHistory = int(itsBATs.nelements());\n for (int i=0, curPos = itsWrapped ? itsLastHistPosition + 1 : 0; i<nHistory; ++i,++curPos) {\n if (curPos >= nHistory) {\n curPos = 0;\n if (!itsWrapped) {\n break;\n }\n }\n os<<itsBATs[curPos]<<\" \";\n for (int beam=0; beam < int(itsHistory.ncolumn()); ++beam) {\n for (casa::uInt baseline = 0; baseline < itsHistory.nplane(); ++baseline) {\n os<<abs(itsHistory(curPos,beam,baseline))<<\" \"<<arg(itsHistory(curPos,beam,baseline))/casa::C::pi*180.<<\" \"\n <<itsDelayHistory(curPos,beam,baseline)*1e9<<\" \";\n }\n }\n \n for (casa::uInt baseline = 0; baseline < itsHistory.nplane(); ++baseline) {\n os<<itsControlHistory(curPos,0,baseline)<<\" \";\n }\n \n os<<std::endl;\n if (curPos == itsLastHistPosition) {\n break;\n }\n } \n}\n\n"},"suffix":{"kind":"string","value":"\n\n} \n\n} \n\n"},"middle":{"kind":"string","value":"casa::Vector<casa::Float> BasicMonitor::estimateDelays(const casa::Matrix<casa::Complex> &vis)\n{\n casa::Vector<casa::Float> result(vis.nrow(),0.);\n if (vis.ncolumn() >= 2) {\n scimath::DelayEstimator de(1e6); \n for (casa::uInt row = 0; row < vis.nrow(); ++row) {\n result[row] = float(de.getDelay(vis.row(row)));\n }\n } \n return result; \n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief a collection of data monitors\n\n/// @details This class is just a container of data monitors. It implements basic calls\n\n/// of the IMonitor interface and translates them to each monitor held in the container.\n\n/// @ingroup swcorrelator\n\nstruct DataMonitors : public IMonitor {\n\n /// @brief constructor, creates monitors using the factory and adds them to the container\n\n /// @param[in] parset parset file used (without the swcorrelator prefix)\n\n /// @note The list of monitors to create is specified by the \"monitors\" keyword.\n\n explicit DataMonitors(const LOFAR::ParameterSet &parset);\n\n \n\n /// @brief destructor, added to assist synchronisation\n\n ~DataMonitors();\n\n\n\n /// @brief initialise publishing\n\n /// @details Technically, this step is not required. But given the\n\n /// current design of the code it seems better to give a hint on the maximum\n\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\n\n /// @param[in] nAnt maximum number of antennas\n\n /// @param[in] nBeam maximum number of beams\n\n /// @param[in] nChan maximum number of channels\n\n /// @note At the moment we envisage that this method would only be called once.\n\n /// Technically all this information could be extracted from the parset supplied\n\n /// in the setup method, but it seems handy to have each parameter extracted from\n\n /// the parset at a single place only. \n\n virtual void initialise(const int nAnt, const int nBeam, const int nChan);\n\n \n\n /// @brief Publish one buffer of data\n\n /// @details This method is called as soon as the new chunk of data is written out\n\n /// @param[in] buf products buffer\n\n /// @note the buffer is locked for the duration of execution of this method, different\n\n /// beams are published separately\n\n virtual void publish(const CorrProducts &buf);\n\n \n\n /// @brief finilaise publishing for the current integration\n\n /// @details This method is called when data corresponding to all beams are published.\n\n /// It is the place for operations which do not require the lock on the buffers\n\n /// (i.e. dumping the accumulated history to the file, etc).\n\n virtual void finalise();\n\n \n\nprivate:\n\n /// @brief name of the monitor\n\n /// @return the name of the monitor\n\n static std::string name() { return \"not_supposed_to_be_called\"; }\n\n \n\n /// @brief container of actual monitors\n\n /// @details We use vector because the most time-critical operation is the iteration over all\n\n /// elements. In addition, it seems unlikely that we have many monitors co-existing at the same time.\n\n std::vector<boost::shared_ptr<IMonitor> > itsMonitors;\n\n\n\n /// @brief mutex to synchronise access to data monitors\n\n mutable boost::mutex itsMonitorsMutex;\n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.h","rank":0,"score":305549.81501957594},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief data monitored externally\n\n/// @details This is a basic structure containing a number of monitoring points\n\n/// such as amplitudes, delays or phases. A structure of this type is passed to \n\n/// a registered call back method at every new correlation cycle. Although we \n\n/// could've passed the CorrProducts structure which is used in the generic monitoring\n\n/// interface, an adapter seems worth while to avoid a tight coupling between epics part\n\n/// and the rest of the software correlator. In addition, we can latter add other information\n\n/// to the type which is not present in the CorrProducts structure.\n\n/// @ingroup corrinterfaces\n\nstruct MonitoringData : private boost::noncopyable {\n\n /// @brief individual baselines\n\n enum Baseline {\n\n BASELINE_12 = 0,\n\n BASELINE_23,\n\n BASELINE_13\n\n };\n\n\n\n /// @brief constructor, initialises the beam number and resizes the vectors\n\n /// @param[in] beam beam index [0..nBeam-1]\n\n explicit MonitoringData(const int beam);\n\n \n\n /// @brief obtain UT date/time string\n\n /// @return the date/time corresponding to itsTime as a string (to simplify reporting)\n\n std::string timeString() const;\n\n \n\n /// @brief the beam number related to this structure\n\n /// @return the beam number\n\n int beam() const; \n\n \n\n /// @brief obtain amplitude for a given baseline \n\n /// @param[in] baseline baseline index\n\n /// @return amplitude in raw counts\n\n float amplitude(const Baseline baseline) const;\n\n\n\n /// @brief obtain phase for a given baseline \n\n /// @param[in] baseline baseline index\n\n /// @return phase in degrees\n\n float phase(const Baseline baseline) const;\n\n\n\n /// @brief obtain fitted delay for a given baseline \n\n /// @param[in] baseline baseline index\n\n /// @return delay in nanoseconds\n\n double delay(const Baseline baseline) const;\n\n\n\n /// @brief check whether a particular baseline has valid data\n\n /// @param[in] baseline baseline index\n\n /// @return true, if the data corresponding to the given baseline are valid\n\n bool isValid(const Baseline baseline) const;\n\n\n\n /// @brief obtain time\n\n /// @return UT epoch in days since 0 MJD\n\n double time() const;\n\n \n\n // monitoring information for the last correlated data\n\n \n\n /// @brief the beam this structure corresponds to [0..nBeam-1]\n\n int itsBeam;\n\n\n\n /// @brief averaged amplitudes for all 3 baselines in raw counts\n\n /// @details This vector is supposed to have 3 elements at all times. The order\n\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\n\n std::vector<float> itsAmplitudes;\n\n \n\n /// @brief averaged phases for all 3 baselines in degrees\n\n /// @details This vector is supposed to have 3 elements at all times. The order\n\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\n\n std::vector<float> itsPhases;\n\n \n\n /// @brief delays for all 3 baselines in nanoseconds\n\n /// @details This vector is supposed to have 3 elements at all times. The order\n\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\n\n std::vector<double> itsDelays;\n\n \n\n /// @brief flagging information\n\n /// @details This vector is supposed to have 3 elements at all times. True for a \n\n /// particular baseline means that the corresponding amplitudes, phases and delays\n\n /// are not valid. The order of baselines is 1-2,2-3,1-3 (1-based indices).\n\n std::vector<bool> itsFlags;\n\n \n\n /// @brief UT time in days since 0 MJD\n\n double itsTime; \n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.h","rank":1,"score":291214.9235100251},{"content":"/// @brief basic on-the-fly monitor dumping data into an ascii file\n\n/// @details This implementation of the data monitor dumps delay and\n\n/// visibility history into ascii files for on-the-fly monitoring along\n\n/// with the latest spectra for each beam\n\n/// @ingroup swcorrelator\n\nclass BasicMonitor : public IMonitor {\n\npublic:\n\n /// @brief constructor\n\n BasicMonitor();\n\n\n\n /// @brief create and configure the monitor \n\n /// @details\n\n /// @param[in] parset parset with parameters (without the swcorrelator prefix)\n\n /// @return shared pointer to the monitor\n\n static boost::shared_ptr<IMonitor> setup(const LOFAR::ParameterSet &parset);\n\n \n\n /// @brief name of the monitor\n\n /// @return the name of the monitor\n\n static std::string name() { return \"basic\"; }\n\n \n\n /// @brief initialise publishing\n\n /// @details Technically, this step is not required. But given the\n\n /// current design of the code it seems better to give a hint on the maximum\n\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\n\n /// @param[in] nAnt maximum number of antennas\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":2,"score":267982.62338736525},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief generic interface for an on-the-fly monitor\n\n/// @details Possible implementations could include dumping some history\n\n/// into ascii files or providing monitoring via epics.\n\n/// @ingroup swcorrelator\n\nstruct IMonitor : private boost::noncopyable {\n\n \n\n /// @brief shared pointer type\n\n typedef boost::shared_ptr<IMonitor> ShPtr;\n\n \n\n /// @brief virtual destructor to keep the compiler happy\n\n virtual ~IMonitor() {};\n\n \n\n /// @brief name of the monitor\n\n /// @return the name of the monitor\n\n static std::string name() { return \"undefined\"; }\n\n \n\n /// @brief initialise publishing\n\n /// @details Technically, this step is not required. But given the\n\n /// current design of the code it seems better to give a hint on the maximum\n\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\n\n /// @param[in] nAnt maximum number of antennas\n\n /// @param[in] nBeam maximum number of beams\n\n /// @param[in] nChan maximum number of channels\n\n /// @note At the moment we envisage that this method would only be called once.\n\n /// Technically all this information could be extracted from the parset supplied\n\n /// in the setup method, but it seems handy to have each parameter extracted from\n\n /// the parset at a single place only. \n\n virtual void initialise(const int nAnt, const int nBeam, const int nChan) = 0;\n\n \n\n /// @brief Publish one buffer of data\n\n /// @details This method is called as soon as the new chunk of data is written out\n\n /// @param[in] buf products buffer\n\n /// @note the buffer is locked for the duration of execution of this method, different\n\n /// beams are published separately\n\n virtual void publish(const CorrProducts &buf) = 0;\n\n \n\n /// @brief finilaise publishing for the current integration\n\n /// @details This method is called when data corresponding to all beams are published.\n\n /// It is the place for operations which do not require the lock on the buffers\n\n /// (i.e. dumping the accumulated history to the file, etc).\n\n virtual void finalise() = 0;\n\n};\n\n \n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/IMonitor.h","rank":3,"score":249246.8077438395},{"content":" uint64_t bat; // BAT of first sample\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h","rank":4,"score":247907.26075640976},{"content":" uint32_t beam; // beam number 1-18\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h","rank":5,"score":247863.44428795762},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief header preceding each data chunk for all buffers\n\n/// @details This header preceds any actual data in the stream.\n\n/// @ingroup swcorrelator\n\nstruct BufferHeader {\n\n uint64_t bat; // BAT of first sample\n\n uint32_t antenna; // antenna number\n\n uint32_t freqId; // currently card number 1-16. If we go to more DSPs will be 1-64 (same as FreqId field is FITs acm capture)\n\n uint32_t beam; // beam number 1-18\n\n uint32_t frame; // frame number of first sample (from digitiser packet, see below)\n\n uint32_t control; // user defined value, can be hooked up thru epics to send control via OSL script or gui to software correlator if necessary\n\n uint32_t length; // length of data (should always be 4194304 (num ddr pages * bytes per beam) for 16MHz\n\n};\n\n\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h","rank":6,"score":246400.306509534},{"content":" /// @param[in] nBeam maximum number of beams\n\n /// @param[in] nChan maximum number of channels\n\n /// @note At the moment we envisage that this method would only be called once.\n\n /// Technically all this information could be extracted from the parset supplied\n\n /// in the setup method, but it seems handy to have each parameter extracted from\n\n /// the parset at a single place only. \n\n virtual void initialise(const int nAnt, const int nBeam, const int nChan);\n\n \n\n /// @brief Publish one buffer of data\n\n /// @details This method is called as soon as the new chunk of data is written out\n\n /// @param[in] buf products buffer\n\n /// @note the buffer is locked for the duration of execution of this method, different\n\n /// beams are published separately\n\n virtual void publish(const CorrProducts &buf);\n\n \n\n /// @brief finilaise publishing for the current integration\n\n /// @details This method is called when data corresponding to all beams are published.\n\n /// It is the place for operations which do not require the lock on the buffers\n\n /// (i.e. dumping the accumulated history to the file, etc).\n\n virtual void finalise();\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":7,"score":204867.445135815},{"content":"#include <casacore/casa/Arrays/Vector.h>\n\n\n\n// other 3rd party\n\n#include <Common/ParameterSet.h>\n\n#include <inttypes.h>\n\n\n\nnamespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief basic on-the-fly monitor dumping data into an ascii file\n\n/// @details This implementation of the data monitor dumps delay and\n\n/// visibility history into ascii files for on-the-fly monitoring along\n\n/// with the latest spectra for each beam\n\n/// @ingroup swcorrelator\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":8,"score":204864.0248015621},{"content":"\n\n /// @brief history of user defined control keywords\n\n casa::Cube<uint32_t> itsControlHistory;\n\n \n\n /// @brief BATs for the history items\n\n casa::Vector<uint64_t> itsBATs;\n\n \n\n /// @brief last position in the history (circular buffers)\n\n /// @details negative value for an uninitialised history\n\n int itsLastHistPosition;\n\n \n\n /// @brief true if the history buffers were wrapped\n\n bool itsWrapped;\n\n};\n\n\n\n} // namespace swcorrelator\n\n\n\n} // namespace askap\n\n\n\n#endif // #ifndef ASKAP_SWCORRELATOR_BASIC_MONITOR_H\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":9,"score":204863.29141174912},{"content":"\n\n /// @brief helper method to get delays\n\n /// @details\n\n /// @param[in] vis visibility matrix (rows are baselines, columns are channels)\n\n /// @return delays in seconds for each baseline\n\n /// @note the routine assumes 1 MHz channel spacing and will not work for a very quick wrap\n\n static casa::Vector<casa::Float> estimateDelays(const casa::Matrix<casa::Complex> &vis);\n\n\n\nprotected:\n\n /// @brief advance history if necessary\n\n /// @details Advances the cursor in the history list if the new bat is different from the one \n\n /// stored during the previous step (unless it is a first step)\n\n /// @param[in] bat new BAT \n\n void advanceHistoryCursor(const uint64_t bat);\n\nprivate:\n\n /// @brief history of visibilities\n\n casa::Cube<casa::Complex> itsHistory;\n\n \n\n /// @brief history of delays\n\n casa::Cube<casa::Float> itsDelayHistory;\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":10,"score":204833.70864316673},{"content":"/// This program is distributed in the hope that it will be useful,\n\n/// but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n/// GNU General Public License for more details.\n\n///\n\n/// You should have received a copy of the GNU General Public License\n\n/// along with this program; if not, write to the Free Software\n\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n///\n\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\n\n\n\n#ifndef ASKAP_SWCORRELATOR_BASIC_MONITOR_H\n\n#define ASKAP_SWCORRELATOR_BASIC_MONITOR_H\n\n\n\n// own includes\n\n#include <swcorrelator/IMonitor.h>\n\n\n\n// casa includes\n\n#include <casacore/casa/Arrays/Matrix.h>\n\n#include <casacore/casa/Arrays/Cube.h>\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":11,"score":204832.74873002138},{"content":"/// @file \n\n///\n\n/// @brief basic on-the-fly monitor dumping data into an ascii file\n\n/// @details This implementation of the data monitor dumps delay and\n\n/// visibility history into ascii files for on-the-fly monitoring along\n\n/// with the latest spectra for each beam\n\n///\n\n/// @copyright (c) 2007 CSIRO\n\n/// Australia Telescope National Facility (ATNF)\n\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\n\n/// PO Box 76, Epping NSW 1710, Australia\n\n/// atnf-enquiries@csiro.au\n\n///\n\n/// This file is part of the ASKAP software distribution.\n\n///\n\n/// The ASKAP software distribution is free software: you can redistribute it\n\n/// and/or modify it under the terms of the GNU General Public License as\n\n/// published by the Free Software Foundation; either version 2 of the License,\n\n/// or (at your option) any later version.\n\n///\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h","rank":12,"score":204832.5316110967},{"content":"/// @param[in] nBeam maximum number of beams\n\n/// @param[in] nChan maximum number of channels\n\n/// @note At the moment we envisage that this method would only be called once.\n\n/// Technically all this information could be extracted from the parset supplied\n\n/// in the setup method, but it seems handy to have each parameter extracted from\n\n/// the parset at a single place only. \n\nvoid DataMonitors::initialise(const int nAnt, const int nBeam, const int nChan)\n\n{\n\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\n\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\n\n ci != itsMonitors.end(); ++ci) {\n\n ASKAPDEBUGASSERT(*ci);\n\n (*ci)->initialise(nAnt,nBeam,nChan);\n\n }\n\n}\n\n \n\n/// @brief Publish one buffer of data\n\n/// @details This method is called as soon as the new chunk of data is written out\n\n/// @param[in] buf products buffer\n\n/// @note the buffer is locked for the duration of execution of this method, different\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":25,"score":201310.01312149307},{"content":"/// beams are published separately\n\nvoid DataMonitors::publish(const CorrProducts &buf)\n\n{\n\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\n\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\n\n ci != itsMonitors.end(); ++ci) {\n\n ASKAPDEBUGASSERT(*ci);\n\n (*ci)->publish(buf);\n\n }\n\n}\n\n \n\n/// @brief finilaise publishing for the current integration\n\n/// @details This method is called when data corresponding to all beams are published.\n\n/// It is the place for operations which do not require the lock on the buffers\n\n/// (i.e. dumping the accumulated history to the file, etc).\n\nvoid DataMonitors::finalise()\n\n{\n\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\n\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\n\n ci != itsMonitors.end(); ++ci) {\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":26,"score":201289.15958581647},{"content":"/// but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n/// GNU General Public License for more details.\n\n///\n\n/// You should have received a copy of the GNU General Public License\n\n/// along with this program; if not, write to the Free Software\n\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n///\n\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\n\n\n\n#include <askap_swcorrelator.h>\n\n#include <askap/AskapError.h>\n\n#include <askap/AskapLogging.h>\n\n\n\n#include <swcorrelator/DataMonitors.h>\n\n#include <swcorrelator/MonitorFactory.h>\n\n\n\nASKAP_LOGGER(logger, \".datamonitors\");\n\n\n\nnamespace askap {\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":27,"score":201285.3053264966},{"content":"\n\nnamespace swcorrelator {\n\n\n\n/// @brief constructor, creates monitors using the factory and adds them to the container\n\n/// @param[in] parset parset file used (without the swcorrelator prefix)\n\n/// @note The list of monitors to create is specified by the \"monitors\" keyword.\n\nDataMonitors::DataMonitors(const LOFAR::ParameterSet &parset)\n\n{\n\n const std::vector<std::string> monitors = parset.getStringVector(\"monitors\",std::vector<std::string>(1,\"basic\"));\n\n if (monitors.size() == 0) {\n\n ASKAPLOG_INFO_STR(logger, \"No on-the-fly data monitors will be created\");\n\n } else {\n\n itsMonitors.reserve(monitors.size());\n\n ASKAPLOG_INFO_STR(logger, \"Setting up data monitors from the list: \"<<monitors);\n\n for (std::vector<std::string>::const_iterator ci = monitors.begin(); ci != monitors.end(); ++ci) {\n\n const boost::shared_ptr<IMonitor> curMonitor = MonitorFactory::make(*ci, parset);\n\n ASKAPCHECK(curMonitor, \"Failed to create data monitor name = `\"<<*ci<<\"`\");\n\n itsMonitors.push_back(curMonitor);\n\n }\n\n }\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":28,"score":201276.92211566388},{"content":"}\n\n\n\n// @brief destructor, added to assist synchronisation\n\nDataMonitors::~DataMonitors()\n\n{\n\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\n\n for (std::vector<boost::shared_ptr<IMonitor> >::iterator it = itsMonitors.begin();\n\n it != itsMonitors.end(); ++it) {\n\n ASKAPDEBUGASSERT(*it);\n\n it->reset();\n\n }\n\n itsMonitors.resize(0);\n\n}\n\n\n\n \n\n/// @brief initialise publishing\n\n/// @details Technically, this step is not required. But given the\n\n/// current design of the code it seems better to give a hint on the maximum\n\n/// possible number of antennas, beams and channels, e.g. to initialise caches.\n\n/// @param[in] nAnt maximum number of antennas\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":29,"score":201273.78919691162},{"content":"/// @file \n\n///\n\n/// @brief a collection of data monitors\n\n/// @details This class is just a container of data monitors. It implements basic calls\n\n/// of the IMonitor interface and translates them to each monitor held in the container.\n\n///\n\n/// @copyright (c) 2007 CSIRO\n\n/// Australia Telescope National Facility (ATNF)\n\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\n\n/// PO Box 76, Epping NSW 1710, Australia\n\n/// atnf-enquiries@csiro.au\n\n///\n\n/// This file is part of the ASKAP software distribution.\n\n///\n\n/// The ASKAP software distribution is free software: you can redistribute it\n\n/// and/or modify it under the terms of the GNU General Public License as\n\n/// published by the Free Software Foundation; either version 2 of the License,\n\n/// or (at your option) any later version.\n\n///\n\n/// This program is distributed in the hope that it will be useful,\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":30,"score":201264.99690795044},{"content":" ASKAPDEBUGASSERT(*ci);\n\n (*ci)->finalise();\n\n }\n\n}\n\n\n\n} // namespace swcorrelator\n\n\n\n} // namespace askap\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc","rank":31,"score":201260.77138981773},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief generic interface for sink of the correlation products\n\n/// @details One of the possible implementations is the MS writer\n\n/// @ingroup swcorrelator\n\nstruct ISink : private boost::noncopyable {\n\n /// @brief virtual destructor to keep the compiler happy\n\n virtual ~ISink() {};\n\n \n\n /// @brief calculate uvw for the given buffer\n\n /// @param[in] buf products buffer\n\n /// @note The calculation is bypassed if itsUVWValid flag is already set in the buffer\n\n /// @return time epoch corresponding to the BAT of the buffer\n\n virtual casa::MEpoch calculateUVW(CorrProducts &buf) const = 0;\n\n \n\n /// @brief write one buffer to the measurement set\n\n /// @details Current fieldID and dataDescID are assumed\n\n /// @param[in] buf products buffer\n\n /// @note This method could've received a const reference to the buffer. However, more\n\n /// workarounds would be required with casa arrays, so we don't bother doing this at the moment.\n\n /// In addition, we could call calculateUVW inside this method (but we still need an option to\n\n /// calculate uvw's ahead of writing the buffer if we implement some form of delay tracking).\n\n virtual void write(CorrProducts &buf) = 0;\n\n};\n\n \n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/ISink.h","rank":32,"score":188726.42404934886},{"content":"\n\nnamespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief constructor, initialises the beam number and resizes the vectors\n\n/// @param[in] beam beam index [0..nBeam-1]\n\nMonitoringData::MonitoringData(const int beam) : itsBeam(beam), itsAmplitudes(3,0.),\n\n itsPhases(3,0.), itsDelays(3,0.), itsFlags(3,true), itsTime(0.) {}\n\n\n\n/// @brief obtain UT date/time string\n\n/// @return the date/time corresponding to itsTime as a string (to simplify reporting)\n\nstd::string MonitoringData::timeString() const\n\n{\n\n const casa::MVEpoch epoch(itsTime);\n\n std::ostringstream os;\n\n epoch.print(os);\n\n return os.str();\n\n}\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":33,"score":187760.1569016535},{"content":"/// @brief check whether a particular baseline has valid data\n\n/// @param[in] baseline baseline index\n\n/// @return true, if the data corresponding to the given baseline are valid\n\nbool MonitoringData::isValid(const Baseline baseline) const\n\n{\n\n const int bl = int(baseline);\n\n ASKAPDEBUGASSERT(bl >= 0);\n\n ASKAPDEBUGASSERT(bl < int(itsFlags.size()));\n\n return !itsFlags[bl];\n\n}\n\n\n\n/// @brief obtain time\n\n/// @return UT epoch in days since 0 MJD\n\ndouble MonitoringData::time() const\n\n{\n\n return itsTime;\n\n}\n\n\n\n} // namespace swcorrelator\n\n\n\n} // namespace askap\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":34,"score":187752.82591506373},{"content":"/// @brief the beam number related to this structure\n\n/// @return the beam number\n\nint MonitoringData::beam() const\n\n{\n\n return itsBeam;\n\n}\n\n\n\n/// @brief obtain amplitude for a given baseline \n\n/// @param[in] baseline baseline index\n\n/// @return amplitude in raw counts\n\nfloat MonitoringData::amplitude(const Baseline baseline) const\n\n{\n\n const int bl = int(baseline);\n\n ASKAPDEBUGASSERT(bl >= 0);\n\n ASKAPDEBUGASSERT(bl < int(itsAmplitudes.size()));\n\n return itsAmplitudes[bl];\n\n}\n\n\n\n/// @brief obtain phase for a given baseline \n\n/// @param[in] baseline baseline\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":35,"score":187738.46084817822},{"content":"/// @return phase in degrees \n\nfloat MonitoringData::phase(const Baseline baseline) const\n\n{\n\n const int bl = int(baseline);\n\n ASKAPDEBUGASSERT(bl >= 0);\n\n ASKAPDEBUGASSERT(bl < int(itsPhases.size()));\n\n return itsPhases[bl];\n\n}\n\n\n\n/// @brief obtain fitted delay for a given baseline \n\n/// @param[in] baseline baseline index \n\n/// @return delay in nanoseconds\n\ndouble MonitoringData::delay(const Baseline baseline) const\n\n{\n\n const int bl = int(baseline);\n\n ASKAPDEBUGASSERT(bl >= 0);\n\n ASKAPDEBUGASSERT(bl < int(itsDelays.size()));\n\n return itsDelays[bl];\n\n}\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":36,"score":187732.022651667},{"content":"/// @file \n\n///\n\n/// @brief data monitored externally\n\n/// @details This is a basic structure containing a number of monitoring points\n\n/// such as amplitudes, delays or phases. A structure of this type is passed to \n\n/// a registered call back method at every new correlation cycle. Although we \n\n/// could've passed the CorrProducts structure which is used in the generic monitoring\n\n/// interface, an adapter seems worth while to avoid a tight coupling between epics part\n\n/// and the rest of the software correlator. In addition, we can latter add other information\n\n/// to the type which is not present in the CorrProducts structure.\n\n///\n\n/// @copyright (c) 2007 CSIRO\n\n/// Australia Telescope National Facility (ATNF)\n\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\n\n/// PO Box 76, Epping NSW 1710, Australia\n\n/// atnf-enquiries@csiro.au\n\n///\n\n/// This file is part of the ASKAP software distribution.\n\n///\n\n/// The ASKAP software distribution is free software: you can redistribute it\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":37,"score":187729.82266914644},{"content":"/// and/or modify it under the terms of the GNU General Public License as\n\n/// published by the Free Software Foundation; either version 2 of the License,\n\n/// or (at your option) any later version.\n\n///\n\n/// This program is distributed in the hope that it will be useful,\n\n/// but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n/// GNU General Public License for more details.\n\n///\n\n/// You should have received a copy of the GNU General Public License\n\n/// along with this program; if not, write to the Free Software\n\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n///\n\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\n\n\n\n#include <corrinterfaces/MonitoringData.h>\n\n#include <askap/AskapError.h>\n\n#include <casacore/casa/Quanta/MVEpoch.h>\n\n\n\n#include <sstream>\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc","rank":38,"score":187721.2420092597},{"content":"#!/usr/bin/env python\n\n\n\nimport math\n\nfrom numpy import *\n\n\n\ndef getInputParams(infilename, prefix):\n\n paramlist = {}\n\n infile = file(infilename,'rU')\n\n lines = infile.readlines()\n\n for line in lines:\n\n if(line[:line.find('.')+1]==prefix):\n\n key = line.split('=')[0][line.find('.')+1:]\n\n val = line.split('=')[1]\n\n paramlist[key.strip()] = val.strip()\n\n return paramlist\n\n\n\ndef getParamValue(dict, param, default):\n\n if(not dict.has_key(param)):\n\n return default\n\n val = dict[param]\n\n return val \n\n\n\ndef getParamArray(dict, param, default):\n\n if(not dict.has_key(param)):\n\n return default\n\n val = dict[param]\n\n if(val[0]!='['):\n\n return default\n\n if(val[-1]!=']'):\n\n return default\n\n return array(val.replace('[','').replace(']','').split(','))\n\n\n","file_path":"Code/Components/Analysis/data/current/askap/analysis/data/parsets.py","rank":39,"score":187547.72504613595},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Writing thread of the MS filler\n\n/// @details This class holds a shared pointer to the main filler and can call\n\n/// its methods to get data and to synchronise.\n\n/// @ingroup swcorrelator\n\nstruct FillerWorker {\n\n\n\n /// @brief constructor, pass the shared pointer to the filler\n\n FillerWorker(const boost::shared_ptr<CorrFiller> &filler);\n\n\n\n /// @brief entry point for the parallel thread\n\n void operator()();\n\n\n\nprivate:\n\n boost::shared_ptr<CorrFiller> itsFiller; \n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/FillerWorker.h","rank":40,"score":186912.22638827033},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Thread which manages a single data stream connection\n\n/// @details This class is initialised with two shared pointers, one to the socket \n\n/// corresponding to one input data stream and another corresponding to the buffer\n\n/// manager. Each instance (executed as a separate thread), obtains a buffer from \n\n/// the manager, fills it with new data and de-allocates it. The correlator thread\n\n/// is responsible for further processing when sufficient data are accumulated.\n\n/// @ingroup swcorrelator\n\nstruct StreamConnection {\n\n\n\n /// @brief constructor\n\n /// @details\n\n /// @param[in] socket shared pointer to the socket corresponding to this connection\n\n /// @param[in] bm shared pointer to the buffer manager\n\n StreamConnection(const boost::shared_ptr<boost::asio::ip::tcp::socket> &socket,\n\n const boost::shared_ptr<BufferManager> &bm);\n\n \n\n /// @brief parallel thread\n\n /// @details This is the main entry point to the code executed in a parallel thread\n\n void operator()();\n\n \n\nprivate:\n\n /// @details shared pointer to the socket corresponding connection managed by this instance\n\n boost::shared_ptr<boost::asio::ip::tcp::socket> itsSocket;\n\n \n\n /// @brief buffer manager\n\n boost::shared_ptr<BufferManager> itsBufferManager;\n\n};\n\n\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/StreamConnection.h","rank":41,"score":186912.22638827033},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Thread which does correlation\n\n/// @details This class holds shared pointers to the filler and the buffer\n\n/// manager. The parallel thread extracts data corresponding to all three \n\n/// baselines, some spectral channel and beam, correlates them and passes\n\n/// to the filler for writing. The filler and buffer manager manage \n\n/// synchronisation.\n\n/// @ingroup swcorrelator\n\nstruct CorrWorker {\n\n\n\n /// @brief constructor\n\n /// @details \n\n /// @param[in] filler shared pointer to a filler\n\n /// @param[in] bm shared pointer to a buffer manager\n\n CorrWorker(const boost::shared_ptr<CorrFiller> &filler,\n\n const boost::shared_ptr<BufferManager> &bm);\n\n\n\n /// @brief entry point for the parallel thread\n\n void operator()();\n\n \n\nprivate:\n\n /// @brief filler\n\n boost::shared_ptr<CorrFiller> itsFiller;\n\n /// @brief buffer manager\n\n boost::shared_ptr<BufferManager> itsBufferManager; \n\n};\n\n\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/CorrWorker.h","rank":42,"score":186912.22638827033},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Thread which just dumps the data into binary file\n\n/// @details This class holds shared pointer to the buffer\n\n/// manager. The parallel thread extracts data when a new buffer is ready\n\n/// and then dumps the content into a file. This is an anternative to the\n\n/// correlation thread and they shouldn't be launched together (or there \n\n/// will be a data race).\n\n/// @ingroup swcorrelator\n\nstruct CaptureWorker {\n\n\n\n /// @brief constructor\n\n /// @details \n\n /// @param[in] bm shared pointer to a buffer manager\n\n /// @param[in] statsOnly if true, only statistics will be stored, not the\n\n /// actual data (and the same output file will be reused for different integrations)\n\n CaptureWorker(const boost::shared_ptr<BufferManager> &bm, const bool statsOnly = false);\n\n\n\n /// @brief entry point for the parallel thread\n\n void operator()();\n\n \n\n /// @brief method to simplify reading the file\n\n /// @details It allows to encapsulate all low-level file \n\n /// operations in the same file.\n\n /// @param[in] fname file name\n\n /// @return a vector with data\n\n static std::vector<std::complex<float> > read(const std::string &fname);\n\n \n\nprivate:\n\n /// @brief buffer manager\n\n boost::shared_ptr<BufferManager> itsBufferManager; \n\n \n\n /// @brief if true, only distribution function is to be written\n\n bool itsStatsOnly;\n\n \n\n /// @brief output stream to store time series for statistics\n\n /// @details Full flexibility is not supported, antenna/channel/beam selection is hard coded\n\n static std::ofstream theirOStream;\n\n \n\n /// @brief BAT time of the start, used in conjunction with the stream defined above\n\n static uint64_t theirStartBAT;\n\n};\n\n\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/CaptureWorker.h","rank":43,"score":186912.22638827033},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Final products of correlation\n\n/// @details This class encapsulates the data, which is the final product of correlation, i.e\n\n/// visibilities for all spectral channels and baselines, flagging information and, BAT and uvw.\n\n/// @ingroup swcorrelator\n\nstruct CorrProducts : private boost::noncopyable {\n\n // baselines are hardcoded at the moment in the order 1-2, 2-3 and 1-3\n\n \n\n /// @brief constructor \n\n /// @param[in] nchan number of channels (cards)\n\n /// @param[in] beam beam number corresponding to this buffer\n\n /// @param[in] nant number of antennas\n\n CorrProducts(const int nchan, const int beam, const int nant = 3);\n\n \n\n /// @brief initialise the buffer for a given beam and bat\n\n /// @details\n\n /// @param[in] bat time\n\n void init(const uint64_t bat);\n\n \n\n /// @brief obtain the number of antennas\n\n /// @return number of antennas handled by this buffer\n\n casa::uInt nAnt() const;\n\n \n\n /// @brief obtain the number of baselines\n\n /// @return number of baselines handled by this buffer\n\n casa::uInt nBaseline() const;\n\n \n\n /// @brief baseline index for a pair of antennas\n\n /// @details For more than 3 antennas mapping between antennas and baselines \n\n /// is handy to implement inside this method\n\n /// @param[in] first index of the first antenna (0..nant-1)\n\n /// @param[in] second index of the second antenna (0..nant-1)\n\n /// @return baseline index (0..(nant*(nant-1)/2)-1)\n\n /// @note an exception is thrown if there is no matching baseline (i.e. if first >= second)\n\n static int baseline(const int first, const int second);\n\n \n\n /// @brief index of the first antenna for a given baseline\n\n /// @details It is handy to encapsulate mapping between baseline and antenna\n\n /// indices.\n\n /// @param[in] baseline baseline index (0..(nant*(nant-1)/2-1))\n\n /// @return index of the first antenna\n\n static int first(const int baseline);\n\n\n\n /// @brief index of the second antenna for a given baseline\n\n /// @details It is handy to encapsulate mapping between baseline and antenna\n\n /// indices.\n\n /// @param[in] baseline baseline index (0..(nant*(nant-1)/2-1))\n\n /// @return index of the second antenna\n\n static int second(const int baseline);\n\n \n\n \n\n /// @brief visibility buffer (dimensions are baseline and channel)\n\n casa::Matrix<casa::Complex> itsVisibility; \n\n \n\n /// @brief flagging information (dimensions are baseline and channel)\n\n casa::Matrix<casa::Bool> itsFlag;\n\n \n\n /// @brief beam index (negative value means that this buffer is not valid)\n\n int itsBeam;\n\n \n\n /// @brief time\n\n uint64_t itsBAT;\n\n \n\n /// @brief baseline spacings for all 3 baselines (rows are baselines)\n\n casa::Matrix<double> itsUVW;\n\n \n\n /// @brief delay vector for all 3 baselines\n\n /// @details We can't use W from itsUVW because it is in J2000 rather than JTRUE\n\n casa::Vector<double> itsDelays;\n\n \n\n /// @brief flag that uvw matrix and delay vector are filled with valid info\n\n bool itsUVWValid;\n\n\n\n /// @brief user defined control words for antennas 1,2 and 3\n\n casa::Vector<uint32_t> itsControl;\n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/CorrProducts.h","rank":44,"score":186912.22638827033},{"content":"namespace askap {\n\n\n\n/// @details The profile package is used to accumulate statistics\n\n/// (e.g. to produce a pie chart to investigate where processing time goes)\n\n/// This class represent a data structure which is accumulated for every\n\n/// selected method.\n\n/// @ingroup profile\n\nstruct ProfileData {\n\n /// @brief default constructor\n\n /// @details Initialises the node with default values of zero execution time and\n\n /// zero number of calls\n\n ProfileData();\n\n \n\n /// @brief constructor corresponding to the first call\n\n /// @details This version initialises the number of calls to one and the times to\n\n /// the given execution times of the first call\n\n /// @param[in] time execution time for the first call\n\n explicit ProfileData(const double time);\n\n\n\n // access to the stats\n\n /// @return number of calls\n\n inline long count() const { return itsCount; }\n\n\n\n /// @param[in] cnt counter to set\n\n inline void setCount(const long cnt) { itsCount = cnt;}\n\n\n\n /// @return total execution time\n\n inline double totalTime() const { return itsTotalTime; }\n\n\n\n /// @return longest execution time\n\n inline double maxTime() const { return itsMaxTime; }\n\n\n\n /// @return shortest execution time\n\n inline double minTime() const { return itsMinTime; }\n\n \n\n /// @brief process another execution\n\n /// @details This method increments total time and count and\n\n /// adjusts min/max statistics as required. It is called after each run of the \n\n /// traced method.\n\n /// @param[in] time execution time for this call\n\n void add(const double time);\n\n\n\n /// @brief process another execution\n\n /// @details This method merges in an additional object of the same type\n\n /// @param[in] other another ProfileData object\n\n void add(const ProfileData &other);\n\n \n\nprivate:\n\n /// @brief number of calls\n\n long itsCount;\n\n /// @brief total execution time\n\n double itsTotalTime;\n\n /// @brief longest execution time\n\n /// @note it is undefined if itsCount == 0\n\n double itsMaxTime;\n\n /// @brief shortest execution time\n\n /// @note it is undefined if itsCount == 0\n\n double itsMinTime;\n","file_path":"Code/Base/askap/current/profile/ProfileData.h","rank":45,"score":186480.37898911524},{"content":" def set(self):\n\n self.__cond.acquire()\n\n try:\n\n self.__flag = True\n\n self.__message = \"\"\n\n self.__cond.notify_all()\n\n finally:\n","file_path":"Code/Base/py-askap/current/askap/event.py","rank":46,"score":185726.4210312904},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief Thread which manages a single data stream connection\n\n/// @details This class is initialised with two shared pointers, one to the socket \n\n/// corresponding to one input data stream and another corresponding to the buffer\n\n/// manager. Each instance (executed as a separate thread), obtains a buffer from \n\n/// the manager, fills it with new data and de-allocates it. The correlator thread\n\n/// is responsible for further processing when sufficient data are accumulated.\n\n/// This version of the class supports data stream in floats as opposed to 16 bit integers\n\n/// @ingroup swcorrelator\n\nstruct FloatStreamConnection {\n\n\n\n /// @brief constructor\n\n /// @details\n\n /// @param[in] socket shared pointer to the socket corresponding to this connection\n\n /// @param[in] bm shared pointer to the buffer manager\n\n FloatStreamConnection(const boost::shared_ptr<boost::asio::ip::tcp::socket> &socket,\n\n const boost::shared_ptr<BufferManager> &bm);\n\n \n\n /// @brief parallel thread\n\n /// @details This is the main entry point to the code executed in a parallel thread\n\n void operator()();\n\n \n\nprivate:\n\n /// @details shared pointer to the socket corresponding connection managed by this instance\n\n boost::shared_ptr<boost::asio::ip::tcp::socket> itsSocket;\n\n \n\n /// @brief buffer manager\n\n boost::shared_ptr<BufferManager> itsBufferManager;\n\n};\n\n\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/FloatStreamConnection.h","rank":47,"score":185149.07113780576},{"content":"from askap import logging\n\nlogger = logging.getLogger(__name__)\n","file_path":"Code/Components/Analysis/data/current/askap/analysis/data/__init__.py","rank":48,"score":184979.18263131875},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief An interface to generic buffer (for writing visibilities)\n\n/// @details Read-write iterator (see IDataIterator) uses the concept\n\n/// of buffers to store scratch data. This is an abstract interface\n\n/// to operations with such buffers.\n\n/// @ingroup dataaccess_hlp\n\nstruct IBufferManager : virtual public IHolder\n\n{\n\n /// @brief populate the cube with the data stored in the given buffer\n\n /// @details The method throws an exception if the requested buffer\n\n /// does not exist (prevents a shape mismatch)\n\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\n\n /// cube to fill with the complex visibility data\n\n /// @param[in] name a name of the buffer to work with\n\n /// @param[in] index a sequential index in the buffer\n\n virtual void readBuffer(casa::Cube<casa::Complex> &vis,\n\n const std::string &name,\n\n\t\t\t casa::uInt index) const = 0;\n\n \n\n /// @brief write the cube back to the given buffer\n\n /// @details This buffer is created on the first write operation\n\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\n\n /// cube to fill with the complex visibility data\n\n /// @param[in] name a name of the buffer to work with\n\n /// @param[in] index a sequential index in the buffer\n\n virtual void writeBuffer(const casa::Cube<casa::Complex> &vis,\n\n const std::string &name,\n\n\t\t\t casa::uInt index) const = 0;\n\n\n\n /// @brief check whether the particular buffer exists\n\n /// @param[in] name a name of the buffer to query\n\n /// @param[in] index a sequential index in the buffer\n\n /// @return true, if the buffer with the given name is present\n\n virtual bool bufferExists(const std::string &name,\n\n\t\t\t casa::uInt index) const = 0;\n\n};\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/IBufferManager.h","rank":49,"score":172645.5825159102},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief Helper class representing a scratch buffer\n\n/// @details Read-write access idiom is to work with so-called\n\n/// buffers, a chunk of visibility data sharing the same metadada\n\n/// with the main accessor (see IDataAccessor for more info).\n\n/// This is a helper class used between ITableDataIterator and\n\n/// ITableDataAccessor, which represents one scratch buffer used to\n\n/// cache disk information for each current iteration.\n\n/// @note an std::pair can be used instead, but this class gives\n\n/// a better looking code\n\n/// @ingroup dataaccess_hlp\n\nstruct ScratchBuffer {\n\n ScratchBuffer() : needsRead(true), needsFlush(false) {}\n\n \n\n /// visibility cube\n\n casa::Cube<casa::Complex> vis;\n\n /// True if the cube has to be initialized (reading is required)\n\n mutable bool needsRead;\n\n /// True if there was a write operation and the cube has to be\n\n /// flushed back to disk (or whatever is used for storage of buffers)\n\n mutable bool needsFlush;\n\n};\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/ScratchBuffer.h","rank":50,"score":172645.5825159102},{"content":"namespace askap {\n\n\n\nnamespace scimath {\n\n\n\n/// @brief helper class to monitor updates of parameters\n\n/// @details It is often needed to monitor a change of some parameters. This class \n\n/// has comparison operators defined (equal and not equal). Two instances are not\n\n/// equal if they correspond to a different version of tracked parameters. This class\n\n/// can be used in various caching-related implementations where some hierarchy exists\n\n/// (and so different parts of the code can be concerned about changes made at a different time) \n\n/// It essentially wraps over an integer number which is incremented every time a\n\n/// tracked parameter changes. \n\n/// @ingroup utils\n\nstruct ChangeMonitor {\n\n /// @brief constructor\n\n inline ChangeMonitor() : itsTag(0) {}\n\n \n\n /// @brief check whether two monitors are equal\n\n /// @details\n\n /// @param[in] in another change monitor object\n\n /// @return true if this class and in are equal\n\n inline bool operator==(const ChangeMonitor &in) const { return in.itsTag == itsTag; }\n\n \n\n /// @brief check whether two monitors are not equal\n\n /// @details\n\n /// @param[in] in another change monitor object\n\n /// @return true if this class and in are not equal\n\n inline bool operator!=(const ChangeMonitor &in) const { return in.itsTag != itsTag; }\n\n \n\n /// @brief notify that a change has been made\n\n /// @details This method is supposed to be called every time a corresponding \n\n /// parameter has been updated.\n\n inline void notifyOfChanges() { ++itsTag; ASKAPCHECK(itsTag!=0, \"Overflow detected!\");}\n\n \n\nprivate: \n\n /// @brief integer tag\n\n /// @details it is incremented every time there is a change in a tracked parameter \n\n unsigned long itsTag;\n","file_path":"Code/Base/scimath/current/utils/ChangeMonitor.h","rank":51,"score":172642.31525703857},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief class which can run the correlator\n\n/// @details This class is analogous to the main method of the stand alone correlator \n\n/// application. It can run the correlator, get monitoring data and stop when necessary.\n\n/// The primary goal for this interface is to run the software correlator from the epics\n\n/// CA server.\n\n/// @ingroup corrinterfaces\n\nstruct CorrRunner : private boost::noncopyable {\n\n \n\n /// @brief call back function type\n\n typedef void (*CallBackType)(const MonitoringData&, void* optionalData); \n\n \n\n /// @brief default constructor\n\n CorrRunner(); // doesn't throw\n\n\n\n /// @brief default destructor\n\n ~CorrRunner(); // doesn't throw\n\n \n\n /// @brief setup call back function\n\n /// @details If not NULL, the given function will be called every time the new data arrive.\n\n /// @param[in] callBackPtr pointer to the call back function\n\n /// @param[in[ optionalData optional pointer which is then passed to call back function\n\n /// @note the meaning of optionalData is user interpreted. It doesn't need to be a valid pointer\n\n void setCallBack(CallBackType callBackPtr = NULL, void* optionalData = NULL);\n\n \n\n /// @brief start the correlator\n\n /// @details This method starts all required threads and intialises the correlator using\n\n /// the parset.\n\n /// @param[in] parset parset with input parameters\n\n void start(const LOFAR::ParameterSet &parset); // doesn't throw\n\n \n\n /// @brief start the correlator\n\n /// @details This version reads the parset from the given file.\n\n /// @param[in] fname parset file name\n\n void start(const std::string &fname); // doesn't throw\n\n \n\n /// @brief stop the correlator\n\n /// @details This method can be called at any time to request a stop. The correlator\n\n /// finishes processing of the current cycle and gracefully shuts down closing the MS.\n\n /// @note This method must be called at the end to avoid corruption of the MS. \n\n static void stop(); // doesn't throw\n\n \n\n // check the status\n\n \n\n /// @brief check whether the correlator is running\n\n /// @details If it is not, the data in the data fields are not valid and all flags are set\n\n /// to true. Note, this method is thread safe and can be called asynchronously\n\n /// @return true if the correlator is running, false otherwise\n\n bool isRunning() const; // doesn't throw\n\n \n\n /// @brief obtain the status of error message\n\n /// @details When the correlator stops due to exception, the error message is available via\n\n /// this method. Note, this method is thread safe and can be called asynchronously\n\n std::string statusMsg() const; // doesn't throw\n\n \n\n /// @brief set status message\n\n /// @param[in] running true, if the correlator is running\n\n /// @param[in] msg status/error message\n\n void setStatus(const bool running, const std::string &msg = \"OK\"); // doesn't throw\n\n\n\nprivate: \n\n // current execution status\n\n\n\n /// @brief true if the correlator is running, false otherwise\n\n bool itsIsRunning;\n\n\n\n /// @brief error or status message\n\n std::string itsStatus;\n\n\n\n /// @brief mutex to protect status message and the running state\n\n mutable boost::mutex itsStatusMutex;\n\n \n\n /// @brief main correlator thread \n\n /// @details This class is executed in the main epics thread. The methods like start and stop\n\n /// return the control without waiting. The correlator is executed in a separate thread (where\n\n /// it spawns its own child threads)\n\n boost::thread itsCorrelatorThread; \n\n \n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/CorrRunner.h","rank":52,"score":172577.33487871944},{"content":"namespace askap {\n\n\n\nnamespace synthesis {\n\n\n\n/// @brief Interface to a basic illumination pattern\n\n/// @details This class is an abstract base (i.e. an interface) to \n\n/// an hierarchy of classes representing illumination patterns.\n\n/// It provides a method to obtain illumination pattern by populating a \n\n/// pre-defined grid supplied as a UVPattern object. \n\n/// @ingroup gridding\n\nstruct IBasicIllumination {\n\n \n\n /// @brief obtain illumination pattern\n\n /// @details This is the main method which populates the \n\n /// supplied uv-pattern with the values corresponding to the model\n\n /// represented by this object. It has to be overridden in the \n\n /// derived classes. An optional phase slope can be applied to\n\n /// simulate offset pointing.\n\n /// @param[in] freq frequency in Hz for which an illumination pattern is required\n\n /// @param[in] pattern a UVPattern object to fill\n\n /// @param[in] l angular offset in the u-direction (in radians)\n\n /// @param[in] m angular offset in the v-direction (in radians)\n\n /// @param[in] pa parallactic angle, or strictly speaking the angle between \n\n /// uv-coordinate system and the system where the pattern is defined\n\n virtual void getPattern(double freq, UVPattern &pattern, double l = 0., \n\n double m = 0., double pa = 0.) const = 0;\n\n \n\n /// @brief check whether the pattern is symmetric\n\n /// @details Some illumination patterns are trivial and it may be known a priori that\n\n /// the pattern does not depend on the parallactic angle. This method allows to check\n\n /// whether such trivial case exists. If true is returned, getPattern ignores pa\n\n /// parameter.\n\n /// @return true if the pattern is symmetric, false otherwise\n\n virtual bool isSymmetric() const = 0;\n\n \n\n /// @brief empty virtual destructor to keep the compiler happy\n\n virtual ~IBasicIllumination();\n\n};\n\n\n\n} // namespace synthesis\n\n\n","file_path":"Code/Components/Synthesis/synthesis/current/gridding/IBasicIllumination.h","rank":53,"score":170703.22094502096},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief A class to manage buffers stored in subtable\n\n/// @details Read-write iterator (see IDataIterator) uses the concept\n\n/// of buffers to store scratch data. This class stores buffers in the\n\n/// BUFFERS subtable \n\n/// @ingroup dataaccess_tab\n\nstruct TableBufferManager : virtual public IBufferManager,\n\n virtual protected TableHolder\n\n{\n\n /// construct the object and link it to the given buffers subtable\n\n /// @param[in] tab subtable to use\n\n TableBufferManager(const casa::Table &tab);\n\n \n\n /// @brief populate the cube with the data stored in the given buffer\n\n /// @details The method throws an exception if the requested buffer\n\n /// does not exist (prevents a shape mismatch)\n\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\n\n /// cube to fill with the complex visibility data\n\n /// @param[in] name a name of the buffer to work with\n\n /// @param[in] index a sequential index in the buffer\n\n virtual void readBuffer(casa::Cube<casa::Complex> &vis,\n\n const std::string &name,\n\n\t\t\t casa::uInt index) const;\n\n \n\n /// @brief write the cube back to the given buffer\n\n /// @details This buffer is created on the first write operation\n\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\n\n /// cube to fill with the complex visibility data\n\n /// @param[in] name a name of the buffer to work with\n\n /// @param[in] index a sequential index in the buffer\n\n virtual void writeBuffer(const casa::Cube<casa::Complex> &vis,\n\n const std::string &name,\n\n\t\t\t casa::uInt index) const;\n\n\n\n /// @brief check whether the particular buffer exists\n\n /// @param[in] name a name of the buffer to query\n\n /// @return true, if the buffer with the given name is present\n\n /// @param[in] index a sequential index in the buffer\n\n virtual bool bufferExists(const std::string &name,\n\n\t\t\t casa::uInt index) const;\n\nprotected:\n\n // templated methods to handle cubes of different types\n\n\n\n /// @brief populate the cube with the data stored in the given table cell\n\n /// @details The method throws an exception if the requested table cell\n\n /// does not exist\n\n /// @param[in] cube a reference to a cube of some type\n\n /// @param[in] name a name of the column to work with\n\n /// @param[in] index row number\n\n template<typename T>\n\n void readCube(casa::Cube<T> &cube, const std::string &name,\n\n\t\t\t casa::uInt index) const;\n\n \n\n /// @brief write the cube back to the table\n\n /// @details The table cell is populated with values on the first write \n\n /// operation\n\n /// @param[in] cube to take the data from \n\n /// @param[in] name a name of the column to work with\n\n /// @param[in] index row number\n\n template<typename T>\n\n void writeCube(const casa::Cube<T> &cube, const std::string &name,\n\n\t\t\t casa::uInt index) const;\n\n\n\n /// @brief check whether a particular table cell exists\n\n /// @param[in] name a name of the table column to query\n\n /// @param[in] index row number \n\n /// @return true, if the given cell exists and has an array\n\n /// @note template type defined the type of the data\n\n template<typename T>\n\n bool cellDefined(const std::string &name,\n\n\t\t\t casa::uInt index) const; \t\t\t \n\n};\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/TableBufferManager.h","rank":54,"score":170656.65728011035},{"content":"namespace askap {\n\n\n\n namespace synthesis {\n\n\n\n /// @brief Base class for monitor of Deconvolver\n\n /// @details All the monitoring is delegated to this class so that\n\n /// more control is possible.\n\n /// @ingroup Deconvolver\n\n template<class T> class DeconvolverMonitor {\n\n\n\n public:\n\n typedef boost::shared_ptr<DeconvolverMonitor<T> > ShPtr;\n\n\n\n DeconvolverMonitor();\n\n\n\n virtual ~DeconvolverMonitor() {};\n\n\n\n /// Monitor the current state\n\n virtual void monitor(const DeconvolverState<T>& ds);\n\n\n\n /// @brief configure basic parameters\n\n /// @details This method encapsulates extraction of basic parameters from the parset.\n\n /// @param[in] parset parset\n\n virtual void configure(const LOFAR::ParameterSet &parset);\n\n\n\n private:\n\n\n\n casa::Bool itsVerbose;\n\n casa::uInt itsLogEvery;\n\n };\n\n\n\n } // namespace synthesis\n\n\n","file_path":"Code/Components/Synthesis/synthesis/current/deconvolution/DeconvolverMonitor.h","rank":55,"score":170653.44498713134},{"content":"namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n// forward declaration to allow passing a pointer\n\nstruct CorrRunner;\n\n\n\n/// @brief parallel thread which runs the correlator\n\n/// @details This class is analogous to the main method of the stand alone correlator \n\n/// application. It can run the correlator, get monitoring data and stop when necessary.\n\n/// The primary goal for this interface is to run the software correlator from the epics\n\n/// CA server. We use parallel thread to get the asynchronous behavior. This class represents\n\n/// the child thread and CorrRunner the main thread.\n\n/// @ingroup corrinterfaces\n\nstruct CorrRunnerThread {\n\n \n\n /// @brief constructor\n\n /// @details\n\n /// @param[in] parent shared pointer to an instance of the main thread class\n\n /// @param[in] parset shared pointer to the parset\n\n CorrRunnerThread(const boost::shared_ptr<CorrRunner> &parent, const boost::shared_ptr<LOFAR::ParameterSet> &parset);\n\n \n\n /// @brief the entry point for the parallel thread\n\n void operator()();\n\n \n\n /// @brief stop the correlator\n\n /// @details This method can be called at any time to request a stop. The correlator\n\n /// finishes processing of the current cycle and gracefully shuts down closing the MS.\n\n /// @note This method must be called at the end to avoid corruption of the MS. \n\n static void stop(); // doesn't throw\n\n \n\nprivate:\n\n /// @brief shared pointer to an instance of the main thread class (to allow status update) \n\n boost::shared_ptr<CorrRunner> itsParent;\n\n \n\n /// @brief shared pointer to the parset with parameters\n\n boost::shared_ptr<LOFAR::ParameterSet> itsParset;\n\n};\n\n\n\n} // namespace swcorrelator\n\n\n","file_path":"Code/Components/swcorrelator/current/corrinterfaces/CorrRunnerThread.h","rank":56,"score":170589.55778956076},{"content":"namespace askap {\n\nnamespace cp {\n\nnamespace sms {\n\nnamespace datamodel {\n\n\n\n// Map C++ bool to an INT NOT NULL database type\n\n#pragma db value(bool) type(\"INT\")\n\n\n\n/// @brief Datamodel class for ancillary data source information.\n\n/// This is primarily intended to identify the source of seed data\n\n/// that did not come from ASKAP observations.\n\n\n\n// Do not edit the version of this file in the `datamodel` directory, as it is\n\n// a copy of the files in the `schema` directory.\n\n\n\n#pragma db object optimistic\n\nstruct DataSource {\n\n DataSource() {}\n\n\n\n // @brief Optimistic concurrency lock version\n\n // @units none\n\n #pragma db version\n\n version_type version;\n\n\n\n // @brief Primary key unique identifier\n\n // @units none\n\n #pragma db index\n\n #pragma db id auto\n\n id_type data_source_id;\n\n\n\n // Include the fields generated from the design spreadsheet\n\n #include \"DataSource.i\"\n\n};\n\n\n\n};\n\n};\n\n};\n","file_path":"Code/Components/Services/skymodel/current/schema/DataSource.h","rank":57,"score":170326.99383463658},{"content":"namespace askap {\n\nnamespace cp {\n\nnamespace sms {\n\nnamespace datamodel {\n\n\n\n// Map C++ bool to an INT NOT NULL database type\n\n#pragma db value(bool) type(\"INT\")\n\n\n\n/// @brief Datamodel class for ancillary data source information.\n\n/// This is primarily intended to identify the source of seed data\n\n/// that did not come from ASKAP observations.\n\n\n\n// Do not edit the version of this file in the `datamodel` directory, as it is\n\n// a copy of the files in the `schema` directory.\n\n\n\n#pragma db object optimistic\n\nstruct DataSource {\n\n DataSource() {}\n\n\n\n // @brief Optimistic concurrency lock version\n\n // @units none\n\n #pragma db version\n\n version_type version;\n\n\n\n // @brief Primary key unique identifier\n\n // @units none\n\n #pragma db index\n\n #pragma db id auto\n\n id_type data_source_id;\n\n\n\n // Include the fields generated from the design spreadsheet\n\n #include \"DataSource.i\"\n\n};\n\n\n\n};\n\n};\n\n};\n","file_path":"Code/Components/Services/skymodel/current/datamodel/DataSource.h","rank":58,"score":170326.99383463658},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief general exception class used in the data access layer\n\n/// @ingroup dataaccess_i\n\nstruct DataAccessError : public AskapError\n\n{\n\n /// constructor - pass the message to the base class\n\n ///\n\n /// @param message a string message explaining what happens\n\n ///\n\n explicit DataAccessError(const std::string& message);\n\n};\n\n\n\n/// @brief exception class indicating a logic error in the data access layer\n\nstruct DataAccessLogicError : public DataAccessError\n\n{\n\n /// constructor - pass the message to the base class\n\n ///\n\n /// @param message a string message explaining what happens\n\n ///\n\n explicit DataAccessLogicError(const std::string& message);\n\n};\n\n\n\n} // namespace askap\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/DataAccessError.h","rank":59,"score":170326.99383463658},{"content":"namespace askap {\n\nnamespace cp {\n\nnamespace sms {\n\n\n\n// Alias for the Ice type namespace\n\nnamespace ice_interfaces = askap::interfaces::skymodelservice;\n\n\n\n/// @brief Transfers data from the datamodel::ContinuumComponent class to the\n\n/// Ice DTO class. If present, polarisation data will be added to the optional\n\n/// polarisation member of ContinuumComponent.\n\n///\n\n/// @param[in] components Pointer to a vector of components for transfer.\n\n/// @throw AskapError Thrown if there are errors.\n\n/// @return askap::interfaces::skymodelservice::ComponentSeq\n\nice_interfaces::ComponentSeq marshallComponentsToDTO(\n\n boost::shared_ptr< std::vector<datamodel::ContinuumComponent> > components)\n\n{\n\n // This might be nice if I can define a conversion operator from\n\n // datamodel::ContinuumComponent to ice_interfaces::ContinuumComponent\n\n // But unfortunately, both source and destination classes are produced by\n\n // the corresponding systems (Ice slice compiler, ODB class generation),\n\n // so I have no easy way to define the conversion. Doing it manually isn't\n\n // too bad though due to the code generation.\n\n //return ice_interfaces::ComponentSeq(components->begin(), components->end());\n\n\n\n // preallocate space for more efficient allocation\n\n ice_interfaces::ComponentSeq dst(components->size());\n\n\n\n int i = 0;\n\n for (std::vector<datamodel::ContinuumComponent>::const_iterator it = components->begin();\n\n it != components->end();\n\n it++, i++) {\n\n\n\n // Copy the component data\n\n dst[i].componentId = it->component_id;\n\n dst[i].ra = it->ra;\n\n dst[i].dec = it->dec;\n\n dst[i].raErr = it->ra_err;\n\n dst[i].decErr = it->dec_err;\n\n dst[i].freq = it->freq;\n\n dst[i].fluxPeak = it->flux_peak;\n\n dst[i].fluxPeakErr = it->flux_peak_err;\n\n dst[i].fluxInt = it->flux_int;\n\n dst[i].fluxIntErr = it->flux_int_err;\n\n dst[i].spectralIndex = it->spectral_index;\n\n dst[i].spectralCurvature = it->spectral_curvature;\n\n\n\n // polarisation may not be present\n\n if (it->polarisation.get()) {\n\n const datamodel::Polarisation* src_pol = it->polarisation.get();\n\n\n\n // I need to profile how the performance of stack instance followed\n\n // by assignment to the vector compares to the resize and assign\n\n // members in place. On the surface, it is comparing a default ctor, field assignment, and copy ctor\n\n // to default ctor and field assignment. I hope to avoid the additional\n\n // copy when pushing the stack instance into the vectory.\n\n // Of course, the compiler could be doing all sorts of optimisations, so\n\n // sticking to the clearer code is probably best.\n\n ice_interfaces::ContinuumComponentPolarisation dst_pol;\n\n\n\n // Or:\n\n //dst[i].polarisation.resize(1);\n\n // And then:\n\n //dst[i].polarisation[0].polPeakFit = src_pol->pol_peak_fit;\n\n\n\n dst_pol.lambdaRefSq = src_pol->lambda_ref_sq;\n\n dst_pol.polPeakFit = src_pol->pol_peak_fit;\n\n dst_pol.polPeakFitDebias = src_pol->pol_peak_fit_debias;\n\n dst_pol.polPeakFitErr = src_pol->pol_peak_fit_err;\n\n dst_pol.polPeakFitSnr = src_pol->pol_peak_fit_snr;\n\n dst_pol.polPeakFitSnrErr = src_pol->pol_peak_fit_snr_err;\n\n dst_pol.fdPeakFit = src_pol->fd_peak_fit;\n\n dst_pol.fdPeakFitErr = src_pol->fd_peak_fit_err;\n\n\n\n // Assign our stack variable to the vector. Hopefully the additional\n\n // copy constructor gets optimised away.\n\n dst[i].polarisation.push_back(dst_pol);\n\n } // end of polarisation branch\n\n } // end of component loop\n\n\n\n\n\n return dst;\n\n}\n\n\n\n\n\n}\n\n}\n","file_path":"Code/Components/Services/skymodel/current/service/DataMarshalling.h","rank":60,"score":170326.99383463658},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief A stubbed implementation of the data accessor\n\n/// @ingroup dataaccess_hlp\n\nstruct DataAccessorStub : virtual public IFlagDataAccessor\n\n{\n\n /// Default version can fill with MIRANdA data\n\n DataAccessorStub(const bool fill=false);\n\n\t\n\n /// The number of rows in this chunk\n\n /// @return the number of rows in this chunk\n\n virtual casa::uInt nRow() const throw();\n\n\n\n // The following methods implement metadata access\n\n\t\t\n\n /// The number of spectral channels (equal for all rows)\n\n /// @return the number of spectral channels\n\n virtual casa::uInt nChannel() const throw();\n\n\n\n /// The number of polarization products (equal for all rows)\n\n /// @return the number of polarization products (can be 1,2 or 4)\n\n virtual casa::uInt nPol() const throw();\n\n\n\n\n\n /// First antenna IDs for all rows\n\n /// @return a vector with IDs of the first antenna corresponding\n\n /// to each visibility (one for each row)\n\n virtual const casa::Vector<casa::uInt>& antenna1() const;\n\n\n\n /// Second antenna IDs for all rows\n\n /// @return a vector with IDs of the second antenna corresponding\n\n /// to each visibility (one for each row)\n\n virtual const casa::Vector<casa::uInt>& antenna2() const;\n\n\t\n\n /// First feed IDs for all rows\n\n /// @return a vector with IDs of the first feed corresponding\n\n /// to each visibility (one for each row)\n\n virtual const casa::Vector<casa::uInt>& feed1() const;\n\n \n\n /// Second feed IDs for all rows\n\n /// @return a vector with IDs of the second feed corresponding\n\n /// to each visibility (one for each row)\n\n virtual const casa::Vector<casa::uInt>& feed2() const;\n\n \n\n /// Position angles of the first feed for all rows\n\n /// @return a vector with position angles (in radians) of the\n\n /// first feed corresponding to each visibility\n\n virtual const casa::Vector<casa::Float>& feed1PA() const;\n\n \n\n /// Position angles of the second feed for all rows\n\n /// @return a vector with position angles (in radians) of the\n\n /// second feed corresponding to each visibility\n\n virtual const casa::Vector<casa::Float>& feed2PA() const;\n\n \n\n /// Return pointing centre directions of the first antenna/feed\n\n /// @return a vector with direction measures (coordinate system\n\n /// is determined by the data accessor), one direction for each\n\n /// visibility/row\n\n virtual const casa::Vector<casa::MVDirection>& pointingDir1() const;\n\n \n\n /// Pointing centre directions of the second antenna/feed\n\n /// @return a vector with direction measures (coordinate system\n\n /// is determined by the data accessor), one direction for each\n\n /// visibility/row\n\n virtual const casa::Vector<casa::MVDirection>& pointingDir2() const;\n\n\n\n /// pointing direction for the centre of the first antenna \n\n /// @details The same as pointingDir1, if the feed offsets are zero\n\n /// @return a vector with direction measures (coordinate system\n\n /// is is set via IDataConverter), one direction for each\n\n /// visibility/row\n\n virtual const casa::Vector<casa::MVDirection>& dishPointing1() const;\n\n\n\n /// pointing direction for the centre of the first antenna \n\n /// @details The same as pointingDir2, if the feed offsets are zero\n\n /// @return a vector with direction measures (coordinate system\n\n /// is is set via IDataConverter), one direction for each\n\n /// visibility/row\n\n virtual const casa::Vector<casa::MVDirection>& dishPointing2() const;\n\n \n\n /// Visibilities (a cube is nRow x nChannel x nPol; each element is\n\n /// a complex visibility)\n\n /// @return a reference to nRow x nChannel x nPol cube, containing\n\n /// all visibility data\n\n /// TODO:\n\n /// a non-const version to be able to subtract the model\n\n virtual const casa::Cube<casa::Complex>& visibility() const;\n\n\n\n /// Read-write visibilities (a cube is nRow x nChannel x nPol; \n\n /// each element is a complex visibility)\n\n /// \n\n /// @return a reference to nRow x nChannel x nPol cube, containing\n\n /// all visibility data\n\n ///\n\n virtual casa::Cube<casa::Complex>& rwVisibility();\n\n\n\n\n\n /// Cube of flags corresponding to the output of visibility() \n\n /// @return a reference to nRow x nChannel x nPol cube with flag \n\n /// information. If True, the corresponding element is flagged.\n\n virtual const casa::Cube<casa::Bool>& flag() const;\n\n\n\n /// Non-const access to the cube of flags.\n\n /// @return a reference to nRow x nChannel x nPol cube with the flag\n\n /// information. If True, the corresponding element is flagged.\n\n virtual casa::Cube<casa::Bool>& rwFlag();\n\n\n\n \n\n /// Noise level required for a proper weighting\n\n /// @return a reference to nRow x nChannel x nPol cube with\n\n /// complex noise estimates\n\n virtual const casa::Cube<casa::Complex>& noise() const;\n\n\n\n /// UVW\n\n /// @return a reference to vector containing uvw-coordinates\n\n /// packed into a 3-D rigid vector\n\n virtual const casa::Vector<casa::RigidVector<casa::Double, 3> >&\n\n uvw() const;\n\n \n\n /// @brief uvw after rotation\n\n /// @details This method calls UVWMachine to rotate baseline coordinates \n\n /// for a new tangent point. Delays corresponding to this correction are\n\n /// returned by a separate method.\n\n /// @param[in] tangentPoint tangent point to rotate the coordinates to\n\n /// @return uvw after rotation to the new coordinate system for each row\n\n virtual const casa::Vector<casa::RigidVector<casa::Double, 3> >&\n\n\t rotatedUVW(const casa::MDirection &tangentPoint) const;\n\n\t \n\n /// @brief delay associated with uvw rotation\n\n /// @details This is a companion method to rotatedUVW. It returns delays corresponding\n\n /// to the baseline coordinate rotation. An additional delay corresponding to the \n\n /// translation in the tangent plane can also be applied using the image \n\n /// centre parameter. Set it to tangent point to apply no extra translation.\n\n /// @param[in] tangentPoint tangent point to rotate the coordinates to\n\n /// @param[in] imageCentre image centre (additional translation is done if imageCentre!=tangentPoint)\n\n /// @return delays corresponding to the uvw rotation for each row\n\n virtual const casa::Vector<casa::Double>& uvwRotationDelay(\n\n\t const casa::MDirection &tangentPoint, const casa::MDirection &imageCentre) const;\n\n \n\n \n\n /// Timestamp for each row\n\n /// @return a timestamp for this buffer (it is always the same\n\n /// for all rows. The timestamp is returned as \n\n /// Double w.r.t. the origin specified by the \n\n /// DataSource object and in that reference frame\n\n virtual casa::Double time() const;\n\n \n\n \n\n /// Frequency for each channel\n\n /// @return a reference to vector containing frequencies for each\n\n /// spectral channel (vector size is nChannel). Frequencies\n\n /// are given as Doubles, the frame/units are specified by\n\n /// the DataSource object\n\n virtual const casa::Vector<casa::Double>& frequency() const;\n\n\n\n /// Velocity for each channel\n\n /// @return a reference to vector containing velocities for each\n\n /// spectral channel (vector size is nChannel). Velocities\n\n /// are given as Doubles, the frame/units are specified by\n\n /// the DataSource object (via IDataConverter).\n\n virtual const casa::Vector<casa::Double>& velocity() const;\n\n\n\n /// @brief polarisation type for each product\n\n /// @return a reference to vector containing polarisation types for\n\n /// each product in the visibility cube (nPol() elements).\n\n /// @note All rows of the accessor have the same structure of the visibility\n\n /// cube, i.e. polarisation types returned by this method are valid for all rows.\n\n virtual const casa::Vector<casa::Stokes::StokesTypes>& stokes() const;\n\n \n\n//private: // to be able to change stubbed data directly, if necessary\n\n // cached results which are filled from an appropriate table\n\n // when necessary (they probably have to be moved to DataSource)\n\n /// cached antenna1\n\n mutable casa::Vector<casa::uInt> itsAntenna1;\n\n /// cached antenna2\n\n mutable casa::Vector<casa::uInt> itsAntenna2;\n\n /// cached feed1\n\n mutable casa::Vector<casa::uInt> itsFeed1;\n\n /// cached feed2\n\n mutable casa::Vector<casa::uInt> itsFeed2;\n\n /// cached feed1 position angle\n\n mutable casa::Vector<casa::Float> itsFeed1PA;\n\n /// cached feed2 position angle\n\n mutable casa::Vector<casa::Float> itsFeed2PA;\n\n /// cached pointing direction of the first antenna/feed\n\n mutable casa::Vector<casa::MVDirection> itsPointingDir1;\n\n /// cached pointing direction of the second antenna/feed\n\n mutable casa::Vector<casa::MVDirection> itsPointingDir2;\n\n /// cached pointing direction of the centre of the first antenna\n\n mutable casa::Vector<casa::MVDirection> itsDishPointing1;\n\n /// cached pointing direction of the centre of the second antenna\n\n mutable casa::Vector<casa::MVDirection> itsDishPointing2;\n\n /// cached visibility\n\n mutable casa::Cube<casa::Complex> itsVisibility;\n\n /// cached flag\n\n mutable casa::Cube<casa::Bool> itsFlag;\n\n /// cached uvw\n\n mutable casa::Vector<casa::RigidVector<casa::Double, 3> > itsUVW;\n\n /// cached noise\n\n mutable casa::Cube<casa::Complex> itsNoise;\n\n /// cached time\n\n mutable casa::Double itsTime;\n\n /// cached frequency\n\n mutable casa::Vector<casa::Double> itsFrequency;\n\n /// cached velocity\n\n mutable casa::Vector<casa::Double> itsVelocity;\n\n /// cached uvw-rotation delay \n\n mutable casa::Vector<casa::Double> itsUVWRotationDelay;\n\n /// cached polarisation types\n\n mutable casa::Vector<casa::Stokes::StokesTypes> itsStokes;\n\n};\n\n\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/DataAccessorStub.h","rank":61,"score":170326.99383463658},{"content":"class MonitoringBuffer(object):\n\n def __init__(self):\n\n \"\"\"Thread safe buffer of monitoring points\"\"\"\n\n self._mutex = ReadWriteMutex()\n\n self._buffer = {}\n\n\n\n def add_points(self, points, timetag=None):\n\n \"\"\"Add a :class:`dict` of point(s) to the buffer. This is to support points\n\n without metadata (old-style monitoring points)\"\"\"\n\n try:\n\n timestamp = timetag or bat_now()\n\n self._mutex.acquire_write_lock()\n\n for k, v in points.items():\n\n self._buffer[k] = {'value': v, 'name': k,\n\n 'timestamp': timestamp}\n\n finally:\n\n self._mutex.release_write_lock()\n\n\n\n def add_full_points(self, points):\n\n \"\"\" points is a list of dict, each is a monitor point \"\"\"\n\n try:\n\n self._mutex.acquire_write_lock()\n\n for point in points:\n\n name = point['name']\n\n mon_point = {'name': name,\n\n 'timestamp': point.get('timestamp', bat_now()),\n\n 'unit': point.get('unit', ''),\n\n 'status': point.get('status', 'OK'),\n\n 'value': point['value']}\n\n self._buffer[name] = mon_point\n\n finally:\n\n self._mutex.release_write_lock()\n\n\n\n def add(self, name, value, timestamp=None, status=\"OK\", unit=\"\"):\n\n \"\"\"Add a monitor point with metadata\"\"\"\n\n try:\n\n timestamp = timestamp or bat_now()\n\n point = {'name': name, 'timestamp': timestamp,\n\n 'unit': unit,\n\n 'status': status,\n\n 'value': value}\n\n self._mutex.acquire_write_lock()\n\n self._buffer[name] = point\n\n finally:\n\n self._mutex.release_write_lock()\n\n\n\n def remove(self, keys):\n\n points = keys\n\n if isinstance(keys, basestring):\n\n points = (keys,)\n\n try:\n\n self._mutex.acquire_write_lock()\n\n for k in points:\n\n if k in self._buffer:\n\n self._buffer.pop(k)\n\n finally:\n\n self._mutex.release_write_lock()\n\n\n\n def clear(self):\n\n \"\"\"\n\n Clear the buffer\n\n \"\"\"\n\n try:\n\n self._mutex.acquire_write_lock()\n\n self._buffer.clear()\n\n finally:\n\n self._mutex.release_write_lock()\n\n\n\n def get(self, keys):\n\n \"\"\"Get given point names `keys` from buffer\n\n\n\n :param list keys: a list of point names.\n\n\n\n \"\"\"\n\n if isinstance(keys, basestring):\n\n keys = (keys,)\n\n try:\n\n self._mutex.acquire_read_lock()\n\n return [self._buffer[k] for k in keys if k in self._buffer]\n\n finally:\n","file_path":"Code/Base/py-iceutils/current/askap/iceutils/monitoringprovider.py","rank":62,"score":169032.64104016824},{"content":"namespace askap {\n\n\n\nnamespace synthesis {\n\n\n\n/// @brief A measurement equation, which does nothing.\n\n/// @details The current calibration class requires a perfect measurement\n\n/// equation. This class has been written to be able to use the same code \n\n/// for both applying a calibration and solving for parameters. It is \n\n/// a void measurement equation in the sense that it does nothing to the \n\n/// data or normal equations given to it.\n\n/// @ingroup measurementequation\n\nstruct VoidMeasurementEquation : public IMeasurementEquation\n\n{\n\n /// @brief Predict model visibilities for one accessor (chunk).\n\n /// @details This prediction is done for single chunk of data only. \n\n /// It seems that all measurement equations should work with accessors \n\n /// rather than iterators (i.e. the iteration over chunks should be \n\n /// moved to the higher level, outside this class). \n\n /// @param[in] chunk a read-write accessor to work with\n\n virtual void predict(accessors::IDataAccessor &chunk) const;\n\n\n\n /// @brief Calculate the normal equation for one accessor (chunk).\n\n /// @details This calculation is done for a single chunk of\n\n /// data only (one iteration).It seems that all measurement\n\n /// equations should work with accessors rather than iterators\n\n /// (i.e. the iteration over chunks should be moved to the higher\n\n /// level, outside this class). \n\n /// @param[in] chunk a read-write accessor to work with\n\n /// @param[in] ne Normal equations\n\n virtual void calcEquations(const accessors::IConstDataAccessor &chunk,\n\n askap::scimath::INormalEquations& ne) const;\n\n};\n\n\n\n} // namespace synthesis\n\n\n","file_path":"Code/Components/Synthesis/synthesis/current/measurementequation/VoidMeasurementEquation.h","rank":63,"score":168826.5319338146},{"content":"namespace askap {\n\n\n\nnamespace synthesis {\n\n\n\n/// @brief Basic composite illumination pattern\n\n/// @details This class is implements an basic composite illumination pattern corresponding\n\n/// to a given weights and offsets of physical feeds. It can be used for simulation and/or\n\n/// imaging with a synthetic beam. As an implementation of IBasicIllumination interface, \n\n/// this class provides a method to obtain illumination pattern by populating a pre-defined \n\n/// grid supplied as a UVPattern object. \n\n/// @note It looks like handling of illumination patterns\n\n/// inside gridders has to be generalised (i.e. main method should receive a full accessor\n\n/// with all the metadata instead of just the pointing offsets, frequency, etc). Such \n\n/// transition would definitely require an interface change in this class.\n\n/// @ingroup gridding\n\nstruct BasicCompositeIllumination : public IBasicIllumination {\n\n /// @brief construct the pattern using given weights and offsets\n\n /// @param[in] pattern single-feed illumination pattern (assumed the same for all feeds)\n\n /// @param[in] feedOffsets offsets of physical feeds in radians\n\n /// @param[in] weights complex weights for each feed\n\n /// @note The size of two vectors should be the same\n\n BasicCompositeIllumination(const boost::shared_ptr<IBasicIllumination> &pattern,\n\n const casa::Vector<casa::RigidVector<casa::Double, 2> > &feedOffsets,\n\n const casa::Vector<casa::Complex> &weights); \n\n \n\n /// @brief obtain illumination pattern\n\n /// @details This is the main method which populates the \n\n /// supplied uv-pattern with the values corresponding to the model\n\n /// represented by this object. It has to be overridden in the \n\n /// derived classes. An optional phase slope can be applied to\n\n /// simulate offset pointing.\n\n /// @param[in] freq frequency in Hz for which an illumination pattern is required\n\n /// @param[in] pattern a UVPattern object to fill\n\n /// @param[in] l angular offset in the u-direction (in radians)\n\n /// @param[in] m angular offset in the v-direction (in radians)\n\n /// @param[in] pa parallactic angle (in radians), or strictly speaking the angle between \n\n /// uv-coordinate system and the system where the pattern is defined\n\n virtual void getPattern(double freq, UVPattern &pattern, double l = 0., \n\n double m = 0., double pa = 0.) const;\n\n \n\n /// @brief check whether the pattern is symmetric\n\n /// @details Some illumination patterns are trivial and it may be known a priori that\n\n /// the pattern does not depend on the parallactic angle. This method allows to check\n\n /// whether such trivial case exists. If true is returned, getPattern ignores pa\n\n /// parameter.\n\n /// @return true if the pattern is symmetric, false otherwise\n\n virtual bool isSymmetric() const;\n\n \n\nprivate:\n\n /// @brief single-feed illumination pattern (assumed the same for all feeds)\n\n boost::shared_ptr<IBasicIllumination> itsPattern;\n\n \n\n /// @brief offsets of physical feeds in radians\n\n casa::Vector<casa::RigidVector<casa::Double, 2> > itsFeedOffsets;\n\n \n\n /// @brief complex weights for each physical feed\n\n casa::Vector<casa::Complex> itsWeights;\n\n \n\n /// @brief flag showing that this pattern is symmetric\n\n /// @details Whether or not it is the case depends on the assigned offsets\n\n /// (i.e. any non-zero offset means automatically that this pattern is asymmetric,\n\n /// it is checked in the constructor)\n\n bool itsSymmetricFlag;\n\n};\n\n\n\n} // namespace synthesis\n\n\n","file_path":"Code/Components/Synthesis/synthesis/current/gridding/BasicCompositeIllumination.h","rank":64,"score":168779.3384754149},{"content":"namespace askap {\n\nnamespace accessors {\n\n\n\n/// @brief An interface for accessing calibration solutions for reading.\n\n/// @details This interface is used to access calibration parameters\n\n/// read-only. A writable version of the interface is derived from this\n\n/// class. Various implementations are possible, i.e. parset-based, \n\n/// table-based and working via database ice service.\n\n/// @ingroup calibaccess\n\nstruct ICalSolutionConstAccessor {\n\n /// @brief virtual destructor to keep the compiler happy\n\n virtual ~ICalSolutionConstAccessor();\n\n \n\n // virtual methods which need to be overridden in concrete \n\n // implementation classes\n\n \n\n /// @brief obtain gains (J-Jones)\n\n /// @details This method retrieves parallel-hand gains for both \n\n /// polarisations (corresponding to XX and YY). If no gains are defined\n\n /// for a particular index, gains of 1. with invalid flags set are\n\n /// returned.\n\n /// @param[in] index ant/beam index \n\n /// @return JonesJTerm object with gains and validity flags\n\n virtual JonesJTerm gain(const JonesIndex &index) const = 0;\n\n \n\n /// @brief obtain leakage (D-Jones)\n\n /// @details This method retrieves cross-hand elements of the \n\n /// Jones matrix (polarisation leakages). There are two values\n\n /// (corresponding to XY and YX) returned (as members of JonesDTerm \n\n /// class). If no leakages are defined for a particular index,\n\n /// zero leakages are returned with invalid flags set. \n\n /// @param[in] index ant/beam index\n\n /// @return JonesDTerm object with leakages and validity flags\n\n virtual JonesDTerm leakage(const JonesIndex &index) const = 0;\n\n \n\n /// @brief obtain bandpass (frequency dependent J-Jones)\n\n /// @details This method retrieves parallel-hand spectral\n\n /// channel-dependent gain (also known as bandpass) for a\n\n /// given channel and antenna/beam. The actual implementation\n\n /// does not necessarily store these channel-dependent gains\n\n /// in an array. It could also implement interpolation or \n\n /// sample a polynomial fit at the given channel (and \n\n /// parameters of the polynomial could be in the database). If\n\n /// no bandpass is defined (at all or for this particular channel),\n\n /// gains of 1.0 are returned (with invalid flag is set).\n\n /// @param[in] index ant/beam index\n\n /// @param[in] chan spectral channel of interest\n\n /// @return JonesJTerm object with gains and validity flags\n\n virtual JonesJTerm bandpass(const JonesIndex &index, const casa::uInt chan) const = 0;\n\n \n\n // helper methods to simplify access to the calibration parameters\n\n \n\n /// @brief obtain full 2x2 Jones Matrix taking all effects into account\n\n /// @details This method returns resulting 2x2 matrix taking gain, leakage and\n\n /// bandpass effects (for a given channel) into account. Invalid gains (and bandpass\n\n /// values) are replaced by 1., invalid leakages are replaced by zeros. This method\n\n /// calls gain, bandpass and leakage virtual methods\n\n /// @param[in] index ant/beam index\n\n /// @param[in] chan spectral channel of interest\n\n /// @return 2x2 Jones matrix\n\n /// @note The relation between leakage terms and Jones matrices matches \n\n /// the definition of Hamaker, Bregman & Sault. See their equation \n\n /// (14) for details. Our parameters d12 (corresponding to Stokes:XY) and\n\n /// d21 (corresponding to Stokes::YX) correspond to d_{Ap} and d_{Aq} from\n\n /// Hamaker, Bregman & Sault, respectively. It is assumed that the gain errors\n\n /// are applied after leakages (i.e. R=GD). \n\n casa::SquareMatrix<casa::Complex, 2> jones(const JonesIndex &index, const casa::uInt chan) const;\n\n \n\n /// @brief obtain full 2x2 Jones Matrix taking all effects into account\n\n /// @details This version of the method accepts antenna and beam indices explicitly and\n\n /// does extra checks before calling the main method expressed via JonesIndex.\n\n /// @param[in] ant antenna index\n\n /// @param[in] beam beam index\n\n /// @param[in] chan spectral channel of interest\n\n /// @return 2x2 Jones matrix\n\n casa::SquareMatrix<casa::Complex, 2> jones(const casa::uInt ant, const casa::uInt beam, const casa::uInt chan) const;\n\n \n\n /// @brief obtain validity flag for the full 2x2 Jones Matrix\n\n /// @details This method combines all validity flags for parameters used to compose Jones\n\n /// matrix and returns true if all elements are valid and false if at least one constituent\n\n /// is not valid\n\n /// @param[in] index ant/beam index\n\n /// @param[in] chan spectral channel of interest\n\n /// @return true, if the matrix returned by jones(...) method called with the same parameters is\n\n /// valid, false otherwise\n\n bool jonesValid(const JonesIndex &index, const casa::uInt chan) const;\n\n \n\n /// @brief obtain validity flag for the full 2x2 Jones Matrix\n\n /// @details This version of the method accepts antenna and beam indices explicitly and\n\n /// does extra checks before calling the main method expressed via JonesIndex.\n\n /// @param[in] ant antenna index\n\n /// @param[in] beam beam index\n\n /// @param[in] chan spectral channel of interest\n\n /// @return true, if the matrix returned by jones(...) method called with the same parameters is\n\n /// valid, false otherwise\n\n bool jonesValid(const casa::uInt ant, const casa::uInt beam, const casa::uInt chan) const;\n\n\n\n /// @brief shared pointer definition\n\n typedef boost::shared_ptr<ICalSolutionConstAccessor> ShPtr;\n\n};\n\n\n\n} // namespace accessors\n","file_path":"Code/Base/accessors/current/calibaccess/ICalSolutionConstAccessor.h","rank":65,"score":168742.31176564324},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief A high-level interface to access calibration solutions\n\n/// @details This interface hides the database look up of the appropriate\n\n/// calibration solution. It manages solution IDs and provides access\n\n/// to the actual solution via ICalSolutionConstAccessor. A single\n\n/// solution ID refers to some gain, leakage and bandpass, although \n\n/// individual solutions may be obtained at different times. The read\n\n/// operation always delivers the \"active\" (i.e. most recent) solution \n\n/// at the given time.\n\n/// @ingroup calibaccess\n\nstruct ICalSolutionConstSource {\n\n\n\n /// @brief virtual destructor to keep the compiler happy\n\n virtual ~ICalSolutionConstSource();\n\n \n\n // virtual methods to be overridden in implementations\n\n \n\n /// @brief obtain ID for the most recent solution\n\n /// @return ID for the most recent solution\n\n virtual long mostRecentSolution() const = 0;\n\n \n\n /// @brief obtain solution ID for a given time\n\n /// @details This method looks for a solution valid at the given time\n\n /// and returns its ID. It is equivalent to mostRecentSolution() if\n\n /// called with a time sufficiently into the future.\n\n /// @param[in] time time stamp in seconds since MJD of 0.\n\n /// @return solution ID\n\n virtual long solutionID(const double time) const = 0;\n\n \n\n /// @brief obtain read-only accessor for a given solution ID\n\n /// @details This method returns a shared pointer to the solution accessor, which\n\n /// can be used to read the parameters. If a solution with the given ID doesn't \n\n /// exist, an exception is thrown. Existing solutions with undefined parameters \n\n /// are managed via validity flags of gains, leakages and bandpasses\n\n /// @param[in] id solution ID to read\n\n /// @return shared pointer to an accessor object\n\n virtual boost::shared_ptr<ICalSolutionConstAccessor> roSolution(const long id) const = 0;\n\n \n\n /// @brief shared pointer definition\n\n typedef boost::shared_ptr<ICalSolutionConstSource> ShPtr;\n\n};\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/calibaccess/ICalSolutionConstSource.h","rank":66,"score":168742.31176564324},{"content":"class MonitorData(dict):\n\n \"\"\" :class:`dict` class adding :meth:`send` to send the dictionary\n\n to :class:`Monitoring` singleton.\n\n \"\"\"\n\n def __init__(self, *args, **kwargs):\n\n dict.__init__(self, *args, **kwargs)\n\n\n\n def publish(self):\n\n mon = get_monitor()\n","file_path":"Code/Base/py-iceutils/current/askap/iceutils/monitorpublisher.py","rank":67,"score":168720.63669109676},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief An interface to DATA_DESCRIPTION subtable\n\n/// @details A class derived from this interface provides access to\n\n/// the content of the DATA_DESCRIPTION table (which connects data\n\n/// description id with spectral window id and polarization id\n\n/// @ingroup dataaccess_tab\n\nstruct ITableDataDescHolder : virtual public IHolder {\n\n\n\n /// obtain spectral window ID via data description ID\n\n /// @param dataDescriptionID an index into data description table for\n\n /// which to return an associated spectral window ID\n\n /// @return spectral window id for a given dataDescriptionID\n\n /// @note return type has sign. User is responsible for interpreting\n\n /// the negative values\n\n virtual int getSpectralWindowID(size_t dataDescriptionID) const = 0;\n\n\n\n /// obtain polaraziation ID via data description ID\n\n /// @param dataDescriptionID an index into data description table for\n\n /// which to return an associated polarization ID\n\n /// @return polarization id for a given dataDescriptionID\n\n /// @note return type has sign. User is responsible for interpreting\n\n /// the negative values\n\n virtual int getPolarizationID(size_t dataDescriptionID) const = 0;\n\n\n\n /// obtain all data description IDs which correspond to the given\n\n /// spectral window ID (requires for selection on the spectral window)\n\n /// @param spWindowID a spectral window ID to search for\n\n /// @return a vector containing data description IDs\n\n /// @note a signed type is used for spWindowID. User is responsible for\n\n /// interpreting the negative values\n\n virtual std::vector<size_t> getDescIDsForSpWinID(int spWindowID) const = 0; \n\n};\n\n\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/ITableDataDescHolder.h","rank":68,"score":168409.33600677756},{"content":"/// This class implements the \"MonitoringProvider\" Ice interface.\n\n/// Remote clients invoke methods on this class to fetch monitoring data.\n\nclass MonitoringProviderImpl : public askap::interfaces::monitoring::MonitoringProvider {\n\n public:\n\n /// @brief Constructor.\n\n MonitoringProviderImpl(DataManager& datasource);\n\n\n\n /// @brief Destructor.\n\n virtual ~MonitoringProviderImpl();\n\n\n\n /// The caller provides zero or more point names and the\n\n /// return value will contain at most the same number of\n\n /// monitoring points in the returned sequence.\n\n ///\n\n /// Where a point name is not available it will simply not\n\n /// be included in the result sequence.\n\n ///\n\n /// If an empty sequence is passed, the returned sequence will\n\n /// be empty.\n\n ///\n\n /// @param[in] pointnames a sequence of point names for\n\n /// which data will be fetched\n","file_path":"Code/Components/Services/ingest/current/monitoring/MonitoringProviderImpl.h","rank":69,"score":166914.7332916763},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief Parset file-based implementation of the calibration solution source\n\n/// @details This implementation is to be used with pre-existing code writing/reading\n\n/// the parset directly and with a number of tests. It is just to convert the legacy code.\n\n/// There is only one implementation of this class which is used for both reading and writing.\n\n/// Main functionality is implemented in the corresponding ParsetCalSolutionAccessor class.\n\n/// This class just creates an instance of the accessor and manages it.\n\n/// @ingroup calibaccess\n\nstruct ParsetCalSolutionConstSource : public CalSolutionConstSourceStub {\n\n /// @brief constructor\n\n /// @details Creates solution source object for a given parset file\n\n /// (whether it is for writing or reading depends on the actual methods\n\n /// used).\n\n /// @param[in] parset parset file name\n\n explicit ParsetCalSolutionConstSource(const std::string &parset);\n\n \n\n /// @brief shared pointer definition\n\n typedef boost::shared_ptr<ParsetCalSolutionConstSource> ShPtr;\n\n\n\n};\n\n\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/calibaccess/ParsetCalSolutionConstSource.h","rank":70,"score":166881.6567126775},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\nstruct DataAccessTestImpl {\n\n /// demonstration of flagging from the given iterator position until the\n\n /// end of the block pointed by the iterator\n\n static void flaggingRoutine(const IDataSharedIter &di);\n\n\n\n /// demonstration of the read-only access\n\n static void readOnlyRoutine(const IConstDataSharedIter &cdi);\n\n\n\n /// obtaining iterators, invoke other methods\n\n static void doTheJob(const boost::shared_ptr<IDataSource> &ds);\n\n};\n\n\n\n} // namespace accessors\n","file_path":"Code/Base/accessors/current/tests/dataaccess/DataAccessTestImpl.h","rank":71,"score":166554.10034278792},{"content":"namespace askap {\n\n\n\nnamespace accessors {\n\n\n\n/// @brief Implementation of ITableDataDescHolder holding everything in memory\n\n/// @details This file contains a class implementing the ITableDataDescHolder\n\n/// interface by reading the appropriate subtable into memory in the constructor.\n\n/// @ingroup dataaccess_tab\n\nstruct MemTableDataDescHolder : public ITableDataDescHolder {\n\n\n\n /// read all required information from the DATA_DESCRIPTION subtable\n\n /// @param ms an input measurement set (a table which has a\n\n /// DATA_DESCRIPTION subtable defined)\n\n explicit MemTableDataDescHolder(const casa::Table &ms);\n\n \n\n /// obtain spectral window ID via data description ID\n\n /// @param dataDescriptionID an index into data description table for\n\n /// which to return an associated spectral window ID\n\n /// @return spectral window id for a given dataDescriptionID\n\n /// @note return type has sign. User is responsible for interpreting\n\n /// the negative values\n\n virtual int getSpectralWindowID(size_t dataDescriptionID) const;\n\n\n\n /// obtain polaraziation ID via data description ID\n\n /// @param dataDescriptionID an index into data description table for\n\n /// which to return an associated polarization ID\n\n /// @return polarization id for a given dataDescriptionID\n\n /// @note return type has sign. User is responsible for interpreting\n\n /// the negative values\n\n virtual int getPolarizationID(size_t dataDescriptionID) const;\n\n\n\n /// obtain all data description IDs which correspond to the given\n\n /// spectral window ID (requires for selection on the spectral window)\n\n /// @param spWindowID a spectral window ID to search for\n\n /// @return a vector containing data description IDs\n\n /// @note a signed type is used for spWindowID. User is responsible for\n\n /// interpreting the negative values\n\n virtual std::vector<size_t> getDescIDsForSpWinID(int spWindowID) const;\n\nprivate:\n\n std::vector<std::pair<int, int> > itsDataDescription;\n\n};\n\n\n\n\n\n} // namespace accessors\n\n\n","file_path":"Code/Base/accessors/current/dataaccess/MemTableDataDescHolder.h","rank":72,"score":166554.10034278792},{"content":"# See http://peak.telecommunity.com/DevCenter/setuptools#namespace-packages\n\ntry:\n\n __import__('pkg_resources').declare_namespace(__name__)\n\nexcept ImportError:\n\n from pkgutil import extend_path\n\n __path__ = extend_path(__path__, __name__)\n","file_path":"Code/Components/Analysis/data/current/askap/__init__.py","rank":73,"score":166375.35406146443},{"content":" private long lastSBID = -10;\n","file_path":"Code/Components/Services/manager/current/src/askap/cp/manager/ingest/IngestMonitorThread.java","rank":74,"score":165699.14026493052},{"content":"namespace askap {\n\n\n\nnamespace synthesis {\n\n\n\n/// @brief Calibration effect: antenna gains without cross-pol, one value for all beams\n\n/// @details This is a simple effect which can be used in conjunction\n\n/// with the CalibrationME template (as its template argument)\n\n/// @ingroup measurementequation\n\nstruct NoXPolBeamIndependentGain : public ParameterizedMEComponent<false> {\n\n \n\n /// @brief constructor, store reference to paramters\n\n /// @param[in] par shared pointer to parameters\n\n inline explicit NoXPolBeamIndependentGain(const scimath::Params::ShPtr &par) : \n\n ParameterizedMEComponent<false>(par) {}\n\n \n\n /// @brief main method returning Mueller matrix and derivatives\n\n /// @details This method has to be overloaded (in the template sense) for\n\n /// all classes representing various calibration effects. CalibrationME\n\n /// template will call it when necessary. It returns \n\n /// @param[in] chunk accessor to work with\n\n /// @param[in] row row of the chunk to work with\n\n /// @return ComplexDiffMatrix filled with Mueller matrix corresponding to\n\n /// this effect\n\n inline scimath::ComplexDiffMatrix get(const accessors::IConstDataAccessor &chunk, \n\n casa::uInt row) const; \n\n};\n\n\n\n} // namespace synthesis\n\n\n","file_path":"Code/Components/Synthesis/synthesis/current/measurementequation/NoXPolBeamIndependentGain.h","rank":75,"score":165117.78719468563},{"content":" private void updateDataService(long sbid, List<MonitorPoint> pointValues) {\n\n\n\n // don't need to update Dataservice if we have already. Assume the obs detail\n\n // does not change during observation.\n\n if (this.lastSBID == sbid)\n\n return;\n\n\n\n MonitorPoint startFreqPoint = null;\n\n MonitorPoint nChanPoint = null;\n\n MonitorPoint chanWidthPoint = null;\n\n\n\n for (MonitorPoint point : pointValues) {\n\n\n\n if (point.name.equals(\"cp.ingest.obs.StartFreq\"))\n\n startFreqPoint = point;\n\n else if (point.name.equals(\"cp.ingest.obs.nChan\"))\n\n nChanPoint = point;\n\n else if (point.name.equals(\"cp.ingest.obs.ChanWidth\"))\n\n chanWidthPoint = point;\n\n }\n\n\n\n /*\n\n * write observation details as a json string:\n\n *\n\n * {\n\n * \"nChan\": {\"value\": 10368},\n\n * \"ChanWidth\": {\"value\": 1344.49, \"unit\": \"MHz\"},\n\n * \"StartFreq\": {\"value\": 1344.49, \"unit\": \"MHz\"},\n\n * \"CentreFreq\": {\"value\": 2344.49, \"unit\": \"MHz\"},\n\n * \"BandWidth\": {\"value\": 192.00, \"unit\": \"MHz\"}\n\n * }\n\n *\n\n */\n\n if (startFreqPoint != null && nChanPoint != null && chanWidthPoint != null) {\n\n\n\n double startFreq = ((TypedValueDouble) startFreqPoint.value).value;\n\n double chanWidth = ((TypedValueDouble) chanWidthPoint.value).value;\n\n long nChan = ((TypedValueLong) nChanPoint.value).value;\n\n\n\n double bandWidth = 0;\n\n if (chanWidthPoint.unit.equalsIgnoreCase(\"khz\"))\n\n bandWidth = chanWidth * nChan / 1000;\n\n else // assume mhz\n\n bandWidth = chanWidth * nChan;\n\n\n\n double centreFreq = startFreq + bandWidth / 2;\n\n\n\n JsonObject obsInfo = new JsonObject();\n\n\n\n JsonObject obj = new JsonObject();\n\n obj.addProperty(\"value\", nChan);\n\n obsInfo.add(\"nChan\", obj);\n\n\n\n obj = new JsonObject();\n\n obj.addProperty(\"value\", chanWidth);\n\n obj.addProperty(\"unit\", chanWidthPoint.unit);\n\n obsInfo.add(\"ChanWidth\", obj);\n\n\n\n obj = new JsonObject();\n\n obj.addProperty(\"value\", startFreq);\n\n obj.addProperty(\"unit\", startFreqPoint.unit);\n\n obsInfo.add(\"StartFreq\", obj);\n\n\n\n obj = new JsonObject();\n\n obj.addProperty(\"value\", centreFreq);\n\n obj.addProperty(\"unit\", startFreqPoint.unit);\n\n obsInfo.add(\"CentreFreq\", obj);\n\n\n\n obj = new JsonObject();\n\n obj.addProperty(\"value\", bandWidth);\n\n obj.addProperty(\"unit\", startFreqPoint.unit);\n\n obsInfo.add(\"BandWidth\", obj);\n\n\n\n\n\n Map<String, String> obsVar = new HashMap<String, String>();\n\n obsVar.put(\"obs.info\", theirGson.toJson(obsInfo));\n\n\n\n try {\n\n ClientServiceFactory.getDataServiceClient().setObsVariables(sbid, obsVar);\n\n this.lastSBID = sbid;\n\n } catch (Exception e) {\n\n logger.error(\"Could not update Dataservice with observation details\", e);\n\n }\n\n }\n","file_path":"Code/Components/Services/manager/current/src/askap/cp/manager/ingest/IngestMonitorThread.java","rank":76,"score":163296.2993353305},{"content":" public void setObsVariables(long sbid, Map<String, String> obsVars)\n","file_path":"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/IDataServiceClient.java","rank":77,"score":163226.96174812582},{"content":"# See http://peak.telecommunity.com/DevCenter/setuptools#namespace-packages\n\ntry:\n\n __import__('pkg_resources').declare_namespace(__name__)\n\nexcept ImportError:\n\n from pkgutil import extend_path\n\n __path__ = extend_path(__path__, __name__)\n","file_path":"Code/Components/Analysis/data/current/askap/analysis/__init__.py","rank":78,"score":161833.5372301237},{"content":" @Override\n\n public void setObsVariables(long sbid, Map<String, String> obsVars) throws NoSuchSchedulingBlockException, ParameterException {\n\n // only need to check the obsVar string is correct\n\n String obsVar = obsVars.get(\"obs.info\");\n\n FuncTestReporterClient.getFuncTestReporterClient().methodCalled(obsVar);\n","file_path":"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/MockDataServiceClient.java","rank":79,"score":159314.34088777882},{"content":" @Override\n\n public void setObsVariables(long sbid, Map<String, String> obsVars) throws NoSuchSchedulingBlockException, ParameterException {\n\n getProxy();\n\n itsProxy.setObsVariables(sbid, obsVars);\n","file_path":"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/IceDataServiceClient.java","rank":80,"score":159314.34088777882},{"content":"// Enumerated constants for data status.\n\n// UNKNOWN: the data status is unknown\n\n// EMPTY : no data inside\n\n// FULL : data inside\n\nenum CorrBufferUnitStatus { UNKNOWN = 0, EMPTY = 1, FULL = 2 };\n\n\n\n#endif\n\n\n\n\n\n\n","file_path":"Code/Components/Services/correlatorsim/current/simplayback/CorrBufferUnit.h","rank":81,"score":157995.7916803237},{"content":"/// @brief task for running another task in a parallel thread\n\n/// @details This task is a wrapper around any other task known to the ingest pipeline.\n\n/// Except for the first chunk of data which is just passed to the child task as is\n\n/// (to allow adjustment to the actual configuration of the parallel streams within the\n\n/// ingest pipeline), this task makes the copy of the data, buffers them and executes the\n\n/// child task in a parallel thread. Provided the execution time plus copy overheads \n\n/// do not exceed the cycle time, this allows better utilisation of resources and more\n\n/// distributed computing. The child task should obey the following conditions (otherwise,\n\n/// ingesting will not work correctly and may even lock up):\n\n/// * it should not modify the data\n\n/// * it should not alter the distribution of data streams (except on the first cycle)\n\n/// For example, MSSink or TCPSink are suitable while ChannelAvgTask or BeamScatterTask are not.\n\n/// The code has limited ability to detect misuse, so it is largely up to an expert user to \n\n/// configure ingest pipeline correctly to avoid problems. This task supports a couple of\n\n/// different strategies deailg with the processing not keeping up: throw an exception, \n\n/// skip the data.\n\n///\n\n/// Parameters (example):\n\n/// child = MSSink (child task, same name as understood in tasklist)\n\n/// lossless = true (if not allowed to skip data in the not-keeping up case)\n\n/// size = 1 (circular buffer size)\n\n/// maxwait = 20 (maximum waiting time in seconds for the child task to complete)\n\n///\n\nclass BufferedTask : public askap::cp::ingest::ITask {\n\n public:\n\n\n\n /// @brief Constructor\n\n /// @param[in] parset the configuration parameter set.\n\n /// @param[in] config configuration\n\n BufferedTask(const LOFAR::ParameterSet& parset,\n\n const Configuration& config);\n\n\n\n /// @brief destructor\n\n ~BufferedTask();\n\n\n\n /// @brief Process single visibility chunk\n\n /// @details There is no modification of the data, just internal buffers are updated.\n\n /// If the child task updates the chunk this change is lost, except on the first \n\n /// iteration where the task is allowed to change data distribution by resetting\n\n /// the shared pointer where appropriate.\n\n ///\n\n /// @param[in,out] chunk the instance of VisChunk for which the\n\n /// phase factors will be applied.\n","file_path":"Code/Components/Services/ingest/current/ingestpipeline/bufferedtask/BufferedTask.h","rank":82,"score":155264.04373298964},{"content":"/// @brief Task to scatter beams\n\n/// @details This task increases the number of parallel streams handling data \n\n/// by scattering beams to different streams. For simplicity, only one stream\n\n/// is allowed to be active prior to this task and this rank will continue to\n\n/// be active past this task (if this approach is proven to be worthwhile, \n\n/// we would need to rework the whole visibility corner turn and merge gather in\n\n/// frequency with scatter in beams.\n\n///\n\n/// This task requires a configuration entry in the parset passed to the\n\n/// constructor. This configuration entry specifies how many streams will exist\n\n/// after this task. For example:\n\n/// @verbatim\n\n/// nstreams = 6\n\n/// @endverbatim\n\n/// The above results in 6 parallel streams handling roughly 1/6 of the beam space\n\n/// each. Obviously, total number of ranks should be equal or more than the\n\n/// value of this parameter.\n\nclass BeamScatterTask : public askap::cp::ingest::ITask {\n\n public:\n\n /// @brief Constructor.\n\n /// @param[in] parset the parameter set used to configure this task.\n\n /// @param[in] config configuration\n\n BeamScatterTask(const LOFAR::ParameterSet& parset, const Configuration& config);\n\n\n\n /// @brief Destructor.\n\n virtual ~BeamScatterTask();\n\n\n\n /// @brief Splits chunks.\n\n ///\n\n /// @param[in,out] chunk the instance of VisChunk to work with\n\n /// This method manipulates the VisChunk\n\n /// instance which is passed in, hence the value of the\n\n /// pointer may be changed \n\n virtual void process(askap::cp::common::VisChunk::ShPtr& chunk);\n\n\n\n /// @brief should this task be executed for inactive ranks?\n\n /// @details If a particular rank is inactive, process method is\n","file_path":"Code/Components/Services/ingest/current/ingestpipeline/beamscattertask/BeamScatterTask.h","rank":83,"score":152280.0998818906},{"content":"/// @brief task for monitoring average data properties\n\n/// @details This task is intended to be used in early commissioning experiments.\n\n/// It is an alternative diagnostics to check the average amplitude, phase and\n\n/// delay for the subset of data managed by this particular rank (in the way\n\n/// similar to software correlator). This class is not intended to survive\n\n/// in its current form in the long term.\n\nclass SimpleMonitorTask : public askap::cp::ingest::ITask {\n\n public:\n\n\n\n /// @brief Constructor\n\n /// @param[in] parset the configuration parameter set.\n\n /// @param[in] config configuration\n\n SimpleMonitorTask(const LOFAR::ParameterSet& parset,\n\n const Configuration& config);\n\n\n\n /// @brief destructor\n\n ~SimpleMonitorTask();\n\n\n\n /// @brief Extract required information from visibilities in the specified VisChunk.\n\n /// @details There is no modification of the data, just internal buffers are updated.\n\n ///\n\n /// @param[in,out] chunk the instance of VisChunk for which the\n\n /// phase factors will be applied.\n\n virtual void process(askap::cp::common::VisChunk::ShPtr& chunk);\n\n\n\n protected:\n","file_path":"Code/Components/Services/ingest/current/ingestpipeline/simplemonitortask/SimpleMonitorTask.h","rank":84,"score":152214.9161832399},{"content":"/// @brief Implementation of IConstDataSource in the table-based case\n\n/// @details\n\n/// TableConstDataSource: Allow read-only access to the data stored in the\n\n/// measurement set. This class implements IConstDataSource interface.\n\n/// @ingroup dataaccess_tab\n\nclass TableConstDataSource : virtual public IConstDataSource,\n\n virtual protected TableInfoAccessor\n\n{\n\npublic:\n\n /// @brief construct a read-only data source object\n\n /// @details All iterators obtained from this object will be read-only\n\n /// iterators.\n\n /// @param[in] fname file name of the measurement set to use\n\n /// @param[in] dataColumn a name of the data column used by default\n\n /// (default is DATA)\n\n explicit TableConstDataSource(const std::string &fname, \n\n const std::string &dataColumn = \"DATA\");\n\n \n\n /// create a converter object corresponding to this type of the\n\n /// DataSource. The user can change converting policies (units,\n\n /// reference frames) by appropriate calls to this converter object\n\n /// and pass it back to createConstIterator(...). The data returned by\n\n /// the iteratsr will automatically be in the requested frame/units\n\n ///\n\n /// @return a shared pointer to a new DataConverter object\n","file_path":"Code/Base/accessors/current/dataaccess/TableConstDataSource.h","rank":85,"score":151985.81337726206},{"content":"/// @brief an implementation of IConstDataAccessor in the table-based case\n\n///\n\n/// @details TableConstDataAccessor is an implementation of the\n\n/// DataAccessor working with TableConstDataIterator.\n\n/// It is currently\n\n/// derived from DataAccessorStub as most of the\n\n/// methods are stubbed. However, in the future\n\n/// it should become a separate class derived\n\n/// directly from its interface\n\n/// @ingroup dataaccess_tab\n\nclass TableConstDataAccessor : virtual public IConstDataAccessor\n\n{\n\npublic:\n\n /// construct an object linked with the given iterator\n\n /// @param iter a reference to associated iterator\n\n explicit TableConstDataAccessor(const TableConstDataIterator &iter);\n\n\n\n /// The number of rows in this chunk\n\n /// @return the number of rows in this chunk\n\n virtual casa::uInt nRow() const throw();\n\n\n\n /// The number of spectral channels (equal for all rows)\n\n /// @return the number of spectral channels\n\n virtual casa::uInt nChannel() const throw();\n\n\n\n /// The number of polarization products (equal for all rows)\n\n /// @return the number of polarization products (can be 1,2 or 4)\n\n virtual casa::uInt nPol() const throw();\n\n \n\n /// Return pointing centre directions of the first antenna/feed\n","file_path":"Code/Base/accessors/current/dataaccess/TableConstDataAccessor.h","rank":86,"score":151979.573310659},{"content":"/// @brief Implementation of IConstDataIterator in the table-based case\n\n/// @details\n\n/// TableConstDataIterator: Allow read-only iteration across preselected data. Each \n\n/// iteration step is represented by the IConstDataAccessor interface.\n\n/// This is an implementation in the table-based case.\n\n/// @ingroup dataaccess_tab\n\nclass TableConstDataIterator : virtual public IConstDataIterator,\n\n virtual public TableInfoAccessor\n\n{\n\npublic:\n\n /// @brief constructor of the const iterator\n\n /// @param[in] msManager a manager of the measurement set to use\n\n /// @param[in] sel shared pointer to selector\n\n /// @param[in] conv shared pointer to converter\n\n /// @param[in] cacheSize a number of uvw machines in the cache (default is 1)\n\n /// @param[in] tolerance pointing direction tolerance in radians, exceeding which leads \n\n /// to initialisation of a new UVW Machine\n\n /// @param[in] maxChunkSize maximum number of rows per accessor\n\n TableConstDataIterator(const boost::shared_ptr<ITableManager const>\n\n &msManager,\n\n const boost::shared_ptr<ITableDataSelectorImpl const> &sel,\n\n\t const boost::shared_ptr<IDataConverterImpl const> &conv,\n\n\t size_t cacheSize = 1, double tolerance = 1e-6,\n\n\t casa::uInt maxChunkSize = INT_MAX);\n\n\n\n /// Restart the iteration from the beginning\n","file_path":"Code/Base/accessors/current/dataaccess/TableConstDataIterator.h","rank":87,"score":151979.54061020407},{"content":"/// @brief basic on-the-fly monitor dumping data into an ascii file\n\n/// @details This implementation of the data monitor dumps delay and\n\n/// visibility history into ascii files for on-the-fly monitoring along\n\n/// with the latest spectra for each beam. Unlike BasicMonitor, this\n\n/// one opens an ascii file in the constructor and appends the data\n\n/// indefinitely.\n\n/// @ingroup swcorrelator\n\nclass SimpleVisMonitor : public IMonitor {\n\npublic:\n\n /// @brief constructor\n\n SimpleVisMonitor();\n\n\n\n /// @brief create and configure the monitor \n\n /// @details\n\n /// @param[in] parset parset with parameters (without the swcorrelator prefix)\n\n /// @return shared pointer to the monitor\n\n static boost::shared_ptr<IMonitor> setup(const LOFAR::ParameterSet &parset);\n\n \n\n /// @brief name of the monitor\n\n /// @return the name of the monitor\n\n static std::string name() { return \"simple\"; }\n\n \n\n /// @brief initialise publishing\n\n /// @details Technically, this step is not required. But given the\n\n /// current design of the code it seems better to give a hint on the maximum\n\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\n\n /// @param[in] nAnt maximum number of antennas\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/SimpleVisMonitor.h","rank":88,"score":151343.2720684634},{"content":"/// @brief manages buffers for raw data\n\n/// @details This class manages buffers for raw data. \n\n/// It keeps track of the current status (i.e. free, filled, \n\n/// being reduced) providing the required syncronisation between\n\n/// parallel threads accessing the buffers. The number of buffers should be\n\n/// at least twice the number of beams * antennas * cards.\n\n/// @ingroup swcorrelator\n\nclass BufferManager {\n\npublic:\n\n /// @brief 3 buffers corresponding to the same channel and beam\n\n struct BufferSet {\n\n BufferSet() : itsAnt1(-1), itsAnt2(-1), itsAnt3(-1) {}\n\n int itsAnt1;\n\n int itsAnt2;\n\n int itsAnt3;\n\n };\n\n \n\n enum BufferStatus {\n\n BUF_FREE = 0,\n\n BUF_BEING_FILLED,\n\n BUF_READY,\n\n BUF_BEING_PROCESSED\n\n };\n\n \n\n /// @brief constructor\n\n /// @details\n\n /// @param[in] nBeam number of beams\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/BufferManager.h","rank":89,"score":150832.23688571565},{"content":"class DelaySolverApp : public askap::Application {\n\npublic:\n\n /// @brief process a single file\n\n /// @param[in] ds data source\n\n /// @param[in] currentDelays a vector with fixed delays (per antenna) used for observations\n\n void process(const IConstDataSource &ds, const std::vector<double>& currentDelays);\n\n \n\n /// @brief run application\n\n /// @param[in] argc number of parameters\n\n /// @param[in] argv parameter vector\n\n /// @return exit code\n\n virtual int run(int argc, char *argv[]);\n\nprotected:\n\n /// @brief helper method to fill antenna names\n\n /// @details This method extracts antenna names from the supplied parset of ingest pipeline\n\n /// (obtained via the SB number) and populates itsAntennaNames in the order of ingest indices.\n\n /// @param[in] parset parset used with ingest pipeline\n\n void fillAntennaNames(const LOFAR::ParameterSet &parset);\n\n\n\n /// @brief helper method to extract current delays from the ingest's parset\n","file_path":"Code/Components/Utilities/current/apps/delaysolver.cc","rank":90,"score":150585.36486178997},{"content":"/// @brief manages buffers for raw data\n\n/// @details This class provides support for more than 3 baselines. Although\n\n/// the original BufferManager accepts the number of antennas as its parameter,\n\n/// it is only used to resize the storage accordingly. The logic to split \n\n/// the set of baselines into 3-antenna triangles is implemented here.\n\n/// @ingroup swcorrelator\n\nclass ExtendedBufferManager : public BufferManager {\n\npublic:\n\n\n\n /// @brief constructor\n\n /// @details\n\n /// @param[in] nBeam number of beams\n\n /// @param[in] nChan number of channels (cards)\n\n /// @param[in] nAnt number of antennas\n\n /// @param[in[ hdrProc optional shared pointer to the header preprocessor\n\n ExtendedBufferManager(const size_t nBeam, const size_t nChan, const size_t nAnt = 3, \n\n const boost::shared_ptr<HeaderPreprocessor> &hdrProc = boost::shared_ptr<HeaderPreprocessor>());\n\n \n\n /// @brief get filled buffers for a matching channel + beam\n\n /// @details This method returns the first available set of\n\n /// completely filled buffers corresponding to the same channel\n\n /// and beam. The calling thread is blocked until a suitable set\n\n /// is available for correlation.\n\n /// @return a set of buffers ready for correlation\n\n virtual BufferSet getFilledBuffers() const;\n\n \n","file_path":"Code/Components/swcorrelator/current/swcorrelator/ExtendedBufferManager.h","rank":91,"score":150001.10153118343},{"content":" class access::object_traits< ::askap::cp::sms::datamodel::DataSource >\n\n {\n\n public:\n\n typedef ::askap::cp::sms::datamodel::DataSource object_type;\n\n typedef ::boost::shared_ptr< ::askap::cp::sms::datamodel::DataSource > pointer_type;\n\n typedef odb::pointer_traits<pointer_type> pointer_traits;\n\n\n\n static const bool polymorphic = false;\n\n\n\n typedef ::askap::cp::sms::datamodel::id_type id_type;\n\n typedef ::askap::cp::sms::datamodel::version_type version_type;\n\n\n\n static const bool auto_id = true;\n\n\n\n static const bool abstract = false;\n\n\n\n static id_type\n\n id (const object_type&);\n\n\n\n typedef\n","file_path":"Code/Components/Services/skymodel/current/datamodel/DataSource-odb.h","rank":92,"score":149737.33154631557},{"content":"/// @brief Interface class for read-only access to visibility data\n\n/// @details IConstDataAccessor is an interface class for read-only \n\n/// access to buffered visibility data. Working instances include \n\n/// a chunk of streamed data or a portion of the disk-based table. \n\n/// A reference to this type is returned by a derivative from\n\n/// IConstDataIterator\n\n/// @ingroup dataaccess_i\n\nclass IConstDataAccessor\n\n{\n\npublic:\n\n\t\n\n\t/// Destruct\n\n\tvirtual ~IConstDataAccessor();\n\n\t\t\n\n\t/// The number of rows in this chunk\n\n\t/// @return the number of rows in this chunk\n\n\tvirtual casa::uInt nRow() const throw() = 0;\n\n\n\n // The following methods implement metadata access\n\n\t\t\n\n\t/// The number of spectral channels (equal for all rows)\n\n\t/// @return the number of spectral channels\n\n\tvirtual casa::uInt nChannel() const throw() = 0;\n\n\n\n\t/// The number of polarization products (equal for all rows)\n\n\t/// @return the number of polarization products (can be 1,2 or 4)\n\n\tvirtual casa::uInt nPol() const throw() = 0;\n","file_path":"Code/Base/accessors/current/dataaccess/IConstDataAccessor.h","rank":93,"score":147307.8014075735},{"content":"/// @brief Read-only iterator across preselected data\n\n/// @details Each \n\n/// iteration step is represented by the IConstDataAccessor interface.\n\n/// The idea is that an iterator object will be obtained via IDataSource\n\n/// which will take care of the actual method to access the data and the\n\n/// source (a MeasurementSet or a stream). Any class controlling data selection\n\n/// is likely to be held by a real implementation of the iterator. However,\n\n/// it will be set up via the IDataSource object and IS NOT a part of this\n\n/// interface.\n\n/// \n\n/// Additional read/write buffers can be used via the IDataIterator, which\n\n/// implements a read/write interface\n\n/// @ingroup dataaccess_i\n\nclass IConstDataIterator\n\n{\n\npublic:\n\n\t/// the type of the value pointed by this iterator\n\n\ttypedef const IConstDataAccessor& value_type;\n\n\n\n\t/// the type of the pointer returned by operator->\n\n\t/// We can't generally just use value_type * because \n\n\ttypedef const IConstDataAccessor* pointer_type;\n\n\n\n\t/// an empty virtual destructor to make the compiler happy\n\n\tvirtual ~IConstDataIterator();\n\n\t\n\n\t/// Restart the iteration from the beginning\n\n\tvirtual void init() = 0;\n\n\t\n\n\t/// Return the data accessor (current chunk) in various ways\n\n\t\n\n\t/// operator* delivers a reference to data accessor (current chunk)\n\n\t/// @return a reference to the current chunk\n","file_path":"Code/Base/accessors/current/dataaccess/IConstDataIterator.h","rank":94,"score":147299.6159504557},{"content":"/// @brief Read-only access to a source of visibility data\n\n/// @details IConstDataSource allows access to a source of visibility data,\n\n/// probably either a MeasurementSet or a stream.\n\n/// @ingroup dataaccess_i\n\nclass IConstDataSource\n\n{\n\npublic:\n\n\t\n\n\t/// an empty virtual destructor to make the compiler happy\n\n\tvirtual ~IConstDataSource();\n\n\n\n\t/// create a converter object corresponding to this type of the\n\n\t/// DataSource. The user can change converting policies (units,\n\n\t/// reference frames) by appropriate calls to this converter object\n\n\t/// and pass it back to createConstIterator(...). The data returned by\n\n\t/// the iteratsr will automatically be in the requested frame/units\n\n\t///\n\n\t/// @return a shared pointer to a new DataConverter object\n\n\t///\n\n\t/// The method acts as a factory by creating a new DataConverter.\n\n\t/// The lifetime of this converter is the same as the lifetime of the\n\n\t/// DataSource object. Therefore, it can be reused multiple times,\n\n\t/// if necessary. However, the behavior of iterators created\n\n\t/// with a particular DataConverter is undefined, if you change\n","file_path":"Code/Base/accessors/current/dataaccess/IConstDataSource.h","rank":95,"score":147294.9498177687},{"content":"class DataSet\n\n{\n\n public:\n\n DataSet(const std::string& filename, const LOFAR::ParameterSet& parset);\n\n ~DataSet();\n\n\n\n void add(void);\n\n\n\n private:\n\n void create(const std::string& filename);\n\n void initAnt(void);\n\n void initFields(void);\n\n void initSpWindows(void);\n\n void initFeeds(void);\n\n void initObs(void);\n\n\n\n casa::MeasurementSet* itsMs;\n\n LOFAR::ParameterSet itsParset;\n\n};\n\n\n\n#endif\n","file_path":"Code/Components/CP/benchmarks/current/msperf/writers/DataSet.h","rank":96,"score":147289.65801521053},{"content":"/// @brief\n\n/// An implementation of the data converter (IDataConverter interface).\n\n/// @details\n\n/// The intention is to use this class in conjunction\n\n/// with the table based implementation of the data accessor. However,\n\n/// it looks at this stage that this class is relatively general and can be\n\n/// used with any implementation of the data accessor layer. One may want to\n\n/// write a different implementation to achieve a better optimization, which\n\n/// may be specific to a particular DataSource.\n\n///\n\n/// The main idea is to supply a DataConverter and DataSelector when\n\n/// an iterator is requested from the DataSource object. The iterator will\n\n/// return the data in the requested frame/units. The end user interacts\n\n/// with the IDataConverter interface only.\n\n/// @ingroup dataaccess_conv\n\nclass BasicDataConverter : virtual public IDataConverterImpl\n\n{\n\npublic:\n\n /// default constructor sets up the default conversion options,\n\n /// which are:\n\n /// for Epoch, origin/frame are MJD 0 UTC, units are seconds\n\n /// (defined in the default arguments for the\n\n /// constructor of EpochConverter)\n\n /// for Directions, frame is J2000, units are not used\n\n BasicDataConverter();\n\n\n\n /// implementation of the interface methods\n\n\n\n /// set the reference frame for any time epochs \n\n /// (e.g. time-based selection, visibility timestamp)\n\n /// The value of the specified measure is the origin epoch. \n\n /// All visibility timestamps will be given as offsets from\n\n /// it. The units of these offsets are given by the second\n\n /// parameter\n\n /// @param[in] origin a zero-point for the visibility timestamps \n","file_path":"Code/Base/accessors/current/dataaccess/BasicDataConverter.h","rank":97,"score":147070.45819436706},{"content":"/// @brief a factory class creating data monitors \n\n/// @details We support both built-in and dynamically loadable\n\n/// data monitors (i.e. something which is called for every chunk of the\n\n/// data written to the MS). The latter can be used for example to implement\n\n/// monitoring via epics.\n\n/// @ingroup swcorrelator\n\nclass MonitorFactory : private boost::noncopyable {\n\n\n\n /// @brief default constructor\n\n /// @details It is declared private, so this type cannot be explicitly created.\n\n /// All work is done via static methods\n\n MonitorFactory();\n\n\n\npublic: \n\n /// @brief signature of the factory method\n\n /// @details All functions creating an IMonitor objects must have this\n\n /// signature. Preferably, such a function should be a static method of the \n\n /// appropriate monitor class.\n\n typedef IMonitor::ShPtr MonitorCreator(const LOFAR::ParameterSet &);\n\n \n\n /// @brief helper method to register a monitor\n\n /// @param[in] name name of the monitor (key into the map)\n\n /// @param[in] creatorFunc factory function able to create the monitor\n\n static void registerMonitor(const std::string &name, MonitorCreator *creatorFunc);\n\n\n\n /// @brief factory method\n","file_path":"Code/Components/swcorrelator/current/swcorrelator/MonitorFactory.h","rank":98,"score":146061.64268471245},{"content":"/// @brief an adapter to most methods of IConstDataAccessor with buffering\n\n///\n\n/// @details This class is somewhat similar to MemBufferDataAccessor, however it is\n\n/// not as basic. The latter doesn't manage the cube at all and only ensures that it has\n\n/// a conforming size. In contrast, this class returns the existing read-only visibility cube \n\n/// until a non-const reference is requested (rwVisibility). Then the read-only visibilities are\n\n/// copied to the internal buffer and the reference to this buffer is passed for all later calls\n\n/// to read-write and read-only methods until either the shape changes or discardCache method is\n\n/// called. The intention is to provide a similar functionality for the flagging methos\n\n/// @ingroup dataaccess_hlp\n\nclass OnDemandBufferDataAccessor : virtual public MetaDataAccessor,\n\n virtual public IDataAccessor,\n\n public boost::noncopyable\n\n{\n\npublic:\n\n /// construct an object linked with the given const accessor\n\n /// @param[in] acc a reference to the associated accessor\n\n explicit OnDemandBufferDataAccessor(const IConstDataAccessor &acc);\n\n \n\n /// Read-only visibilities (a cube is nRow x nChannel x nPol; \n\n /// each element is a complex visibility)\n\n ///\n\n /// @return a reference to nRow x nChannel x nPol cube, containing\n\n /// all visibility data\n\n ///\n\n virtual const casa::Cube<casa::Complex>& visibility() const;\n\n\n\n\t\n\n /// Read-write access to visibilities (a cube is nRow x nChannel x nPol;\n\n /// each element is a complex visibility)\n","file_path":"Code/Base/accessors/current/dataaccess/OnDemandBufferDataAccessor.h","rank":99,"score":144523.30532490328}],"string":"[\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief a collection of data monitors\\n\\n/// @details This class is just a container of data monitors. It implements basic calls\\n\\n/// of the IMonitor interface and translates them to each monitor held in the container.\\n\\n/// @ingroup swcorrelator\\n\\nstruct DataMonitors : public IMonitor {\\n\\n /// @brief constructor, creates monitors using the factory and adds them to the container\\n\\n /// @param[in] parset parset file used (without the swcorrelator prefix)\\n\\n /// @note The list of monitors to create is specified by the \\\"monitors\\\" keyword.\\n\\n explicit DataMonitors(const LOFAR::ParameterSet &parset);\\n\\n \\n\\n /// @brief destructor, added to assist synchronisation\\n\\n ~DataMonitors();\\n\\n\\n\\n /// @brief initialise publishing\\n\\n /// @details Technically, this step is not required. But given the\\n\\n /// current design of the code it seems better to give a hint on the maximum\\n\\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\\n\\n /// @param[in] nAnt maximum number of antennas\\n\\n /// @param[in] nBeam maximum number of beams\\n\\n /// @param[in] nChan maximum number of channels\\n\\n /// @note At the moment we envisage that this method would only be called once.\\n\\n /// Technically all this information could be extracted from the parset supplied\\n\\n /// in the setup method, but it seems handy to have each parameter extracted from\\n\\n /// the parset at a single place only. \\n\\n virtual void initialise(const int nAnt, const int nBeam, const int nChan);\\n\\n \\n\\n /// @brief Publish one buffer of data\\n\\n /// @details This method is called as soon as the new chunk of data is written out\\n\\n /// @param[in] buf products buffer\\n\\n /// @note the buffer is locked for the duration of execution of this method, different\\n\\n /// beams are published separately\\n\\n virtual void publish(const CorrProducts &buf);\\n\\n \\n\\n /// @brief finilaise publishing for the current integration\\n\\n /// @details This method is called when data corresponding to all beams are published.\\n\\n /// It is the place for operations which do not require the lock on the buffers\\n\\n /// (i.e. dumping the accumulated history to the file, etc).\\n\\n virtual void finalise();\\n\\n \\n\\nprivate:\\n\\n /// @brief name of the monitor\\n\\n /// @return the name of the monitor\\n\\n static std::string name() { return \\\"not_supposed_to_be_called\\\"; }\\n\\n \\n\\n /// @brief container of actual monitors\\n\\n /// @details We use vector because the most time-critical operation is the iteration over all\\n\\n /// elements. In addition, it seems unlikely that we have many monitors co-existing at the same time.\\n\\n std::vector<boost::shared_ptr<IMonitor> > itsMonitors;\\n\\n\\n\\n /// @brief mutex to synchronise access to data monitors\\n\\n mutable boost::mutex itsMonitorsMutex;\\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.h\",\n \"rank\": 0,\n \"score\": 305549.81501957594\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief data monitored externally\\n\\n/// @details This is a basic structure containing a number of monitoring points\\n\\n/// such as amplitudes, delays or phases. A structure of this type is passed to \\n\\n/// a registered call back method at every new correlation cycle. Although we \\n\\n/// could've passed the CorrProducts structure which is used in the generic monitoring\\n\\n/// interface, an adapter seems worth while to avoid a tight coupling between epics part\\n\\n/// and the rest of the software correlator. In addition, we can latter add other information\\n\\n/// to the type which is not present in the CorrProducts structure.\\n\\n/// @ingroup corrinterfaces\\n\\nstruct MonitoringData : private boost::noncopyable {\\n\\n /// @brief individual baselines\\n\\n enum Baseline {\\n\\n BASELINE_12 = 0,\\n\\n BASELINE_23,\\n\\n BASELINE_13\\n\\n };\\n\\n\\n\\n /// @brief constructor, initialises the beam number and resizes the vectors\\n\\n /// @param[in] beam beam index [0..nBeam-1]\\n\\n explicit MonitoringData(const int beam);\\n\\n \\n\\n /// @brief obtain UT date/time string\\n\\n /// @return the date/time corresponding to itsTime as a string (to simplify reporting)\\n\\n std::string timeString() const;\\n\\n \\n\\n /// @brief the beam number related to this structure\\n\\n /// @return the beam number\\n\\n int beam() const; \\n\\n \\n\\n /// @brief obtain amplitude for a given baseline \\n\\n /// @param[in] baseline baseline index\\n\\n /// @return amplitude in raw counts\\n\\n float amplitude(const Baseline baseline) const;\\n\\n\\n\\n /// @brief obtain phase for a given baseline \\n\\n /// @param[in] baseline baseline index\\n\\n /// @return phase in degrees\\n\\n float phase(const Baseline baseline) const;\\n\\n\\n\\n /// @brief obtain fitted delay for a given baseline \\n\\n /// @param[in] baseline baseline index\\n\\n /// @return delay in nanoseconds\\n\\n double delay(const Baseline baseline) const;\\n\\n\\n\\n /// @brief check whether a particular baseline has valid data\\n\\n /// @param[in] baseline baseline index\\n\\n /// @return true, if the data corresponding to the given baseline are valid\\n\\n bool isValid(const Baseline baseline) const;\\n\\n\\n\\n /// @brief obtain time\\n\\n /// @return UT epoch in days since 0 MJD\\n\\n double time() const;\\n\\n \\n\\n // monitoring information for the last correlated data\\n\\n \\n\\n /// @brief the beam this structure corresponds to [0..nBeam-1]\\n\\n int itsBeam;\\n\\n\\n\\n /// @brief averaged amplitudes for all 3 baselines in raw counts\\n\\n /// @details This vector is supposed to have 3 elements at all times. The order\\n\\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\\n\\n std::vector<float> itsAmplitudes;\\n\\n \\n\\n /// @brief averaged phases for all 3 baselines in degrees\\n\\n /// @details This vector is supposed to have 3 elements at all times. The order\\n\\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\\n\\n std::vector<float> itsPhases;\\n\\n \\n\\n /// @brief delays for all 3 baselines in nanoseconds\\n\\n /// @details This vector is supposed to have 3 elements at all times. The order\\n\\n /// of baselines is 1-2,2-3,1-3 (1-based indices).\\n\\n std::vector<double> itsDelays;\\n\\n \\n\\n /// @brief flagging information\\n\\n /// @details This vector is supposed to have 3 elements at all times. True for a \\n\\n /// particular baseline means that the corresponding amplitudes, phases and delays\\n\\n /// are not valid. The order of baselines is 1-2,2-3,1-3 (1-based indices).\\n\\n std::vector<bool> itsFlags;\\n\\n \\n\\n /// @brief UT time in days since 0 MJD\\n\\n double itsTime; \\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.h\",\n \"rank\": 1,\n \"score\": 291214.9235100251\n },\n {\n \"content\": \"/// @brief basic on-the-fly monitor dumping data into an ascii file\\n\\n/// @details This implementation of the data monitor dumps delay and\\n\\n/// visibility history into ascii files for on-the-fly monitoring along\\n\\n/// with the latest spectra for each beam\\n\\n/// @ingroup swcorrelator\\n\\nclass BasicMonitor : public IMonitor {\\n\\npublic:\\n\\n /// @brief constructor\\n\\n BasicMonitor();\\n\\n\\n\\n /// @brief create and configure the monitor \\n\\n /// @details\\n\\n /// @param[in] parset parset with parameters (without the swcorrelator prefix)\\n\\n /// @return shared pointer to the monitor\\n\\n static boost::shared_ptr<IMonitor> setup(const LOFAR::ParameterSet &parset);\\n\\n \\n\\n /// @brief name of the monitor\\n\\n /// @return the name of the monitor\\n\\n static std::string name() { return \\\"basic\\\"; }\\n\\n \\n\\n /// @brief initialise publishing\\n\\n /// @details Technically, this step is not required. But given the\\n\\n /// current design of the code it seems better to give a hint on the maximum\\n\\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\\n\\n /// @param[in] nAnt maximum number of antennas\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 2,\n \"score\": 267982.62338736525\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief generic interface for an on-the-fly monitor\\n\\n/// @details Possible implementations could include dumping some history\\n\\n/// into ascii files or providing monitoring via epics.\\n\\n/// @ingroup swcorrelator\\n\\nstruct IMonitor : private boost::noncopyable {\\n\\n \\n\\n /// @brief shared pointer type\\n\\n typedef boost::shared_ptr<IMonitor> ShPtr;\\n\\n \\n\\n /// @brief virtual destructor to keep the compiler happy\\n\\n virtual ~IMonitor() {};\\n\\n \\n\\n /// @brief name of the monitor\\n\\n /// @return the name of the monitor\\n\\n static std::string name() { return \\\"undefined\\\"; }\\n\\n \\n\\n /// @brief initialise publishing\\n\\n /// @details Technically, this step is not required. But given the\\n\\n /// current design of the code it seems better to give a hint on the maximum\\n\\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\\n\\n /// @param[in] nAnt maximum number of antennas\\n\\n /// @param[in] nBeam maximum number of beams\\n\\n /// @param[in] nChan maximum number of channels\\n\\n /// @note At the moment we envisage that this method would only be called once.\\n\\n /// Technically all this information could be extracted from the parset supplied\\n\\n /// in the setup method, but it seems handy to have each parameter extracted from\\n\\n /// the parset at a single place only. \\n\\n virtual void initialise(const int nAnt, const int nBeam, const int nChan) = 0;\\n\\n \\n\\n /// @brief Publish one buffer of data\\n\\n /// @details This method is called as soon as the new chunk of data is written out\\n\\n /// @param[in] buf products buffer\\n\\n /// @note the buffer is locked for the duration of execution of this method, different\\n\\n /// beams are published separately\\n\\n virtual void publish(const CorrProducts &buf) = 0;\\n\\n \\n\\n /// @brief finilaise publishing for the current integration\\n\\n /// @details This method is called when data corresponding to all beams are published.\\n\\n /// It is the place for operations which do not require the lock on the buffers\\n\\n /// (i.e. dumping the accumulated history to the file, etc).\\n\\n virtual void finalise() = 0;\\n\\n};\\n\\n \\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/IMonitor.h\",\n \"rank\": 3,\n \"score\": 249246.8077438395\n },\n {\n \"content\": \" uint64_t bat; // BAT of first sample\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h\",\n \"rank\": 4,\n \"score\": 247907.26075640976\n },\n {\n \"content\": \" uint32_t beam; // beam number 1-18\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h\",\n \"rank\": 5,\n \"score\": 247863.44428795762\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief header preceding each data chunk for all buffers\\n\\n/// @details This header preceds any actual data in the stream.\\n\\n/// @ingroup swcorrelator\\n\\nstruct BufferHeader {\\n\\n uint64_t bat; // BAT of first sample\\n\\n uint32_t antenna; // antenna number\\n\\n uint32_t freqId; // currently card number 1-16. If we go to more DSPs will be 1-64 (same as FreqId field is FITs acm capture)\\n\\n uint32_t beam; // beam number 1-18\\n\\n uint32_t frame; // frame number of first sample (from digitiser packet, see below)\\n\\n uint32_t control; // user defined value, can be hooked up thru epics to send control via OSL script or gui to software correlator if necessary\\n\\n uint32_t length; // length of data (should always be 4194304 (num ddr pages * bytes per beam) for 16MHz\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BufferHeader.h\",\n \"rank\": 6,\n \"score\": 246400.306509534\n },\n {\n \"content\": \" /// @param[in] nBeam maximum number of beams\\n\\n /// @param[in] nChan maximum number of channels\\n\\n /// @note At the moment we envisage that this method would only be called once.\\n\\n /// Technically all this information could be extracted from the parset supplied\\n\\n /// in the setup method, but it seems handy to have each parameter extracted from\\n\\n /// the parset at a single place only. \\n\\n virtual void initialise(const int nAnt, const int nBeam, const int nChan);\\n\\n \\n\\n /// @brief Publish one buffer of data\\n\\n /// @details This method is called as soon as the new chunk of data is written out\\n\\n /// @param[in] buf products buffer\\n\\n /// @note the buffer is locked for the duration of execution of this method, different\\n\\n /// beams are published separately\\n\\n virtual void publish(const CorrProducts &buf);\\n\\n \\n\\n /// @brief finilaise publishing for the current integration\\n\\n /// @details This method is called when data corresponding to all beams are published.\\n\\n /// It is the place for operations which do not require the lock on the buffers\\n\\n /// (i.e. dumping the accumulated history to the file, etc).\\n\\n virtual void finalise();\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 7,\n \"score\": 204867.445135815\n },\n {\n \"content\": \"#include <casacore/casa/Arrays/Vector.h>\\n\\n\\n\\n// other 3rd party\\n\\n#include <Common/ParameterSet.h>\\n\\n#include <inttypes.h>\\n\\n\\n\\nnamespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief basic on-the-fly monitor dumping data into an ascii file\\n\\n/// @details This implementation of the data monitor dumps delay and\\n\\n/// visibility history into ascii files for on-the-fly monitoring along\\n\\n/// with the latest spectra for each beam\\n\\n/// @ingroup swcorrelator\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 8,\n \"score\": 204864.0248015621\n },\n {\n \"content\": \"\\n\\n /// @brief history of user defined control keywords\\n\\n casa::Cube<uint32_t> itsControlHistory;\\n\\n \\n\\n /// @brief BATs for the history items\\n\\n casa::Vector<uint64_t> itsBATs;\\n\\n \\n\\n /// @brief last position in the history (circular buffers)\\n\\n /// @details negative value for an uninitialised history\\n\\n int itsLastHistPosition;\\n\\n \\n\\n /// @brief true if the history buffers were wrapped\\n\\n bool itsWrapped;\\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\\n} // namespace askap\\n\\n\\n\\n#endif // #ifndef ASKAP_SWCORRELATOR_BASIC_MONITOR_H\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 9,\n \"score\": 204863.29141174912\n },\n {\n \"content\": \"\\n\\n /// @brief helper method to get delays\\n\\n /// @details\\n\\n /// @param[in] vis visibility matrix (rows are baselines, columns are channels)\\n\\n /// @return delays in seconds for each baseline\\n\\n /// @note the routine assumes 1 MHz channel spacing and will not work for a very quick wrap\\n\\n static casa::Vector<casa::Float> estimateDelays(const casa::Matrix<casa::Complex> &vis);\\n\\n\\n\\nprotected:\\n\\n /// @brief advance history if necessary\\n\\n /// @details Advances the cursor in the history list if the new bat is different from the one \\n\\n /// stored during the previous step (unless it is a first step)\\n\\n /// @param[in] bat new BAT \\n\\n void advanceHistoryCursor(const uint64_t bat);\\n\\nprivate:\\n\\n /// @brief history of visibilities\\n\\n casa::Cube<casa::Complex> itsHistory;\\n\\n \\n\\n /// @brief history of delays\\n\\n casa::Cube<casa::Float> itsDelayHistory;\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 10,\n \"score\": 204833.70864316673\n },\n {\n \"content\": \"/// This program is distributed in the hope that it will be useful,\\n\\n/// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n/// GNU General Public License for more details.\\n\\n///\\n\\n/// You should have received a copy of the GNU General Public License\\n\\n/// along with this program; if not, write to the Free Software\\n\\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\\n\\n///\\n\\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\\n\\n\\n\\n#ifndef ASKAP_SWCORRELATOR_BASIC_MONITOR_H\\n\\n#define ASKAP_SWCORRELATOR_BASIC_MONITOR_H\\n\\n\\n\\n// own includes\\n\\n#include <swcorrelator/IMonitor.h>\\n\\n\\n\\n// casa includes\\n\\n#include <casacore/casa/Arrays/Matrix.h>\\n\\n#include <casacore/casa/Arrays/Cube.h>\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 11,\n \"score\": 204832.74873002138\n },\n {\n \"content\": \"/// @file \\n\\n///\\n\\n/// @brief basic on-the-fly monitor dumping data into an ascii file\\n\\n/// @details This implementation of the data monitor dumps delay and\\n\\n/// visibility history into ascii files for on-the-fly monitoring along\\n\\n/// with the latest spectra for each beam\\n\\n///\\n\\n/// @copyright (c) 2007 CSIRO\\n\\n/// Australia Telescope National Facility (ATNF)\\n\\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\\n\\n/// PO Box 76, Epping NSW 1710, Australia\\n\\n/// atnf-enquiries@csiro.au\\n\\n///\\n\\n/// This file is part of the ASKAP software distribution.\\n\\n///\\n\\n/// The ASKAP software distribution is free software: you can redistribute it\\n\\n/// and/or modify it under the terms of the GNU General Public License as\\n\\n/// published by the Free Software Foundation; either version 2 of the License,\\n\\n/// or (at your option) any later version.\\n\\n///\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.h\",\n \"rank\": 12,\n \"score\": 204832.5316110967\n },\n {\n \"content\": \"/// @param[in] nBeam maximum number of beams\\n\\n/// @param[in] nChan maximum number of channels\\n\\n/// @note At the moment we envisage that this method would only be called once.\\n\\n/// Technically all this information could be extracted from the parset supplied\\n\\n/// in the setup method, but it seems handy to have each parameter extracted from\\n\\n/// the parset at a single place only. \\n\\nvoid DataMonitors::initialise(const int nAnt, const int nBeam, const int nChan)\\n\\n{\\n\\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\\n\\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\\n\\n ci != itsMonitors.end(); ++ci) {\\n\\n ASKAPDEBUGASSERT(*ci);\\n\\n (*ci)->initialise(nAnt,nBeam,nChan);\\n\\n }\\n\\n}\\n\\n \\n\\n/// @brief Publish one buffer of data\\n\\n/// @details This method is called as soon as the new chunk of data is written out\\n\\n/// @param[in] buf products buffer\\n\\n/// @note the buffer is locked for the duration of execution of this method, different\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 25,\n \"score\": 201310.01312149307\n },\n {\n \"content\": \"/// beams are published separately\\n\\nvoid DataMonitors::publish(const CorrProducts &buf)\\n\\n{\\n\\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\\n\\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\\n\\n ci != itsMonitors.end(); ++ci) {\\n\\n ASKAPDEBUGASSERT(*ci);\\n\\n (*ci)->publish(buf);\\n\\n }\\n\\n}\\n\\n \\n\\n/// @brief finilaise publishing for the current integration\\n\\n/// @details This method is called when data corresponding to all beams are published.\\n\\n/// It is the place for operations which do not require the lock on the buffers\\n\\n/// (i.e. dumping the accumulated history to the file, etc).\\n\\nvoid DataMonitors::finalise()\\n\\n{\\n\\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\\n\\n for (std::vector<boost::shared_ptr<IMonitor> >::const_iterator ci = itsMonitors.begin();\\n\\n ci != itsMonitors.end(); ++ci) {\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 26,\n \"score\": 201289.15958581647\n },\n {\n \"content\": \"/// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n/// GNU General Public License for more details.\\n\\n///\\n\\n/// You should have received a copy of the GNU General Public License\\n\\n/// along with this program; if not, write to the Free Software\\n\\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\\n\\n///\\n\\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\\n\\n\\n\\n#include <askap_swcorrelator.h>\\n\\n#include <askap/AskapError.h>\\n\\n#include <askap/AskapLogging.h>\\n\\n\\n\\n#include <swcorrelator/DataMonitors.h>\\n\\n#include <swcorrelator/MonitorFactory.h>\\n\\n\\n\\nASKAP_LOGGER(logger, \\\".datamonitors\\\");\\n\\n\\n\\nnamespace askap {\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 27,\n \"score\": 201285.3053264966\n },\n {\n \"content\": \"\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief constructor, creates monitors using the factory and adds them to the container\\n\\n/// @param[in] parset parset file used (without the swcorrelator prefix)\\n\\n/// @note The list of monitors to create is specified by the \\\"monitors\\\" keyword.\\n\\nDataMonitors::DataMonitors(const LOFAR::ParameterSet &parset)\\n\\n{\\n\\n const std::vector<std::string> monitors = parset.getStringVector(\\\"monitors\\\",std::vector<std::string>(1,\\\"basic\\\"));\\n\\n if (monitors.size() == 0) {\\n\\n ASKAPLOG_INFO_STR(logger, \\\"No on-the-fly data monitors will be created\\\");\\n\\n } else {\\n\\n itsMonitors.reserve(monitors.size());\\n\\n ASKAPLOG_INFO_STR(logger, \\\"Setting up data monitors from the list: \\\"<<monitors);\\n\\n for (std::vector<std::string>::const_iterator ci = monitors.begin(); ci != monitors.end(); ++ci) {\\n\\n const boost::shared_ptr<IMonitor> curMonitor = MonitorFactory::make(*ci, parset);\\n\\n ASKAPCHECK(curMonitor, \\\"Failed to create data monitor name = `\\\"<<*ci<<\\\"`\\\");\\n\\n itsMonitors.push_back(curMonitor);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 28,\n \"score\": 201276.92211566388\n },\n {\n \"content\": \"}\\n\\n\\n\\n// @brief destructor, added to assist synchronisation\\n\\nDataMonitors::~DataMonitors()\\n\\n{\\n\\n boost::lock_guard<boost::mutex> lock(itsMonitorsMutex);\\n\\n for (std::vector<boost::shared_ptr<IMonitor> >::iterator it = itsMonitors.begin();\\n\\n it != itsMonitors.end(); ++it) {\\n\\n ASKAPDEBUGASSERT(*it);\\n\\n it->reset();\\n\\n }\\n\\n itsMonitors.resize(0);\\n\\n}\\n\\n\\n\\n \\n\\n/// @brief initialise publishing\\n\\n/// @details Technically, this step is not required. But given the\\n\\n/// current design of the code it seems better to give a hint on the maximum\\n\\n/// possible number of antennas, beams and channels, e.g. to initialise caches.\\n\\n/// @param[in] nAnt maximum number of antennas\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 29,\n \"score\": 201273.78919691162\n },\n {\n \"content\": \"/// @file \\n\\n///\\n\\n/// @brief a collection of data monitors\\n\\n/// @details This class is just a container of data monitors. It implements basic calls\\n\\n/// of the IMonitor interface and translates them to each monitor held in the container.\\n\\n///\\n\\n/// @copyright (c) 2007 CSIRO\\n\\n/// Australia Telescope National Facility (ATNF)\\n\\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\\n\\n/// PO Box 76, Epping NSW 1710, Australia\\n\\n/// atnf-enquiries@csiro.au\\n\\n///\\n\\n/// This file is part of the ASKAP software distribution.\\n\\n///\\n\\n/// The ASKAP software distribution is free software: you can redistribute it\\n\\n/// and/or modify it under the terms of the GNU General Public License as\\n\\n/// published by the Free Software Foundation; either version 2 of the License,\\n\\n/// or (at your option) any later version.\\n\\n///\\n\\n/// This program is distributed in the hope that it will be useful,\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 30,\n \"score\": 201264.99690795044\n },\n {\n \"content\": \" ASKAPDEBUGASSERT(*ci);\\n\\n (*ci)->finalise();\\n\\n }\\n\\n}\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\\n} // namespace askap\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/DataMonitors.cc\",\n \"rank\": 31,\n \"score\": 201260.77138981773\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief generic interface for sink of the correlation products\\n\\n/// @details One of the possible implementations is the MS writer\\n\\n/// @ingroup swcorrelator\\n\\nstruct ISink : private boost::noncopyable {\\n\\n /// @brief virtual destructor to keep the compiler happy\\n\\n virtual ~ISink() {};\\n\\n \\n\\n /// @brief calculate uvw for the given buffer\\n\\n /// @param[in] buf products buffer\\n\\n /// @note The calculation is bypassed if itsUVWValid flag is already set in the buffer\\n\\n /// @return time epoch corresponding to the BAT of the buffer\\n\\n virtual casa::MEpoch calculateUVW(CorrProducts &buf) const = 0;\\n\\n \\n\\n /// @brief write one buffer to the measurement set\\n\\n /// @details Current fieldID and dataDescID are assumed\\n\\n /// @param[in] buf products buffer\\n\\n /// @note This method could've received a const reference to the buffer. However, more\\n\\n /// workarounds would be required with casa arrays, so we don't bother doing this at the moment.\\n\\n /// In addition, we could call calculateUVW inside this method (but we still need an option to\\n\\n /// calculate uvw's ahead of writing the buffer if we implement some form of delay tracking).\\n\\n virtual void write(CorrProducts &buf) = 0;\\n\\n};\\n\\n \\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/ISink.h\",\n \"rank\": 32,\n \"score\": 188726.42404934886\n },\n {\n \"content\": \"\\n\\nnamespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief constructor, initialises the beam number and resizes the vectors\\n\\n/// @param[in] beam beam index [0..nBeam-1]\\n\\nMonitoringData::MonitoringData(const int beam) : itsBeam(beam), itsAmplitudes(3,0.),\\n\\n itsPhases(3,0.), itsDelays(3,0.), itsFlags(3,true), itsTime(0.) {}\\n\\n\\n\\n/// @brief obtain UT date/time string\\n\\n/// @return the date/time corresponding to itsTime as a string (to simplify reporting)\\n\\nstd::string MonitoringData::timeString() const\\n\\n{\\n\\n const casa::MVEpoch epoch(itsTime);\\n\\n std::ostringstream os;\\n\\n epoch.print(os);\\n\\n return os.str();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 33,\n \"score\": 187760.1569016535\n },\n {\n \"content\": \"/// @brief check whether a particular baseline has valid data\\n\\n/// @param[in] baseline baseline index\\n\\n/// @return true, if the data corresponding to the given baseline are valid\\n\\nbool MonitoringData::isValid(const Baseline baseline) const\\n\\n{\\n\\n const int bl = int(baseline);\\n\\n ASKAPDEBUGASSERT(bl >= 0);\\n\\n ASKAPDEBUGASSERT(bl < int(itsFlags.size()));\\n\\n return !itsFlags[bl];\\n\\n}\\n\\n\\n\\n/// @brief obtain time\\n\\n/// @return UT epoch in days since 0 MJD\\n\\ndouble MonitoringData::time() const\\n\\n{\\n\\n return itsTime;\\n\\n}\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\\n} // namespace askap\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 34,\n \"score\": 187752.82591506373\n },\n {\n \"content\": \"/// @brief the beam number related to this structure\\n\\n/// @return the beam number\\n\\nint MonitoringData::beam() const\\n\\n{\\n\\n return itsBeam;\\n\\n}\\n\\n\\n\\n/// @brief obtain amplitude for a given baseline \\n\\n/// @param[in] baseline baseline index\\n\\n/// @return amplitude in raw counts\\n\\nfloat MonitoringData::amplitude(const Baseline baseline) const\\n\\n{\\n\\n const int bl = int(baseline);\\n\\n ASKAPDEBUGASSERT(bl >= 0);\\n\\n ASKAPDEBUGASSERT(bl < int(itsAmplitudes.size()));\\n\\n return itsAmplitudes[bl];\\n\\n}\\n\\n\\n\\n/// @brief obtain phase for a given baseline \\n\\n/// @param[in] baseline baseline\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 35,\n \"score\": 187738.46084817822\n },\n {\n \"content\": \"/// @return phase in degrees \\n\\nfloat MonitoringData::phase(const Baseline baseline) const\\n\\n{\\n\\n const int bl = int(baseline);\\n\\n ASKAPDEBUGASSERT(bl >= 0);\\n\\n ASKAPDEBUGASSERT(bl < int(itsPhases.size()));\\n\\n return itsPhases[bl];\\n\\n}\\n\\n\\n\\n/// @brief obtain fitted delay for a given baseline \\n\\n/// @param[in] baseline baseline index \\n\\n/// @return delay in nanoseconds\\n\\ndouble MonitoringData::delay(const Baseline baseline) const\\n\\n{\\n\\n const int bl = int(baseline);\\n\\n ASKAPDEBUGASSERT(bl >= 0);\\n\\n ASKAPDEBUGASSERT(bl < int(itsDelays.size()));\\n\\n return itsDelays[bl];\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 36,\n \"score\": 187732.022651667\n },\n {\n \"content\": \"/// @file \\n\\n///\\n\\n/// @brief data monitored externally\\n\\n/// @details This is a basic structure containing a number of monitoring points\\n\\n/// such as amplitudes, delays or phases. A structure of this type is passed to \\n\\n/// a registered call back method at every new correlation cycle. Although we \\n\\n/// could've passed the CorrProducts structure which is used in the generic monitoring\\n\\n/// interface, an adapter seems worth while to avoid a tight coupling between epics part\\n\\n/// and the rest of the software correlator. In addition, we can latter add other information\\n\\n/// to the type which is not present in the CorrProducts structure.\\n\\n///\\n\\n/// @copyright (c) 2007 CSIRO\\n\\n/// Australia Telescope National Facility (ATNF)\\n\\n/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)\\n\\n/// PO Box 76, Epping NSW 1710, Australia\\n\\n/// atnf-enquiries@csiro.au\\n\\n///\\n\\n/// This file is part of the ASKAP software distribution.\\n\\n///\\n\\n/// The ASKAP software distribution is free software: you can redistribute it\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 37,\n \"score\": 187729.82266914644\n },\n {\n \"content\": \"/// and/or modify it under the terms of the GNU General Public License as\\n\\n/// published by the Free Software Foundation; either version 2 of the License,\\n\\n/// or (at your option) any later version.\\n\\n///\\n\\n/// This program is distributed in the hope that it will be useful,\\n\\n/// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n/// GNU General Public License for more details.\\n\\n///\\n\\n/// You should have received a copy of the GNU General Public License\\n\\n/// along with this program; if not, write to the Free Software\\n\\n/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\\n\\n///\\n\\n/// @author Max Voronkov <maxim.voronkov@csiro.au>\\n\\n\\n\\n#include <corrinterfaces/MonitoringData.h>\\n\\n#include <askap/AskapError.h>\\n\\n#include <casacore/casa/Quanta/MVEpoch.h>\\n\\n\\n\\n#include <sstream>\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/MonitoringData.cc\",\n \"rank\": 38,\n \"score\": 187721.2420092597\n },\n {\n \"content\": \"#!/usr/bin/env python\\n\\n\\n\\nimport math\\n\\nfrom numpy import *\\n\\n\\n\\ndef getInputParams(infilename, prefix):\\n\\n paramlist = {}\\n\\n infile = file(infilename,'rU')\\n\\n lines = infile.readlines()\\n\\n for line in lines:\\n\\n if(line[:line.find('.')+1]==prefix):\\n\\n key = line.split('=')[0][line.find('.')+1:]\\n\\n val = line.split('=')[1]\\n\\n paramlist[key.strip()] = val.strip()\\n\\n return paramlist\\n\\n\\n\\ndef getParamValue(dict, param, default):\\n\\n if(not dict.has_key(param)):\\n\\n return default\\n\\n val = dict[param]\\n\\n return val \\n\\n\\n\\ndef getParamArray(dict, param, default):\\n\\n if(not dict.has_key(param)):\\n\\n return default\\n\\n val = dict[param]\\n\\n if(val[0]!='['):\\n\\n return default\\n\\n if(val[-1]!=']'):\\n\\n return default\\n\\n return array(val.replace('[','').replace(']','').split(','))\\n\\n\\n\",\n \"file_path\": \"Code/Components/Analysis/data/current/askap/analysis/data/parsets.py\",\n \"rank\": 39,\n \"score\": 187547.72504613595\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Writing thread of the MS filler\\n\\n/// @details This class holds a shared pointer to the main filler and can call\\n\\n/// its methods to get data and to synchronise.\\n\\n/// @ingroup swcorrelator\\n\\nstruct FillerWorker {\\n\\n\\n\\n /// @brief constructor, pass the shared pointer to the filler\\n\\n FillerWorker(const boost::shared_ptr<CorrFiller> &filler);\\n\\n\\n\\n /// @brief entry point for the parallel thread\\n\\n void operator()();\\n\\n\\n\\nprivate:\\n\\n boost::shared_ptr<CorrFiller> itsFiller; \\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/FillerWorker.h\",\n \"rank\": 40,\n \"score\": 186912.22638827033\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Thread which manages a single data stream connection\\n\\n/// @details This class is initialised with two shared pointers, one to the socket \\n\\n/// corresponding to one input data stream and another corresponding to the buffer\\n\\n/// manager. Each instance (executed as a separate thread), obtains a buffer from \\n\\n/// the manager, fills it with new data and de-allocates it. The correlator thread\\n\\n/// is responsible for further processing when sufficient data are accumulated.\\n\\n/// @ingroup swcorrelator\\n\\nstruct StreamConnection {\\n\\n\\n\\n /// @brief constructor\\n\\n /// @details\\n\\n /// @param[in] socket shared pointer to the socket corresponding to this connection\\n\\n /// @param[in] bm shared pointer to the buffer manager\\n\\n StreamConnection(const boost::shared_ptr<boost::asio::ip::tcp::socket> &socket,\\n\\n const boost::shared_ptr<BufferManager> &bm);\\n\\n \\n\\n /// @brief parallel thread\\n\\n /// @details This is the main entry point to the code executed in a parallel thread\\n\\n void operator()();\\n\\n \\n\\nprivate:\\n\\n /// @details shared pointer to the socket corresponding connection managed by this instance\\n\\n boost::shared_ptr<boost::asio::ip::tcp::socket> itsSocket;\\n\\n \\n\\n /// @brief buffer manager\\n\\n boost::shared_ptr<BufferManager> itsBufferManager;\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/StreamConnection.h\",\n \"rank\": 41,\n \"score\": 186912.22638827033\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Thread which does correlation\\n\\n/// @details This class holds shared pointers to the filler and the buffer\\n\\n/// manager. The parallel thread extracts data corresponding to all three \\n\\n/// baselines, some spectral channel and beam, correlates them and passes\\n\\n/// to the filler for writing. The filler and buffer manager manage \\n\\n/// synchronisation.\\n\\n/// @ingroup swcorrelator\\n\\nstruct CorrWorker {\\n\\n\\n\\n /// @brief constructor\\n\\n /// @details \\n\\n /// @param[in] filler shared pointer to a filler\\n\\n /// @param[in] bm shared pointer to a buffer manager\\n\\n CorrWorker(const boost::shared_ptr<CorrFiller> &filler,\\n\\n const boost::shared_ptr<BufferManager> &bm);\\n\\n\\n\\n /// @brief entry point for the parallel thread\\n\\n void operator()();\\n\\n \\n\\nprivate:\\n\\n /// @brief filler\\n\\n boost::shared_ptr<CorrFiller> itsFiller;\\n\\n /// @brief buffer manager\\n\\n boost::shared_ptr<BufferManager> itsBufferManager; \\n\\n};\\n\\n\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/CorrWorker.h\",\n \"rank\": 42,\n \"score\": 186912.22638827033\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Thread which just dumps the data into binary file\\n\\n/// @details This class holds shared pointer to the buffer\\n\\n/// manager. The parallel thread extracts data when a new buffer is ready\\n\\n/// and then dumps the content into a file. This is an anternative to the\\n\\n/// correlation thread and they shouldn't be launched together (or there \\n\\n/// will be a data race).\\n\\n/// @ingroup swcorrelator\\n\\nstruct CaptureWorker {\\n\\n\\n\\n /// @brief constructor\\n\\n /// @details \\n\\n /// @param[in] bm shared pointer to a buffer manager\\n\\n /// @param[in] statsOnly if true, only statistics will be stored, not the\\n\\n /// actual data (and the same output file will be reused for different integrations)\\n\\n CaptureWorker(const boost::shared_ptr<BufferManager> &bm, const bool statsOnly = false);\\n\\n\\n\\n /// @brief entry point for the parallel thread\\n\\n void operator()();\\n\\n \\n\\n /// @brief method to simplify reading the file\\n\\n /// @details It allows to encapsulate all low-level file \\n\\n /// operations in the same file.\\n\\n /// @param[in] fname file name\\n\\n /// @return a vector with data\\n\\n static std::vector<std::complex<float> > read(const std::string &fname);\\n\\n \\n\\nprivate:\\n\\n /// @brief buffer manager\\n\\n boost::shared_ptr<BufferManager> itsBufferManager; \\n\\n \\n\\n /// @brief if true, only distribution function is to be written\\n\\n bool itsStatsOnly;\\n\\n \\n\\n /// @brief output stream to store time series for statistics\\n\\n /// @details Full flexibility is not supported, antenna/channel/beam selection is hard coded\\n\\n static std::ofstream theirOStream;\\n\\n \\n\\n /// @brief BAT time of the start, used in conjunction with the stream defined above\\n\\n static uint64_t theirStartBAT;\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/CaptureWorker.h\",\n \"rank\": 43,\n \"score\": 186912.22638827033\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Final products of correlation\\n\\n/// @details This class encapsulates the data, which is the final product of correlation, i.e\\n\\n/// visibilities for all spectral channels and baselines, flagging information and, BAT and uvw.\\n\\n/// @ingroup swcorrelator\\n\\nstruct CorrProducts : private boost::noncopyable {\\n\\n // baselines are hardcoded at the moment in the order 1-2, 2-3 and 1-3\\n\\n \\n\\n /// @brief constructor \\n\\n /// @param[in] nchan number of channels (cards)\\n\\n /// @param[in] beam beam number corresponding to this buffer\\n\\n /// @param[in] nant number of antennas\\n\\n CorrProducts(const int nchan, const int beam, const int nant = 3);\\n\\n \\n\\n /// @brief initialise the buffer for a given beam and bat\\n\\n /// @details\\n\\n /// @param[in] bat time\\n\\n void init(const uint64_t bat);\\n\\n \\n\\n /// @brief obtain the number of antennas\\n\\n /// @return number of antennas handled by this buffer\\n\\n casa::uInt nAnt() const;\\n\\n \\n\\n /// @brief obtain the number of baselines\\n\\n /// @return number of baselines handled by this buffer\\n\\n casa::uInt nBaseline() const;\\n\\n \\n\\n /// @brief baseline index for a pair of antennas\\n\\n /// @details For more than 3 antennas mapping between antennas and baselines \\n\\n /// is handy to implement inside this method\\n\\n /// @param[in] first index of the first antenna (0..nant-1)\\n\\n /// @param[in] second index of the second antenna (0..nant-1)\\n\\n /// @return baseline index (0..(nant*(nant-1)/2)-1)\\n\\n /// @note an exception is thrown if there is no matching baseline (i.e. if first >= second)\\n\\n static int baseline(const int first, const int second);\\n\\n \\n\\n /// @brief index of the first antenna for a given baseline\\n\\n /// @details It is handy to encapsulate mapping between baseline and antenna\\n\\n /// indices.\\n\\n /// @param[in] baseline baseline index (0..(nant*(nant-1)/2-1))\\n\\n /// @return index of the first antenna\\n\\n static int first(const int baseline);\\n\\n\\n\\n /// @brief index of the second antenna for a given baseline\\n\\n /// @details It is handy to encapsulate mapping between baseline and antenna\\n\\n /// indices.\\n\\n /// @param[in] baseline baseline index (0..(nant*(nant-1)/2-1))\\n\\n /// @return index of the second antenna\\n\\n static int second(const int baseline);\\n\\n \\n\\n \\n\\n /// @brief visibility buffer (dimensions are baseline and channel)\\n\\n casa::Matrix<casa::Complex> itsVisibility; \\n\\n \\n\\n /// @brief flagging information (dimensions are baseline and channel)\\n\\n casa::Matrix<casa::Bool> itsFlag;\\n\\n \\n\\n /// @brief beam index (negative value means that this buffer is not valid)\\n\\n int itsBeam;\\n\\n \\n\\n /// @brief time\\n\\n uint64_t itsBAT;\\n\\n \\n\\n /// @brief baseline spacings for all 3 baselines (rows are baselines)\\n\\n casa::Matrix<double> itsUVW;\\n\\n \\n\\n /// @brief delay vector for all 3 baselines\\n\\n /// @details We can't use W from itsUVW because it is in J2000 rather than JTRUE\\n\\n casa::Vector<double> itsDelays;\\n\\n \\n\\n /// @brief flag that uvw matrix and delay vector are filled with valid info\\n\\n bool itsUVWValid;\\n\\n\\n\\n /// @brief user defined control words for antennas 1,2 and 3\\n\\n casa::Vector<uint32_t> itsControl;\\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/CorrProducts.h\",\n \"rank\": 44,\n \"score\": 186912.22638827033\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\n/// @details The profile package is used to accumulate statistics\\n\\n/// (e.g. to produce a pie chart to investigate where processing time goes)\\n\\n/// This class represent a data structure which is accumulated for every\\n\\n/// selected method.\\n\\n/// @ingroup profile\\n\\nstruct ProfileData {\\n\\n /// @brief default constructor\\n\\n /// @details Initialises the node with default values of zero execution time and\\n\\n /// zero number of calls\\n\\n ProfileData();\\n\\n \\n\\n /// @brief constructor corresponding to the first call\\n\\n /// @details This version initialises the number of calls to one and the times to\\n\\n /// the given execution times of the first call\\n\\n /// @param[in] time execution time for the first call\\n\\n explicit ProfileData(const double time);\\n\\n\\n\\n // access to the stats\\n\\n /// @return number of calls\\n\\n inline long count() const { return itsCount; }\\n\\n\\n\\n /// @param[in] cnt counter to set\\n\\n inline void setCount(const long cnt) { itsCount = cnt;}\\n\\n\\n\\n /// @return total execution time\\n\\n inline double totalTime() const { return itsTotalTime; }\\n\\n\\n\\n /// @return longest execution time\\n\\n inline double maxTime() const { return itsMaxTime; }\\n\\n\\n\\n /// @return shortest execution time\\n\\n inline double minTime() const { return itsMinTime; }\\n\\n \\n\\n /// @brief process another execution\\n\\n /// @details This method increments total time and count and\\n\\n /// adjusts min/max statistics as required. It is called after each run of the \\n\\n /// traced method.\\n\\n /// @param[in] time execution time for this call\\n\\n void add(const double time);\\n\\n\\n\\n /// @brief process another execution\\n\\n /// @details This method merges in an additional object of the same type\\n\\n /// @param[in] other another ProfileData object\\n\\n void add(const ProfileData &other);\\n\\n \\n\\nprivate:\\n\\n /// @brief number of calls\\n\\n long itsCount;\\n\\n /// @brief total execution time\\n\\n double itsTotalTime;\\n\\n /// @brief longest execution time\\n\\n /// @note it is undefined if itsCount == 0\\n\\n double itsMaxTime;\\n\\n /// @brief shortest execution time\\n\\n /// @note it is undefined if itsCount == 0\\n\\n double itsMinTime;\\n\",\n \"file_path\": \"Code/Base/askap/current/profile/ProfileData.h\",\n \"rank\": 45,\n \"score\": 186480.37898911524\n },\n {\n \"content\": \" def set(self):\\n\\n self.__cond.acquire()\\n\\n try:\\n\\n self.__flag = True\\n\\n self.__message = \\\"\\\"\\n\\n self.__cond.notify_all()\\n\\n finally:\\n\",\n \"file_path\": \"Code/Base/py-askap/current/askap/event.py\",\n \"rank\": 46,\n \"score\": 185726.4210312904\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief Thread which manages a single data stream connection\\n\\n/// @details This class is initialised with two shared pointers, one to the socket \\n\\n/// corresponding to one input data stream and another corresponding to the buffer\\n\\n/// manager. Each instance (executed as a separate thread), obtains a buffer from \\n\\n/// the manager, fills it with new data and de-allocates it. The correlator thread\\n\\n/// is responsible for further processing when sufficient data are accumulated.\\n\\n/// This version of the class supports data stream in floats as opposed to 16 bit integers\\n\\n/// @ingroup swcorrelator\\n\\nstruct FloatStreamConnection {\\n\\n\\n\\n /// @brief constructor\\n\\n /// @details\\n\\n /// @param[in] socket shared pointer to the socket corresponding to this connection\\n\\n /// @param[in] bm shared pointer to the buffer manager\\n\\n FloatStreamConnection(const boost::shared_ptr<boost::asio::ip::tcp::socket> &socket,\\n\\n const boost::shared_ptr<BufferManager> &bm);\\n\\n \\n\\n /// @brief parallel thread\\n\\n /// @details This is the main entry point to the code executed in a parallel thread\\n\\n void operator()();\\n\\n \\n\\nprivate:\\n\\n /// @details shared pointer to the socket corresponding connection managed by this instance\\n\\n boost::shared_ptr<boost::asio::ip::tcp::socket> itsSocket;\\n\\n \\n\\n /// @brief buffer manager\\n\\n boost::shared_ptr<BufferManager> itsBufferManager;\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/FloatStreamConnection.h\",\n \"rank\": 47,\n \"score\": 185149.07113780576\n },\n {\n \"content\": \"from askap import logging\\n\\nlogger = logging.getLogger(__name__)\\n\",\n \"file_path\": \"Code/Components/Analysis/data/current/askap/analysis/data/__init__.py\",\n \"rank\": 48,\n \"score\": 184979.18263131875\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief An interface to generic buffer (for writing visibilities)\\n\\n/// @details Read-write iterator (see IDataIterator) uses the concept\\n\\n/// of buffers to store scratch data. This is an abstract interface\\n\\n/// to operations with such buffers.\\n\\n/// @ingroup dataaccess_hlp\\n\\nstruct IBufferManager : virtual public IHolder\\n\\n{\\n\\n /// @brief populate the cube with the data stored in the given buffer\\n\\n /// @details The method throws an exception if the requested buffer\\n\\n /// does not exist (prevents a shape mismatch)\\n\\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\\n\\n /// cube to fill with the complex visibility data\\n\\n /// @param[in] name a name of the buffer to work with\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n virtual void readBuffer(casa::Cube<casa::Complex> &vis,\\n\\n const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const = 0;\\n\\n \\n\\n /// @brief write the cube back to the given buffer\\n\\n /// @details This buffer is created on the first write operation\\n\\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\\n\\n /// cube to fill with the complex visibility data\\n\\n /// @param[in] name a name of the buffer to work with\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n virtual void writeBuffer(const casa::Cube<casa::Complex> &vis,\\n\\n const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const = 0;\\n\\n\\n\\n /// @brief check whether the particular buffer exists\\n\\n /// @param[in] name a name of the buffer to query\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n /// @return true, if the buffer with the given name is present\\n\\n virtual bool bufferExists(const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const = 0;\\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/IBufferManager.h\",\n \"rank\": 49,\n \"score\": 172645.5825159102\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief Helper class representing a scratch buffer\\n\\n/// @details Read-write access idiom is to work with so-called\\n\\n/// buffers, a chunk of visibility data sharing the same metadada\\n\\n/// with the main accessor (see IDataAccessor for more info).\\n\\n/// This is a helper class used between ITableDataIterator and\\n\\n/// ITableDataAccessor, which represents one scratch buffer used to\\n\\n/// cache disk information for each current iteration.\\n\\n/// @note an std::pair can be used instead, but this class gives\\n\\n/// a better looking code\\n\\n/// @ingroup dataaccess_hlp\\n\\nstruct ScratchBuffer {\\n\\n ScratchBuffer() : needsRead(true), needsFlush(false) {}\\n\\n \\n\\n /// visibility cube\\n\\n casa::Cube<casa::Complex> vis;\\n\\n /// True if the cube has to be initialized (reading is required)\\n\\n mutable bool needsRead;\\n\\n /// True if there was a write operation and the cube has to be\\n\\n /// flushed back to disk (or whatever is used for storage of buffers)\\n\\n mutable bool needsFlush;\\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/ScratchBuffer.h\",\n \"rank\": 50,\n \"score\": 172645.5825159102\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace scimath {\\n\\n\\n\\n/// @brief helper class to monitor updates of parameters\\n\\n/// @details It is often needed to monitor a change of some parameters. This class \\n\\n/// has comparison operators defined (equal and not equal). Two instances are not\\n\\n/// equal if they correspond to a different version of tracked parameters. This class\\n\\n/// can be used in various caching-related implementations where some hierarchy exists\\n\\n/// (and so different parts of the code can be concerned about changes made at a different time) \\n\\n/// It essentially wraps over an integer number which is incremented every time a\\n\\n/// tracked parameter changes. \\n\\n/// @ingroup utils\\n\\nstruct ChangeMonitor {\\n\\n /// @brief constructor\\n\\n inline ChangeMonitor() : itsTag(0) {}\\n\\n \\n\\n /// @brief check whether two monitors are equal\\n\\n /// @details\\n\\n /// @param[in] in another change monitor object\\n\\n /// @return true if this class and in are equal\\n\\n inline bool operator==(const ChangeMonitor &in) const { return in.itsTag == itsTag; }\\n\\n \\n\\n /// @brief check whether two monitors are not equal\\n\\n /// @details\\n\\n /// @param[in] in another change monitor object\\n\\n /// @return true if this class and in are not equal\\n\\n inline bool operator!=(const ChangeMonitor &in) const { return in.itsTag != itsTag; }\\n\\n \\n\\n /// @brief notify that a change has been made\\n\\n /// @details This method is supposed to be called every time a corresponding \\n\\n /// parameter has been updated.\\n\\n inline void notifyOfChanges() { ++itsTag; ASKAPCHECK(itsTag!=0, \\\"Overflow detected!\\\");}\\n\\n \\n\\nprivate: \\n\\n /// @brief integer tag\\n\\n /// @details it is incremented every time there is a change in a tracked parameter \\n\\n unsigned long itsTag;\\n\",\n \"file_path\": \"Code/Base/scimath/current/utils/ChangeMonitor.h\",\n \"rank\": 51,\n \"score\": 172642.31525703857\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n/// @brief class which can run the correlator\\n\\n/// @details This class is analogous to the main method of the stand alone correlator \\n\\n/// application. It can run the correlator, get monitoring data and stop when necessary.\\n\\n/// The primary goal for this interface is to run the software correlator from the epics\\n\\n/// CA server.\\n\\n/// @ingroup corrinterfaces\\n\\nstruct CorrRunner : private boost::noncopyable {\\n\\n \\n\\n /// @brief call back function type\\n\\n typedef void (*CallBackType)(const MonitoringData&, void* optionalData); \\n\\n \\n\\n /// @brief default constructor\\n\\n CorrRunner(); // doesn't throw\\n\\n\\n\\n /// @brief default destructor\\n\\n ~CorrRunner(); // doesn't throw\\n\\n \\n\\n /// @brief setup call back function\\n\\n /// @details If not NULL, the given function will be called every time the new data arrive.\\n\\n /// @param[in] callBackPtr pointer to the call back function\\n\\n /// @param[in[ optionalData optional pointer which is then passed to call back function\\n\\n /// @note the meaning of optionalData is user interpreted. It doesn't need to be a valid pointer\\n\\n void setCallBack(CallBackType callBackPtr = NULL, void* optionalData = NULL);\\n\\n \\n\\n /// @brief start the correlator\\n\\n /// @details This method starts all required threads and intialises the correlator using\\n\\n /// the parset.\\n\\n /// @param[in] parset parset with input parameters\\n\\n void start(const LOFAR::ParameterSet &parset); // doesn't throw\\n\\n \\n\\n /// @brief start the correlator\\n\\n /// @details This version reads the parset from the given file.\\n\\n /// @param[in] fname parset file name\\n\\n void start(const std::string &fname); // doesn't throw\\n\\n \\n\\n /// @brief stop the correlator\\n\\n /// @details This method can be called at any time to request a stop. The correlator\\n\\n /// finishes processing of the current cycle and gracefully shuts down closing the MS.\\n\\n /// @note This method must be called at the end to avoid corruption of the MS. \\n\\n static void stop(); // doesn't throw\\n\\n \\n\\n // check the status\\n\\n \\n\\n /// @brief check whether the correlator is running\\n\\n /// @details If it is not, the data in the data fields are not valid and all flags are set\\n\\n /// to true. Note, this method is thread safe and can be called asynchronously\\n\\n /// @return true if the correlator is running, false otherwise\\n\\n bool isRunning() const; // doesn't throw\\n\\n \\n\\n /// @brief obtain the status of error message\\n\\n /// @details When the correlator stops due to exception, the error message is available via\\n\\n /// this method. Note, this method is thread safe and can be called asynchronously\\n\\n std::string statusMsg() const; // doesn't throw\\n\\n \\n\\n /// @brief set status message\\n\\n /// @param[in] running true, if the correlator is running\\n\\n /// @param[in] msg status/error message\\n\\n void setStatus(const bool running, const std::string &msg = \\\"OK\\\"); // doesn't throw\\n\\n\\n\\nprivate: \\n\\n // current execution status\\n\\n\\n\\n /// @brief true if the correlator is running, false otherwise\\n\\n bool itsIsRunning;\\n\\n\\n\\n /// @brief error or status message\\n\\n std::string itsStatus;\\n\\n\\n\\n /// @brief mutex to protect status message and the running state\\n\\n mutable boost::mutex itsStatusMutex;\\n\\n \\n\\n /// @brief main correlator thread \\n\\n /// @details This class is executed in the main epics thread. The methods like start and stop\\n\\n /// return the control without waiting. The correlator is executed in a separate thread (where\\n\\n /// it spawns its own child threads)\\n\\n boost::thread itsCorrelatorThread; \\n\\n \\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/CorrRunner.h\",\n \"rank\": 52,\n \"score\": 172577.33487871944\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace synthesis {\\n\\n\\n\\n/// @brief Interface to a basic illumination pattern\\n\\n/// @details This class is an abstract base (i.e. an interface) to \\n\\n/// an hierarchy of classes representing illumination patterns.\\n\\n/// It provides a method to obtain illumination pattern by populating a \\n\\n/// pre-defined grid supplied as a UVPattern object. \\n\\n/// @ingroup gridding\\n\\nstruct IBasicIllumination {\\n\\n \\n\\n /// @brief obtain illumination pattern\\n\\n /// @details This is the main method which populates the \\n\\n /// supplied uv-pattern with the values corresponding to the model\\n\\n /// represented by this object. It has to be overridden in the \\n\\n /// derived classes. An optional phase slope can be applied to\\n\\n /// simulate offset pointing.\\n\\n /// @param[in] freq frequency in Hz for which an illumination pattern is required\\n\\n /// @param[in] pattern a UVPattern object to fill\\n\\n /// @param[in] l angular offset in the u-direction (in radians)\\n\\n /// @param[in] m angular offset in the v-direction (in radians)\\n\\n /// @param[in] pa parallactic angle, or strictly speaking the angle between \\n\\n /// uv-coordinate system and the system where the pattern is defined\\n\\n virtual void getPattern(double freq, UVPattern &pattern, double l = 0., \\n\\n double m = 0., double pa = 0.) const = 0;\\n\\n \\n\\n /// @brief check whether the pattern is symmetric\\n\\n /// @details Some illumination patterns are trivial and it may be known a priori that\\n\\n /// the pattern does not depend on the parallactic angle. This method allows to check\\n\\n /// whether such trivial case exists. If true is returned, getPattern ignores pa\\n\\n /// parameter.\\n\\n /// @return true if the pattern is symmetric, false otherwise\\n\\n virtual bool isSymmetric() const = 0;\\n\\n \\n\\n /// @brief empty virtual destructor to keep the compiler happy\\n\\n virtual ~IBasicIllumination();\\n\\n};\\n\\n\\n\\n} // namespace synthesis\\n\\n\\n\",\n \"file_path\": \"Code/Components/Synthesis/synthesis/current/gridding/IBasicIllumination.h\",\n \"rank\": 53,\n \"score\": 170703.22094502096\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief A class to manage buffers stored in subtable\\n\\n/// @details Read-write iterator (see IDataIterator) uses the concept\\n\\n/// of buffers to store scratch data. This class stores buffers in the\\n\\n/// BUFFERS subtable \\n\\n/// @ingroup dataaccess_tab\\n\\nstruct TableBufferManager : virtual public IBufferManager,\\n\\n virtual protected TableHolder\\n\\n{\\n\\n /// construct the object and link it to the given buffers subtable\\n\\n /// @param[in] tab subtable to use\\n\\n TableBufferManager(const casa::Table &tab);\\n\\n \\n\\n /// @brief populate the cube with the data stored in the given buffer\\n\\n /// @details The method throws an exception if the requested buffer\\n\\n /// does not exist (prevents a shape mismatch)\\n\\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\\n\\n /// cube to fill with the complex visibility data\\n\\n /// @param[in] name a name of the buffer to work with\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n virtual void readBuffer(casa::Cube<casa::Complex> &vis,\\n\\n const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const;\\n\\n \\n\\n /// @brief write the cube back to the given buffer\\n\\n /// @details This buffer is created on the first write operation\\n\\n /// @param[in] vis a reference to the nRow x nChannel x nPol buffer\\n\\n /// cube to fill with the complex visibility data\\n\\n /// @param[in] name a name of the buffer to work with\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n virtual void writeBuffer(const casa::Cube<casa::Complex> &vis,\\n\\n const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const;\\n\\n\\n\\n /// @brief check whether the particular buffer exists\\n\\n /// @param[in] name a name of the buffer to query\\n\\n /// @return true, if the buffer with the given name is present\\n\\n /// @param[in] index a sequential index in the buffer\\n\\n virtual bool bufferExists(const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const;\\n\\nprotected:\\n\\n // templated methods to handle cubes of different types\\n\\n\\n\\n /// @brief populate the cube with the data stored in the given table cell\\n\\n /// @details The method throws an exception if the requested table cell\\n\\n /// does not exist\\n\\n /// @param[in] cube a reference to a cube of some type\\n\\n /// @param[in] name a name of the column to work with\\n\\n /// @param[in] index row number\\n\\n template<typename T>\\n\\n void readCube(casa::Cube<T> &cube, const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const;\\n\\n \\n\\n /// @brief write the cube back to the table\\n\\n /// @details The table cell is populated with values on the first write \\n\\n /// operation\\n\\n /// @param[in] cube to take the data from \\n\\n /// @param[in] name a name of the column to work with\\n\\n /// @param[in] index row number\\n\\n template<typename T>\\n\\n void writeCube(const casa::Cube<T> &cube, const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const;\\n\\n\\n\\n /// @brief check whether a particular table cell exists\\n\\n /// @param[in] name a name of the table column to query\\n\\n /// @param[in] index row number \\n\\n /// @return true, if the given cell exists and has an array\\n\\n /// @note template type defined the type of the data\\n\\n template<typename T>\\n\\n bool cellDefined(const std::string &name,\\n\\n\\t\\t\\t casa::uInt index) const; \\t\\t\\t \\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/TableBufferManager.h\",\n \"rank\": 54,\n \"score\": 170656.65728011035\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\n namespace synthesis {\\n\\n\\n\\n /// @brief Base class for monitor of Deconvolver\\n\\n /// @details All the monitoring is delegated to this class so that\\n\\n /// more control is possible.\\n\\n /// @ingroup Deconvolver\\n\\n template<class T> class DeconvolverMonitor {\\n\\n\\n\\n public:\\n\\n typedef boost::shared_ptr<DeconvolverMonitor<T> > ShPtr;\\n\\n\\n\\n DeconvolverMonitor();\\n\\n\\n\\n virtual ~DeconvolverMonitor() {};\\n\\n\\n\\n /// Monitor the current state\\n\\n virtual void monitor(const DeconvolverState<T>& ds);\\n\\n\\n\\n /// @brief configure basic parameters\\n\\n /// @details This method encapsulates extraction of basic parameters from the parset.\\n\\n /// @param[in] parset parset\\n\\n virtual void configure(const LOFAR::ParameterSet &parset);\\n\\n\\n\\n private:\\n\\n\\n\\n casa::Bool itsVerbose;\\n\\n casa::uInt itsLogEvery;\\n\\n };\\n\\n\\n\\n } // namespace synthesis\\n\\n\\n\",\n \"file_path\": \"Code/Components/Synthesis/synthesis/current/deconvolution/DeconvolverMonitor.h\",\n \"rank\": 55,\n \"score\": 170653.44498713134\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace swcorrelator {\\n\\n\\n\\n// forward declaration to allow passing a pointer\\n\\nstruct CorrRunner;\\n\\n\\n\\n/// @brief parallel thread which runs the correlator\\n\\n/// @details This class is analogous to the main method of the stand alone correlator \\n\\n/// application. It can run the correlator, get monitoring data and stop when necessary.\\n\\n/// The primary goal for this interface is to run the software correlator from the epics\\n\\n/// CA server. We use parallel thread to get the asynchronous behavior. This class represents\\n\\n/// the child thread and CorrRunner the main thread.\\n\\n/// @ingroup corrinterfaces\\n\\nstruct CorrRunnerThread {\\n\\n \\n\\n /// @brief constructor\\n\\n /// @details\\n\\n /// @param[in] parent shared pointer to an instance of the main thread class\\n\\n /// @param[in] parset shared pointer to the parset\\n\\n CorrRunnerThread(const boost::shared_ptr<CorrRunner> &parent, const boost::shared_ptr<LOFAR::ParameterSet> &parset);\\n\\n \\n\\n /// @brief the entry point for the parallel thread\\n\\n void operator()();\\n\\n \\n\\n /// @brief stop the correlator\\n\\n /// @details This method can be called at any time to request a stop. The correlator\\n\\n /// finishes processing of the current cycle and gracefully shuts down closing the MS.\\n\\n /// @note This method must be called at the end to avoid corruption of the MS. \\n\\n static void stop(); // doesn't throw\\n\\n \\n\\nprivate:\\n\\n /// @brief shared pointer to an instance of the main thread class (to allow status update) \\n\\n boost::shared_ptr<CorrRunner> itsParent;\\n\\n \\n\\n /// @brief shared pointer to the parset with parameters\\n\\n boost::shared_ptr<LOFAR::ParameterSet> itsParset;\\n\\n};\\n\\n\\n\\n} // namespace swcorrelator\\n\\n\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/corrinterfaces/CorrRunnerThread.h\",\n \"rank\": 56,\n \"score\": 170589.55778956076\n },\n {\n \"content\": \"namespace askap {\\n\\nnamespace cp {\\n\\nnamespace sms {\\n\\nnamespace datamodel {\\n\\n\\n\\n// Map C++ bool to an INT NOT NULL database type\\n\\n#pragma db value(bool) type(\\\"INT\\\")\\n\\n\\n\\n/// @brief Datamodel class for ancillary data source information.\\n\\n/// This is primarily intended to identify the source of seed data\\n\\n/// that did not come from ASKAP observations.\\n\\n\\n\\n// Do not edit the version of this file in the `datamodel` directory, as it is\\n\\n// a copy of the files in the `schema` directory.\\n\\n\\n\\n#pragma db object optimistic\\n\\nstruct DataSource {\\n\\n DataSource() {}\\n\\n\\n\\n // @brief Optimistic concurrency lock version\\n\\n // @units none\\n\\n #pragma db version\\n\\n version_type version;\\n\\n\\n\\n // @brief Primary key unique identifier\\n\\n // @units none\\n\\n #pragma db index\\n\\n #pragma db id auto\\n\\n id_type data_source_id;\\n\\n\\n\\n // Include the fields generated from the design spreadsheet\\n\\n #include \\\"DataSource.i\\\"\\n\\n};\\n\\n\\n\\n};\\n\\n};\\n\\n};\\n\",\n \"file_path\": \"Code/Components/Services/skymodel/current/schema/DataSource.h\",\n \"rank\": 57,\n \"score\": 170326.99383463658\n },\n {\n \"content\": \"namespace askap {\\n\\nnamespace cp {\\n\\nnamespace sms {\\n\\nnamespace datamodel {\\n\\n\\n\\n// Map C++ bool to an INT NOT NULL database type\\n\\n#pragma db value(bool) type(\\\"INT\\\")\\n\\n\\n\\n/// @brief Datamodel class for ancillary data source information.\\n\\n/// This is primarily intended to identify the source of seed data\\n\\n/// that did not come from ASKAP observations.\\n\\n\\n\\n// Do not edit the version of this file in the `datamodel` directory, as it is\\n\\n// a copy of the files in the `schema` directory.\\n\\n\\n\\n#pragma db object optimistic\\n\\nstruct DataSource {\\n\\n DataSource() {}\\n\\n\\n\\n // @brief Optimistic concurrency lock version\\n\\n // @units none\\n\\n #pragma db version\\n\\n version_type version;\\n\\n\\n\\n // @brief Primary key unique identifier\\n\\n // @units none\\n\\n #pragma db index\\n\\n #pragma db id auto\\n\\n id_type data_source_id;\\n\\n\\n\\n // Include the fields generated from the design spreadsheet\\n\\n #include \\\"DataSource.i\\\"\\n\\n};\\n\\n\\n\\n};\\n\\n};\\n\\n};\\n\",\n \"file_path\": \"Code/Components/Services/skymodel/current/datamodel/DataSource.h\",\n \"rank\": 58,\n \"score\": 170326.99383463658\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief general exception class used in the data access layer\\n\\n/// @ingroup dataaccess_i\\n\\nstruct DataAccessError : public AskapError\\n\\n{\\n\\n /// constructor - pass the message to the base class\\n\\n ///\\n\\n /// @param message a string message explaining what happens\\n\\n ///\\n\\n explicit DataAccessError(const std::string& message);\\n\\n};\\n\\n\\n\\n/// @brief exception class indicating a logic error in the data access layer\\n\\nstruct DataAccessLogicError : public DataAccessError\\n\\n{\\n\\n /// constructor - pass the message to the base class\\n\\n ///\\n\\n /// @param message a string message explaining what happens\\n\\n ///\\n\\n explicit DataAccessLogicError(const std::string& message);\\n\\n};\\n\\n\\n\\n} // namespace askap\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/DataAccessError.h\",\n \"rank\": 59,\n \"score\": 170326.99383463658\n },\n {\n \"content\": \"namespace askap {\\n\\nnamespace cp {\\n\\nnamespace sms {\\n\\n\\n\\n// Alias for the Ice type namespace\\n\\nnamespace ice_interfaces = askap::interfaces::skymodelservice;\\n\\n\\n\\n/// @brief Transfers data from the datamodel::ContinuumComponent class to the\\n\\n/// Ice DTO class. If present, polarisation data will be added to the optional\\n\\n/// polarisation member of ContinuumComponent.\\n\\n///\\n\\n/// @param[in] components Pointer to a vector of components for transfer.\\n\\n/// @throw AskapError Thrown if there are errors.\\n\\n/// @return askap::interfaces::skymodelservice::ComponentSeq\\n\\nice_interfaces::ComponentSeq marshallComponentsToDTO(\\n\\n boost::shared_ptr< std::vector<datamodel::ContinuumComponent> > components)\\n\\n{\\n\\n // This might be nice if I can define a conversion operator from\\n\\n // datamodel::ContinuumComponent to ice_interfaces::ContinuumComponent\\n\\n // But unfortunately, both source and destination classes are produced by\\n\\n // the corresponding systems (Ice slice compiler, ODB class generation),\\n\\n // so I have no easy way to define the conversion. Doing it manually isn't\\n\\n // too bad though due to the code generation.\\n\\n //return ice_interfaces::ComponentSeq(components->begin(), components->end());\\n\\n\\n\\n // preallocate space for more efficient allocation\\n\\n ice_interfaces::ComponentSeq dst(components->size());\\n\\n\\n\\n int i = 0;\\n\\n for (std::vector<datamodel::ContinuumComponent>::const_iterator it = components->begin();\\n\\n it != components->end();\\n\\n it++, i++) {\\n\\n\\n\\n // Copy the component data\\n\\n dst[i].componentId = it->component_id;\\n\\n dst[i].ra = it->ra;\\n\\n dst[i].dec = it->dec;\\n\\n dst[i].raErr = it->ra_err;\\n\\n dst[i].decErr = it->dec_err;\\n\\n dst[i].freq = it->freq;\\n\\n dst[i].fluxPeak = it->flux_peak;\\n\\n dst[i].fluxPeakErr = it->flux_peak_err;\\n\\n dst[i].fluxInt = it->flux_int;\\n\\n dst[i].fluxIntErr = it->flux_int_err;\\n\\n dst[i].spectralIndex = it->spectral_index;\\n\\n dst[i].spectralCurvature = it->spectral_curvature;\\n\\n\\n\\n // polarisation may not be present\\n\\n if (it->polarisation.get()) {\\n\\n const datamodel::Polarisation* src_pol = it->polarisation.get();\\n\\n\\n\\n // I need to profile how the performance of stack instance followed\\n\\n // by assignment to the vector compares to the resize and assign\\n\\n // members in place. On the surface, it is comparing a default ctor, field assignment, and copy ctor\\n\\n // to default ctor and field assignment. I hope to avoid the additional\\n\\n // copy when pushing the stack instance into the vectory.\\n\\n // Of course, the compiler could be doing all sorts of optimisations, so\\n\\n // sticking to the clearer code is probably best.\\n\\n ice_interfaces::ContinuumComponentPolarisation dst_pol;\\n\\n\\n\\n // Or:\\n\\n //dst[i].polarisation.resize(1);\\n\\n // And then:\\n\\n //dst[i].polarisation[0].polPeakFit = src_pol->pol_peak_fit;\\n\\n\\n\\n dst_pol.lambdaRefSq = src_pol->lambda_ref_sq;\\n\\n dst_pol.polPeakFit = src_pol->pol_peak_fit;\\n\\n dst_pol.polPeakFitDebias = src_pol->pol_peak_fit_debias;\\n\\n dst_pol.polPeakFitErr = src_pol->pol_peak_fit_err;\\n\\n dst_pol.polPeakFitSnr = src_pol->pol_peak_fit_snr;\\n\\n dst_pol.polPeakFitSnrErr = src_pol->pol_peak_fit_snr_err;\\n\\n dst_pol.fdPeakFit = src_pol->fd_peak_fit;\\n\\n dst_pol.fdPeakFitErr = src_pol->fd_peak_fit_err;\\n\\n\\n\\n // Assign our stack variable to the vector. Hopefully the additional\\n\\n // copy constructor gets optimised away.\\n\\n dst[i].polarisation.push_back(dst_pol);\\n\\n } // end of polarisation branch\\n\\n } // end of component loop\\n\\n\\n\\n\\n\\n return dst;\\n\\n}\\n\\n\\n\\n\\n\\n}\\n\\n}\\n\",\n \"file_path\": \"Code/Components/Services/skymodel/current/service/DataMarshalling.h\",\n \"rank\": 60,\n \"score\": 170326.99383463658\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief A stubbed implementation of the data accessor\\n\\n/// @ingroup dataaccess_hlp\\n\\nstruct DataAccessorStub : virtual public IFlagDataAccessor\\n\\n{\\n\\n /// Default version can fill with MIRANdA data\\n\\n DataAccessorStub(const bool fill=false);\\n\\n\\t\\n\\n /// The number of rows in this chunk\\n\\n /// @return the number of rows in this chunk\\n\\n virtual casa::uInt nRow() const throw();\\n\\n\\n\\n // The following methods implement metadata access\\n\\n\\t\\t\\n\\n /// The number of spectral channels (equal for all rows)\\n\\n /// @return the number of spectral channels\\n\\n virtual casa::uInt nChannel() const throw();\\n\\n\\n\\n /// The number of polarization products (equal for all rows)\\n\\n /// @return the number of polarization products (can be 1,2 or 4)\\n\\n virtual casa::uInt nPol() const throw();\\n\\n\\n\\n\\n\\n /// First antenna IDs for all rows\\n\\n /// @return a vector with IDs of the first antenna corresponding\\n\\n /// to each visibility (one for each row)\\n\\n virtual const casa::Vector<casa::uInt>& antenna1() const;\\n\\n\\n\\n /// Second antenna IDs for all rows\\n\\n /// @return a vector with IDs of the second antenna corresponding\\n\\n /// to each visibility (one for each row)\\n\\n virtual const casa::Vector<casa::uInt>& antenna2() const;\\n\\n\\t\\n\\n /// First feed IDs for all rows\\n\\n /// @return a vector with IDs of the first feed corresponding\\n\\n /// to each visibility (one for each row)\\n\\n virtual const casa::Vector<casa::uInt>& feed1() const;\\n\\n \\n\\n /// Second feed IDs for all rows\\n\\n /// @return a vector with IDs of the second feed corresponding\\n\\n /// to each visibility (one for each row)\\n\\n virtual const casa::Vector<casa::uInt>& feed2() const;\\n\\n \\n\\n /// Position angles of the first feed for all rows\\n\\n /// @return a vector with position angles (in radians) of the\\n\\n /// first feed corresponding to each visibility\\n\\n virtual const casa::Vector<casa::Float>& feed1PA() const;\\n\\n \\n\\n /// Position angles of the second feed for all rows\\n\\n /// @return a vector with position angles (in radians) of the\\n\\n /// second feed corresponding to each visibility\\n\\n virtual const casa::Vector<casa::Float>& feed2PA() const;\\n\\n \\n\\n /// Return pointing centre directions of the first antenna/feed\\n\\n /// @return a vector with direction measures (coordinate system\\n\\n /// is determined by the data accessor), one direction for each\\n\\n /// visibility/row\\n\\n virtual const casa::Vector<casa::MVDirection>& pointingDir1() const;\\n\\n \\n\\n /// Pointing centre directions of the second antenna/feed\\n\\n /// @return a vector with direction measures (coordinate system\\n\\n /// is determined by the data accessor), one direction for each\\n\\n /// visibility/row\\n\\n virtual const casa::Vector<casa::MVDirection>& pointingDir2() const;\\n\\n\\n\\n /// pointing direction for the centre of the first antenna \\n\\n /// @details The same as pointingDir1, if the feed offsets are zero\\n\\n /// @return a vector with direction measures (coordinate system\\n\\n /// is is set via IDataConverter), one direction for each\\n\\n /// visibility/row\\n\\n virtual const casa::Vector<casa::MVDirection>& dishPointing1() const;\\n\\n\\n\\n /// pointing direction for the centre of the first antenna \\n\\n /// @details The same as pointingDir2, if the feed offsets are zero\\n\\n /// @return a vector with direction measures (coordinate system\\n\\n /// is is set via IDataConverter), one direction for each\\n\\n /// visibility/row\\n\\n virtual const casa::Vector<casa::MVDirection>& dishPointing2() const;\\n\\n \\n\\n /// Visibilities (a cube is nRow x nChannel x nPol; each element is\\n\\n /// a complex visibility)\\n\\n /// @return a reference to nRow x nChannel x nPol cube, containing\\n\\n /// all visibility data\\n\\n /// TODO:\\n\\n /// a non-const version to be able to subtract the model\\n\\n virtual const casa::Cube<casa::Complex>& visibility() const;\\n\\n\\n\\n /// Read-write visibilities (a cube is nRow x nChannel x nPol; \\n\\n /// each element is a complex visibility)\\n\\n /// \\n\\n /// @return a reference to nRow x nChannel x nPol cube, containing\\n\\n /// all visibility data\\n\\n ///\\n\\n virtual casa::Cube<casa::Complex>& rwVisibility();\\n\\n\\n\\n\\n\\n /// Cube of flags corresponding to the output of visibility() \\n\\n /// @return a reference to nRow x nChannel x nPol cube with flag \\n\\n /// information. If True, the corresponding element is flagged.\\n\\n virtual const casa::Cube<casa::Bool>& flag() const;\\n\\n\\n\\n /// Non-const access to the cube of flags.\\n\\n /// @return a reference to nRow x nChannel x nPol cube with the flag\\n\\n /// information. If True, the corresponding element is flagged.\\n\\n virtual casa::Cube<casa::Bool>& rwFlag();\\n\\n\\n\\n \\n\\n /// Noise level required for a proper weighting\\n\\n /// @return a reference to nRow x nChannel x nPol cube with\\n\\n /// complex noise estimates\\n\\n virtual const casa::Cube<casa::Complex>& noise() const;\\n\\n\\n\\n /// UVW\\n\\n /// @return a reference to vector containing uvw-coordinates\\n\\n /// packed into a 3-D rigid vector\\n\\n virtual const casa::Vector<casa::RigidVector<casa::Double, 3> >&\\n\\n uvw() const;\\n\\n \\n\\n /// @brief uvw after rotation\\n\\n /// @details This method calls UVWMachine to rotate baseline coordinates \\n\\n /// for a new tangent point. Delays corresponding to this correction are\\n\\n /// returned by a separate method.\\n\\n /// @param[in] tangentPoint tangent point to rotate the coordinates to\\n\\n /// @return uvw after rotation to the new coordinate system for each row\\n\\n virtual const casa::Vector<casa::RigidVector<casa::Double, 3> >&\\n\\n\\t rotatedUVW(const casa::MDirection &tangentPoint) const;\\n\\n\\t \\n\\n /// @brief delay associated with uvw rotation\\n\\n /// @details This is a companion method to rotatedUVW. It returns delays corresponding\\n\\n /// to the baseline coordinate rotation. An additional delay corresponding to the \\n\\n /// translation in the tangent plane can also be applied using the image \\n\\n /// centre parameter. Set it to tangent point to apply no extra translation.\\n\\n /// @param[in] tangentPoint tangent point to rotate the coordinates to\\n\\n /// @param[in] imageCentre image centre (additional translation is done if imageCentre!=tangentPoint)\\n\\n /// @return delays corresponding to the uvw rotation for each row\\n\\n virtual const casa::Vector<casa::Double>& uvwRotationDelay(\\n\\n\\t const casa::MDirection &tangentPoint, const casa::MDirection &imageCentre) const;\\n\\n \\n\\n \\n\\n /// Timestamp for each row\\n\\n /// @return a timestamp for this buffer (it is always the same\\n\\n /// for all rows. The timestamp is returned as \\n\\n /// Double w.r.t. the origin specified by the \\n\\n /// DataSource object and in that reference frame\\n\\n virtual casa::Double time() const;\\n\\n \\n\\n \\n\\n /// Frequency for each channel\\n\\n /// @return a reference to vector containing frequencies for each\\n\\n /// spectral channel (vector size is nChannel). Frequencies\\n\\n /// are given as Doubles, the frame/units are specified by\\n\\n /// the DataSource object\\n\\n virtual const casa::Vector<casa::Double>& frequency() const;\\n\\n\\n\\n /// Velocity for each channel\\n\\n /// @return a reference to vector containing velocities for each\\n\\n /// spectral channel (vector size is nChannel). Velocities\\n\\n /// are given as Doubles, the frame/units are specified by\\n\\n /// the DataSource object (via IDataConverter).\\n\\n virtual const casa::Vector<casa::Double>& velocity() const;\\n\\n\\n\\n /// @brief polarisation type for each product\\n\\n /// @return a reference to vector containing polarisation types for\\n\\n /// each product in the visibility cube (nPol() elements).\\n\\n /// @note All rows of the accessor have the same structure of the visibility\\n\\n /// cube, i.e. polarisation types returned by this method are valid for all rows.\\n\\n virtual const casa::Vector<casa::Stokes::StokesTypes>& stokes() const;\\n\\n \\n\\n//private: // to be able to change stubbed data directly, if necessary\\n\\n // cached results which are filled from an appropriate table\\n\\n // when necessary (they probably have to be moved to DataSource)\\n\\n /// cached antenna1\\n\\n mutable casa::Vector<casa::uInt> itsAntenna1;\\n\\n /// cached antenna2\\n\\n mutable casa::Vector<casa::uInt> itsAntenna2;\\n\\n /// cached feed1\\n\\n mutable casa::Vector<casa::uInt> itsFeed1;\\n\\n /// cached feed2\\n\\n mutable casa::Vector<casa::uInt> itsFeed2;\\n\\n /// cached feed1 position angle\\n\\n mutable casa::Vector<casa::Float> itsFeed1PA;\\n\\n /// cached feed2 position angle\\n\\n mutable casa::Vector<casa::Float> itsFeed2PA;\\n\\n /// cached pointing direction of the first antenna/feed\\n\\n mutable casa::Vector<casa::MVDirection> itsPointingDir1;\\n\\n /// cached pointing direction of the second antenna/feed\\n\\n mutable casa::Vector<casa::MVDirection> itsPointingDir2;\\n\\n /// cached pointing direction of the centre of the first antenna\\n\\n mutable casa::Vector<casa::MVDirection> itsDishPointing1;\\n\\n /// cached pointing direction of the centre of the second antenna\\n\\n mutable casa::Vector<casa::MVDirection> itsDishPointing2;\\n\\n /// cached visibility\\n\\n mutable casa::Cube<casa::Complex> itsVisibility;\\n\\n /// cached flag\\n\\n mutable casa::Cube<casa::Bool> itsFlag;\\n\\n /// cached uvw\\n\\n mutable casa::Vector<casa::RigidVector<casa::Double, 3> > itsUVW;\\n\\n /// cached noise\\n\\n mutable casa::Cube<casa::Complex> itsNoise;\\n\\n /// cached time\\n\\n mutable casa::Double itsTime;\\n\\n /// cached frequency\\n\\n mutable casa::Vector<casa::Double> itsFrequency;\\n\\n /// cached velocity\\n\\n mutable casa::Vector<casa::Double> itsVelocity;\\n\\n /// cached uvw-rotation delay \\n\\n mutable casa::Vector<casa::Double> itsUVWRotationDelay;\\n\\n /// cached polarisation types\\n\\n mutable casa::Vector<casa::Stokes::StokesTypes> itsStokes;\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/DataAccessorStub.h\",\n \"rank\": 61,\n \"score\": 170326.99383463658\n },\n {\n \"content\": \"class MonitoringBuffer(object):\\n\\n def __init__(self):\\n\\n \\\"\\\"\\\"Thread safe buffer of monitoring points\\\"\\\"\\\"\\n\\n self._mutex = ReadWriteMutex()\\n\\n self._buffer = {}\\n\\n\\n\\n def add_points(self, points, timetag=None):\\n\\n \\\"\\\"\\\"Add a :class:`dict` of point(s) to the buffer. This is to support points\\n\\n without metadata (old-style monitoring points)\\\"\\\"\\\"\\n\\n try:\\n\\n timestamp = timetag or bat_now()\\n\\n self._mutex.acquire_write_lock()\\n\\n for k, v in points.items():\\n\\n self._buffer[k] = {'value': v, 'name': k,\\n\\n 'timestamp': timestamp}\\n\\n finally:\\n\\n self._mutex.release_write_lock()\\n\\n\\n\\n def add_full_points(self, points):\\n\\n \\\"\\\"\\\" points is a list of dict, each is a monitor point \\\"\\\"\\\"\\n\\n try:\\n\\n self._mutex.acquire_write_lock()\\n\\n for point in points:\\n\\n name = point['name']\\n\\n mon_point = {'name': name,\\n\\n 'timestamp': point.get('timestamp', bat_now()),\\n\\n 'unit': point.get('unit', ''),\\n\\n 'status': point.get('status', 'OK'),\\n\\n 'value': point['value']}\\n\\n self._buffer[name] = mon_point\\n\\n finally:\\n\\n self._mutex.release_write_lock()\\n\\n\\n\\n def add(self, name, value, timestamp=None, status=\\\"OK\\\", unit=\\\"\\\"):\\n\\n \\\"\\\"\\\"Add a monitor point with metadata\\\"\\\"\\\"\\n\\n try:\\n\\n timestamp = timestamp or bat_now()\\n\\n point = {'name': name, 'timestamp': timestamp,\\n\\n 'unit': unit,\\n\\n 'status': status,\\n\\n 'value': value}\\n\\n self._mutex.acquire_write_lock()\\n\\n self._buffer[name] = point\\n\\n finally:\\n\\n self._mutex.release_write_lock()\\n\\n\\n\\n def remove(self, keys):\\n\\n points = keys\\n\\n if isinstance(keys, basestring):\\n\\n points = (keys,)\\n\\n try:\\n\\n self._mutex.acquire_write_lock()\\n\\n for k in points:\\n\\n if k in self._buffer:\\n\\n self._buffer.pop(k)\\n\\n finally:\\n\\n self._mutex.release_write_lock()\\n\\n\\n\\n def clear(self):\\n\\n \\\"\\\"\\\"\\n\\n Clear the buffer\\n\\n \\\"\\\"\\\"\\n\\n try:\\n\\n self._mutex.acquire_write_lock()\\n\\n self._buffer.clear()\\n\\n finally:\\n\\n self._mutex.release_write_lock()\\n\\n\\n\\n def get(self, keys):\\n\\n \\\"\\\"\\\"Get given point names `keys` from buffer\\n\\n\\n\\n :param list keys: a list of point names.\\n\\n\\n\\n \\\"\\\"\\\"\\n\\n if isinstance(keys, basestring):\\n\\n keys = (keys,)\\n\\n try:\\n\\n self._mutex.acquire_read_lock()\\n\\n return [self._buffer[k] for k in keys if k in self._buffer]\\n\\n finally:\\n\",\n \"file_path\": \"Code/Base/py-iceutils/current/askap/iceutils/monitoringprovider.py\",\n \"rank\": 62,\n \"score\": 169032.64104016824\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace synthesis {\\n\\n\\n\\n/// @brief A measurement equation, which does nothing.\\n\\n/// @details The current calibration class requires a perfect measurement\\n\\n/// equation. This class has been written to be able to use the same code \\n\\n/// for both applying a calibration and solving for parameters. It is \\n\\n/// a void measurement equation in the sense that it does nothing to the \\n\\n/// data or normal equations given to it.\\n\\n/// @ingroup measurementequation\\n\\nstruct VoidMeasurementEquation : public IMeasurementEquation\\n\\n{\\n\\n /// @brief Predict model visibilities for one accessor (chunk).\\n\\n /// @details This prediction is done for single chunk of data only. \\n\\n /// It seems that all measurement equations should work with accessors \\n\\n /// rather than iterators (i.e. the iteration over chunks should be \\n\\n /// moved to the higher level, outside this class). \\n\\n /// @param[in] chunk a read-write accessor to work with\\n\\n virtual void predict(accessors::IDataAccessor &chunk) const;\\n\\n\\n\\n /// @brief Calculate the normal equation for one accessor (chunk).\\n\\n /// @details This calculation is done for a single chunk of\\n\\n /// data only (one iteration).It seems that all measurement\\n\\n /// equations should work with accessors rather than iterators\\n\\n /// (i.e. the iteration over chunks should be moved to the higher\\n\\n /// level, outside this class). \\n\\n /// @param[in] chunk a read-write accessor to work with\\n\\n /// @param[in] ne Normal equations\\n\\n virtual void calcEquations(const accessors::IConstDataAccessor &chunk,\\n\\n askap::scimath::INormalEquations& ne) const;\\n\\n};\\n\\n\\n\\n} // namespace synthesis\\n\\n\\n\",\n \"file_path\": \"Code/Components/Synthesis/synthesis/current/measurementequation/VoidMeasurementEquation.h\",\n \"rank\": 63,\n \"score\": 168826.5319338146\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace synthesis {\\n\\n\\n\\n/// @brief Basic composite illumination pattern\\n\\n/// @details This class is implements an basic composite illumination pattern corresponding\\n\\n/// to a given weights and offsets of physical feeds. It can be used for simulation and/or\\n\\n/// imaging with a synthetic beam. As an implementation of IBasicIllumination interface, \\n\\n/// this class provides a method to obtain illumination pattern by populating a pre-defined \\n\\n/// grid supplied as a UVPattern object. \\n\\n/// @note It looks like handling of illumination patterns\\n\\n/// inside gridders has to be generalised (i.e. main method should receive a full accessor\\n\\n/// with all the metadata instead of just the pointing offsets, frequency, etc). Such \\n\\n/// transition would definitely require an interface change in this class.\\n\\n/// @ingroup gridding\\n\\nstruct BasicCompositeIllumination : public IBasicIllumination {\\n\\n /// @brief construct the pattern using given weights and offsets\\n\\n /// @param[in] pattern single-feed illumination pattern (assumed the same for all feeds)\\n\\n /// @param[in] feedOffsets offsets of physical feeds in radians\\n\\n /// @param[in] weights complex weights for each feed\\n\\n /// @note The size of two vectors should be the same\\n\\n BasicCompositeIllumination(const boost::shared_ptr<IBasicIllumination> &pattern,\\n\\n const casa::Vector<casa::RigidVector<casa::Double, 2> > &feedOffsets,\\n\\n const casa::Vector<casa::Complex> &weights); \\n\\n \\n\\n /// @brief obtain illumination pattern\\n\\n /// @details This is the main method which populates the \\n\\n /// supplied uv-pattern with the values corresponding to the model\\n\\n /// represented by this object. It has to be overridden in the \\n\\n /// derived classes. An optional phase slope can be applied to\\n\\n /// simulate offset pointing.\\n\\n /// @param[in] freq frequency in Hz for which an illumination pattern is required\\n\\n /// @param[in] pattern a UVPattern object to fill\\n\\n /// @param[in] l angular offset in the u-direction (in radians)\\n\\n /// @param[in] m angular offset in the v-direction (in radians)\\n\\n /// @param[in] pa parallactic angle (in radians), or strictly speaking the angle between \\n\\n /// uv-coordinate system and the system where the pattern is defined\\n\\n virtual void getPattern(double freq, UVPattern &pattern, double l = 0., \\n\\n double m = 0., double pa = 0.) const;\\n\\n \\n\\n /// @brief check whether the pattern is symmetric\\n\\n /// @details Some illumination patterns are trivial and it may be known a priori that\\n\\n /// the pattern does not depend on the parallactic angle. This method allows to check\\n\\n /// whether such trivial case exists. If true is returned, getPattern ignores pa\\n\\n /// parameter.\\n\\n /// @return true if the pattern is symmetric, false otherwise\\n\\n virtual bool isSymmetric() const;\\n\\n \\n\\nprivate:\\n\\n /// @brief single-feed illumination pattern (assumed the same for all feeds)\\n\\n boost::shared_ptr<IBasicIllumination> itsPattern;\\n\\n \\n\\n /// @brief offsets of physical feeds in radians\\n\\n casa::Vector<casa::RigidVector<casa::Double, 2> > itsFeedOffsets;\\n\\n \\n\\n /// @brief complex weights for each physical feed\\n\\n casa::Vector<casa::Complex> itsWeights;\\n\\n \\n\\n /// @brief flag showing that this pattern is symmetric\\n\\n /// @details Whether or not it is the case depends on the assigned offsets\\n\\n /// (i.e. any non-zero offset means automatically that this pattern is asymmetric,\\n\\n /// it is checked in the constructor)\\n\\n bool itsSymmetricFlag;\\n\\n};\\n\\n\\n\\n} // namespace synthesis\\n\\n\\n\",\n \"file_path\": \"Code/Components/Synthesis/synthesis/current/gridding/BasicCompositeIllumination.h\",\n \"rank\": 64,\n \"score\": 168779.3384754149\n },\n {\n \"content\": \"namespace askap {\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief An interface for accessing calibration solutions for reading.\\n\\n/// @details This interface is used to access calibration parameters\\n\\n/// read-only. A writable version of the interface is derived from this\\n\\n/// class. Various implementations are possible, i.e. parset-based, \\n\\n/// table-based and working via database ice service.\\n\\n/// @ingroup calibaccess\\n\\nstruct ICalSolutionConstAccessor {\\n\\n /// @brief virtual destructor to keep the compiler happy\\n\\n virtual ~ICalSolutionConstAccessor();\\n\\n \\n\\n // virtual methods which need to be overridden in concrete \\n\\n // implementation classes\\n\\n \\n\\n /// @brief obtain gains (J-Jones)\\n\\n /// @details This method retrieves parallel-hand gains for both \\n\\n /// polarisations (corresponding to XX and YY). If no gains are defined\\n\\n /// for a particular index, gains of 1. with invalid flags set are\\n\\n /// returned.\\n\\n /// @param[in] index ant/beam index \\n\\n /// @return JonesJTerm object with gains and validity flags\\n\\n virtual JonesJTerm gain(const JonesIndex &index) const = 0;\\n\\n \\n\\n /// @brief obtain leakage (D-Jones)\\n\\n /// @details This method retrieves cross-hand elements of the \\n\\n /// Jones matrix (polarisation leakages). There are two values\\n\\n /// (corresponding to XY and YX) returned (as members of JonesDTerm \\n\\n /// class). If no leakages are defined for a particular index,\\n\\n /// zero leakages are returned with invalid flags set. \\n\\n /// @param[in] index ant/beam index\\n\\n /// @return JonesDTerm object with leakages and validity flags\\n\\n virtual JonesDTerm leakage(const JonesIndex &index) const = 0;\\n\\n \\n\\n /// @brief obtain bandpass (frequency dependent J-Jones)\\n\\n /// @details This method retrieves parallel-hand spectral\\n\\n /// channel-dependent gain (also known as bandpass) for a\\n\\n /// given channel and antenna/beam. The actual implementation\\n\\n /// does not necessarily store these channel-dependent gains\\n\\n /// in an array. It could also implement interpolation or \\n\\n /// sample a polynomial fit at the given channel (and \\n\\n /// parameters of the polynomial could be in the database). If\\n\\n /// no bandpass is defined (at all or for this particular channel),\\n\\n /// gains of 1.0 are returned (with invalid flag is set).\\n\\n /// @param[in] index ant/beam index\\n\\n /// @param[in] chan spectral channel of interest\\n\\n /// @return JonesJTerm object with gains and validity flags\\n\\n virtual JonesJTerm bandpass(const JonesIndex &index, const casa::uInt chan) const = 0;\\n\\n \\n\\n // helper methods to simplify access to the calibration parameters\\n\\n \\n\\n /// @brief obtain full 2x2 Jones Matrix taking all effects into account\\n\\n /// @details This method returns resulting 2x2 matrix taking gain, leakage and\\n\\n /// bandpass effects (for a given channel) into account. Invalid gains (and bandpass\\n\\n /// values) are replaced by 1., invalid leakages are replaced by zeros. This method\\n\\n /// calls gain, bandpass and leakage virtual methods\\n\\n /// @param[in] index ant/beam index\\n\\n /// @param[in] chan spectral channel of interest\\n\\n /// @return 2x2 Jones matrix\\n\\n /// @note The relation between leakage terms and Jones matrices matches \\n\\n /// the definition of Hamaker, Bregman & Sault. See their equation \\n\\n /// (14) for details. Our parameters d12 (corresponding to Stokes:XY) and\\n\\n /// d21 (corresponding to Stokes::YX) correspond to d_{Ap} and d_{Aq} from\\n\\n /// Hamaker, Bregman & Sault, respectively. It is assumed that the gain errors\\n\\n /// are applied after leakages (i.e. R=GD). \\n\\n casa::SquareMatrix<casa::Complex, 2> jones(const JonesIndex &index, const casa::uInt chan) const;\\n\\n \\n\\n /// @brief obtain full 2x2 Jones Matrix taking all effects into account\\n\\n /// @details This version of the method accepts antenna and beam indices explicitly and\\n\\n /// does extra checks before calling the main method expressed via JonesIndex.\\n\\n /// @param[in] ant antenna index\\n\\n /// @param[in] beam beam index\\n\\n /// @param[in] chan spectral channel of interest\\n\\n /// @return 2x2 Jones matrix\\n\\n casa::SquareMatrix<casa::Complex, 2> jones(const casa::uInt ant, const casa::uInt beam, const casa::uInt chan) const;\\n\\n \\n\\n /// @brief obtain validity flag for the full 2x2 Jones Matrix\\n\\n /// @details This method combines all validity flags for parameters used to compose Jones\\n\\n /// matrix and returns true if all elements are valid and false if at least one constituent\\n\\n /// is not valid\\n\\n /// @param[in] index ant/beam index\\n\\n /// @param[in] chan spectral channel of interest\\n\\n /// @return true, if the matrix returned by jones(...) method called with the same parameters is\\n\\n /// valid, false otherwise\\n\\n bool jonesValid(const JonesIndex &index, const casa::uInt chan) const;\\n\\n \\n\\n /// @brief obtain validity flag for the full 2x2 Jones Matrix\\n\\n /// @details This version of the method accepts antenna and beam indices explicitly and\\n\\n /// does extra checks before calling the main method expressed via JonesIndex.\\n\\n /// @param[in] ant antenna index\\n\\n /// @param[in] beam beam index\\n\\n /// @param[in] chan spectral channel of interest\\n\\n /// @return true, if the matrix returned by jones(...) method called with the same parameters is\\n\\n /// valid, false otherwise\\n\\n bool jonesValid(const casa::uInt ant, const casa::uInt beam, const casa::uInt chan) const;\\n\\n\\n\\n /// @brief shared pointer definition\\n\\n typedef boost::shared_ptr<ICalSolutionConstAccessor> ShPtr;\\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\",\n \"file_path\": \"Code/Base/accessors/current/calibaccess/ICalSolutionConstAccessor.h\",\n \"rank\": 65,\n \"score\": 168742.31176564324\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief A high-level interface to access calibration solutions\\n\\n/// @details This interface hides the database look up of the appropriate\\n\\n/// calibration solution. It manages solution IDs and provides access\\n\\n/// to the actual solution via ICalSolutionConstAccessor. A single\\n\\n/// solution ID refers to some gain, leakage and bandpass, although \\n\\n/// individual solutions may be obtained at different times. The read\\n\\n/// operation always delivers the \\\"active\\\" (i.e. most recent) solution \\n\\n/// at the given time.\\n\\n/// @ingroup calibaccess\\n\\nstruct ICalSolutionConstSource {\\n\\n\\n\\n /// @brief virtual destructor to keep the compiler happy\\n\\n virtual ~ICalSolutionConstSource();\\n\\n \\n\\n // virtual methods to be overridden in implementations\\n\\n \\n\\n /// @brief obtain ID for the most recent solution\\n\\n /// @return ID for the most recent solution\\n\\n virtual long mostRecentSolution() const = 0;\\n\\n \\n\\n /// @brief obtain solution ID for a given time\\n\\n /// @details This method looks for a solution valid at the given time\\n\\n /// and returns its ID. It is equivalent to mostRecentSolution() if\\n\\n /// called with a time sufficiently into the future.\\n\\n /// @param[in] time time stamp in seconds since MJD of 0.\\n\\n /// @return solution ID\\n\\n virtual long solutionID(const double time) const = 0;\\n\\n \\n\\n /// @brief obtain read-only accessor for a given solution ID\\n\\n /// @details This method returns a shared pointer to the solution accessor, which\\n\\n /// can be used to read the parameters. If a solution with the given ID doesn't \\n\\n /// exist, an exception is thrown. Existing solutions with undefined parameters \\n\\n /// are managed via validity flags of gains, leakages and bandpasses\\n\\n /// @param[in] id solution ID to read\\n\\n /// @return shared pointer to an accessor object\\n\\n virtual boost::shared_ptr<ICalSolutionConstAccessor> roSolution(const long id) const = 0;\\n\\n \\n\\n /// @brief shared pointer definition\\n\\n typedef boost::shared_ptr<ICalSolutionConstSource> ShPtr;\\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/calibaccess/ICalSolutionConstSource.h\",\n \"rank\": 66,\n \"score\": 168742.31176564324\n },\n {\n \"content\": \"class MonitorData(dict):\\n\\n \\\"\\\"\\\" :class:`dict` class adding :meth:`send` to send the dictionary\\n\\n to :class:`Monitoring` singleton.\\n\\n \\\"\\\"\\\"\\n\\n def __init__(self, *args, **kwargs):\\n\\n dict.__init__(self, *args, **kwargs)\\n\\n\\n\\n def publish(self):\\n\\n mon = get_monitor()\\n\",\n \"file_path\": \"Code/Base/py-iceutils/current/askap/iceutils/monitorpublisher.py\",\n \"rank\": 67,\n \"score\": 168720.63669109676\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief An interface to DATA_DESCRIPTION subtable\\n\\n/// @details A class derived from this interface provides access to\\n\\n/// the content of the DATA_DESCRIPTION table (which connects data\\n\\n/// description id with spectral window id and polarization id\\n\\n/// @ingroup dataaccess_tab\\n\\nstruct ITableDataDescHolder : virtual public IHolder {\\n\\n\\n\\n /// obtain spectral window ID via data description ID\\n\\n /// @param dataDescriptionID an index into data description table for\\n\\n /// which to return an associated spectral window ID\\n\\n /// @return spectral window id for a given dataDescriptionID\\n\\n /// @note return type has sign. User is responsible for interpreting\\n\\n /// the negative values\\n\\n virtual int getSpectralWindowID(size_t dataDescriptionID) const = 0;\\n\\n\\n\\n /// obtain polaraziation ID via data description ID\\n\\n /// @param dataDescriptionID an index into data description table for\\n\\n /// which to return an associated polarization ID\\n\\n /// @return polarization id for a given dataDescriptionID\\n\\n /// @note return type has sign. User is responsible for interpreting\\n\\n /// the negative values\\n\\n virtual int getPolarizationID(size_t dataDescriptionID) const = 0;\\n\\n\\n\\n /// obtain all data description IDs which correspond to the given\\n\\n /// spectral window ID (requires for selection on the spectral window)\\n\\n /// @param spWindowID a spectral window ID to search for\\n\\n /// @return a vector containing data description IDs\\n\\n /// @note a signed type is used for spWindowID. User is responsible for\\n\\n /// interpreting the negative values\\n\\n virtual std::vector<size_t> getDescIDsForSpWinID(int spWindowID) const = 0; \\n\\n};\\n\\n\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/ITableDataDescHolder.h\",\n \"rank\": 68,\n \"score\": 168409.33600677756\n },\n {\n \"content\": \"/// This class implements the \\\"MonitoringProvider\\\" Ice interface.\\n\\n/// Remote clients invoke methods on this class to fetch monitoring data.\\n\\nclass MonitoringProviderImpl : public askap::interfaces::monitoring::MonitoringProvider {\\n\\n public:\\n\\n /// @brief Constructor.\\n\\n MonitoringProviderImpl(DataManager& datasource);\\n\\n\\n\\n /// @brief Destructor.\\n\\n virtual ~MonitoringProviderImpl();\\n\\n\\n\\n /// The caller provides zero or more point names and the\\n\\n /// return value will contain at most the same number of\\n\\n /// monitoring points in the returned sequence.\\n\\n ///\\n\\n /// Where a point name is not available it will simply not\\n\\n /// be included in the result sequence.\\n\\n ///\\n\\n /// If an empty sequence is passed, the returned sequence will\\n\\n /// be empty.\\n\\n ///\\n\\n /// @param[in] pointnames a sequence of point names for\\n\\n /// which data will be fetched\\n\",\n \"file_path\": \"Code/Components/Services/ingest/current/monitoring/MonitoringProviderImpl.h\",\n \"rank\": 69,\n \"score\": 166914.7332916763\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief Parset file-based implementation of the calibration solution source\\n\\n/// @details This implementation is to be used with pre-existing code writing/reading\\n\\n/// the parset directly and with a number of tests. It is just to convert the legacy code.\\n\\n/// There is only one implementation of this class which is used for both reading and writing.\\n\\n/// Main functionality is implemented in the corresponding ParsetCalSolutionAccessor class.\\n\\n/// This class just creates an instance of the accessor and manages it.\\n\\n/// @ingroup calibaccess\\n\\nstruct ParsetCalSolutionConstSource : public CalSolutionConstSourceStub {\\n\\n /// @brief constructor\\n\\n /// @details Creates solution source object for a given parset file\\n\\n /// (whether it is for writing or reading depends on the actual methods\\n\\n /// used).\\n\\n /// @param[in] parset parset file name\\n\\n explicit ParsetCalSolutionConstSource(const std::string &parset);\\n\\n \\n\\n /// @brief shared pointer definition\\n\\n typedef boost::shared_ptr<ParsetCalSolutionConstSource> ShPtr;\\n\\n\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/calibaccess/ParsetCalSolutionConstSource.h\",\n \"rank\": 70,\n \"score\": 166881.6567126775\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\nstruct DataAccessTestImpl {\\n\\n /// demonstration of flagging from the given iterator position until the\\n\\n /// end of the block pointed by the iterator\\n\\n static void flaggingRoutine(const IDataSharedIter &di);\\n\\n\\n\\n /// demonstration of the read-only access\\n\\n static void readOnlyRoutine(const IConstDataSharedIter &cdi);\\n\\n\\n\\n /// obtaining iterators, invoke other methods\\n\\n static void doTheJob(const boost::shared_ptr<IDataSource> &ds);\\n\\n};\\n\\n\\n\\n} // namespace accessors\\n\",\n \"file_path\": \"Code/Base/accessors/current/tests/dataaccess/DataAccessTestImpl.h\",\n \"rank\": 71,\n \"score\": 166554.10034278792\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace accessors {\\n\\n\\n\\n/// @brief Implementation of ITableDataDescHolder holding everything in memory\\n\\n/// @details This file contains a class implementing the ITableDataDescHolder\\n\\n/// interface by reading the appropriate subtable into memory in the constructor.\\n\\n/// @ingroup dataaccess_tab\\n\\nstruct MemTableDataDescHolder : public ITableDataDescHolder {\\n\\n\\n\\n /// read all required information from the DATA_DESCRIPTION subtable\\n\\n /// @param ms an input measurement set (a table which has a\\n\\n /// DATA_DESCRIPTION subtable defined)\\n\\n explicit MemTableDataDescHolder(const casa::Table &ms);\\n\\n \\n\\n /// obtain spectral window ID via data description ID\\n\\n /// @param dataDescriptionID an index into data description table for\\n\\n /// which to return an associated spectral window ID\\n\\n /// @return spectral window id for a given dataDescriptionID\\n\\n /// @note return type has sign. User is responsible for interpreting\\n\\n /// the negative values\\n\\n virtual int getSpectralWindowID(size_t dataDescriptionID) const;\\n\\n\\n\\n /// obtain polaraziation ID via data description ID\\n\\n /// @param dataDescriptionID an index into data description table for\\n\\n /// which to return an associated polarization ID\\n\\n /// @return polarization id for a given dataDescriptionID\\n\\n /// @note return type has sign. User is responsible for interpreting\\n\\n /// the negative values\\n\\n virtual int getPolarizationID(size_t dataDescriptionID) const;\\n\\n\\n\\n /// obtain all data description IDs which correspond to the given\\n\\n /// spectral window ID (requires for selection on the spectral window)\\n\\n /// @param spWindowID a spectral window ID to search for\\n\\n /// @return a vector containing data description IDs\\n\\n /// @note a signed type is used for spWindowID. User is responsible for\\n\\n /// interpreting the negative values\\n\\n virtual std::vector<size_t> getDescIDsForSpWinID(int spWindowID) const;\\n\\nprivate:\\n\\n std::vector<std::pair<int, int> > itsDataDescription;\\n\\n};\\n\\n\\n\\n\\n\\n} // namespace accessors\\n\\n\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/MemTableDataDescHolder.h\",\n \"rank\": 72,\n \"score\": 166554.10034278792\n },\n {\n \"content\": \"# See http://peak.telecommunity.com/DevCenter/setuptools#namespace-packages\\n\\ntry:\\n\\n __import__('pkg_resources').declare_namespace(__name__)\\n\\nexcept ImportError:\\n\\n from pkgutil import extend_path\\n\\n __path__ = extend_path(__path__, __name__)\\n\",\n \"file_path\": \"Code/Components/Analysis/data/current/askap/__init__.py\",\n \"rank\": 73,\n \"score\": 166375.35406146443\n },\n {\n \"content\": \" private long lastSBID = -10;\\n\",\n \"file_path\": \"Code/Components/Services/manager/current/src/askap/cp/manager/ingest/IngestMonitorThread.java\",\n \"rank\": 74,\n \"score\": 165699.14026493052\n },\n {\n \"content\": \"namespace askap {\\n\\n\\n\\nnamespace synthesis {\\n\\n\\n\\n/// @brief Calibration effect: antenna gains without cross-pol, one value for all beams\\n\\n/// @details This is a simple effect which can be used in conjunction\\n\\n/// with the CalibrationME template (as its template argument)\\n\\n/// @ingroup measurementequation\\n\\nstruct NoXPolBeamIndependentGain : public ParameterizedMEComponent<false> {\\n\\n \\n\\n /// @brief constructor, store reference to paramters\\n\\n /// @param[in] par shared pointer to parameters\\n\\n inline explicit NoXPolBeamIndependentGain(const scimath::Params::ShPtr &par) : \\n\\n ParameterizedMEComponent<false>(par) {}\\n\\n \\n\\n /// @brief main method returning Mueller matrix and derivatives\\n\\n /// @details This method has to be overloaded (in the template sense) for\\n\\n /// all classes representing various calibration effects. CalibrationME\\n\\n /// template will call it when necessary. It returns \\n\\n /// @param[in] chunk accessor to work with\\n\\n /// @param[in] row row of the chunk to work with\\n\\n /// @return ComplexDiffMatrix filled with Mueller matrix corresponding to\\n\\n /// this effect\\n\\n inline scimath::ComplexDiffMatrix get(const accessors::IConstDataAccessor &chunk, \\n\\n casa::uInt row) const; \\n\\n};\\n\\n\\n\\n} // namespace synthesis\\n\\n\\n\",\n \"file_path\": \"Code/Components/Synthesis/synthesis/current/measurementequation/NoXPolBeamIndependentGain.h\",\n \"rank\": 75,\n \"score\": 165117.78719468563\n },\n {\n \"content\": \" private void updateDataService(long sbid, List<MonitorPoint> pointValues) {\\n\\n\\n\\n // don't need to update Dataservice if we have already. Assume the obs detail\\n\\n // does not change during observation.\\n\\n if (this.lastSBID == sbid)\\n\\n return;\\n\\n\\n\\n MonitorPoint startFreqPoint = null;\\n\\n MonitorPoint nChanPoint = null;\\n\\n MonitorPoint chanWidthPoint = null;\\n\\n\\n\\n for (MonitorPoint point : pointValues) {\\n\\n\\n\\n if (point.name.equals(\\\"cp.ingest.obs.StartFreq\\\"))\\n\\n startFreqPoint = point;\\n\\n else if (point.name.equals(\\\"cp.ingest.obs.nChan\\\"))\\n\\n nChanPoint = point;\\n\\n else if (point.name.equals(\\\"cp.ingest.obs.ChanWidth\\\"))\\n\\n chanWidthPoint = point;\\n\\n }\\n\\n\\n\\n /*\\n\\n * write observation details as a json string:\\n\\n *\\n\\n * {\\n\\n * \\\"nChan\\\": {\\\"value\\\": 10368},\\n\\n * \\\"ChanWidth\\\": {\\\"value\\\": 1344.49, \\\"unit\\\": \\\"MHz\\\"},\\n\\n * \\\"StartFreq\\\": {\\\"value\\\": 1344.49, \\\"unit\\\": \\\"MHz\\\"},\\n\\n * \\\"CentreFreq\\\": {\\\"value\\\": 2344.49, \\\"unit\\\": \\\"MHz\\\"},\\n\\n * \\\"BandWidth\\\": {\\\"value\\\": 192.00, \\\"unit\\\": \\\"MHz\\\"}\\n\\n * }\\n\\n *\\n\\n */\\n\\n if (startFreqPoint != null && nChanPoint != null && chanWidthPoint != null) {\\n\\n\\n\\n double startFreq = ((TypedValueDouble) startFreqPoint.value).value;\\n\\n double chanWidth = ((TypedValueDouble) chanWidthPoint.value).value;\\n\\n long nChan = ((TypedValueLong) nChanPoint.value).value;\\n\\n\\n\\n double bandWidth = 0;\\n\\n if (chanWidthPoint.unit.equalsIgnoreCase(\\\"khz\\\"))\\n\\n bandWidth = chanWidth * nChan / 1000;\\n\\n else // assume mhz\\n\\n bandWidth = chanWidth * nChan;\\n\\n\\n\\n double centreFreq = startFreq + bandWidth / 2;\\n\\n\\n\\n JsonObject obsInfo = new JsonObject();\\n\\n\\n\\n JsonObject obj = new JsonObject();\\n\\n obj.addProperty(\\\"value\\\", nChan);\\n\\n obsInfo.add(\\\"nChan\\\", obj);\\n\\n\\n\\n obj = new JsonObject();\\n\\n obj.addProperty(\\\"value\\\", chanWidth);\\n\\n obj.addProperty(\\\"unit\\\", chanWidthPoint.unit);\\n\\n obsInfo.add(\\\"ChanWidth\\\", obj);\\n\\n\\n\\n obj = new JsonObject();\\n\\n obj.addProperty(\\\"value\\\", startFreq);\\n\\n obj.addProperty(\\\"unit\\\", startFreqPoint.unit);\\n\\n obsInfo.add(\\\"StartFreq\\\", obj);\\n\\n\\n\\n obj = new JsonObject();\\n\\n obj.addProperty(\\\"value\\\", centreFreq);\\n\\n obj.addProperty(\\\"unit\\\", startFreqPoint.unit);\\n\\n obsInfo.add(\\\"CentreFreq\\\", obj);\\n\\n\\n\\n obj = new JsonObject();\\n\\n obj.addProperty(\\\"value\\\", bandWidth);\\n\\n obj.addProperty(\\\"unit\\\", startFreqPoint.unit);\\n\\n obsInfo.add(\\\"BandWidth\\\", obj);\\n\\n\\n\\n\\n\\n Map<String, String> obsVar = new HashMap<String, String>();\\n\\n obsVar.put(\\\"obs.info\\\", theirGson.toJson(obsInfo));\\n\\n\\n\\n try {\\n\\n ClientServiceFactory.getDataServiceClient().setObsVariables(sbid, obsVar);\\n\\n this.lastSBID = sbid;\\n\\n } catch (Exception e) {\\n\\n logger.error(\\\"Could not update Dataservice with observation details\\\", e);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"Code/Components/Services/manager/current/src/askap/cp/manager/ingest/IngestMonitorThread.java\",\n \"rank\": 76,\n \"score\": 163296.2993353305\n },\n {\n \"content\": \" public void setObsVariables(long sbid, Map<String, String> obsVars)\\n\",\n \"file_path\": \"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/IDataServiceClient.java\",\n \"rank\": 77,\n \"score\": 163226.96174812582\n },\n {\n \"content\": \"# See http://peak.telecommunity.com/DevCenter/setuptools#namespace-packages\\n\\ntry:\\n\\n __import__('pkg_resources').declare_namespace(__name__)\\n\\nexcept ImportError:\\n\\n from pkgutil import extend_path\\n\\n __path__ = extend_path(__path__, __name__)\\n\",\n \"file_path\": \"Code/Components/Analysis/data/current/askap/analysis/__init__.py\",\n \"rank\": 78,\n \"score\": 161833.5372301237\n },\n {\n \"content\": \" @Override\\n\\n public void setObsVariables(long sbid, Map<String, String> obsVars) throws NoSuchSchedulingBlockException, ParameterException {\\n\\n // only need to check the obsVar string is correct\\n\\n String obsVar = obsVars.get(\\\"obs.info\\\");\\n\\n FuncTestReporterClient.getFuncTestReporterClient().methodCalled(obsVar);\\n\",\n \"file_path\": \"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/MockDataServiceClient.java\",\n \"rank\": 79,\n \"score\": 159314.34088777882\n },\n {\n \"content\": \" @Override\\n\\n public void setObsVariables(long sbid, Map<String, String> obsVars) throws NoSuchSchedulingBlockException, ParameterException {\\n\\n getProxy();\\n\\n itsProxy.setObsVariables(sbid, obsVars);\\n\",\n \"file_path\": \"Code/Components/Services/manager/current/src/askap/cp/manager/svcclients/IceDataServiceClient.java\",\n \"rank\": 80,\n \"score\": 159314.34088777882\n },\n {\n \"content\": \"// Enumerated constants for data status.\\n\\n// UNKNOWN: the data status is unknown\\n\\n// EMPTY : no data inside\\n\\n// FULL : data inside\\n\\nenum CorrBufferUnitStatus { UNKNOWN = 0, EMPTY = 1, FULL = 2 };\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/Components/Services/correlatorsim/current/simplayback/CorrBufferUnit.h\",\n \"rank\": 81,\n \"score\": 157995.7916803237\n },\n {\n \"content\": \"/// @brief task for running another task in a parallel thread\\n\\n/// @details This task is a wrapper around any other task known to the ingest pipeline.\\n\\n/// Except for the first chunk of data which is just passed to the child task as is\\n\\n/// (to allow adjustment to the actual configuration of the parallel streams within the\\n\\n/// ingest pipeline), this task makes the copy of the data, buffers them and executes the\\n\\n/// child task in a parallel thread. Provided the execution time plus copy overheads \\n\\n/// do not exceed the cycle time, this allows better utilisation of resources and more\\n\\n/// distributed computing. The child task should obey the following conditions (otherwise,\\n\\n/// ingesting will not work correctly and may even lock up):\\n\\n/// * it should not modify the data\\n\\n/// * it should not alter the distribution of data streams (except on the first cycle)\\n\\n/// For example, MSSink or TCPSink are suitable while ChannelAvgTask or BeamScatterTask are not.\\n\\n/// The code has limited ability to detect misuse, so it is largely up to an expert user to \\n\\n/// configure ingest pipeline correctly to avoid problems. This task supports a couple of\\n\\n/// different strategies deailg with the processing not keeping up: throw an exception, \\n\\n/// skip the data.\\n\\n///\\n\\n/// Parameters (example):\\n\\n/// child = MSSink (child task, same name as understood in tasklist)\\n\\n/// lossless = true (if not allowed to skip data in the not-keeping up case)\\n\\n/// size = 1 (circular buffer size)\\n\\n/// maxwait = 20 (maximum waiting time in seconds for the child task to complete)\\n\\n///\\n\\nclass BufferedTask : public askap::cp::ingest::ITask {\\n\\n public:\\n\\n\\n\\n /// @brief Constructor\\n\\n /// @param[in] parset the configuration parameter set.\\n\\n /// @param[in] config configuration\\n\\n BufferedTask(const LOFAR::ParameterSet& parset,\\n\\n const Configuration& config);\\n\\n\\n\\n /// @brief destructor\\n\\n ~BufferedTask();\\n\\n\\n\\n /// @brief Process single visibility chunk\\n\\n /// @details There is no modification of the data, just internal buffers are updated.\\n\\n /// If the child task updates the chunk this change is lost, except on the first \\n\\n /// iteration where the task is allowed to change data distribution by resetting\\n\\n /// the shared pointer where appropriate.\\n\\n ///\\n\\n /// @param[in,out] chunk the instance of VisChunk for which the\\n\\n /// phase factors will be applied.\\n\",\n \"file_path\": \"Code/Components/Services/ingest/current/ingestpipeline/bufferedtask/BufferedTask.h\",\n \"rank\": 82,\n \"score\": 155264.04373298964\n },\n {\n \"content\": \"/// @brief Task to scatter beams\\n\\n/// @details This task increases the number of parallel streams handling data \\n\\n/// by scattering beams to different streams. For simplicity, only one stream\\n\\n/// is allowed to be active prior to this task and this rank will continue to\\n\\n/// be active past this task (if this approach is proven to be worthwhile, \\n\\n/// we would need to rework the whole visibility corner turn and merge gather in\\n\\n/// frequency with scatter in beams.\\n\\n///\\n\\n/// This task requires a configuration entry in the parset passed to the\\n\\n/// constructor. This configuration entry specifies how many streams will exist\\n\\n/// after this task. For example:\\n\\n/// @verbatim\\n\\n/// nstreams = 6\\n\\n/// @endverbatim\\n\\n/// The above results in 6 parallel streams handling roughly 1/6 of the beam space\\n\\n/// each. Obviously, total number of ranks should be equal or more than the\\n\\n/// value of this parameter.\\n\\nclass BeamScatterTask : public askap::cp::ingest::ITask {\\n\\n public:\\n\\n /// @brief Constructor.\\n\\n /// @param[in] parset the parameter set used to configure this task.\\n\\n /// @param[in] config configuration\\n\\n BeamScatterTask(const LOFAR::ParameterSet& parset, const Configuration& config);\\n\\n\\n\\n /// @brief Destructor.\\n\\n virtual ~BeamScatterTask();\\n\\n\\n\\n /// @brief Splits chunks.\\n\\n ///\\n\\n /// @param[in,out] chunk the instance of VisChunk to work with\\n\\n /// This method manipulates the VisChunk\\n\\n /// instance which is passed in, hence the value of the\\n\\n /// pointer may be changed \\n\\n virtual void process(askap::cp::common::VisChunk::ShPtr& chunk);\\n\\n\\n\\n /// @brief should this task be executed for inactive ranks?\\n\\n /// @details If a particular rank is inactive, process method is\\n\",\n \"file_path\": \"Code/Components/Services/ingest/current/ingestpipeline/beamscattertask/BeamScatterTask.h\",\n \"rank\": 83,\n \"score\": 152280.0998818906\n },\n {\n \"content\": \"/// @brief task for monitoring average data properties\\n\\n/// @details This task is intended to be used in early commissioning experiments.\\n\\n/// It is an alternative diagnostics to check the average amplitude, phase and\\n\\n/// delay for the subset of data managed by this particular rank (in the way\\n\\n/// similar to software correlator). This class is not intended to survive\\n\\n/// in its current form in the long term.\\n\\nclass SimpleMonitorTask : public askap::cp::ingest::ITask {\\n\\n public:\\n\\n\\n\\n /// @brief Constructor\\n\\n /// @param[in] parset the configuration parameter set.\\n\\n /// @param[in] config configuration\\n\\n SimpleMonitorTask(const LOFAR::ParameterSet& parset,\\n\\n const Configuration& config);\\n\\n\\n\\n /// @brief destructor\\n\\n ~SimpleMonitorTask();\\n\\n\\n\\n /// @brief Extract required information from visibilities in the specified VisChunk.\\n\\n /// @details There is no modification of the data, just internal buffers are updated.\\n\\n ///\\n\\n /// @param[in,out] chunk the instance of VisChunk for which the\\n\\n /// phase factors will be applied.\\n\\n virtual void process(askap::cp::common::VisChunk::ShPtr& chunk);\\n\\n\\n\\n protected:\\n\",\n \"file_path\": \"Code/Components/Services/ingest/current/ingestpipeline/simplemonitortask/SimpleMonitorTask.h\",\n \"rank\": 84,\n \"score\": 152214.9161832399\n },\n {\n \"content\": \"/// @brief Implementation of IConstDataSource in the table-based case\\n\\n/// @details\\n\\n/// TableConstDataSource: Allow read-only access to the data stored in the\\n\\n/// measurement set. This class implements IConstDataSource interface.\\n\\n/// @ingroup dataaccess_tab\\n\\nclass TableConstDataSource : virtual public IConstDataSource,\\n\\n virtual protected TableInfoAccessor\\n\\n{\\n\\npublic:\\n\\n /// @brief construct a read-only data source object\\n\\n /// @details All iterators obtained from this object will be read-only\\n\\n /// iterators.\\n\\n /// @param[in] fname file name of the measurement set to use\\n\\n /// @param[in] dataColumn a name of the data column used by default\\n\\n /// (default is DATA)\\n\\n explicit TableConstDataSource(const std::string &fname, \\n\\n const std::string &dataColumn = \\\"DATA\\\");\\n\\n \\n\\n /// create a converter object corresponding to this type of the\\n\\n /// DataSource. The user can change converting policies (units,\\n\\n /// reference frames) by appropriate calls to this converter object\\n\\n /// and pass it back to createConstIterator(...). The data returned by\\n\\n /// the iteratsr will automatically be in the requested frame/units\\n\\n ///\\n\\n /// @return a shared pointer to a new DataConverter object\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/TableConstDataSource.h\",\n \"rank\": 85,\n \"score\": 151985.81337726206\n },\n {\n \"content\": \"/// @brief an implementation of IConstDataAccessor in the table-based case\\n\\n///\\n\\n/// @details TableConstDataAccessor is an implementation of the\\n\\n/// DataAccessor working with TableConstDataIterator.\\n\\n/// It is currently\\n\\n/// derived from DataAccessorStub as most of the\\n\\n/// methods are stubbed. However, in the future\\n\\n/// it should become a separate class derived\\n\\n/// directly from its interface\\n\\n/// @ingroup dataaccess_tab\\n\\nclass TableConstDataAccessor : virtual public IConstDataAccessor\\n\\n{\\n\\npublic:\\n\\n /// construct an object linked with the given iterator\\n\\n /// @param iter a reference to associated iterator\\n\\n explicit TableConstDataAccessor(const TableConstDataIterator &iter);\\n\\n\\n\\n /// The number of rows in this chunk\\n\\n /// @return the number of rows in this chunk\\n\\n virtual casa::uInt nRow() const throw();\\n\\n\\n\\n /// The number of spectral channels (equal for all rows)\\n\\n /// @return the number of spectral channels\\n\\n virtual casa::uInt nChannel() const throw();\\n\\n\\n\\n /// The number of polarization products (equal for all rows)\\n\\n /// @return the number of polarization products (can be 1,2 or 4)\\n\\n virtual casa::uInt nPol() const throw();\\n\\n \\n\\n /// Return pointing centre directions of the first antenna/feed\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/TableConstDataAccessor.h\",\n \"rank\": 86,\n \"score\": 151979.573310659\n },\n {\n \"content\": \"/// @brief Implementation of IConstDataIterator in the table-based case\\n\\n/// @details\\n\\n/// TableConstDataIterator: Allow read-only iteration across preselected data. Each \\n\\n/// iteration step is represented by the IConstDataAccessor interface.\\n\\n/// This is an implementation in the table-based case.\\n\\n/// @ingroup dataaccess_tab\\n\\nclass TableConstDataIterator : virtual public IConstDataIterator,\\n\\n virtual public TableInfoAccessor\\n\\n{\\n\\npublic:\\n\\n /// @brief constructor of the const iterator\\n\\n /// @param[in] msManager a manager of the measurement set to use\\n\\n /// @param[in] sel shared pointer to selector\\n\\n /// @param[in] conv shared pointer to converter\\n\\n /// @param[in] cacheSize a number of uvw machines in the cache (default is 1)\\n\\n /// @param[in] tolerance pointing direction tolerance in radians, exceeding which leads \\n\\n /// to initialisation of a new UVW Machine\\n\\n /// @param[in] maxChunkSize maximum number of rows per accessor\\n\\n TableConstDataIterator(const boost::shared_ptr<ITableManager const>\\n\\n &msManager,\\n\\n const boost::shared_ptr<ITableDataSelectorImpl const> &sel,\\n\\n\\t const boost::shared_ptr<IDataConverterImpl const> &conv,\\n\\n\\t size_t cacheSize = 1, double tolerance = 1e-6,\\n\\n\\t casa::uInt maxChunkSize = INT_MAX);\\n\\n\\n\\n /// Restart the iteration from the beginning\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/TableConstDataIterator.h\",\n \"rank\": 87,\n \"score\": 151979.54061020407\n },\n {\n \"content\": \"/// @brief basic on-the-fly monitor dumping data into an ascii file\\n\\n/// @details This implementation of the data monitor dumps delay and\\n\\n/// visibility history into ascii files for on-the-fly monitoring along\\n\\n/// with the latest spectra for each beam. Unlike BasicMonitor, this\\n\\n/// one opens an ascii file in the constructor and appends the data\\n\\n/// indefinitely.\\n\\n/// @ingroup swcorrelator\\n\\nclass SimpleVisMonitor : public IMonitor {\\n\\npublic:\\n\\n /// @brief constructor\\n\\n SimpleVisMonitor();\\n\\n\\n\\n /// @brief create and configure the monitor \\n\\n /// @details\\n\\n /// @param[in] parset parset with parameters (without the swcorrelator prefix)\\n\\n /// @return shared pointer to the monitor\\n\\n static boost::shared_ptr<IMonitor> setup(const LOFAR::ParameterSet &parset);\\n\\n \\n\\n /// @brief name of the monitor\\n\\n /// @return the name of the monitor\\n\\n static std::string name() { return \\\"simple\\\"; }\\n\\n \\n\\n /// @brief initialise publishing\\n\\n /// @details Technically, this step is not required. But given the\\n\\n /// current design of the code it seems better to give a hint on the maximum\\n\\n /// possible number of antennas, beams and channels, e.g. to initialise caches.\\n\\n /// @param[in] nAnt maximum number of antennas\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/SimpleVisMonitor.h\",\n \"rank\": 88,\n \"score\": 151343.2720684634\n },\n {\n \"content\": \"/// @brief manages buffers for raw data\\n\\n/// @details This class manages buffers for raw data. \\n\\n/// It keeps track of the current status (i.e. free, filled, \\n\\n/// being reduced) providing the required syncronisation between\\n\\n/// parallel threads accessing the buffers. The number of buffers should be\\n\\n/// at least twice the number of beams * antennas * cards.\\n\\n/// @ingroup swcorrelator\\n\\nclass BufferManager {\\n\\npublic:\\n\\n /// @brief 3 buffers corresponding to the same channel and beam\\n\\n struct BufferSet {\\n\\n BufferSet() : itsAnt1(-1), itsAnt2(-1), itsAnt3(-1) {}\\n\\n int itsAnt1;\\n\\n int itsAnt2;\\n\\n int itsAnt3;\\n\\n };\\n\\n \\n\\n enum BufferStatus {\\n\\n BUF_FREE = 0,\\n\\n BUF_BEING_FILLED,\\n\\n BUF_READY,\\n\\n BUF_BEING_PROCESSED\\n\\n };\\n\\n \\n\\n /// @brief constructor\\n\\n /// @details\\n\\n /// @param[in] nBeam number of beams\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/BufferManager.h\",\n \"rank\": 89,\n \"score\": 150832.23688571565\n },\n {\n \"content\": \"class DelaySolverApp : public askap::Application {\\n\\npublic:\\n\\n /// @brief process a single file\\n\\n /// @param[in] ds data source\\n\\n /// @param[in] currentDelays a vector with fixed delays (per antenna) used for observations\\n\\n void process(const IConstDataSource &ds, const std::vector<double>& currentDelays);\\n\\n \\n\\n /// @brief run application\\n\\n /// @param[in] argc number of parameters\\n\\n /// @param[in] argv parameter vector\\n\\n /// @return exit code\\n\\n virtual int run(int argc, char *argv[]);\\n\\nprotected:\\n\\n /// @brief helper method to fill antenna names\\n\\n /// @details This method extracts antenna names from the supplied parset of ingest pipeline\\n\\n /// (obtained via the SB number) and populates itsAntennaNames in the order of ingest indices.\\n\\n /// @param[in] parset parset used with ingest pipeline\\n\\n void fillAntennaNames(const LOFAR::ParameterSet &parset);\\n\\n\\n\\n /// @brief helper method to extract current delays from the ingest's parset\\n\",\n \"file_path\": \"Code/Components/Utilities/current/apps/delaysolver.cc\",\n \"rank\": 90,\n \"score\": 150585.36486178997\n },\n {\n \"content\": \"/// @brief manages buffers for raw data\\n\\n/// @details This class provides support for more than 3 baselines. Although\\n\\n/// the original BufferManager accepts the number of antennas as its parameter,\\n\\n/// it is only used to resize the storage accordingly. The logic to split \\n\\n/// the set of baselines into 3-antenna triangles is implemented here.\\n\\n/// @ingroup swcorrelator\\n\\nclass ExtendedBufferManager : public BufferManager {\\n\\npublic:\\n\\n\\n\\n /// @brief constructor\\n\\n /// @details\\n\\n /// @param[in] nBeam number of beams\\n\\n /// @param[in] nChan number of channels (cards)\\n\\n /// @param[in] nAnt number of antennas\\n\\n /// @param[in[ hdrProc optional shared pointer to the header preprocessor\\n\\n ExtendedBufferManager(const size_t nBeam, const size_t nChan, const size_t nAnt = 3, \\n\\n const boost::shared_ptr<HeaderPreprocessor> &hdrProc = boost::shared_ptr<HeaderPreprocessor>());\\n\\n \\n\\n /// @brief get filled buffers for a matching channel + beam\\n\\n /// @details This method returns the first available set of\\n\\n /// completely filled buffers corresponding to the same channel\\n\\n /// and beam. The calling thread is blocked until a suitable set\\n\\n /// is available for correlation.\\n\\n /// @return a set of buffers ready for correlation\\n\\n virtual BufferSet getFilledBuffers() const;\\n\\n \\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/ExtendedBufferManager.h\",\n \"rank\": 91,\n \"score\": 150001.10153118343\n },\n {\n \"content\": \" class access::object_traits< ::askap::cp::sms::datamodel::DataSource >\\n\\n {\\n\\n public:\\n\\n typedef ::askap::cp::sms::datamodel::DataSource object_type;\\n\\n typedef ::boost::shared_ptr< ::askap::cp::sms::datamodel::DataSource > pointer_type;\\n\\n typedef odb::pointer_traits<pointer_type> pointer_traits;\\n\\n\\n\\n static const bool polymorphic = false;\\n\\n\\n\\n typedef ::askap::cp::sms::datamodel::id_type id_type;\\n\\n typedef ::askap::cp::sms::datamodel::version_type version_type;\\n\\n\\n\\n static const bool auto_id = true;\\n\\n\\n\\n static const bool abstract = false;\\n\\n\\n\\n static id_type\\n\\n id (const object_type&);\\n\\n\\n\\n typedef\\n\",\n \"file_path\": \"Code/Components/Services/skymodel/current/datamodel/DataSource-odb.h\",\n \"rank\": 92,\n \"score\": 149737.33154631557\n },\n {\n \"content\": \"/// @brief Interface class for read-only access to visibility data\\n\\n/// @details IConstDataAccessor is an interface class for read-only \\n\\n/// access to buffered visibility data. Working instances include \\n\\n/// a chunk of streamed data or a portion of the disk-based table. \\n\\n/// A reference to this type is returned by a derivative from\\n\\n/// IConstDataIterator\\n\\n/// @ingroup dataaccess_i\\n\\nclass IConstDataAccessor\\n\\n{\\n\\npublic:\\n\\n\\t\\n\\n\\t/// Destruct\\n\\n\\tvirtual ~IConstDataAccessor();\\n\\n\\t\\t\\n\\n\\t/// The number of rows in this chunk\\n\\n\\t/// @return the number of rows in this chunk\\n\\n\\tvirtual casa::uInt nRow() const throw() = 0;\\n\\n\\n\\n // The following methods implement metadata access\\n\\n\\t\\t\\n\\n\\t/// The number of spectral channels (equal for all rows)\\n\\n\\t/// @return the number of spectral channels\\n\\n\\tvirtual casa::uInt nChannel() const throw() = 0;\\n\\n\\n\\n\\t/// The number of polarization products (equal for all rows)\\n\\n\\t/// @return the number of polarization products (can be 1,2 or 4)\\n\\n\\tvirtual casa::uInt nPol() const throw() = 0;\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/IConstDataAccessor.h\",\n \"rank\": 93,\n \"score\": 147307.8014075735\n },\n {\n \"content\": \"/// @brief Read-only iterator across preselected data\\n\\n/// @details Each \\n\\n/// iteration step is represented by the IConstDataAccessor interface.\\n\\n/// The idea is that an iterator object will be obtained via IDataSource\\n\\n/// which will take care of the actual method to access the data and the\\n\\n/// source (a MeasurementSet or a stream). Any class controlling data selection\\n\\n/// is likely to be held by a real implementation of the iterator. However,\\n\\n/// it will be set up via the IDataSource object and IS NOT a part of this\\n\\n/// interface.\\n\\n/// \\n\\n/// Additional read/write buffers can be used via the IDataIterator, which\\n\\n/// implements a read/write interface\\n\\n/// @ingroup dataaccess_i\\n\\nclass IConstDataIterator\\n\\n{\\n\\npublic:\\n\\n\\t/// the type of the value pointed by this iterator\\n\\n\\ttypedef const IConstDataAccessor& value_type;\\n\\n\\n\\n\\t/// the type of the pointer returned by operator->\\n\\n\\t/// We can't generally just use value_type * because \\n\\n\\ttypedef const IConstDataAccessor* pointer_type;\\n\\n\\n\\n\\t/// an empty virtual destructor to make the compiler happy\\n\\n\\tvirtual ~IConstDataIterator();\\n\\n\\t\\n\\n\\t/// Restart the iteration from the beginning\\n\\n\\tvirtual void init() = 0;\\n\\n\\t\\n\\n\\t/// Return the data accessor (current chunk) in various ways\\n\\n\\t\\n\\n\\t/// operator* delivers a reference to data accessor (current chunk)\\n\\n\\t/// @return a reference to the current chunk\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/IConstDataIterator.h\",\n \"rank\": 94,\n \"score\": 147299.6159504557\n },\n {\n \"content\": \"/// @brief Read-only access to a source of visibility data\\n\\n/// @details IConstDataSource allows access to a source of visibility data,\\n\\n/// probably either a MeasurementSet or a stream.\\n\\n/// @ingroup dataaccess_i\\n\\nclass IConstDataSource\\n\\n{\\n\\npublic:\\n\\n\\t\\n\\n\\t/// an empty virtual destructor to make the compiler happy\\n\\n\\tvirtual ~IConstDataSource();\\n\\n\\n\\n\\t/// create a converter object corresponding to this type of the\\n\\n\\t/// DataSource. The user can change converting policies (units,\\n\\n\\t/// reference frames) by appropriate calls to this converter object\\n\\n\\t/// and pass it back to createConstIterator(...). The data returned by\\n\\n\\t/// the iteratsr will automatically be in the requested frame/units\\n\\n\\t///\\n\\n\\t/// @return a shared pointer to a new DataConverter object\\n\\n\\t///\\n\\n\\t/// The method acts as a factory by creating a new DataConverter.\\n\\n\\t/// The lifetime of this converter is the same as the lifetime of the\\n\\n\\t/// DataSource object. Therefore, it can be reused multiple times,\\n\\n\\t/// if necessary. However, the behavior of iterators created\\n\\n\\t/// with a particular DataConverter is undefined, if you change\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/IConstDataSource.h\",\n \"rank\": 95,\n \"score\": 147294.9498177687\n },\n {\n \"content\": \"class DataSet\\n\\n{\\n\\n public:\\n\\n DataSet(const std::string& filename, const LOFAR::ParameterSet& parset);\\n\\n ~DataSet();\\n\\n\\n\\n void add(void);\\n\\n\\n\\n private:\\n\\n void create(const std::string& filename);\\n\\n void initAnt(void);\\n\\n void initFields(void);\\n\\n void initSpWindows(void);\\n\\n void initFeeds(void);\\n\\n void initObs(void);\\n\\n\\n\\n casa::MeasurementSet* itsMs;\\n\\n LOFAR::ParameterSet itsParset;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Code/Components/CP/benchmarks/current/msperf/writers/DataSet.h\",\n \"rank\": 96,\n \"score\": 147289.65801521053\n },\n {\n \"content\": \"/// @brief\\n\\n/// An implementation of the data converter (IDataConverter interface).\\n\\n/// @details\\n\\n/// The intention is to use this class in conjunction\\n\\n/// with the table based implementation of the data accessor. However,\\n\\n/// it looks at this stage that this class is relatively general and can be\\n\\n/// used with any implementation of the data accessor layer. One may want to\\n\\n/// write a different implementation to achieve a better optimization, which\\n\\n/// may be specific to a particular DataSource.\\n\\n///\\n\\n/// The main idea is to supply a DataConverter and DataSelector when\\n\\n/// an iterator is requested from the DataSource object. The iterator will\\n\\n/// return the data in the requested frame/units. The end user interacts\\n\\n/// with the IDataConverter interface only.\\n\\n/// @ingroup dataaccess_conv\\n\\nclass BasicDataConverter : virtual public IDataConverterImpl\\n\\n{\\n\\npublic:\\n\\n /// default constructor sets up the default conversion options,\\n\\n /// which are:\\n\\n /// for Epoch, origin/frame are MJD 0 UTC, units are seconds\\n\\n /// (defined in the default arguments for the\\n\\n /// constructor of EpochConverter)\\n\\n /// for Directions, frame is J2000, units are not used\\n\\n BasicDataConverter();\\n\\n\\n\\n /// implementation of the interface methods\\n\\n\\n\\n /// set the reference frame for any time epochs \\n\\n /// (e.g. time-based selection, visibility timestamp)\\n\\n /// The value of the specified measure is the origin epoch. \\n\\n /// All visibility timestamps will be given as offsets from\\n\\n /// it. The units of these offsets are given by the second\\n\\n /// parameter\\n\\n /// @param[in] origin a zero-point for the visibility timestamps \\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/BasicDataConverter.h\",\n \"rank\": 97,\n \"score\": 147070.45819436706\n },\n {\n \"content\": \"/// @brief a factory class creating data monitors \\n\\n/// @details We support both built-in and dynamically loadable\\n\\n/// data monitors (i.e. something which is called for every chunk of the\\n\\n/// data written to the MS). The latter can be used for example to implement\\n\\n/// monitoring via epics.\\n\\n/// @ingroup swcorrelator\\n\\nclass MonitorFactory : private boost::noncopyable {\\n\\n\\n\\n /// @brief default constructor\\n\\n /// @details It is declared private, so this type cannot be explicitly created.\\n\\n /// All work is done via static methods\\n\\n MonitorFactory();\\n\\n\\n\\npublic: \\n\\n /// @brief signature of the factory method\\n\\n /// @details All functions creating an IMonitor objects must have this\\n\\n /// signature. Preferably, such a function should be a static method of the \\n\\n /// appropriate monitor class.\\n\\n typedef IMonitor::ShPtr MonitorCreator(const LOFAR::ParameterSet &);\\n\\n \\n\\n /// @brief helper method to register a monitor\\n\\n /// @param[in] name name of the monitor (key into the map)\\n\\n /// @param[in] creatorFunc factory function able to create the monitor\\n\\n static void registerMonitor(const std::string &name, MonitorCreator *creatorFunc);\\n\\n\\n\\n /// @brief factory method\\n\",\n \"file_path\": \"Code/Components/swcorrelator/current/swcorrelator/MonitorFactory.h\",\n \"rank\": 98,\n \"score\": 146061.64268471245\n },\n {\n \"content\": \"/// @brief an adapter to most methods of IConstDataAccessor with buffering\\n\\n///\\n\\n/// @details This class is somewhat similar to MemBufferDataAccessor, however it is\\n\\n/// not as basic. The latter doesn't manage the cube at all and only ensures that it has\\n\\n/// a conforming size. In contrast, this class returns the existing read-only visibility cube \\n\\n/// until a non-const reference is requested (rwVisibility). Then the read-only visibilities are\\n\\n/// copied to the internal buffer and the reference to this buffer is passed for all later calls\\n\\n/// to read-write and read-only methods until either the shape changes or discardCache method is\\n\\n/// called. The intention is to provide a similar functionality for the flagging methos\\n\\n/// @ingroup dataaccess_hlp\\n\\nclass OnDemandBufferDataAccessor : virtual public MetaDataAccessor,\\n\\n virtual public IDataAccessor,\\n\\n public boost::noncopyable\\n\\n{\\n\\npublic:\\n\\n /// construct an object linked with the given const accessor\\n\\n /// @param[in] acc a reference to the associated accessor\\n\\n explicit OnDemandBufferDataAccessor(const IConstDataAccessor &acc);\\n\\n \\n\\n /// Read-only visibilities (a cube is nRow x nChannel x nPol; \\n\\n /// each element is a complex visibility)\\n\\n ///\\n\\n /// @return a reference to nRow x nChannel x nPol cube, containing\\n\\n /// all visibility data\\n\\n ///\\n\\n virtual const casa::Cube<casa::Complex>& visibility() const;\\n\\n\\n\\n\\t\\n\\n /// Read-write access to visibilities (a cube is nRow x nChannel x nPol;\\n\\n /// each element is a complex visibility)\\n\",\n \"file_path\": \"Code/Base/accessors/current/dataaccess/OnDemandBufferDataAccessor.h\",\n \"rank\": 99,\n \"score\": 144523.30532490328\n }\n]","isConversational":false}}},{"rowIdx":398,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/core/net/netif.cpp"},"repo_name":{"kind":"string","value":"jjzhang166/openthread"},"commit":{"kind":"string","value":"e68e38b8e85fe4eeb3810727cd3583b5f87a4e70"},"file_code":{"kind":"string","value":"\n\n#include <common/code_utils.hpp>\n#include <common/debug.hpp>\n#include <common/message.hpp>\n#include <net/netif.hpp>\n\nnamespace Thread {\nnamespace Ip6 {\n\nNetif *Netif::sNetifListHead = NULL;\nint Netif::sNextInterfaceId = 1;\n\nNetif::Netif() :\n mUnicastChangedTask(&HandleUnicastChangedTask, this)\n{\n mHandlers = NULL;\n mUnicastAddresses = NULL;\n mMulticastAddresses = NULL;\n mInterfaceId = -1;\n mAllRoutersSubscribed = false;\n mNext = NULL;\n}\n\nThreadError Netif::RegisterHandler(NetifHandler &aHandler)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifHandler *cur = mHandlers; cur; cur = cur->mNext)\n {\n if (cur == &aHandler)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aHandler.mNext = mHandlers;\n mHandlers = &aHandler;\n\nexit:\n return error;\n}\n\nThreadError Netif::AddNetif()\n{\n ThreadError error = kThreadError_None;\n Netif *netif;\n\n if (sNetifListHead == NULL)\n {\n sNetifListHead = this;\n }\n else\n {\n netif = sNetifListHead;\n\n do\n {\n if (netif == this)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n while (netif->mNext);\n\n netif->mNext = this;\n }\n\n mNext = NULL;\n\n if (mInterfaceId < 0)\n {\n mInterfaceId = sNextInterfaceId++;\n }\n\nexit:\n return error;\n}\n\nThreadError Netif::RemoveNetif()\n{\n ThreadError error = kThreadError_None;\n\n VerifyOrExit(sNetifListHead != NULL, error = kThreadError_Busy);\n\n if (sNetifListHead == this)\n {\n sNetifListHead = mNext;\n }\n else\n {\n for (Netif *netif = sNetifListHead; netif->mNext; netif = netif->mNext)\n {\n if (netif->mNext != this)\n {\n continue;\n }\n\n netif->mNext = mNext;\n break;\n }\n }\n\n mNext = NULL;\n\nexit:\n return error;\n}\n\nNetif *Netif::GetNext() const\n{\n return mNext;\n}\n\nNetif *Netif::GetNetifById(uint8_t aInterfaceId)\n{\n Netif *netif;\n\n for (netif = sNetifListHead; netif; netif = netif->mNext)\n {\n if (netif->mInterfaceId == aInterfaceId)\n {\n ExitNow();\n }\n }\n\nexit:\n return netif;\n}\n\nNetif *Netif::GetNetifByName(char *aName)\n{\n Netif *netif;\n\n for (netif = sNetifListHead; netif; netif = netif->mNext)\n {\n if (strcmp(netif->GetName(), aName) == 0)\n {\n ExitNow();\n }\n }\n\nexit:\n return netif;\n}\n\nint Netif::GetInterfaceId() const\n{\n return mInterfaceId;\n}\n\nbool Netif::IsMulticastSubscribed(const Address &aAddress) const\n{\n bool rval = false;\n\n if (aAddress.IsLinkLocalAllNodesMulticast() || aAddress.IsRealmLocalAllNodesMulticast())\n {\n ExitNow(rval = true);\n }\n else if (aAddress.IsLinkLocalAllRoutersMulticast() || aAddress.IsRealmLocalAllRoutersMulticast())\n {\n ExitNow(rval = mAllRoutersSubscribed);\n }\n\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur; cur = cur->mNext)\n {\n if (memcmp(&cur->mAddress, &aAddress, sizeof(cur->mAddress)) == 0)\n {\n ExitNow(rval = true);\n }\n }\n\nexit:\n return rval;\n}\n\nvoid Netif::SubscribeAllRoutersMulticast()\n{\n mAllRoutersSubscribed = true;\n}\n\nvoid Netif::UnsubscribeAllRoutersMulticast()\n{\n mAllRoutersSubscribed = false;\n}\n\nThreadError Netif::SubscribeMulticast(NetifMulticastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur; cur = cur->mNext)\n {\n if (cur == &aAddress)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aAddress.mNext = mMulticastAddresses;\n mMulticastAddresses = &aAddress;\n\nexit:\n return error;\n}\n\nThreadError Netif::UnsubscribeMulticast(const NetifMulticastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n if (mMulticastAddresses == &aAddress)\n {\n mMulticastAddresses = mMulticastAddresses->mNext;\n ExitNow();\n }\n else if (mMulticastAddresses != NULL)\n {\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur->mNext; cur = cur->mNext)\n {\n if (cur->mNext == &aAddress)\n {\n cur->mNext = aAddress.mNext;\n ExitNow();\n }\n }\n }\n\n ExitNow(error = kThreadError_Error);\n\nexit:\n return error;\n}\n\nconst NetifUnicastAddress *Netif::GetUnicastAddresses() const\n{\n return mUnicastAddresses;\n}\n\nThreadError Netif::AddUnicastAddress(NetifUnicastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifUnicastAddress *cur = mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur == &aAddress)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aAddress.mNext = mUnicastAddresses;\n mUnicastAddresses = &aAddress;\n\n mUnicastChangedTask.Post();\n\nexit:\n return error;\n}\n\nThreadError Netif::RemoveUnicastAddress(const NetifUnicastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n if (mUnicastAddresses == &aAddress)\n {\n mUnicastAddresses = mUnicastAddresses->GetNext();\n ExitNow();\n }\n else if (mUnicastAddresses != NULL)\n {\n for (NetifUnicastAddress *cur = mUnicastAddresses; cur->GetNext(); cur = cur->GetNext())\n {\n if (cur->mNext == &aAddress)\n {\n cur->mNext = aAddress.mNext;\n ExitNow();\n }\n }\n }\n\n ExitNow(error = kThreadError_Error);\n\nexit:\n mUnicastChangedTask.Post();\n return error;\n}\n\nNetif *Netif::GetNetifList()\n{\n return sNetifListHead;\n}\n\nbool Netif::IsUnicastAddress(const Address &aAddress)\n{\n bool rval = false;\n\n for (Netif *netif = sNetifListHead; netif; netif = netif->mNext)\n {\n for (NetifUnicastAddress *cur = netif->mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur->GetAddress() == aAddress)\n {\n ExitNow(rval = true);\n }\n }\n }\n\nexit:\n return rval;\n}\n\nconst NetifUnicastAddress *Netif::SelectSourceAddress(MessageInfo &aMessageInfo)\n{\n Address *destination = &aMessageInfo.GetPeerAddr();\n int interfaceId = aMessageInfo.mInterfaceId;\n const NetifUnicastAddress *rvalAddr = NULL;\n const Address *candidateAddr;\n uint8_t candidateId;\n uint8_t rvalIface = 0;\n\n for (Netif *netif = GetNetifList(); netif; netif = netif->mNext)\n {\n candidateId = netif->GetInterfaceId();\n\n for (const NetifUnicastAddress *addr = netif->GetUnicastAddresses(); addr; addr = addr->GetNext())\n {\n candidateAddr = &addr->GetAddress();\n\n if (destination->IsLinkLocal() || destination->IsMulticast())\n {\n if (interfaceId != candidateId)\n {\n continue;\n }\n }\n\n if (rvalAddr == NULL)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (*candidateAddr == *destination)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n goto exit;\n }\n else if (candidateAddr->GetScope() < rvalAddr->GetAddress().GetScope())\n {\n \n if (candidateAddr->GetScope() >= destination->GetScope())\n {\n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n else if (candidateAddr->GetScope() > rvalAddr->GetAddress().GetScope())\n {\n if (rvalAddr->GetAddress().GetScope() < destination->GetScope())\n {\n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n else if (addr->mPreferredLifetime != 0 && rvalAddr->mPreferredLifetime == 0)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (aMessageInfo.mInterfaceId != 0 && aMessageInfo.mInterfaceId == candidateId &&\n rvalIface != candidateId)\n {\n \n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (destination->PrefixMatch(*candidateAddr) > destination->PrefixMatch(rvalAddr->GetAddress()))\n {\n \n \n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n }\n\nexit:\n aMessageInfo.mInterfaceId = rvalIface;\n return rvalAddr;\n}\n\nint Netif::GetOnLinkNetif(const Address &aAddress)\n{\n int rval = -1;\n\n for (Netif *netif = sNetifListHead; netif; netif = netif->mNext)\n {\n for (NetifUnicastAddress *cur = netif->mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur->GetAddress().PrefixMatch(aAddress) >= cur->mPrefixLength)\n {\n ExitNow(rval = netif->mInterfaceId);\n }\n }\n }\n\nexit:\n return rval;\n}\n\nvoid Netif::HandleUnicastChangedTask(void *aContext)\n{\n Netif *obj = reinterpret_cast<Netif *>(aContext);\n obj->HandleUnicastChangedTask();\n}\n\nvoid Netif::HandleUnicastChangedTask()\n{\n for (NetifHandler *handler = mHandlers; handler; handler = handler->mNext)\n {\n handler->HandleUnicastAddressesChanged();\n }\n}\n\n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#include <common/code_utils.hpp>\n#include <common/debug.hpp>\n#include <common/message.hpp>\n#include <net/netif.hpp>\n\nnamespace Thread {\nnamespace Ip6 {\n\nNetif *Netif::sNetifListHead = NULL;\nint Netif::sNextInterfaceId = 1;\n\nNetif::Netif() :\n mUnicastChangedTask(&HandleUnicastChangedTask, this)\n{\n mHandlers = NULL;\n mUnicastAddresses = NULL;\n mMulticastAddresses = NULL;\n mInterfaceId = -1;\n mAllRoutersSubscribed = false;\n mNext = NULL;\n}\n\nThreadError Netif::RegisterHandler(NetifHandler &aHandler)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifHandler *cur = mHandlers; cur; cur = cur->mNext)\n {\n if (cur == &aHandler)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aHandler.mNext = mHandlers;\n mHandlers = &aHandler;\n\nexit:\n return error;\n}\n\nThreadError Netif::AddNetif()\n{\n ThreadError error = kThreadError_None;\n Netif *netif;\n\n if (sNetifListHead == NULL)\n {\n sNetifListHead = this;\n }\n else\n {\n netif = sNetifListHead;\n\n do\n {\n if (netif == this)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n while (netif->mNext);\n\n netif->mNext = this;\n }\n\n mNext = NULL;\n\n if (mInterfaceId < 0)\n {\n mInterfaceId = sNextInterfaceId++;\n }\n\nexit:\n return error;\n}\n\nThreadError Netif::RemoveNetif()\n{\n ThreadError error = kThreadError_None;\n\n VerifyOrExit(sNetifListHead != NULL, error = kThreadError_Busy);\n\n if (sNetifListHead == this)\n {\n sNetifListHead = mNext;\n }\n else\n {\n for (Netif *netif = sNetifListHead; netif->mNext; netif = netif->mNext)\n {\n if (netif->mNext != this)\n {\n continue;\n }\n\n netif->mNext = mNext;\n break;\n }\n }\n\n mNext = NULL;\n\nexit:\n return error;\n}\n\nNetif *Netif::GetNext() const\n{\n return mNext;\n}\n\nNetif *Netif::GetNetifById(uint8_t aInterfaceId)\n{\n Netif *netif;\n\n for (netif = sNetifListHead; netif; netif = netif->mNext)\n {\n if (netif->mInterfaceId == aInterfaceId)\n {\n ExitNow();\n }\n }\n\nexit:\n return netif;\n}\n\nNetif *Netif::GetNetifByName(char *aName)\n{\n Netif *netif;\n\n for (netif = sNetifListHead; netif; netif = netif->mNext)\n {\n if (strcmp(netif->GetName(), aName) == 0)\n {\n ExitNow();\n }\n }\n\nexit:\n return netif;\n}\n\nint Netif::GetInterfaceId() const\n{\n return mInterfaceId;\n}\n\nbool Netif::IsMulticastSubscribed(const Address &aAddress) const\n{\n bool rval = false;\n\n if (aAddress.IsLinkLocalAllNodesMulticast() || aAddress.IsRealmLocalAllNodesMulticast())\n {\n ExitNow(rval = true);\n }\n else if (aAddress.IsLinkLocalAllRoutersMulticast() || aAddress.IsRealmLocalAllRoutersMulticast())\n {\n ExitNow(rval = mAllRoutersSubscribed);\n }\n\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur; cur = cur->mNext)\n {\n if (memcmp(&cur->mAddress, &aAddress, sizeof(cur->mAddress)) == 0)\n {\n ExitNow(rval = true);\n }\n }\n\nexit:\n return rval;\n}\n\nvoid Netif::SubscribeAllRoutersMulticast()\n{\n mAllRoutersSubscribed = true;\n}\n\nvoid Netif::UnsubscribeAllRoutersMulticast()\n{\n mAllRoutersSubscribed = false;\n}\n\nThreadError Netif::SubscribeMulticast(NetifMulticastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur; cur = cur->mNext)\n {\n if (cur == &aAddress)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aAddress.mNext = mMulticastAddresses;\n mMulticastAddresses = &aAddress;\n\nexit:\n return error;\n}\n\nThreadError Netif::UnsubscribeMulticast(const NetifMulticastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n if (mMulticastAddresses == &aAddress)\n {\n mMulticastAddresses = mMulticastAddresses->mNext;\n ExitNow();\n }\n else if (mMulticastAddresses != NULL)\n {\n for (NetifMulticastAddress *cur = mMulticastAddresses; cur->mNext; cur = cur->mNext)\n {\n if (cur->mNext == &aAddress)\n {\n cur->mNext = aAddress.mNext;\n ExitNow();\n }\n }\n }\n\n ExitNow(error = kThreadError_Error);\n\nexit:\n return error;\n}\n\nconst NetifUnicastAddress *Netif::GetUnicastAddresses() const\n{\n return mUnicastAddresses;\n}\n\nThreadError Netif::AddUnicastAddress(NetifUnicastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n for (NetifUnicastAddress *cur = mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur == &aAddress)\n {\n ExitNow(error = kThreadError_Busy);\n }\n }\n\n aAddress.mNext = mUnicastAddresses;\n mUnicastAddresses = &aAddress;\n\n mUnicastChangedTask.Post();\n\nexit:\n return error;\n}\n\nThreadError Netif::RemoveUnicastAddress(const NetifUnicastAddress &aAddress)\n{\n ThreadError error = kThreadError_None;\n\n if (mUnicastAddresses == &aAddress)\n {\n mUnicastAddresses = mUnicastAddresses->GetNext();\n ExitNow();\n }\n else if (mUnicastAddresses != NULL)\n {\n for (NetifUnicastAddress *cur = mUnicastAddresses; cur->GetNext(); cur = cur->GetNext())\n {\n if (cur->mNext == &aAddress)\n {\n cur->mNext = aAddress.mNext;\n ExitNow();\n }\n }\n }\n\n ExitNow(error = kThreadError_Error);\n\nexit:\n mUnicastChangedTask.Post();\n return error;\n}\n\nNetif *Netif::GetNetifList()\n{\n return sNetifListHead;\n}\n\nbool Netif::IsUnicastAddress(const Address &aAddress)\n{\n bool rval = false;\n\n for (Netif *netif = sNetifListHead; netif; netif = netif->mNext)\n {\n for (NetifUnicastAddress *cur = netif->mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur->GetAddress() == aAddress)\n {\n ExitNow(rval = true);\n }\n }\n }\n\nexit:\n return rval;\n}\n\nconst NetifUnicastAddress *Netif::SelectSourceAddress(MessageInfo &aMessageInfo)\n{\n Address *destination = &aMessageInfo.GetPeerAddr();\n int interfaceId = aMessageInfo.mInterfaceId;\n const NetifUnicastAddress *rvalAddr = NULL;\n const Address *candidateAddr;\n uint8_t candidateId;\n uint8_t rvalIface = 0;\n\n for (Netif *netif = GetNetifList(); netif; netif = netif->mNext)\n {\n candidateId = netif->GetInterfaceId();\n\n for (const NetifUnicastAddress *addr = netif->GetUnicastAddresses(); addr; addr = addr->GetNext())\n {\n candidateAddr = &addr->GetAddress();\n\n if (destination->IsLinkLocal() || destination->IsMulticast())\n {\n if (interfaceId != candidateId)\n {\n continue;\n }\n }\n\n if (rvalAddr == NULL)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (*candidateAddr == *destination)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n goto exit;\n }\n else if (candidateAddr->GetScope() < rvalAddr->GetAddress().GetScope())\n {\n \n if (candidateAddr->GetScope() >= destination->GetScope())\n {\n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n else if (candidateAddr->GetScope() > rvalAddr->GetAddress().GetScope())\n {\n if (rvalAddr->"},"suffix":{"kind":"string","value":"\n\nint Netif::GetOnLinkNetif(const Address &aAddress)\n{\n int rval = -1;\n\n for (Netif *netif = sNetifListHead; netif; netif = netif->mNext)\n {\n for (NetifUnicastAddress *cur = netif->mUnicastAddresses; cur; cur = cur->GetNext())\n {\n if (cur->GetAddress().PrefixMatch(aAddress) >= cur->mPrefixLength)\n {\n ExitNow(rval = netif->mInterfaceId);\n }\n }\n }\n\nexit:\n return rval;\n}\n\nvoid Netif::HandleUnicastChangedTask(void *aContext)\n{\n Netif *obj = reinterpret_cast<Netif *>(aContext);\n obj->HandleUnicastChangedTask();\n}\n\nvoid Netif::HandleUnicastChangedTask()\n{\n for (NetifHandler *handler = mHandlers; handler; handler = handler->mNext)\n {\n handler->HandleUnicastAddressesChanged();\n }\n}\n\n} \n} \n"},"middle":{"kind":"string","value":"GetAddress().GetScope() < destination->GetScope())\n {\n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n else if (addr->mPreferredLifetime != 0 && rvalAddr->mPreferredLifetime == 0)\n {\n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (aMessageInfo.mInterfaceId != 0 && aMessageInfo.mInterfaceId == candidateId &&\n rvalIface != candidateId)\n {\n \n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n else if (destination->PrefixMatch(*candidateAddr) > destination->PrefixMatch(rvalAddr->GetAddress()))\n {\n \n \n \n rvalAddr = addr;\n rvalIface = candidateId;\n }\n }\n }\n\nexit:\n aMessageInfo.mInterfaceId = rvalIface;\n return rvalAddr;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"class ThreadNetif: public Ip6::Netif\n\n{\n\npublic:\n\n /**\n\n * This constructor initializes the Thread network interface.\n\n *\n\n */\n\n ThreadNetif(void);\n\n\n\n /**\n\n * This method enables the Thread network interface.\n\n *\n\n */\n\n ThreadError Up(void);\n\n\n\n /**\n\n * This method disables the Thread network interface.\n\n *\n\n */\n\n ThreadError Down(void);\n","file_path":"src/core/thread/thread_netif.hpp","rank":0,"score":229476.2600924089},{"content":" class Buffer *GetNextBuffer(void) const { return mHeader.mNext; }\n\n\n\n /**\n\n * This method sets the pointer to the next message buffer.\n\n *\n\n */\n\n void SetNextBuffer(class Buffer *buf) { mHeader.mNext = buf; }\n\n\n\nprivate:\n\n /**\n\n * This method returns a pointer to the first byte of data in the first message buffer.\n\n *\n\n * @returns A pointer to the first data byte.\n\n *\n\n */\n\n uint8_t *GetFirstData(void) { return mHeadData; }\n\n\n\n /**\n\n * This method returns a pointer to the first byte of data in the first message buffer.\n\n *\n","file_path":"src/core/common/message.hpp","rank":1,"score":200601.5930662636},{"content":"class ThreadNetif;\n","file_path":"src/core/thread/address_resolver.hpp","rank":2,"score":161911.49890523514},{"content":"class Address: public otIp6Address\n\n{\n\npublic:\n\n /**\n\n * Constants\n\n *\n\n */\n\n enum\n\n {\n\n kInterfaceIdentifierSize = 8, ///< Interface Identifier size in bytes.\n\n };\n\n\n\n /**\n\n * IPv6 Address Scopes\n\n */\n\n enum\n\n {\n\n kNodeLocalScope = 0, ///< Node-Local scope\n\n kInterfaceLocalScope = 1, ///< Interface-Local scope\n\n kLinkLocalScope = 2, ///< Link-Local scope\n","file_path":"src/core/net/ip6_address.hpp","rank":3,"score":155845.0499763362},{"content":"class NetifUnicastAddress: public otNetifAddress\n\n{\n\n friend class Netif;\n\n\n\npublic:\n\n /**\n\n * This method returns the unicast address.\n\n *\n\n * @returns The unicast address.\n\n *\n\n */\n\n const Address &GetAddress(void) const { return *static_cast<const Address *>(&mAddress); }\n\n\n\n /**\n\n * This method returns the unicast address.\n\n *\n\n * @returns The unicast address.\n\n *\n\n */\n\n Address &GetAddress(void) { return *static_cast<Address *>(&mAddress); }\n","file_path":"src/core/net/netif.hpp","rank":4,"score":154618.25790192393},{"content":"class NetifMulticastAddress\n\n{\n\n friend class Netif;\n\n\n\npublic:\n\n /**\n\n * This method returns the multicast address.\n\n *\n\n * @returns The multicast address.\n\n *\n\n */\n\n const Address &GetAddress(void) const { return *static_cast<const Address *>(&mAddress); }\n\n\n\n /**\n\n * This method returns the multicast address.\n\n *\n\n * @returns The multicast address.\n\n *\n\n */\n\n Address &GetAddress(void) { return *static_cast<Address *>(&mAddress); }\n","file_path":"src/core/net/netif.hpp","rank":5,"score":152626.59057236684},{"content":" void *address;\n","file_path":"third_party/nlbuild-autotools/repo/tools/host/include/ltdl.h","rank":6,"score":137945.55823489535},{"content":" mIsUp = true;\n\n return kThreadError_None;\n\n}\n\n\n\nThreadError ThreadNetif::Down(void)\n\n{\n\n mCoapServer.Stop();\n\n mMleRouter.Stop();\n\n mMeshForwarder.Stop();\n\n Netif::RemoveNetif();\n\n mIsUp = false;\n\n return kThreadError_None;\n\n}\n\n\n\nbool ThreadNetif::IsUp(void) const\n\n{\n\n return mIsUp;\n\n}\n\n\n\nThreadError ThreadNetif::GetLinkAddress(Ip6::LinkAddress &address) const\n","file_path":"src/core/thread/thread_netif.cpp","rank":7,"score":114798.49630142128},{"content":"{\n\n address.mType = Ip6::LinkAddress::kEui64;\n\n address.mLength = sizeof(address.mExtAddress);\n\n memcpy(&address.mExtAddress, mMac.GetExtAddress(), address.mLength);\n\n return kThreadError_None;\n\n}\n\n\n\nThreadError ThreadNetif::RouteLookup(const Ip6::Address &source, const Ip6::Address &destination, uint8_t *prefixMatch)\n\n{\n\n return mNetworkDataLeader.RouteLookup(source, destination, prefixMatch, NULL);\n\n}\n\n\n\nThreadError ThreadNetif::SendMessage(Message &message)\n\n{\n\n return mMeshForwarder.SendMessage(message);\n\n}\n\n\n\n} // namespace Thread\n","file_path":"src/core/thread/thread_netif.cpp","rank":8,"score":114796.3174057129},{"content":" * @param[in] aDestination A reference to the IPv6 destination address.\n\n * @param[out] aPrefixMatch A pointer where the number of prefix match bits for the chosen route is stored.\n\n *\n\n * @retval kThreadError_None Successfully found a route.\n\n * @retval kThreadError_NoRoute Could not find a valid route.\n\n *\n\n */\n\n ThreadError RouteLookup(const Ip6::Address &aSource, const Ip6::Address &aDestination, uint8_t *aPrefixMatch);\n\n\n\n /**\n\n * This method returns a pointer to the address resolver object.\n\n *\n\n * @returns A pointer to the address resolver object.\n\n *\n\n */\n\n AddressResolver &GetAddressResolver(void) { return mAddressResolver; }\n\n\n\n /**\n\n * This method returns a pointer to the coap server object.\n\n *\n","file_path":"src/core/thread/thread_netif.hpp","rank":9,"score":114786.40263151436},{"content":"\n\n /**\n\n * This method indicates whether or not the Thread network interface is enabled.\n\n *\n\n * @retval TRUE If the Thread network interface is enabled.\n\n * @retval FALSE If the Thread network interface is not enabled.\n\n *\n\n */\n\n bool IsUp(void) const;\n\n\n\n /**\n\n * This method returns a pointer to a NULL-terminated string that names the interface.\n\n *\n\n * @returns A pointer to a NULL-terminated string that names the interface.\n\n *\n\n */\n\n const char *GetName(void) const;\n\n\n\n /**\n\n * This method retrieves the link address.\n","file_path":"src/core/thread/thread_netif.hpp","rank":10,"score":114784.48580565417},{"content":"#include <thread/thread_netif.hpp>\n\n#include <thread/thread_tlvs.hpp>\n\n\n\nusing Thread::Encoding::BigEndian::HostSwap16;\n\n\n\nnamespace Thread {\n\n\n\nstatic const uint8_t kThreadMasterKey[] =\n\n{\n\n 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77,\n\n 0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff,\n\n};\n\n\n\nstatic const char name[] = \"thread\";\n\n\n\nThreadNetif::ThreadNetif(void):\n\n mCoapServer(kCoapUdpPort),\n\n mAddressResolver(*this),\n\n mKeyManager(*this),\n\n mLowpan(*this),\n","file_path":"src/core/thread/thread_netif.cpp","rank":11,"score":114783.3138399322},{"content":"#include <thread/key_manager.hpp>\n\n#include <thread/mesh_forwarder.hpp>\n\n#include <thread/mle.hpp>\n\n#include <thread/mle_router.hpp>\n\n#include <thread/network_data_local.hpp>\n\n\n\nnamespace Thread {\n\n\n\n/**\n\n * @addtogroup core-netif\n\n *\n\n * @brief\n\n * This module includes definitions for the Thread network interface.\n\n *\n\n * @{\n\n */\n\n\n","file_path":"src/core/thread/thread_netif.hpp","rank":12,"score":114776.5519470204},{"content":" *\n\n * @param[out] aAddress A reference to the link address.\n\n *\n\n */\n\n ThreadError GetLinkAddress(Ip6::LinkAddress &aAddress) const;\n\n\n\n /**\n\n * This method submits a message to the network interface.\n\n *\n\n * @param[in] aMessage A reference to the message.\n\n *\n\n * @retval kThreadError_None Successfully submitted the message to the interface.\n\n *\n\n */\n\n ThreadError SendMessage(Message &aMessage);\n\n\n\n /**\n\n * This method performs a route lookup.\n\n *\n\n * @param[in] aSource A reference to the IPv6 source address.\n","file_path":"src/core/thread/thread_netif.hpp","rank":13,"score":114776.43672335584},{"content":" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n */\n\n\n\n/**\n\n * @file\n\n * This file includes definitions for the Thread network interface.\n\n */\n\n\n\n#ifndef THREAD_NETIF_HPP_\n\n#define THREAD_NETIF_HPP_\n\n\n\n#include <openthread-types.h>\n\n#include <mac/mac.hpp>\n\n#include <net/netif.hpp>\n\n#include <thread/address_resolver.hpp>\n","file_path":"src/core/thread/thread_netif.hpp","rank":14,"score":114775.98904557679},{"content":" mMac(*this),\n\n mMeshForwarder(*this),\n\n mMleRouter(*this),\n\n mNetworkDataLocal(*this),\n\n mNetworkDataLeader(*this)\n\n{\n\n mKeyManager.SetMasterKey(kThreadMasterKey, sizeof(kThreadMasterKey));\n\n}\n\n\n\nconst char *ThreadNetif::GetName(void) const\n\n{\n\n return name;\n\n}\n\n\n\nThreadError ThreadNetif::Up(void)\n\n{\n\n Netif::AddNetif();\n\n mMeshForwarder.Start();\n\n mMleRouter.Start();\n\n mCoapServer.Start();\n","file_path":"src/core/thread/thread_netif.cpp","rank":15,"score":114775.96569012286},{"content":" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n */\n\n\n\n/**\n\n * @file\n\n * This file implements the Thread network interface.\n\n */\n\n\n\n#include <common/code_utils.hpp>\n\n#include <common/encoding.hpp>\n\n#include <common/message.hpp>\n\n#include <net/ip6.hpp>\n\n#include <net/netif.hpp>\n\n#include <net/udp6.hpp>\n\n#include <thread/mle.hpp>\n","file_path":"src/core/thread/thread_netif.cpp","rank":16,"score":114772.95012253907},{"content":"\n\nprivate:\n\n Coap::Server mCoapServer;\n\n AddressResolver mAddressResolver;\n\n KeyManager mKeyManager;\n\n Lowpan::Lowpan mLowpan;\n\n Mac::Mac mMac;\n\n MeshForwarder mMeshForwarder;\n\n Mle::MleRouter mMleRouter;\n\n NetworkData::Local mNetworkDataLocal;\n\n NetworkData::Leader mNetworkDataLeader;\n\n bool mIsUp;\n\n};\n\n\n\n/**\n\n * This structure represents Thread-specific link information.\n\n *\n\n */\n","file_path":"src/core/thread/thread_netif.hpp","rank":17,"score":114767.42469298828},{"content":" * @returns A pointer to the coap server object.\n\n *\n\n */\n\n Coap::Server &GetCoapServer(void) { return mCoapServer; }\n\n\n\n /**\n\n * This method returns a pointer to the key manager object.\n\n *\n\n * @returns A pointer to the key manager object.\n\n *\n\n */\n\n KeyManager &GetKeyManager(void) { return mKeyManager; }\n\n\n\n /**\n\n * This method returns a pointer to the lowpan object.\n\n *\n\n * @returns A pointer to the lowpan object.\n\n *\n\n */\n\n Lowpan::Lowpan &GetLowpan(void) { return mLowpan; }\n","file_path":"src/core/thread/thread_netif.hpp","rank":18,"score":114759.69835033688},{"content":" * @returns A pointer to the mesh forwarder object.\n\n *\n\n */\n\n MeshForwarder &GetMeshForwarder(void) { return mMeshForwarder; }\n\n\n\n /**\n\n * This method returns a pointer to the network data local object.\n\n *\n\n * @returns A pointer to the network data local object.\n\n *\n\n */\n\n NetworkData::Local &GetNetworkDataLocal(void) { return mNetworkDataLocal; }\n\n\n\n /**\n\n * This method returns a pointer to the network data leader object.\n\n *\n\n * @returns A pointer to the network data leader object.\n\n *\n\n */\n\n NetworkData::Leader &GetNetworkDataLeader(void) { return mNetworkDataLeader; }\n","file_path":"src/core/thread/thread_netif.hpp","rank":19,"score":114759.45141070873},{"content":"\n\n /**\n\n * This method returns a pointer to the mac object.\n\n *\n\n * @returns A pointer to the mac object.\n\n *\n\n */\n\n Mac::Mac &GetMac(void) { return mMac; }\n\n\n\n /**\n\n * This method returns a pointer to the mle object.\n\n *\n\n * @returns A pointer to the mle object.\n\n *\n\n */\n\n Mle::MleRouter &GetMle(void) { return mMleRouter; }\n\n\n\n /**\n\n * This method returns a pointer to the mesh forwarder object.\n\n *\n","file_path":"src/core/thread/thread_netif.hpp","rank":20,"score":114759.37623629822},{"content":"/*\n\n * Copyright (c) 2016, Nest Labs, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n * 1. Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * 2. Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * 3. Neither the name of the copyright holder nor the\n\n * names of its contributors may be used to endorse or promote products\n\n * derived from this software without specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n","file_path":"src/core/thread/thread_netif.cpp","rank":21,"score":114756.9481988199},{"content":"/*\n\n * Copyright (c) 2016, Nest Labs, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n * 1. Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * 2. Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * 3. Neither the name of the copyright holder nor the\n\n * names of its contributors may be used to endorse or promote products\n\n * derived from this software without specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n","file_path":"src/core/thread/thread_netif.hpp","rank":22,"score":114756.9481988199},{"content":"struct ThreadMessageInfo\n\n{\n\n uint8_t mLinkMargin; ///< The Link Margin for a received message in dBm.\n\n};\n\n\n\n/**\n\n * @}\n\n */\n\n\n\n} // namespace Thread\n\n\n\n#endif // THREAD_NETIF_HPP_\n","file_path":"src/core/thread/thread_netif.hpp","rank":23,"score":114297.83099104001},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nBR = 2\n\nROUTER2 = 3\n\nROUTER3 = 4\n\nSED2 = 5\n\n\n\nclass Cert_5_3_9_AddressQuery(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,6):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[BR].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER3].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[BR].set_panid(0xface)\n\n self.nodes[BR].set_mode('rsdn')\n\n self.nodes[BR].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[BR].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[SED2].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n self.nodes[ROUTER3].set_panid(0xface)\n\n self.nodes[ROUTER3].set_mode('rsdn')\n\n self.nodes[ROUTER3].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER3].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ROUTER3].enable_whitelist()\n\n\n\n self.nodes[SED2].set_panid(0xface)\n\n self.nodes[SED2].set_mode('sn')\n\n self.nodes[SED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[SED2].set_timeout(3)\n\n self.nodes[SED2].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[BR].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[BR].get_state(), 'router')\n\n\n\n self.nodes[BR].add_prefix('2003::/64', 'pvcrs')\n\n self.nodes[BR].add_prefix('2004::/64', 'pvcrs')\n\n self.nodes[BR].register_netdata()\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n self.nodes[ROUTER3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER3].get_state(), 'router')\n\n\n\n self.nodes[SED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[SED2].get_state(), 'child')\n\n\n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[SED2].ping(addr)\n\n\n\n addrs = self.nodes[SED2].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[BR].ping(addr)\n\n\n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[SED2].ping(addr)\n\n\n\n self.nodes[ROUTER3].stop()\n\n time.sleep(300)\n\n \n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[SED2].ping(addr)\n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\n self.nodes[SED2].stop()\n\n time.sleep(10)\n\n\n\n addrs = self.nodes[SED2].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[BR].ping(addr)\n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_3_10_AddressQuery.py","rank":24,"score":113207.01380080033},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nBR = 1\n\nLEADER = 2\n\nROUTER2 = 3\n\nROUTER3 = 4\n\nED2 = 5\n\n\n\nclass Cert_5_3_3_AddressQuery(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,6):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[BR].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER3].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[BR].set_panid(0xface)\n\n self.nodes[BR].set_mode('rsdn')\n\n self.nodes[BR].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[BR].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER3].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n self.nodes[ROUTER3].set_panid(0xface)\n\n self.nodes[ROUTER3].set_mode('rsdn')\n\n self.nodes[ROUTER3].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER3].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ROUTER3].enable_whitelist()\n\n\n\n self.nodes[ED2].set_panid(0xface)\n\n self.nodes[ED2].set_mode('rsn')\n\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ED2].set_timeout(3)\n\n self.nodes[ED2].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[BR].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[BR].get_state(), 'router')\n\n\n\n self.nodes[BR].add_prefix('2003::/64', 'pvcrs')\n\n self.nodes[BR].add_prefix('2004::/64', 'pvcrs')\n\n self.nodes[BR].register_netdata()\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n self.nodes[ROUTER3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER3].get_state(), 'router')\n\n\n\n self.nodes[ED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\n\n\n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[ED2].ping(addr)\n\n time.sleep(1)\n\n\n\n addrs = self.nodes[ED2].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[LEADER].ping(addr)\n\n time.sleep(1)\n\n\n\n addrs = self.nodes[BR].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[ED2].ping(addr)\n\n time.sleep(1)\n\n\n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[ED2].ping(addr)\n\n time.sleep(1)\n\n\n\n addrs = self.nodes[ROUTER3].get_addrs()\n\n self.nodes[ROUTER3].stop()\n\n time.sleep(130)\n\n\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[ED2].ping(addr)\n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\n addrs = self.nodes[ED2].get_addrs()\n\n self.nodes[ED2].stop()\n\n time.sleep(10)\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[BR].ping(addr) \n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_3_03_AddressQuery.py","rank":25,"score":113207.01380080033},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER1 = 2\n\nROUTER2 = 3\n\nED1 = 4\n\nED2 = 5\n\nED3 = 6\n\n\n\nclass Cert_5_3_7_DuplicateAddress(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,7):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER1].set_panid(0xface)\n\n self.nodes[ROUTER1].set_mode('rsdn')\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[ED1].get_addr64())\n\n self.nodes[ROUTER1].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n self.nodes[ED1].set_panid(0xface)\n\n self.nodes[ED1].set_mode('rsn')\n\n self.nodes[ED1].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[ED1].enable_whitelist()\n\n\n\n self.nodes[ED2].set_panid(0xface)\n\n self.nodes[ED2].set_mode('rsn')\n\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ED2].enable_whitelist()\n\n\n\n self.nodes[ED3].set_panid(0xface)\n\n self.nodes[ED3].set_mode('rsn')\n\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED3].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n self.nodes[ED1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\n\n\n\n self.nodes[ED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\n\n\n\n self.nodes[ED3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\n\n\n\n self.nodes[ROUTER2].add_prefix('2001::/64', 'pvcrs')\n\n self.nodes[ROUTER2].register_netdata()\n\n\n\n self.nodes[ED1].add_ipaddr('2001::1')\n\n self.nodes[ED2].add_ipaddr('2001::1')\n\n time.sleep(3)\n\n\n\n self.nodes[ED3].ping('2001::1')\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_3_07_DuplicateAddress.py","rank":26,"score":113207.01380080033},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nED1 = 1\n\nBR1 = 2\n\nLEADER = 3\n\nROUTER2 = 4\n\nREED = 5\n\nED2 = 6\n\nED3 = 7\n\n\n\nclass Cert_5_2_5_AddressQuery(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,8):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[BR1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[REED].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[BR1].set_panid(0xface)\n\n self.nodes[BR1].set_mode('rsdn')\n\n self.nodes[BR1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[BR1].add_whitelist(self.nodes[ED1].get_addr64())\n\n self.nodes[BR1].enable_whitelist()\n\n\n\n self.nodes[ED1].set_panid(0xface)\n\n self.nodes[ED1].set_mode('rsn')\n\n self.nodes[ED1].add_whitelist(self.nodes[BR1].get_addr64())\n\n self.nodes[ED1].enable_whitelist()\n\n\n\n self.nodes[REED].set_panid(0xface)\n\n self.nodes[REED].set_mode('rsdn')\n\n self.nodes[REED].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[REED].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[REED].set_router_upgrade_threshold(0)\n\n self.nodes[REED].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[REED].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED3].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n self.nodes[ED2].set_panid(0xface)\n\n self.nodes[ED2].set_mode('rsn')\n\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ED2].enable_whitelist()\n\n\n\n self.nodes[ED3].set_panid(0xface)\n\n self.nodes[ED3].set_mode('rsn')\n\n self.nodes[ED3].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ED3].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[BR1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[BR1].get_state(), 'router')\n\n\n\n self.nodes[BR1].add_prefix('2003::/64', 'pvcrs')\n\n self.nodes[BR1].add_prefix('2004::/64', 'pvcrs')\n\n self.nodes[BR1].register_netdata()\n\n\n\n self.nodes[ED1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\n\n\n\n self.nodes[REED].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[REED].get_state(), 'child')\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n self.nodes[ED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\n\n\n\n self.nodes[ED3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\n\n\n\n addrs = self.nodes[REED].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[ED2].ping(addr)\n\n time.sleep(1)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_2_05_AddressQuery.py","rank":27,"score":113207.01380080033},{"content":"class ThreadNetif;\n","file_path":"src/core/thread/mle.hpp","rank":28,"score":112814.99743628965},{"content":"class ThreadNetif;\n\n\n\nnamespace NetworkData { class Leader; }\n\n\n\n/**\n\n * @addtogroup core-6lowpan\n\n *\n\n * @brief\n\n * This module includes definitions for 6LoWPAN header compression.\n\n *\n\n * @{\n\n */\n\n\n\n/**\n\n * @namespace Thread::Lowpan\n\n *\n\n * @brief\n\n * This namespace includes definitions for 6LoWPAN message processing.\n\n *\n\n */\n\nnamespace Lowpan {\n\n\n\n/**\n\n * This structure represents a LOWPAN_IPHC Context.\n\n *\n\n */\n","file_path":"src/core/thread/lowpan.hpp","rank":29,"score":112814.99743628965},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nED1 = 2\n\nED2 = 3\n\nED3 = 4\n\nED4 = 5\n\n\n\nclass Cert_5_3_8_ChildAddressSet(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,6):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED4].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ED1].set_panid(0xface)\n\n self.nodes[ED1].set_mode('rsn')\n\n self.nodes[ED1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED1].enable_whitelist()\n\n\n\n self.nodes[ED2].set_panid(0xface)\n\n self.nodes[ED2].set_mode('rsn')\n\n self.nodes[ED2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED2].enable_whitelist()\n\n\n\n self.nodes[ED3].set_panid(0xface)\n\n self.nodes[ED3].set_mode('rsn')\n\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED3].enable_whitelist()\n\n\n\n self.nodes[ED4].set_panid(0xface)\n\n self.nodes[ED4].set_mode('rsn')\n\n self.nodes[ED4].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED4].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ED1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\n\n\n\n self.nodes[ED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\n\n\n\n self.nodes[ED3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\n\n\n\n self.nodes[ED4].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED4].get_state(), 'child')\n\n\n\n for i in range(2,6):\n\n addrs = self.nodes[i].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[LEADER].ping(addr)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_3_08_ChildAddressSet.py","rank":30,"score":111399.71214581616},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER1 = 2\n\n\n\nclass Cert_5_1_05_RouterAddressTimeout(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,3):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER1].set_panid(0xface)\n\n self.nodes[ROUTER1].set_mode('rsdn')\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER1].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n\n\n rloc16 = self.nodes[ROUTER1].get_addr16()\n\n\n\n self.nodes[ROUTER1].stop()\n\n time.sleep(200)\n\n self.nodes[ROUTER1].start()\n\n time.sleep(5)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n self.assertNotEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\n\n\n\n rloc16 = self.nodes[ROUTER1].get_addr16()\n\n\n\n self.nodes[ROUTER1].stop()\n\n time.sleep(300)\n\n self.nodes[ROUTER1].start()\n\n time.sleep(5)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_1_05_RouterAddressTimeout.py","rank":31,"score":111399.71214581616},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER1 = 2\n\nROUTER2 = 3\n\n\n\nclass Cert_5_1_03_RouterAddressReallocation(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,4):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER1].set_panid(0xface)\n\n self.nodes[ROUTER1].set_mode('rsdn')\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ROUTER1].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n rloc16 = self.nodes[ROUTER1].get_addr16()\n\n\n\n self.nodes[ROUTER2].set_network_id_timeout(110)\n\n self.nodes[LEADER].stop()\n\n time.sleep(130)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'leader')\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_1_03_RouterAddressReallocation.py","rank":32,"score":111399.71214581616},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER = 2\n\nED = 3\n\nSED = 4\n\n\n\nclass Cert_5_1_02_ChildAddressTimeout(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,5):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER].set_panid(0xface)\n\n self.nodes[ROUTER].set_mode('rsdn')\n\n self.nodes[ROUTER].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER].add_whitelist(self.nodes[ED].get_addr64())\n\n self.nodes[ROUTER].add_whitelist(self.nodes[SED].get_addr64())\n\n self.nodes[ROUTER].enable_whitelist()\n\n\n\n self.nodes[ED].set_panid(0xface)\n\n self.nodes[ED].set_mode('rsn')\n\n self.nodes[ED].set_timeout(3)\n\n self.nodes[ED].add_whitelist(self.nodes[ROUTER].get_addr64())\n\n self.nodes[ED].enable_whitelist()\n\n\n\n self.nodes[SED].set_panid(0xface)\n\n self.nodes[SED].set_mode('sn')\n\n self.nodes[SED].set_timeout(3)\n\n self.nodes[SED].add_whitelist(self.nodes[ROUTER].get_addr64())\n\n self.nodes[SED].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER].get_state(), 'router')\n\n\n\n self.nodes[ED].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED].get_state(), 'child')\n\n\n\n self.nodes[SED].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[SED].get_state(), 'child')\n\n\n\n ed_addrs = self.nodes[ED].get_addrs()\n\n sed_addrs = self.nodes[SED].get_addrs()\n\n\n\n self.nodes[ED].stop()\n\n time.sleep(5)\n\n for addr in ed_addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[LEADER].ping(addr)\n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\n self.nodes[SED].stop()\n\n time.sleep(5)\n\n for addr in sed_addrs:\n\n if addr[0:4] != 'fe80':\n\n try:\n\n self.nodes[LEADER].ping(addr)\n\n self.assertFalse()\n\n except pexpect.TIMEOUT:\n\n pass\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_1_02_ChildAddressTimeout.py","rank":33,"score":111399.71214581616},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER1 = 2\n\nSED1 = 3\n\nED2 = 4\n\nED3 = 5\n\nED4 = 6\n\nED5 = 7\n\n\n\nclass Cert_5_3_4_AddressMapCache(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,8):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED2].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED4].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ED5].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER1].set_panid(0xface)\n\n self.nodes[ROUTER1].set_mode('rsdn')\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[SED1].get_addr64())\n\n self.nodes[ROUTER1].enable_whitelist()\n\n\n\n self.nodes[SED1].set_panid(0xface)\n\n self.nodes[SED1].set_mode('rsn')\n\n self.nodes[SED1].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[SED1].enable_whitelist()\n\n\n\n self.nodes[ED2].set_panid(0xface)\n\n self.nodes[ED2].set_mode('rsn')\n\n self.nodes[ED2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED2].enable_whitelist()\n\n\n\n self.nodes[ED3].set_panid(0xface)\n\n self.nodes[ED3].set_mode('rsn')\n\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED3].enable_whitelist()\n\n\n\n self.nodes[ED4].set_panid(0xface)\n\n self.nodes[ED4].set_mode('rsn')\n\n self.nodes[ED4].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED4].enable_whitelist()\n\n\n\n self.nodes[ED5].set_panid(0xface)\n\n self.nodes[ED5].set_mode('rsn')\n\n self.nodes[ED5].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ED5].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n\n\n self.nodes[SED1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[SED1].get_state(), 'child')\n\n\n\n self.nodes[ED2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\n\n\n\n self.nodes[ED3].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\n\n\n\n self.nodes[ED4].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED4].get_state(), 'child')\n\n\n\n self.nodes[ED5].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ED5].get_state(), 'child')\n\n\n\n for i in range(4, 8):\n\n addrs = self.nodes[i].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[SED1].ping(addr)\n\n\n\n for i in range(4, 8):\n\n addrs = self.nodes[i].get_addrs()\n\n for addr in addrs:\n\n if addr[0:4] != 'fe80':\n\n self.nodes[SED1].ping(addr)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_3_04_AddressMapCache.py","rank":34,"score":111399.71214581616},{"content":"#!/usr/bin/python\n\n#\n\n# Copyright (c) 2016, Nest Labs, Inc.\n\n# All rights reserved.\n\n#\n\n# Redistribution and use in source and binary forms, with or without\n\n# modification, are permitted provided that the following conditions are met:\n\n# 1. Redistributions of source code must retain the above copyright\n\n# notice, this list of conditions and the following disclaimer.\n\n# 2. Redistributions in binary form must reproduce the above copyright\n\n# notice, this list of conditions and the following disclaimer in the\n\n# documentation and/or other materials provided with the distribution.\n\n# 3. Neither the name of the copyright holder nor the\n\n# names of its contributors may be used to endorse or promote products\n\n# derived from this software without specific prior written permission.\n\n#\n\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n# POSSIBILITY OF SUCH DAMAGE.\n\n#\n\n\n\nimport pexpect\n\nimport time\n\nimport unittest\n\n\n\nimport node\n\n\n\nLEADER = 1\n\nROUTER1 = 2\n\nROUTER2 = 3\n\n\n\nclass Cert_5_1_04_RouterAddressReallocation(unittest.TestCase):\n\n def setUp(self):\n\n self.nodes = {}\n\n for i in range(1,4):\n\n self.nodes[i] = node.Node(i)\n\n\n\n self.nodes[LEADER].set_panid(0xface)\n\n self.nodes[LEADER].set_mode('rsdn')\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[LEADER].enable_whitelist()\n\n\n\n self.nodes[ROUTER1].set_panid(0xface)\n\n self.nodes[ROUTER1].set_mode('rsdn')\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER1].add_whitelist(self.nodes[ROUTER2].get_addr64())\n\n self.nodes[ROUTER1].enable_whitelist()\n\n\n\n self.nodes[ROUTER2].set_panid(0xface)\n\n self.nodes[ROUTER2].set_mode('rsdn')\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\n\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER1].get_addr64())\n\n self.nodes[ROUTER2].enable_whitelist()\n\n\n\n def tearDown(self):\n\n for node in self.nodes.itervalues():\n\n node.stop()\n\n del self.nodes\n\n\n\n def test(self):\n\n self.nodes[LEADER].start()\n\n self.nodes[LEADER].set_state('leader')\n\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\n\n\n\n self.nodes[ROUTER1].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\n\n\n\n self.nodes[ROUTER2].start()\n\n time.sleep(3)\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n\n\n rloc16 = self.nodes[ROUTER1].get_addr16()\n\n\n\n self.nodes[ROUTER2].set_network_id_timeout(200)\n\n self.nodes[LEADER].stop()\n\n time.sleep(210)\n\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'leader')\n\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\n\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\n\n\n\nif __name__ == '__main__':\n\n unittest.main()\n","file_path":"tests/scripts/thread-cert/Cert_5_1_04_RouterAddressReallocation.py","rank":35,"score":111399.71214581616},{"content":"class AddressResolver\n\n{\n\npublic:\n\n /**\n\n * This constructor initializes the object.\n\n *\n\n */\n\n explicit AddressResolver(ThreadNetif &aThreadNetif);\n\n\n\n /**\n\n * This method clears the EID-to-RLOC cache.\n\n *\n\n */\n\n void Clear(void);\n\n\n\n /**\n\n * This method removes a Router ID from the EID-to-RLOC cache.\n\n *\n\n * @param[in] aRouterId The Router ID.\n\n *\n","file_path":"src/core/thread/address_resolver.hpp","rank":36,"score":111366.58737722444},{"content":"class ThreadNetif;\n\n\n\n/**\n\n * @addtogroup core-security\n\n *\n\n * @brief\n\n * This module includes definitions for Thread security material generation.\n\n *\n\n * @{\n\n */\n\n\n","file_path":"src/core/thread/key_manager.hpp","rank":37,"score":110944.59247700083},{"content":"class ThreadExtMacAddressTlv: public ThreadTlv\n\n{\n\npublic:\n\n /**\n\n * This method initializes the TLV.\n\n *\n\n */\n\n void Init() { SetType(kExtMacAddress); SetLength(sizeof(*this) - sizeof(ThreadTlv)); }\n\n\n\n /**\n\n * This method indicates whether or not the TLV appears to be well-formed.\n\n *\n\n * @retval TRUE If the TLV appears to be well-formed.\n\n * @retval FALSE If the TLV does not appear to be well-formed.\n\n *\n\n */\n\n bool IsValid() const { return GetLength() == sizeof(*this) - sizeof(ThreadTlv); }\n\n\n\n /**\n\n * This method returns a pointer to the Extended MAC Address.\n","file_path":"src/core/thread/thread_tlvs.hpp","rank":38,"score":110136.77265292345},{"content":"class ThreadNetif;\n\n\n\n/**\n\n * @addtogroup core-netdata-local\n\n *\n\n * @brief\n\n * This module includes definitions for manipulating local Thread Network Data.\n\n *\n\n * @{\n\n */\n\n\n\nnamespace NetworkData {\n\n\n\n/**\n\n * This class implements the Thread Network Data contributed by the local device.\n\n *\n\n */\n","file_path":"src/core/thread/network_data_local.hpp","rank":39,"score":109138.64054876044},{"content":"class ThreadNetif;\n\n\n\nnamespace NetworkData {\n\n\n\n/**\n\n * @addtogroup core-netdata-leader\n\n *\n\n * @brief\n\n * This module includes definitions for manipulating Thread Network Data maanged by the Thread Leader.\n\n *\n\n * @{\n\n *\n\n */\n\n\n\n/**\n\n * This class implements the Thread Network Data maintained by the Leader.\n\n *\n\n */\n","file_path":"src/core/thread/network_data_leader.hpp","rank":40,"score":109138.64054876044},{"content":"class ThreadTargetTlv;\n\n\n\n/**\n\n * @addtogroup core-arp\n\n *\n\n * @brief\n\n * This module includes definitions for Thread EID-to-RLOC mapping and caching.\n\n *\n\n * @{\n\n */\n\n\n\n/**\n\n * This class implements the EID-to-RLOC mapping and caching.\n\n *\n\n */\n","file_path":"src/core/thread/address_resolver.hpp","rank":41,"score":109020.91638284735},{"content":"\n\nusing Thread::Encoding::BigEndian::HostSwap16;\n\nusing Thread::Encoding::BigEndian::HostSwap32;\n\n\n\nnamespace Thread {\n\nnamespace Ip6 {\n\n\n\nbool Address::IsUnspecified(void) const\n\n{\n\n return (m32[0] == 0 && m32[1] == 0 && m32[2] == 0 && m32[3] == 0);\n\n}\n\n\n\nbool Address::IsLoopback(void) const\n\n{\n\n return (m32[0] == 0 && m32[1] == 0 && m32[2] == 0 && m32[3] == HostSwap32(1));\n\n}\n\n\n\nbool Address::IsLinkLocal(void) const\n\n{\n\n return (m8[0] == 0xfe) && ((m8[1] & 0xc0) == 0x80);\n","file_path":"src/core/net/ip6_address.cpp","rank":42,"score":106463.91362158509},{"content":"\n\n break;\n\n }\n\n }\n\n\n\n return rval;\n\n}\n\n\n\nbool Address::operator==(const Address &aOther) const\n\n{\n\n return memcmp(m8, aOther.m8, sizeof(m8)) == 0;\n\n}\n\n\n\nbool Address::operator!=(const Address &aOther) const\n\n{\n\n return memcmp(m8, aOther.m8, sizeof(m8)) != 0;\n\n}\n\n\n\nThreadError Address::FromString(const char *aBuf)\n\n{\n","file_path":"src/core/net/ip6_address.cpp","rank":43,"score":106462.21781361669},{"content":" if (ch == '\\0' || ch == ' ')\n\n {\n\n break;\n\n }\n\n\n\n continue;\n\n }\n\n else\n\n {\n\n VerifyOrExit('0' <= ch && ch <= '9', error = kThreadError_Parse);\n\n }\n\n\n\n first = false;\n\n val = (val << 4) | d;\n\n VerifyOrExit(++count <= 4, error = kThreadError_Parse);\n\n }\n\n\n\n while (colonp && dst > colonp)\n\n {\n\n *endp-- = *dst--;\n","file_path":"src/core/net/ip6_address.cpp","rank":44,"score":106458.0339054554},{"content":" }\n\n\n\n while (endp > dst)\n\n {\n\n *endp-- = 0;\n\n }\n\n\n\nexit:\n\n return error;\n\n}\n\n\n\nconst char *Address::ToString(char *aBuf, uint16_t aSize) const\n\n{\n\n snprintf(aBuf, aSize, \"%x:%x:%x:%x:%x:%x:%x:%x\",\n\n HostSwap16(m16[0]), HostSwap16(m16[1]),\n\n HostSwap16(m16[2]), HostSwap16(m16[3]),\n\n HostSwap16(m16[4]), HostSwap16(m16[5]),\n\n HostSwap16(m16[6]), HostSwap16(m16[7]));\n\n return aBuf;\n\n}\n\n\n\n} // namespace Ip6\n\n} // namespace Thread\n","file_path":"src/core/net/ip6_address.cpp","rank":45,"score":106457.2436781186},{"content":" ThreadError error = kThreadError_None;\n\n uint8_t *dst = reinterpret_cast<uint8_t *>(m8);\n\n uint8_t *endp = reinterpret_cast<uint8_t *>(m8 + 15);\n\n uint8_t *colonp = NULL;\n\n uint16_t val = 0;\n\n uint8_t count = 0;\n\n bool first = true;\n\n uint8_t ch;\n\n uint8_t d;\n\n\n\n memset(m8, 0, 16);\n\n\n\n dst--;\n\n\n\n for (;;)\n\n {\n\n ch = *aBuf++;\n\n d = ch & 0xf;\n\n\n\n if (('a' <= ch && ch <= 'f') || ('A' <= ch && ch <= 'F'))\n","file_path":"src/core/net/ip6_address.cpp","rank":46,"score":106454.70405725768},{"content":" */\n\n bool IsLinkLocal(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a multicast address.\n\n *\n\n */\n\n bool IsMulticast(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is a link-local multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a link-local multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a link-local multicast address.\n\n *\n\n */\n\n bool IsLinkLocalMulticast(void) const;\n","file_path":"src/core/net/ip6_address.hpp","rank":47,"score":106454.18232279213},{"content":"namespace Thread {\n\nnamespace Ip6 {\n\n\n\n/**\n\n * @addtogroup core-ip6-ip6\n\n *\n\n * @{\n\n *\n\n */\n\n\n\n/**\n\n * This class implements an IPv6 address object.\n\n *\n\n */\n","file_path":"src/core/net/ip6_address.hpp","rank":48,"score":106453.92147669538},{"content":" * @retval FALSE If the IPv6 address is not the Loopback Address.\n\n *\n\n */\n\n bool IsLoopback(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address scope is Interafce-Local.\n\n *\n\n * @retval TRUE If the IPv6 address scope is Interface-Local.\n\n * @retval FALSE If the IPv6 address scope is not Interface-Local.\n\n *\n\n */\n\n bool IsInterfaceLocal(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address scope is Link-Local.\n\n *\n\n * @retval TRUE If the IPv6 address scope is Link-Local.\n\n * @retval FALSE If the IPv6 address scope is not Link-Local.\n\n *\n","file_path":"src/core/net/ip6_address.hpp","rank":49,"score":106452.74901331998},{"content":"private:\n\n enum\n\n {\n\n kInterfaceIdentifierOffset = 8, ///< Interface Identifier offset in bytes.\n\n };\n\n} __attribute__((packed));\n\n\n\n/**\n\n * @}\n\n *\n\n */\n\n\n\n} // namespace Ip6\n\n} // namespace Thread\n\n\n\n#endif // NET_IP6_ADDRESS_HPP_\n","file_path":"src/core/net/ip6_address.hpp","rank":50,"score":106452.70843862837},{"content":" {\n\n d += 9;\n\n }\n\n else if (ch == ':' || ch == '\\0' || ch == ' ')\n\n {\n\n if (count)\n\n {\n\n VerifyOrExit(dst + 2 <= endp, error = kThreadError_Parse);\n\n *(dst + 1) = static_cast<uint8_t>(val >> 8);\n\n *(dst + 2) = static_cast<uint8_t>(val);\n\n dst += 2;\n\n count = 0;\n\n val = 0;\n\n }\n\n else if (ch == ':')\n\n {\n\n VerifyOrExit(colonp == NULL || first, error = kThreadError_Parse);\n\n colonp = dst;\n\n }\n\n\n","file_path":"src/core/net/ip6_address.cpp","rank":51,"score":106452.24470221254},{"content":" *\n\n * @param[in] aBuf A pointer to the NULL-terminated string.\n\n *\n\n * @retval kThreadError_None Successfully parsed the IPv6 address string.\n\n * @retval kTheradError_InvalidArgs Failed to parse the IPv6 address string.\n\n *\n\n */\n\n ThreadError FromString(const char *aBuf);\n\n\n\n /**\n\n * This method converts an IPv6 address object to a NULL-terminated string.\n\n *\n\n * @param[out] aBuf A pointer to the buffer.\n\n * @param[in] aSize The maximum size of the buffer.\n\n *\n\n * @returns A pointer to the buffer.\n\n *\n\n */\n\n const char *ToString(char *aBuf, uint16_t aSize) const;\n\n\n","file_path":"src/core/net/ip6_address.hpp","rank":52,"score":106452.23065638776},{"content":"\n\n /**\n\n * This method indicates whether or not the IPv6 address is a link-local all nodes multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a link-local all nodes multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a link-local all nodes multicast address.\n\n *\n\n */\n\n bool IsLinkLocalAllNodesMulticast(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is a link-local all routers multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a link-local all routers multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a link-local all routers multicast address.\n\n *\n\n */\n\n bool IsLinkLocalAllRoutersMulticast(void) const;\n\n\n\n /**\n","file_path":"src/core/net/ip6_address.hpp","rank":53,"score":106452.17441599857},{"content":" * This method indicates whether or not the IPv6 address is a realm-local multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a realm-local multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a realm-local multicast address.\n\n *\n\n */\n\n bool IsRealmLocalMulticast(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is a realm-local all nodes multicast address.\n\n *\n\n * @retval TRUE If the IPv6 address is a realm-local all nodes multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a realm-local all nodes multicast address.\n\n *\n\n */\n\n bool IsRealmLocalAllNodesMulticast(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is a realm-local all routers multicast address.\n\n *\n","file_path":"src/core/net/ip6_address.hpp","rank":54,"score":106451.90676218623},{"content":" * @retval TRUE If the IPv6 address is a realm-local all routers multicast address.\n\n * @retval FALSE If the IPv6 address scope is not a realm-local all routers multicast address.\n\n *\n\n */\n\n bool IsRealmLocalAllRoutersMulticast(void) const;\n\n\n\n /**\n\n * This method returns a pointer to the Interface Identifier.\n\n *\n\n * @returns A pointer to the Interface Identifier.\n\n *\n\n */\n\n const uint8_t *GetIid(void) const;\n\n\n\n /**\n\n * This method returns a pointer to the Interface Identifier.\n\n *\n\n * @returns A pointer to the Interface Identifier.\n\n *\n\n */\n","file_path":"src/core/net/ip6_address.hpp","rank":55,"score":106450.72977783885},{"content":" kRealmLocalScope = 3, ///< Realm-Local scope\n\n kAdminLocalScope = 4, ///< Admin-Local scope\n\n kSiteLocalScope = 5, ///< Site-Local scope\n\n kOrgLocalScope = 8, ///< Organization-Local scope\n\n kGlobalScope = 14, ///< Global scope\n\n };\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is the Unspecified Address.\n\n *\n\n * @retval TRUE If the IPv6 address is the Unspecified Address.\n\n * @retval FALSE If the IPv6 address is not the Unspecified Address.\n\n *\n\n */\n\n bool IsUnspecified(void) const;\n\n\n\n /**\n\n * This method indicates whether or not the IPv6 address is the Loopback Address.\n\n *\n\n * @retval TRUE If the IPv6 address is the Loopback Address.\n","file_path":"src/core/net/ip6_address.hpp","rank":56,"score":106449.9335854148},{"content":"}\n\n\n\nbool Address::IsMulticast(void) const\n\n{\n\n return m8[0] == 0xff;\n\n}\n\n\n\nbool Address::IsLinkLocalMulticast(void) const\n\n{\n\n return IsMulticast() && (GetScope() == kLinkLocalScope);\n\n}\n\n\n\nbool Address::IsLinkLocalAllNodesMulticast(void) const\n\n{\n\n return (m32[0] == HostSwap32(0xff020000) && m32[1] == 0 &&\n\n m32[2] == 0 && m32[3] == HostSwap32(0x01));\n\n}\n\n\n\nbool Address::IsLinkLocalAllRoutersMulticast(void) const\n\n{\n","file_path":"src/core/net/ip6_address.cpp","rank":57,"score":106449.41535476582},{"content":" *\n\n * @retval TRUE If the IPv6 addresses match.\n\n * @retval FALSE If the IPv6 addresses do not match.\n\n *\n\n */\n\n bool operator==(const Address &aOther) const;\n\n\n\n /**\n\n * This method evaluates whether or not the IPv6 addresses differ.\n\n *\n\n * @param[in] aOther The IPv6 address to compare.\n\n *\n\n * @retval TRUE If the IPv6 addresses differ.\n\n * @retval FALSE If the IPv6 addresses do not differ.\n\n *\n\n */\n\n bool operator!=(const Address &aOther) const;\n\n\n\n /**\n\n * This method converts an IPv6 address string to binary.\n","file_path":"src/core/net/ip6_address.hpp","rank":58,"score":106448.41258194325},{"content":" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n */\n\n\n\n/**\n\n * @file\n\n * This file includes definitions for IPv6 addresses.\n\n */\n\n\n\n#ifndef IP6_ADDRESS_HPP_\n\n#define IP6_ADDRESS_HPP_\n\n\n\n#include <stdint.h>\n\n\n\n#include <openthread-types.h>\n\n\n","file_path":"src/core/net/ip6_address.hpp","rank":59,"score":106447.96289278283},{"content":" return (m32[0] == HostSwap32(0xff020000) && m32[1] == 0 &&\n\n m32[2] == 0 && m32[3] == HostSwap32(0x02));\n\n}\n\n\n\nbool Address::IsRealmLocalMulticast(void) const\n\n{\n\n return IsMulticast() && (GetScope() == kRealmLocalScope);\n\n}\n\n\n\nbool Address::IsRealmLocalAllNodesMulticast(void) const\n\n{\n\n return (m32[0] == HostSwap32(0xff030000) && m32[1] == 0 &&\n\n m32[2] == 0 && m32[3] == HostSwap32(0x01));\n\n}\n\n\n\nbool Address::IsRealmLocalAllRoutersMulticast(void) const\n\n{\n\n return (m32[0] == HostSwap32(0xff030000) && m32[1] == 0 &&\n\n m32[2] == 0 && m32[3] == HostSwap32(0x02));\n\n}\n","file_path":"src/core/net/ip6_address.cpp","rank":60,"score":106447.70419753097},{"content":" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\n * POSSIBILITY OF SUCH DAMAGE.\n\n */\n\n\n\n/**\n\n * @file\n\n * This file implements IPv6 addresses.\n\n */\n\n\n\n#include <stdio.h>\n\n#include <string.h>\n\n\n\n#include <common/code_utils.hpp>\n\n#include <common/encoding.hpp>\n\n#include <mac/mac_frame.hpp>\n\n#include <net/ip6_address.hpp>\n","file_path":"src/core/net/ip6_address.cpp","rank":61,"score":106445.98352173381},{"content":"uint8_t Address::PrefixMatch(const Address &aOther) const\n\n{\n\n uint8_t rval = 0;\n\n uint8_t diff;\n\n\n\n for (uint8_t i = 0; i < sizeof(Address); i++)\n\n {\n\n diff = m8[i] ^ aOther.m8[i];\n\n\n\n if (diff == 0)\n\n {\n\n rval += 8;\n\n }\n\n else\n\n {\n\n while ((diff & 0x80) == 0)\n\n {\n\n rval++;\n\n diff <<= 1;\n\n }\n","file_path":"src/core/net/ip6_address.cpp","rank":62,"score":106443.21950482506},{"content":"\n\nconst uint8_t *Address::GetIid(void) const\n\n{\n\n return m8 + kInterfaceIdentifierOffset;\n\n}\n\n\n\nuint8_t *Address::GetIid(void)\n\n{\n\n return m8 + kInterfaceIdentifierOffset;\n\n}\n\n\n\nvoid Address::SetIid(const uint8_t *aIid)\n\n{\n\n memcpy(m8 + kInterfaceIdentifierOffset, aIid, kInterfaceIdentifierSize);\n\n}\n\n\n\nvoid Address::SetIid(const Mac::ExtAddress &aEui64)\n\n{\n\n memcpy(m8 + kInterfaceIdentifierOffset, aEui64.m8, kInterfaceIdentifierSize);\n\n m8[kInterfaceIdentifierOffset] ^= 0x02;\n","file_path":"src/core/net/ip6_address.cpp","rank":63,"score":106442.6989666933},{"content":" uint8_t *GetIid(void);\n\n\n\n /**\n\n * This method sets the Interface Identifier.\n\n *\n\n * @param[in] aIid A reference to the Interface Identifier.\n\n *\n\n */\n\n void SetIid(const uint8_t *aIid);\n\n\n\n /**\n\n * This method sets the Interface Identifier.\n\n *\n\n * @param[in] aEui64 A reference to the IEEE EUI-64 address.\n\n *\n\n */\n\n void SetIid(const Mac::ExtAddress &aEui64);\n\n\n\n /**\n\n * This method returns the IPv6 address scope.\n","file_path":"src/core/net/ip6_address.hpp","rank":64,"score":106442.3195440893},{"content":" *\n\n * @returns The IPv6 address scope.\n\n *\n\n */\n\n uint8_t GetScope(void) const;\n\n\n\n /**\n\n * This method returns the number of IPv6 prefix bits that match.\n\n *\n\n * @param[in] aOther The IPv6 address to match against.\n\n *\n\n * @returns The number of IPv6 prefix bits that match.\n\n *\n\n */\n\n uint8_t PrefixMatch(const Address &aOther) const;\n\n\n\n /**\n\n * This method evaluates whether or not the IPv6 addresses match.\n\n *\n\n * @param[in] aOther The IPv6 address to compare.\n","file_path":"src/core/net/ip6_address.hpp","rank":65,"score":106441.24631331959},{"content":"}\n\n\n\nuint8_t Address::GetScope(void) const\n\n{\n\n if (IsMulticast())\n\n {\n\n return m8[1] & 0xf;\n\n }\n\n else if (IsLinkLocal())\n\n {\n\n return kLinkLocalScope;\n\n }\n\n else if (IsLoopback())\n\n {\n\n return kNodeLocalScope;\n\n }\n\n\n\n return kGlobalScope;\n\n}\n\n\n","file_path":"src/core/net/ip6_address.cpp","rank":66,"score":106440.16098428724},{"content":"/*\n\n * Copyright (c) 2016, Nest Labs, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n * 1. Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * 2. Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * 3. Neither the name of the copyright holder nor the\n\n * names of its contributors may be used to endorse or promote products\n\n * derived from this software without specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n","file_path":"src/core/net/ip6_address.hpp","rank":67,"score":106433.47519413303},{"content":"/*\n\n * Copyright (c) 2016, Nest Labs, Inc.\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n * 1. Redistributions of source code must retain the above copyright\n\n * notice, this list of conditions and the following disclaimer.\n\n * 2. Redistributions in binary form must reproduce the above copyright\n\n * notice, this list of conditions and the following disclaimer in the\n\n * documentation and/or other materials provided with the distribution.\n\n * 3. Neither the name of the copyright holder nor the\n\n * names of its contributors may be used to endorse or promote products\n\n * derived from this software without specific prior written permission.\n\n *\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n","file_path":"src/core/net/ip6_address.cpp","rank":68,"score":106433.47519413303},{"content":"class ThreadMeshLocalEidTlv;\n","file_path":"src/core/thread/address_resolver.hpp","rank":69,"score":105593.52283816083},{"content":"class ThreadLastTransactionTimeTlv;\n","file_path":"src/core/thread/address_resolver.hpp","rank":70,"score":105593.52283816083},{"content":"class LinkAddress\n\n{\n\npublic :\n\n /**\n\n * Hardware types.\n\n *\n\n */\n\n enum HardwareType\n\n {\n\n kEui64 = 27,\n\n };\n\n HardwareType mType; ///< Link address type.\n\n uint8_t mLength; ///< Length of link address.\n\n Mac::ExtAddress mExtAddress; ///< Link address.\n\n};\n\n\n\n/**\n\n * This class implements an IPv6 network interface unicast address.\n\n *\n\n */\n","file_path":"src/core/net/netif.hpp","rank":71,"score":104232.2058515706},{"content":" }\n\n\n\nexit:\n\n {}\n\n}\n\n\n\nvoid AddressResolver::SendAddressQueryResponse(const ThreadTargetTlv &aTargetTlv,\n\n const ThreadMeshLocalEidTlv &aMlIidTlv,\n\n const ThreadLastTransactionTimeTlv *aLastTransactionTimeTlv,\n\n const Ip6::Address &aDestination)\n\n{\n\n ThreadError error;\n\n Message *message;\n\n Coap::Header header;\n\n ThreadRloc16Tlv rloc16Tlv;\n\n Ip6::MessageInfo messageInfo;\n\n\n\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\n\n\n\n header.Init();\n","file_path":"src/core/thread/address_resolver.cpp","rank":72,"score":103971.99509999841},{"content":" ThreadTargetTlv targetTlv;\n\n ThreadMeshLocalEidTlv mlIidTlv;\n\n Child *children;\n\n uint8_t numChildren;\n\n Mac::ExtAddress macAddr;\n\n Ip6::Address destination;\n\n\n\n VerifyOrExit(aHeader.GetCode() == Coap::Header::kCodePost, error = kThreadError_Drop);\n\n\n\n otLogInfoArp(\"Received address error notification\\n\");\n\n\n\n SuccessOrExit(error = ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\n\n VerifyOrExit(targetTlv.IsValid(), error = kThreadError_Parse);\n\n\n\n SuccessOrExit(error = ThreadTlv::GetTlv(aMessage, ThreadTlv::kMeshLocalEid, sizeof(mlIidTlv), mlIidTlv));\n\n VerifyOrExit(mlIidTlv.IsValid(), error = kThreadError_Parse);\n\n\n\n for (const Ip6::NetifUnicastAddress *address = mNetif.GetUnicastAddresses(); address; address = address->GetNext())\n\n {\n\n if (memcmp(&address->mAddress, targetTlv.GetTarget(), sizeof(address->mAddress)) == 0 &&\n","file_path":"src/core/thread/address_resolver.cpp","rank":73,"score":103970.90226299173},{"content":" break;\n\n\n\n case Cache::kStateCached:\n\n aRloc16 = entry->mRloc16;\n\n break;\n\n }\n\n\n\nexit:\n\n return error;\n\n}\n\n\n\nThreadError AddressResolver::SendAddressQuery(const Ip6::Address &aEid)\n\n{\n\n ThreadError error;\n\n Ip6::SockAddr sockaddr;\n\n Message *message;\n\n Coap::Header header;\n\n ThreadTargetTlv targetTlv;\n\n Ip6::MessageInfo messageInfo;\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":74,"score":103970.37314704972},{"content":" for (int j = 0; j < Child::kMaxIp6AddressPerChild; j++)\n\n {\n\n if (memcmp(&children[i].mIp6Address[j], targetTlv.GetTarget(), sizeof(children[i].mIp6Address[j])) == 0 &&\n\n memcmp(&children[i].mMacAddr, &macAddr, sizeof(children[i].mMacAddr)))\n\n {\n\n // Target EID matches child address and Mesh Local EID differs on child\n\n memset(&children[i].mIp6Address[j], 0, sizeof(children[i].mIp6Address[j]));\n\n\n\n memset(&destination, 0, sizeof(destination));\n\n destination.m16[0] = HostSwap16(0xfe80);\n\n destination.SetIid(children[i].mMacAddr);\n\n\n\n SendAddressError(targetTlv, mlIidTlv, &destination);\n\n ExitNow();\n\n }\n\n }\n\n }\n\n\n\nexit:\n\n {}\n","file_path":"src/core/thread/address_resolver.cpp","rank":75,"score":103969.10304161055},{"content":" }\n\n\n\n memset(&messageInfo, 0, sizeof(messageInfo));\n\n memcpy(&messageInfo.GetPeerAddr(), &aDestination, sizeof(messageInfo.GetPeerAddr()));\n\n messageInfo.mInterfaceId = messageInfo.mInterfaceId;\n\n messageInfo.mPeerPort = kCoapUdpPort;\n\n\n\n SuccessOrExit(error = mSocket.SendTo(*message, messageInfo));\n\n\n\n otLogInfoArp(\"Sent address notification\\n\");\n\n\n\nexit:\n\n\n\n if (error != kThreadError_None && message != NULL)\n\n {\n\n Message::Free(*message);\n\n }\n\n}\n\n\n\nvoid AddressResolver::HandleTimer(void *aContext)\n","file_path":"src/core/thread/address_resolver.cpp","rank":76,"score":103968.77394261141},{"content":"\n\n if (error != kThreadError_None && message != NULL)\n\n {\n\n Message::Free(*message);\n\n }\n\n}\n\n\n\nThreadError AddressResolver::SendAddressError(const ThreadTargetTlv &aTarget, const ThreadMeshLocalEidTlv &aEid,\n\n const Ip6::Address *aDestination)\n\n{\n\n ThreadError error;\n\n Message *message;\n\n Coap::Header header;\n\n Ip6::MessageInfo messageInfo;\n\n Ip6::SockAddr sockaddr;\n\n\n\n sockaddr.mPort = kCoapUdpPort;\n\n mSocket.Open(&HandleUdpReceive, this);\n\n mSocket.Bind(sockaddr);\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":77,"score":103967.99379329135},{"content":" {\n\n SendAddressError(targetTlv, mlIidTlv, NULL);\n\n }\n\n\n\n ExitNow();\n\n }\n\n }\n\n\n\n ExitNow();\n\n\n\nexit:\n\n {}\n\n}\n\n\n\nvoid AddressResolver::SendAddressNotificationResponse(const Coap::Header &aRequestHeader,\n\n const Ip6::MessageInfo &aRequestInfo)\n\n{\n\n ThreadError error;\n\n Message *message;\n\n Coap::Header responseHeader;\n","file_path":"src/core/thread/address_resolver.cpp","rank":78,"score":103967.59804571696},{"content":"#include <thread/address_resolver.hpp>\n\n#include <thread/mesh_forwarder.hpp>\n\n#include <thread/mle_router.hpp>\n\n#include <thread/thread_netif.hpp>\n\n#include <thread/thread_tlvs.hpp>\n\n#include <thread/thread_uris.hpp>\n\n\n\nusing Thread::Encoding::BigEndian::HostSwap16;\n\n\n\nnamespace Thread {\n\n\n\nAddressResolver::AddressResolver(ThreadNetif &aThreadNetif) :\n\n mAddressError(OPENTHREAD_URI_ADDRESS_ERROR, &HandleAddressError, this),\n\n mAddressQuery(OPENTHREAD_URI_ADDRESS_QUERY, &HandleAddressQuery, this),\n\n mAddressNotification(OPENTHREAD_URI_ADDRESS_NOTIFY, &HandleAddressNotification, this),\n\n mIcmpHandler(&HandleDstUnreach, this),\n\n mTimer(&HandleTimer, this),\n\n mMeshForwarder(aThreadNetif.GetMeshForwarder()),\n\n mCoapServer(aThreadNetif.GetCoapServer()),\n\n mMle(aThreadNetif.GetMle()),\n","file_path":"src/core/thread/address_resolver.cpp","rank":79,"score":103966.24268356853},{"content":" uint8_t mFailures;\n\n\n\n enum State\n\n {\n\n kStateInvalid,\n\n kStateQuery,\n\n kStateCached,\n\n };\n\n State mState;\n\n };\n\n\n\n ThreadError SendAddressQuery(const Ip6::Address &aEid);\n\n ThreadError SendAddressError(const ThreadTargetTlv &aTarget, const ThreadMeshLocalEidTlv &aEid,\n\n const Ip6::Address *aDestination);\n\n void SendAddressQueryResponse(const ThreadTargetTlv &aTargetTlv, const ThreadMeshLocalEidTlv &aMlEidTlv,\n\n const ThreadLastTransactionTimeTlv *aLastTransactionTimeTlv,\n\n const Ip6::Address &aDestination);\n\n void SendAddressNotificationResponse(const Coap::Header &aRequestHeader, const Ip6::MessageInfo &aMessageInfo);\n\n\n\n static void HandleUdpReceive(void *aContext, otMessage aMessage, const otMessageInfo *aMessageInfo);\n","file_path":"src/core/thread/address_resolver.hpp","rank":80,"score":103965.52510042177},{"content":"\n\n if (error != kThreadError_None && message != NULL)\n\n {\n\n Message::Free(*message);\n\n }\n\n\n\n return error;\n\n}\n\n\n\nvoid AddressResolver::HandleAddressError(void *aContext, Coap::Header &aHeader,\n\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\n\n obj->HandleAddressError(aHeader, aMessage, aMessageInfo);\n\n}\n\n\n\nvoid AddressResolver::HandleAddressError(Coap::Header &aHeader, Message &aMessage,\n\n const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n ThreadError error = kThreadError_None;\n","file_path":"src/core/thread/address_resolver.cpp","rank":81,"score":103965.16459794847},{"content":" mNetif(aThreadNetif)\n\n{\n\n memset(&mCache, 0, sizeof(mCache));\n\n\n\n mCoapServer.AddResource(mAddressError);\n\n mCoapServer.AddResource(mAddressQuery);\n\n mCoapServer.AddResource(mAddressNotification);\n\n mCoapMessageId = otPlatRandomGet();\n\n\n\n Ip6::Icmp::RegisterCallbacks(mIcmpHandler);\n\n}\n\n\n\nvoid AddressResolver::Clear()\n\n{\n\n memset(&mCache, 0, sizeof(mCache));\n\n}\n\n\n\nvoid AddressResolver::Remove(uint8_t routerId)\n\n{\n\n for (int i = 0; i < kCacheEntries; i++)\n","file_path":"src/core/thread/address_resolver.cpp","rank":82,"score":103964.50627574127},{"content":" break;\n\n }\n\n }\n\n else if (entry == NULL)\n\n {\n\n entry = &mCache[i];\n\n }\n\n }\n\n\n\n VerifyOrExit(entry != NULL, error = kThreadError_NoBufs);\n\n\n\n switch (entry->mState)\n\n {\n\n case Cache::kStateInvalid:\n\n entry->mTarget = aEid;\n\n entry->mRloc16 = Mac::kShortAddrInvalid;\n\n entry->mTimeout = kAddressQueryTimeout;\n\n entry->mFailures = 0;\n\n entry->mRetryTimeout = kAddressQueryInitialRetryDelay;\n\n entry->mState = Cache::kStateQuery;\n","file_path":"src/core/thread/address_resolver.cpp","rank":83,"score":103964.37608314399},{"content":" memset(&messageInfo, 0, sizeof(messageInfo));\n\n\n\n if (aDestination == NULL)\n\n {\n\n messageInfo.GetPeerAddr().m16[0] = HostSwap16(0xff03);\n\n messageInfo.GetPeerAddr().m16[7] = HostSwap16(0x0002);\n\n }\n\n else\n\n {\n\n memcpy(&messageInfo.GetPeerAddr(), aDestination, sizeof(messageInfo.GetPeerAddr()));\n\n }\n\n\n\n messageInfo.mPeerPort = kCoapUdpPort;\n\n messageInfo.mInterfaceId = mNetif.GetInterfaceId();\n\n\n\n SuccessOrExit(error = mSocket.SendTo(*message, messageInfo));\n\n\n\n otLogInfoArp(\"Sent address error\\n\");\n\n\n\nexit:\n","file_path":"src/core/thread/address_resolver.cpp","rank":84,"score":103963.86231067083},{"content":" VerifyOrExit(aIcmpHeader.GetCode() == Ip6::IcmpHeader::kCodeDstUnreachNoRoute, ;);\n\n VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(ip6Header), &ip6Header) == sizeof(ip6Header), ;);\n\n\n\n for (int i = 0; i < kCacheEntries; i++)\n\n {\n\n if (mCache[i].mState != Cache::kStateInvalid &&\n\n memcmp(&mCache[i].mTarget, &ip6Header.GetDestination(), sizeof(mCache[i].mTarget)) == 0)\n\n {\n\n mCache[i].mState = Cache::kStateInvalid;\n\n otLogInfoArp(\"cache entry removed!\\n\");\n\n break;\n\n }\n\n }\n\n\n\nexit:\n\n {}\n\n}\n\n\n\n} // namespace Thread\n","file_path":"src/core/thread/address_resolver.cpp","rank":85,"score":103963.28196065738},{"content":"{\n\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\n\n obj->HandleTimer();\n\n}\n\n\n\nvoid AddressResolver::HandleTimer()\n\n{\n\n bool continueTimer = false;\n\n\n\n for (int i = 0; i < kCacheEntries; i++)\n\n {\n\n if (mCache[i].mState != Cache::kStateQuery)\n\n {\n\n continue;\n\n }\n\n\n\n continueTimer = true;\n\n\n\n if (mCache[i].mTimeout > 0)\n\n {\n","file_path":"src/core/thread/address_resolver.cpp","rank":86,"score":103962.74124781726},{"content":" {\n\n if ((mCache[i].mRloc16 >> 10) == routerId)\n\n {\n\n mCache[i].mState = Cache::kStateInvalid;\n\n }\n\n }\n\n}\n\n\n\nThreadError AddressResolver::Resolve(const Ip6::Address &aEid, uint16_t &aRloc16)\n\n{\n\n ThreadError error = kThreadError_None;\n\n Cache *entry = NULL;\n\n\n\n for (int i = 0; i < kCacheEntries; i++)\n\n {\n\n if (mCache[i].mState != Cache::kStateInvalid)\n\n {\n\n if (memcmp(&mCache[i].mTarget, &aEid, sizeof(mCache[i].mTarget)) == 0)\n\n {\n\n entry = &mCache[i];\n","file_path":"src/core/thread/address_resolver.cpp","rank":87,"score":103962.18486395813},{"content":"\n\n otLogInfoArp(\"Received address query from %04x\\n\", HostSwap16(aMessageInfo.GetPeerAddr().m16[7]));\n\n\n\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\n\n VerifyOrExit(targetTlv.IsValid(), ;);\n\n\n\n mlIidTlv.Init();\n\n\n\n lastTransactionTimeTlv.Init();\n\n\n\n if (mNetif.IsUnicastAddress(*targetTlv.GetTarget()))\n\n {\n\n mlIidTlv.SetIid(mMle.GetMeshLocal64()->GetIid());\n\n SendAddressQueryResponse(targetTlv, mlIidTlv, NULL, aMessageInfo.GetPeerAddr());\n\n ExitNow();\n\n }\n\n\n\n children = mMle.GetChildren(&numChildren);\n\n\n\n for (int i = 0; i < Mle::kMaxChildren; i++)\n","file_path":"src/core/thread/address_resolver.cpp","rank":88,"score":103961.78845560494},{"content":" Coap::Resource mAddressError;\n\n Coap::Resource mAddressQuery;\n\n Coap::Resource mAddressNotification;\n\n Cache mCache[kCacheEntries];\n\n uint16_t mCoapMessageId;\n\n uint8_t mCoapToken[2];\n\n Ip6::IcmpHandler mIcmpHandler;\n\n Ip6::UdpSocket mSocket;\n\n Timer mTimer;\n\n\n\n MeshForwarder &mMeshForwarder;\n\n Coap::Server &mCoapServer;\n\n Mle::MleRouter &mMle;\n\n Ip6::Netif &mNetif;\n\n};\n\n\n\n/**\n\n * @}\n\n */\n\n\n\n} // namespace Thread\n\n\n\n#endif // ADDRESS_RESOLVER_HPP_\n","file_path":"src/core/thread/address_resolver.hpp","rank":89,"score":103961.21684873708},{"content":" mTimer.Start(kStateUpdatePeriod);\n\n }\n\n\n\n if (error != kThreadError_None && message != NULL)\n\n {\n\n Message::Free(*message);\n\n }\n\n\n\n return error;\n\n}\n\n\n\nvoid AddressResolver::HandleUdpReceive(void *aContext, otMessage aMessage, const otMessageInfo *aMessageInfo)\n\n{\n\n}\n\n\n\nvoid AddressResolver::HandleAddressNotification(void *aContext, Coap::Header &aHeader, Message &aMessage,\n\n const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\n\n obj->HandleAddressNotification(aHeader, aMessage, aMessageInfo);\n","file_path":"src/core/thread/address_resolver.cpp","rank":90,"score":103961.17952986823},{"content":" {\n\n if (children[i].mState != Neighbor::kStateValid || (children[i].mMode & Mle::ModeTlv::kModeFFD) != 0)\n\n {\n\n continue;\n\n }\n\n\n\n for (int j = 0; j < Child::kMaxIp6AddressPerChild; j++)\n\n {\n\n if (memcmp(&children[i].mIp6Address[j], targetTlv.GetTarget(), sizeof(children[i].mIp6Address[j])))\n\n {\n\n continue;\n\n }\n\n\n\n children[i].mMacAddr.m8[0] ^= 0x2;\n\n mlIidTlv.SetIid(children[i].mMacAddr.m8);\n\n children[i].mMacAddr.m8[0] ^= 0x2;\n\n lastTransactionTimeTlv.SetTime(Timer::GetNow() - children[i].mLastHeard);\n\n SendAddressQueryResponse(targetTlv, mlIidTlv, &lastTransactionTimeTlv, aMessageInfo.GetPeerAddr());\n\n ExitNow();\n\n }\n","file_path":"src/core/thread/address_resolver.cpp","rank":91,"score":103960.66286684625},{"content":" Ip6::MessageInfo responseInfo;\n\n\n\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\n\n\n\n responseHeader.Init();\n\n responseHeader.SetVersion(1);\n\n responseHeader.SetType(Coap::Header::kTypeAcknowledgment);\n\n responseHeader.SetCode(Coap::Header::kCodeChanged);\n\n responseHeader.SetMessageId(aRequestHeader.GetMessageId());\n\n responseHeader.SetToken(aRequestHeader.GetToken(), aRequestHeader.GetTokenLength());\n\n responseHeader.Finalize();\n\n SuccessOrExit(error = message->Append(responseHeader.GetBytes(), responseHeader.GetLength()));\n\n\n\n memcpy(&responseInfo, &aRequestInfo, sizeof(responseInfo));\n\n memset(&responseInfo.mSockAddr, 0, sizeof(responseInfo.mSockAddr));\n\n SuccessOrExit(error = mCoapServer.SendMessage(*message, responseInfo));\n\n\n\n otLogInfoArp(\"Sent address notification acknowledgment\\n\");\n\n\n\nexit:\n","file_path":"src/core/thread/address_resolver.cpp","rank":92,"score":103959.98136486729},{"content":" memcmp(mMle.GetMeshLocal64()->GetIid(), mlIidTlv.GetIid(), 8))\n\n {\n\n // Target EID matches address and Mesh Local EID differs\n\n mNetif.RemoveUnicastAddress(*address);\n\n ExitNow();\n\n }\n\n }\n\n\n\n children = mMle.GetChildren(&numChildren);\n\n\n\n memcpy(&macAddr, mlIidTlv.GetIid(), sizeof(macAddr));\n\n macAddr.m8[0] ^= 0x2;\n\n\n\n for (int i = 0; i < Mle::kMaxChildren; i++)\n\n {\n\n if (children[i].mState != Neighbor::kStateValid || (children[i].mMode & Mle::ModeTlv::kModeFFD) != 0)\n\n {\n\n continue;\n\n }\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":93,"score":103958.50357118623},{"content":"}\n\n\n\nvoid AddressResolver::HandleAddressNotification(Coap::Header &aHeader, Message &aMessage,\n\n const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n ThreadTargetTlv targetTlv;\n\n ThreadMeshLocalEidTlv mlIidTlv;\n\n ThreadRloc16Tlv rloc16Tlv;\n\n\n\n VerifyOrExit(aHeader.GetType() == Coap::Header::kTypeConfirmable &&\n\n aHeader.GetCode() == Coap::Header::kCodePost, ;);\n\n\n\n otLogInfoArp(\"Received address notification from %04x\\n\", HostSwap16(aMessageInfo.GetPeerAddr().m16[7]));\n\n\n\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\n\n VerifyOrExit(targetTlv.IsValid(), ;);\n\n\n\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kMeshLocalEid, sizeof(mlIidTlv), mlIidTlv));\n\n VerifyOrExit(mlIidTlv.IsValid(), ;);\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":94,"score":103957.87440603384},{"content":" for (size_t i = 0; i < sizeof(mCoapToken); i++)\n\n {\n\n mCoapToken[i] = otPlatRandomGet();\n\n }\n\n\n\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\n\n\n\n header.Init();\n\n header.SetVersion(1);\n\n header.SetType(Coap::Header::kTypeNonConfirmable);\n\n header.SetCode(Coap::Header::kCodePost);\n\n header.SetMessageId(++mCoapMessageId);\n\n header.SetToken(NULL, 0);\n\n header.AppendUriPathOptions(OPENTHREAD_URI_ADDRESS_ERROR);\n\n header.AppendContentFormatOption(Coap::Header::kApplicationOctetStream);\n\n header.Finalize();\n\n SuccessOrExit(error = message->Append(header.GetBytes(), header.GetLength()));\n\n SuccessOrExit(error = message->Append(&aTarget, sizeof(aTarget)));\n\n SuccessOrExit(error = message->Append(&aEid, sizeof(aEid)));\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":95,"score":103957.33178874559},{"content":" */\n\n void Remove(uint8_t aRouterId);\n\n\n\n /**\n\n * This method returns the RLOC16 for a given EID, or initiates an Address Query if the mapping is not known.\n\n *\n\n * @param[in] aEid A reference to the EID.\n\n * @param[out] aRloc16 The RLOC16 corresponding to @p aEid.\n\n *\n\n * @retval kTheradError_None Successfully provided the RLOC16.\n\n * @retval kThreadError_AddressQuery Initiated an Address Query.\n\n *\n\n */\n\n ThreadError Resolve(const Ip6::Address &aEid, Mac::ShortAddress &aRloc16);\n\n\n\nprivate:\n\n enum\n\n {\n\n kCacheEntries = OPENTHREAD_CONFIG_ADDRESS_CACHE_ENTRIES,\n\n kStateUpdatePeriod = 1000u, ///< State update period in milliseconds.\n","file_path":"src/core/thread/address_resolver.hpp","rank":96,"score":103956.57721448313},{"content":"}\n\n\n\nvoid AddressResolver::HandleAddressQuery(void *aContext, Coap::Header &aHeader, Message &aMessage,\n\n const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\n\n obj->HandleAddressQuery(aHeader, aMessage, aMessageInfo);\n\n}\n\n\n\nvoid AddressResolver::HandleAddressQuery(Coap::Header &aHeader, Message &aMessage,\n\n const Ip6::MessageInfo &aMessageInfo)\n\n{\n\n ThreadTargetTlv targetTlv;\n\n ThreadMeshLocalEidTlv mlIidTlv;\n\n ThreadLastTransactionTimeTlv lastTransactionTimeTlv;\n\n Child *children;\n\n uint8_t numChildren;\n\n\n\n VerifyOrExit(aHeader.GetType() == Coap::Header::kTypeNonConfirmable &&\n\n aHeader.GetCode() == Coap::Header::kCodePost, ;);\n","file_path":"src/core/thread/address_resolver.cpp","rank":97,"score":103956.34494763383},{"content":" SendAddressQuery(aEid);\n\n error = kThreadError_AddressQuery;\n\n break;\n\n\n\n case Cache::kStateQuery:\n\n if (entry->mTimeout > 0)\n\n {\n\n error = kThreadError_AddressQuery;\n\n }\n\n else if (entry->mTimeout == 0 && entry->mRetryTimeout == 0)\n\n {\n\n entry->mTimeout = kAddressQueryTimeout;\n\n SendAddressQuery(aEid);\n\n error = kThreadError_AddressQuery;\n\n }\n\n else\n\n {\n\n error = kThreadError_Drop;\n\n }\n\n\n","file_path":"src/core/thread/address_resolver.cpp","rank":98,"score":103955.8436242316},{"content":"\n\n static void HandleAddressError(void *aContext, Coap::Header &aHeader,\n\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n void HandleAddressError(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n\n\n static void HandleAddressQuery(void *aContext, Coap::Header &aHeader,\n\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n void HandleAddressQuery(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n\n\n static void HandleAddressNotification(void *aContext, Coap::Header &aHeader,\n\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n void HandleAddressNotification(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\n\n\n\n static void HandleDstUnreach(void *aContext, Message &aMessage, const Ip6::MessageInfo &aMessageInfo,\n\n const Ip6::IcmpHeader &aIcmpHeader);\n\n void HandleDstUnreach(Message &aMessage, const Ip6::MessageInfo &aMessageInfo, const Ip6::IcmpHeader &aIcmpHeader);\n\n\n\n static void HandleTimer(void *aContext);\n\n void HandleTimer(void);\n\n\n","file_path":"src/core/thread/address_resolver.hpp","rank":99,"score":103954.78050249818}],"string":"[\n {\n \"content\": \"class ThreadNetif: public Ip6::Netif\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * This constructor initializes the Thread network interface.\\n\\n *\\n\\n */\\n\\n ThreadNetif(void);\\n\\n\\n\\n /**\\n\\n * This method enables the Thread network interface.\\n\\n *\\n\\n */\\n\\n ThreadError Up(void);\\n\\n\\n\\n /**\\n\\n * This method disables the Thread network interface.\\n\\n *\\n\\n */\\n\\n ThreadError Down(void);\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 0,\n \"score\": 229476.2600924089\n },\n {\n \"content\": \" class Buffer *GetNextBuffer(void) const { return mHeader.mNext; }\\n\\n\\n\\n /**\\n\\n * This method sets the pointer to the next message buffer.\\n\\n *\\n\\n */\\n\\n void SetNextBuffer(class Buffer *buf) { mHeader.mNext = buf; }\\n\\n\\n\\nprivate:\\n\\n /**\\n\\n * This method returns a pointer to the first byte of data in the first message buffer.\\n\\n *\\n\\n * @returns A pointer to the first data byte.\\n\\n *\\n\\n */\\n\\n uint8_t *GetFirstData(void) { return mHeadData; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the first byte of data in the first message buffer.\\n\\n *\\n\",\n \"file_path\": \"src/core/common/message.hpp\",\n \"rank\": 1,\n \"score\": 200601.5930662636\n },\n {\n \"content\": \"class ThreadNetif;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 2,\n \"score\": 161911.49890523514\n },\n {\n \"content\": \"class Address: public otIp6Address\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * Constants\\n\\n *\\n\\n */\\n\\n enum\\n\\n {\\n\\n kInterfaceIdentifierSize = 8, ///< Interface Identifier size in bytes.\\n\\n };\\n\\n\\n\\n /**\\n\\n * IPv6 Address Scopes\\n\\n */\\n\\n enum\\n\\n {\\n\\n kNodeLocalScope = 0, ///< Node-Local scope\\n\\n kInterfaceLocalScope = 1, ///< Interface-Local scope\\n\\n kLinkLocalScope = 2, ///< Link-Local scope\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 3,\n \"score\": 155845.0499763362\n },\n {\n \"content\": \"class NetifUnicastAddress: public otNetifAddress\\n\\n{\\n\\n friend class Netif;\\n\\n\\n\\npublic:\\n\\n /**\\n\\n * This method returns the unicast address.\\n\\n *\\n\\n * @returns The unicast address.\\n\\n *\\n\\n */\\n\\n const Address &GetAddress(void) const { return *static_cast<const Address *>(&mAddress); }\\n\\n\\n\\n /**\\n\\n * This method returns the unicast address.\\n\\n *\\n\\n * @returns The unicast address.\\n\\n *\\n\\n */\\n\\n Address &GetAddress(void) { return *static_cast<Address *>(&mAddress); }\\n\",\n \"file_path\": \"src/core/net/netif.hpp\",\n \"rank\": 4,\n \"score\": 154618.25790192393\n },\n {\n \"content\": \"class NetifMulticastAddress\\n\\n{\\n\\n friend class Netif;\\n\\n\\n\\npublic:\\n\\n /**\\n\\n * This method returns the multicast address.\\n\\n *\\n\\n * @returns The multicast address.\\n\\n *\\n\\n */\\n\\n const Address &GetAddress(void) const { return *static_cast<const Address *>(&mAddress); }\\n\\n\\n\\n /**\\n\\n * This method returns the multicast address.\\n\\n *\\n\\n * @returns The multicast address.\\n\\n *\\n\\n */\\n\\n Address &GetAddress(void) { return *static_cast<Address *>(&mAddress); }\\n\",\n \"file_path\": \"src/core/net/netif.hpp\",\n \"rank\": 5,\n \"score\": 152626.59057236684\n },\n {\n \"content\": \" void *address;\\n\",\n \"file_path\": \"third_party/nlbuild-autotools/repo/tools/host/include/ltdl.h\",\n \"rank\": 6,\n \"score\": 137945.55823489535\n },\n {\n \"content\": \" mIsUp = true;\\n\\n return kThreadError_None;\\n\\n}\\n\\n\\n\\nThreadError ThreadNetif::Down(void)\\n\\n{\\n\\n mCoapServer.Stop();\\n\\n mMleRouter.Stop();\\n\\n mMeshForwarder.Stop();\\n\\n Netif::RemoveNetif();\\n\\n mIsUp = false;\\n\\n return kThreadError_None;\\n\\n}\\n\\n\\n\\nbool ThreadNetif::IsUp(void) const\\n\\n{\\n\\n return mIsUp;\\n\\n}\\n\\n\\n\\nThreadError ThreadNetif::GetLinkAddress(Ip6::LinkAddress &address) const\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 7,\n \"score\": 114798.49630142128\n },\n {\n \"content\": \"{\\n\\n address.mType = Ip6::LinkAddress::kEui64;\\n\\n address.mLength = sizeof(address.mExtAddress);\\n\\n memcpy(&address.mExtAddress, mMac.GetExtAddress(), address.mLength);\\n\\n return kThreadError_None;\\n\\n}\\n\\n\\n\\nThreadError ThreadNetif::RouteLookup(const Ip6::Address &source, const Ip6::Address &destination, uint8_t *prefixMatch)\\n\\n{\\n\\n return mNetworkDataLeader.RouteLookup(source, destination, prefixMatch, NULL);\\n\\n}\\n\\n\\n\\nThreadError ThreadNetif::SendMessage(Message &message)\\n\\n{\\n\\n return mMeshForwarder.SendMessage(message);\\n\\n}\\n\\n\\n\\n} // namespace Thread\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 8,\n \"score\": 114796.3174057129\n },\n {\n \"content\": \" * @param[in] aDestination A reference to the IPv6 destination address.\\n\\n * @param[out] aPrefixMatch A pointer where the number of prefix match bits for the chosen route is stored.\\n\\n *\\n\\n * @retval kThreadError_None Successfully found a route.\\n\\n * @retval kThreadError_NoRoute Could not find a valid route.\\n\\n *\\n\\n */\\n\\n ThreadError RouteLookup(const Ip6::Address &aSource, const Ip6::Address &aDestination, uint8_t *aPrefixMatch);\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the address resolver object.\\n\\n *\\n\\n * @returns A pointer to the address resolver object.\\n\\n *\\n\\n */\\n\\n AddressResolver &GetAddressResolver(void) { return mAddressResolver; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the coap server object.\\n\\n *\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 9,\n \"score\": 114786.40263151436\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * This method indicates whether or not the Thread network interface is enabled.\\n\\n *\\n\\n * @retval TRUE If the Thread network interface is enabled.\\n\\n * @retval FALSE If the Thread network interface is not enabled.\\n\\n *\\n\\n */\\n\\n bool IsUp(void) const;\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to a NULL-terminated string that names the interface.\\n\\n *\\n\\n * @returns A pointer to a NULL-terminated string that names the interface.\\n\\n *\\n\\n */\\n\\n const char *GetName(void) const;\\n\\n\\n\\n /**\\n\\n * This method retrieves the link address.\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 10,\n \"score\": 114784.48580565417\n },\n {\n \"content\": \"#include <thread/thread_netif.hpp>\\n\\n#include <thread/thread_tlvs.hpp>\\n\\n\\n\\nusing Thread::Encoding::BigEndian::HostSwap16;\\n\\n\\n\\nnamespace Thread {\\n\\n\\n\\nstatic const uint8_t kThreadMasterKey[] =\\n\\n{\\n\\n 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77,\\n\\n 0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff,\\n\\n};\\n\\n\\n\\nstatic const char name[] = \\\"thread\\\";\\n\\n\\n\\nThreadNetif::ThreadNetif(void):\\n\\n mCoapServer(kCoapUdpPort),\\n\\n mAddressResolver(*this),\\n\\n mKeyManager(*this),\\n\\n mLowpan(*this),\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 11,\n \"score\": 114783.3138399322\n },\n {\n \"content\": \"#include <thread/key_manager.hpp>\\n\\n#include <thread/mesh_forwarder.hpp>\\n\\n#include <thread/mle.hpp>\\n\\n#include <thread/mle_router.hpp>\\n\\n#include <thread/network_data_local.hpp>\\n\\n\\n\\nnamespace Thread {\\n\\n\\n\\n/**\\n\\n * @addtogroup core-netif\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for the Thread network interface.\\n\\n *\\n\\n * @{\\n\\n */\\n\\n\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 12,\n \"score\": 114776.5519470204\n },\n {\n \"content\": \" *\\n\\n * @param[out] aAddress A reference to the link address.\\n\\n *\\n\\n */\\n\\n ThreadError GetLinkAddress(Ip6::LinkAddress &aAddress) const;\\n\\n\\n\\n /**\\n\\n * This method submits a message to the network interface.\\n\\n *\\n\\n * @param[in] aMessage A reference to the message.\\n\\n *\\n\\n * @retval kThreadError_None Successfully submitted the message to the interface.\\n\\n *\\n\\n */\\n\\n ThreadError SendMessage(Message &aMessage);\\n\\n\\n\\n /**\\n\\n * This method performs a route lookup.\\n\\n *\\n\\n * @param[in] aSource A reference to the IPv6 source address.\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 13,\n \"score\": 114776.43672335584\n },\n {\n \"content\": \" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file\\n\\n * This file includes definitions for the Thread network interface.\\n\\n */\\n\\n\\n\\n#ifndef THREAD_NETIF_HPP_\\n\\n#define THREAD_NETIF_HPP_\\n\\n\\n\\n#include <openthread-types.h>\\n\\n#include <mac/mac.hpp>\\n\\n#include <net/netif.hpp>\\n\\n#include <thread/address_resolver.hpp>\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 14,\n \"score\": 114775.98904557679\n },\n {\n \"content\": \" mMac(*this),\\n\\n mMeshForwarder(*this),\\n\\n mMleRouter(*this),\\n\\n mNetworkDataLocal(*this),\\n\\n mNetworkDataLeader(*this)\\n\\n{\\n\\n mKeyManager.SetMasterKey(kThreadMasterKey, sizeof(kThreadMasterKey));\\n\\n}\\n\\n\\n\\nconst char *ThreadNetif::GetName(void) const\\n\\n{\\n\\n return name;\\n\\n}\\n\\n\\n\\nThreadError ThreadNetif::Up(void)\\n\\n{\\n\\n Netif::AddNetif();\\n\\n mMeshForwarder.Start();\\n\\n mMleRouter.Start();\\n\\n mCoapServer.Start();\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 15,\n \"score\": 114775.96569012286\n },\n {\n \"content\": \" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file\\n\\n * This file implements the Thread network interface.\\n\\n */\\n\\n\\n\\n#include <common/code_utils.hpp>\\n\\n#include <common/encoding.hpp>\\n\\n#include <common/message.hpp>\\n\\n#include <net/ip6.hpp>\\n\\n#include <net/netif.hpp>\\n\\n#include <net/udp6.hpp>\\n\\n#include <thread/mle.hpp>\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 16,\n \"score\": 114772.95012253907\n },\n {\n \"content\": \"\\n\\nprivate:\\n\\n Coap::Server mCoapServer;\\n\\n AddressResolver mAddressResolver;\\n\\n KeyManager mKeyManager;\\n\\n Lowpan::Lowpan mLowpan;\\n\\n Mac::Mac mMac;\\n\\n MeshForwarder mMeshForwarder;\\n\\n Mle::MleRouter mMleRouter;\\n\\n NetworkData::Local mNetworkDataLocal;\\n\\n NetworkData::Leader mNetworkDataLeader;\\n\\n bool mIsUp;\\n\\n};\\n\\n\\n\\n/**\\n\\n * This structure represents Thread-specific link information.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 17,\n \"score\": 114767.42469298828\n },\n {\n \"content\": \" * @returns A pointer to the coap server object.\\n\\n *\\n\\n */\\n\\n Coap::Server &GetCoapServer(void) { return mCoapServer; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the key manager object.\\n\\n *\\n\\n * @returns A pointer to the key manager object.\\n\\n *\\n\\n */\\n\\n KeyManager &GetKeyManager(void) { return mKeyManager; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the lowpan object.\\n\\n *\\n\\n * @returns A pointer to the lowpan object.\\n\\n *\\n\\n */\\n\\n Lowpan::Lowpan &GetLowpan(void) { return mLowpan; }\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 18,\n \"score\": 114759.69835033688\n },\n {\n \"content\": \" * @returns A pointer to the mesh forwarder object.\\n\\n *\\n\\n */\\n\\n MeshForwarder &GetMeshForwarder(void) { return mMeshForwarder; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the network data local object.\\n\\n *\\n\\n * @returns A pointer to the network data local object.\\n\\n *\\n\\n */\\n\\n NetworkData::Local &GetNetworkDataLocal(void) { return mNetworkDataLocal; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the network data leader object.\\n\\n *\\n\\n * @returns A pointer to the network data leader object.\\n\\n *\\n\\n */\\n\\n NetworkData::Leader &GetNetworkDataLeader(void) { return mNetworkDataLeader; }\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 19,\n \"score\": 114759.45141070873\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * This method returns a pointer to the mac object.\\n\\n *\\n\\n * @returns A pointer to the mac object.\\n\\n *\\n\\n */\\n\\n Mac::Mac &GetMac(void) { return mMac; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the mle object.\\n\\n *\\n\\n * @returns A pointer to the mle object.\\n\\n *\\n\\n */\\n\\n Mle::MleRouter &GetMle(void) { return mMleRouter; }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the mesh forwarder object.\\n\\n *\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 20,\n \"score\": 114759.37623629822\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2016, Nest Labs, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n * 1. Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * 2. Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * 3. Neither the name of the copyright holder nor the\\n\\n * names of its contributors may be used to endorse or promote products\\n\\n * derived from this software without specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\",\n \"file_path\": \"src/core/thread/thread_netif.cpp\",\n \"rank\": 21,\n \"score\": 114756.9481988199\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2016, Nest Labs, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n * 1. Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * 2. Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * 3. Neither the name of the copyright holder nor the\\n\\n * names of its contributors may be used to endorse or promote products\\n\\n * derived from this software without specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 22,\n \"score\": 114756.9481988199\n },\n {\n \"content\": \"struct ThreadMessageInfo\\n\\n{\\n\\n uint8_t mLinkMargin; ///< The Link Margin for a received message in dBm.\\n\\n};\\n\\n\\n\\n/**\\n\\n * @}\\n\\n */\\n\\n\\n\\n} // namespace Thread\\n\\n\\n\\n#endif // THREAD_NETIF_HPP_\\n\",\n \"file_path\": \"src/core/thread/thread_netif.hpp\",\n \"rank\": 23,\n \"score\": 114297.83099104001\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nBR = 2\\n\\nROUTER2 = 3\\n\\nROUTER3 = 4\\n\\nSED2 = 5\\n\\n\\n\\nclass Cert_5_3_9_AddressQuery(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,6):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[BR].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER3].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[BR].set_panid(0xface)\\n\\n self.nodes[BR].set_mode('rsdn')\\n\\n self.nodes[BR].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[BR].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[SED2].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER3].set_panid(0xface)\\n\\n self.nodes[ROUTER3].set_mode('rsdn')\\n\\n self.nodes[ROUTER3].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER3].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ROUTER3].enable_whitelist()\\n\\n\\n\\n self.nodes[SED2].set_panid(0xface)\\n\\n self.nodes[SED2].set_mode('sn')\\n\\n self.nodes[SED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[SED2].set_timeout(3)\\n\\n self.nodes[SED2].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[BR].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[BR].get_state(), 'router')\\n\\n\\n\\n self.nodes[BR].add_prefix('2003::/64', 'pvcrs')\\n\\n self.nodes[BR].add_prefix('2004::/64', 'pvcrs')\\n\\n self.nodes[BR].register_netdata()\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n self.nodes[ROUTER3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER3].get_state(), 'router')\\n\\n\\n\\n self.nodes[SED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[SED2].get_state(), 'child')\\n\\n\\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[SED2].ping(addr)\\n\\n\\n\\n addrs = self.nodes[SED2].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[BR].ping(addr)\\n\\n\\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[SED2].ping(addr)\\n\\n\\n\\n self.nodes[ROUTER3].stop()\\n\\n time.sleep(300)\\n\\n \\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[SED2].ping(addr)\\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\n self.nodes[SED2].stop()\\n\\n time.sleep(10)\\n\\n\\n\\n addrs = self.nodes[SED2].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[BR].ping(addr)\\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_3_10_AddressQuery.py\",\n \"rank\": 24,\n \"score\": 113207.01380080033\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nBR = 1\\n\\nLEADER = 2\\n\\nROUTER2 = 3\\n\\nROUTER3 = 4\\n\\nED2 = 5\\n\\n\\n\\nclass Cert_5_3_3_AddressQuery(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,6):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[BR].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER3].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[BR].set_panid(0xface)\\n\\n self.nodes[BR].set_mode('rsdn')\\n\\n self.nodes[BR].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[BR].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER3].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER3].set_panid(0xface)\\n\\n self.nodes[ROUTER3].set_mode('rsdn')\\n\\n self.nodes[ROUTER3].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER3].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ROUTER3].enable_whitelist()\\n\\n\\n\\n self.nodes[ED2].set_panid(0xface)\\n\\n self.nodes[ED2].set_mode('rsn')\\n\\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ED2].set_timeout(3)\\n\\n self.nodes[ED2].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[BR].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[BR].get_state(), 'router')\\n\\n\\n\\n self.nodes[BR].add_prefix('2003::/64', 'pvcrs')\\n\\n self.nodes[BR].add_prefix('2004::/64', 'pvcrs')\\n\\n self.nodes[BR].register_netdata()\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n self.nodes[ROUTER3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER3].get_state(), 'router')\\n\\n\\n\\n self.nodes[ED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\\n\\n\\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[ED2].ping(addr)\\n\\n time.sleep(1)\\n\\n\\n\\n addrs = self.nodes[ED2].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[LEADER].ping(addr)\\n\\n time.sleep(1)\\n\\n\\n\\n addrs = self.nodes[BR].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[ED2].ping(addr)\\n\\n time.sleep(1)\\n\\n\\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[ED2].ping(addr)\\n\\n time.sleep(1)\\n\\n\\n\\n addrs = self.nodes[ROUTER3].get_addrs()\\n\\n self.nodes[ROUTER3].stop()\\n\\n time.sleep(130)\\n\\n\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[ED2].ping(addr)\\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\n addrs = self.nodes[ED2].get_addrs()\\n\\n self.nodes[ED2].stop()\\n\\n time.sleep(10)\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[BR].ping(addr) \\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_3_03_AddressQuery.py\",\n \"rank\": 25,\n \"score\": 113207.01380080033\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER1 = 2\\n\\nROUTER2 = 3\\n\\nED1 = 4\\n\\nED2 = 5\\n\\nED3 = 6\\n\\n\\n\\nclass Cert_5_3_7_DuplicateAddress(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,7):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER1].set_panid(0xface)\\n\\n self.nodes[ROUTER1].set_mode('rsdn')\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[ED1].get_addr64())\\n\\n self.nodes[ROUTER1].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED1].set_panid(0xface)\\n\\n self.nodes[ED1].set_mode('rsn')\\n\\n self.nodes[ED1].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[ED1].enable_whitelist()\\n\\n\\n\\n self.nodes[ED2].set_panid(0xface)\\n\\n self.nodes[ED2].set_mode('rsn')\\n\\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ED2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED3].set_panid(0xface)\\n\\n self.nodes[ED3].set_mode('rsn')\\n\\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED3].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n self.nodes[ED1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\\n\\n\\n\\n self.nodes[ROUTER2].add_prefix('2001::/64', 'pvcrs')\\n\\n self.nodes[ROUTER2].register_netdata()\\n\\n\\n\\n self.nodes[ED1].add_ipaddr('2001::1')\\n\\n self.nodes[ED2].add_ipaddr('2001::1')\\n\\n time.sleep(3)\\n\\n\\n\\n self.nodes[ED3].ping('2001::1')\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_3_07_DuplicateAddress.py\",\n \"rank\": 26,\n \"score\": 113207.01380080033\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nED1 = 1\\n\\nBR1 = 2\\n\\nLEADER = 3\\n\\nROUTER2 = 4\\n\\nREED = 5\\n\\nED2 = 6\\n\\nED3 = 7\\n\\n\\n\\nclass Cert_5_2_5_AddressQuery(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,8):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[BR1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[REED].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[BR1].set_panid(0xface)\\n\\n self.nodes[BR1].set_mode('rsdn')\\n\\n self.nodes[BR1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[BR1].add_whitelist(self.nodes[ED1].get_addr64())\\n\\n self.nodes[BR1].enable_whitelist()\\n\\n\\n\\n self.nodes[ED1].set_panid(0xface)\\n\\n self.nodes[ED1].set_mode('rsn')\\n\\n self.nodes[ED1].add_whitelist(self.nodes[BR1].get_addr64())\\n\\n self.nodes[ED1].enable_whitelist()\\n\\n\\n\\n self.nodes[REED].set_panid(0xface)\\n\\n self.nodes[REED].set_mode('rsdn')\\n\\n self.nodes[REED].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[REED].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[REED].set_router_upgrade_threshold(0)\\n\\n self.nodes[REED].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[REED].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED2].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ED3].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED2].set_panid(0xface)\\n\\n self.nodes[ED2].set_mode('rsn')\\n\\n self.nodes[ED2].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ED2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED3].set_panid(0xface)\\n\\n self.nodes[ED3].set_mode('rsn')\\n\\n self.nodes[ED3].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ED3].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[BR1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[BR1].get_state(), 'router')\\n\\n\\n\\n self.nodes[BR1].add_prefix('2003::/64', 'pvcrs')\\n\\n self.nodes[BR1].add_prefix('2004::/64', 'pvcrs')\\n\\n self.nodes[BR1].register_netdata()\\n\\n\\n\\n self.nodes[ED1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\\n\\n\\n\\n self.nodes[REED].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[REED].get_state(), 'child')\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n self.nodes[ED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\\n\\n\\n\\n addrs = self.nodes[REED].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[ED2].ping(addr)\\n\\n time.sleep(1)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_2_05_AddressQuery.py\",\n \"rank\": 27,\n \"score\": 113207.01380080033\n },\n {\n \"content\": \"class ThreadNetif;\\n\",\n \"file_path\": \"src/core/thread/mle.hpp\",\n \"rank\": 28,\n \"score\": 112814.99743628965\n },\n {\n \"content\": \"class ThreadNetif;\\n\\n\\n\\nnamespace NetworkData { class Leader; }\\n\\n\\n\\n/**\\n\\n * @addtogroup core-6lowpan\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for 6LoWPAN header compression.\\n\\n *\\n\\n * @{\\n\\n */\\n\\n\\n\\n/**\\n\\n * @namespace Thread::Lowpan\\n\\n *\\n\\n * @brief\\n\\n * This namespace includes definitions for 6LoWPAN message processing.\\n\\n *\\n\\n */\\n\\nnamespace Lowpan {\\n\\n\\n\\n/**\\n\\n * This structure represents a LOWPAN_IPHC Context.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/thread/lowpan.hpp\",\n \"rank\": 29,\n \"score\": 112814.99743628965\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nED1 = 2\\n\\nED2 = 3\\n\\nED3 = 4\\n\\nED4 = 5\\n\\n\\n\\nclass Cert_5_3_8_ChildAddressSet(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,6):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED4].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ED1].set_panid(0xface)\\n\\n self.nodes[ED1].set_mode('rsn')\\n\\n self.nodes[ED1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED1].enable_whitelist()\\n\\n\\n\\n self.nodes[ED2].set_panid(0xface)\\n\\n self.nodes[ED2].set_mode('rsn')\\n\\n self.nodes[ED2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED3].set_panid(0xface)\\n\\n self.nodes[ED3].set_mode('rsn')\\n\\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED3].enable_whitelist()\\n\\n\\n\\n self.nodes[ED4].set_panid(0xface)\\n\\n self.nodes[ED4].set_mode('rsn')\\n\\n self.nodes[ED4].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED4].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ED1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED1].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED4].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED4].get_state(), 'child')\\n\\n\\n\\n for i in range(2,6):\\n\\n addrs = self.nodes[i].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[LEADER].ping(addr)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_3_08_ChildAddressSet.py\",\n \"rank\": 30,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER1 = 2\\n\\n\\n\\nclass Cert_5_1_05_RouterAddressTimeout(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,3):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER1].set_panid(0xface)\\n\\n self.nodes[ROUTER1].set_mode('rsdn')\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER1].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n\\n\\n rloc16 = self.nodes[ROUTER1].get_addr16()\\n\\n\\n\\n self.nodes[ROUTER1].stop()\\n\\n time.sleep(200)\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(5)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n self.assertNotEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\\n\\n\\n\\n rloc16 = self.nodes[ROUTER1].get_addr16()\\n\\n\\n\\n self.nodes[ROUTER1].stop()\\n\\n time.sleep(300)\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(5)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_1_05_RouterAddressTimeout.py\",\n \"rank\": 31,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER1 = 2\\n\\nROUTER2 = 3\\n\\n\\n\\nclass Cert_5_1_03_RouterAddressReallocation(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,4):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER1].set_panid(0xface)\\n\\n self.nodes[ROUTER1].set_mode('rsdn')\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ROUTER1].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n rloc16 = self.nodes[ROUTER1].get_addr16()\\n\\n\\n\\n self.nodes[ROUTER2].set_network_id_timeout(110)\\n\\n self.nodes[LEADER].stop()\\n\\n time.sleep(130)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'leader')\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_1_03_RouterAddressReallocation.py\",\n \"rank\": 32,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER = 2\\n\\nED = 3\\n\\nSED = 4\\n\\n\\n\\nclass Cert_5_1_02_ChildAddressTimeout(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,5):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER].set_panid(0xface)\\n\\n self.nodes[ROUTER].set_mode('rsdn')\\n\\n self.nodes[ROUTER].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER].add_whitelist(self.nodes[ED].get_addr64())\\n\\n self.nodes[ROUTER].add_whitelist(self.nodes[SED].get_addr64())\\n\\n self.nodes[ROUTER].enable_whitelist()\\n\\n\\n\\n self.nodes[ED].set_panid(0xface)\\n\\n self.nodes[ED].set_mode('rsn')\\n\\n self.nodes[ED].set_timeout(3)\\n\\n self.nodes[ED].add_whitelist(self.nodes[ROUTER].get_addr64())\\n\\n self.nodes[ED].enable_whitelist()\\n\\n\\n\\n self.nodes[SED].set_panid(0xface)\\n\\n self.nodes[SED].set_mode('sn')\\n\\n self.nodes[SED].set_timeout(3)\\n\\n self.nodes[SED].add_whitelist(self.nodes[ROUTER].get_addr64())\\n\\n self.nodes[SED].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER].get_state(), 'router')\\n\\n\\n\\n self.nodes[ED].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED].get_state(), 'child')\\n\\n\\n\\n self.nodes[SED].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[SED].get_state(), 'child')\\n\\n\\n\\n ed_addrs = self.nodes[ED].get_addrs()\\n\\n sed_addrs = self.nodes[SED].get_addrs()\\n\\n\\n\\n self.nodes[ED].stop()\\n\\n time.sleep(5)\\n\\n for addr in ed_addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[LEADER].ping(addr)\\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\n self.nodes[SED].stop()\\n\\n time.sleep(5)\\n\\n for addr in sed_addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n try:\\n\\n self.nodes[LEADER].ping(addr)\\n\\n self.assertFalse()\\n\\n except pexpect.TIMEOUT:\\n\\n pass\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_1_02_ChildAddressTimeout.py\",\n \"rank\": 33,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER1 = 2\\n\\nSED1 = 3\\n\\nED2 = 4\\n\\nED3 = 5\\n\\nED4 = 6\\n\\nED5 = 7\\n\\n\\n\\nclass Cert_5_3_4_AddressMapCache(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,8):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED2].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED3].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED4].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ED5].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER1].set_panid(0xface)\\n\\n self.nodes[ROUTER1].set_mode('rsdn')\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[SED1].get_addr64())\\n\\n self.nodes[ROUTER1].enable_whitelist()\\n\\n\\n\\n self.nodes[SED1].set_panid(0xface)\\n\\n self.nodes[SED1].set_mode('rsn')\\n\\n self.nodes[SED1].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[SED1].enable_whitelist()\\n\\n\\n\\n self.nodes[ED2].set_panid(0xface)\\n\\n self.nodes[ED2].set_mode('rsn')\\n\\n self.nodes[ED2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED2].enable_whitelist()\\n\\n\\n\\n self.nodes[ED3].set_panid(0xface)\\n\\n self.nodes[ED3].set_mode('rsn')\\n\\n self.nodes[ED3].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED3].enable_whitelist()\\n\\n\\n\\n self.nodes[ED4].set_panid(0xface)\\n\\n self.nodes[ED4].set_mode('rsn')\\n\\n self.nodes[ED4].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED4].enable_whitelist()\\n\\n\\n\\n self.nodes[ED5].set_panid(0xface)\\n\\n self.nodes[ED5].set_mode('rsn')\\n\\n self.nodes[ED5].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ED5].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n\\n\\n self.nodes[SED1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[SED1].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED2].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED3].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED3].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED4].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED4].get_state(), 'child')\\n\\n\\n\\n self.nodes[ED5].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ED5].get_state(), 'child')\\n\\n\\n\\n for i in range(4, 8):\\n\\n addrs = self.nodes[i].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[SED1].ping(addr)\\n\\n\\n\\n for i in range(4, 8):\\n\\n addrs = self.nodes[i].get_addrs()\\n\\n for addr in addrs:\\n\\n if addr[0:4] != 'fe80':\\n\\n self.nodes[SED1].ping(addr)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_3_04_AddressMapCache.py\",\n \"rank\": 34,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"#!/usr/bin/python\\n\\n#\\n\\n# Copyright (c) 2016, Nest Labs, Inc.\\n\\n# All rights reserved.\\n\\n#\\n\\n# Redistribution and use in source and binary forms, with or without\\n\\n# modification, are permitted provided that the following conditions are met:\\n\\n# 1. Redistributions of source code must retain the above copyright\\n\\n# notice, this list of conditions and the following disclaimer.\\n\\n# 2. Redistributions in binary form must reproduce the above copyright\\n\\n# notice, this list of conditions and the following disclaimer in the\\n\\n# documentation and/or other materials provided with the distribution.\\n\\n# 3. Neither the name of the copyright holder nor the\\n\\n# names of its contributors may be used to endorse or promote products\\n\\n# derived from this software without specific prior written permission.\\n\\n#\\n\\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\\n# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n# POSSIBILITY OF SUCH DAMAGE.\\n\\n#\\n\\n\\n\\nimport pexpect\\n\\nimport time\\n\\nimport unittest\\n\\n\\n\\nimport node\\n\\n\\n\\nLEADER = 1\\n\\nROUTER1 = 2\\n\\nROUTER2 = 3\\n\\n\\n\\nclass Cert_5_1_04_RouterAddressReallocation(unittest.TestCase):\\n\\n def setUp(self):\\n\\n self.nodes = {}\\n\\n for i in range(1,4):\\n\\n self.nodes[i] = node.Node(i)\\n\\n\\n\\n self.nodes[LEADER].set_panid(0xface)\\n\\n self.nodes[LEADER].set_mode('rsdn')\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[LEADER].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[LEADER].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER1].set_panid(0xface)\\n\\n self.nodes[ROUTER1].set_mode('rsdn')\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER1].add_whitelist(self.nodes[ROUTER2].get_addr64())\\n\\n self.nodes[ROUTER1].enable_whitelist()\\n\\n\\n\\n self.nodes[ROUTER2].set_panid(0xface)\\n\\n self.nodes[ROUTER2].set_mode('rsdn')\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[LEADER].get_addr64())\\n\\n self.nodes[ROUTER2].add_whitelist(self.nodes[ROUTER1].get_addr64())\\n\\n self.nodes[ROUTER2].enable_whitelist()\\n\\n\\n\\n def tearDown(self):\\n\\n for node in self.nodes.itervalues():\\n\\n node.stop()\\n\\n del self.nodes\\n\\n\\n\\n def test(self):\\n\\n self.nodes[LEADER].start()\\n\\n self.nodes[LEADER].set_state('leader')\\n\\n self.assertEqual(self.nodes[LEADER].get_state(), 'leader')\\n\\n\\n\\n self.nodes[ROUTER1].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'router')\\n\\n\\n\\n self.nodes[ROUTER2].start()\\n\\n time.sleep(3)\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n\\n\\n rloc16 = self.nodes[ROUTER1].get_addr16()\\n\\n\\n\\n self.nodes[ROUTER2].set_network_id_timeout(200)\\n\\n self.nodes[LEADER].stop()\\n\\n time.sleep(210)\\n\\n self.assertEqual(self.nodes[ROUTER1].get_state(), 'leader')\\n\\n self.assertEqual(self.nodes[ROUTER2].get_state(), 'router')\\n\\n self.assertEqual(self.nodes[ROUTER1].get_addr16(), rloc16)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n unittest.main()\\n\",\n \"file_path\": \"tests/scripts/thread-cert/Cert_5_1_04_RouterAddressReallocation.py\",\n \"rank\": 35,\n \"score\": 111399.71214581616\n },\n {\n \"content\": \"class AddressResolver\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * This constructor initializes the object.\\n\\n *\\n\\n */\\n\\n explicit AddressResolver(ThreadNetif &aThreadNetif);\\n\\n\\n\\n /**\\n\\n * This method clears the EID-to-RLOC cache.\\n\\n *\\n\\n */\\n\\n void Clear(void);\\n\\n\\n\\n /**\\n\\n * This method removes a Router ID from the EID-to-RLOC cache.\\n\\n *\\n\\n * @param[in] aRouterId The Router ID.\\n\\n *\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 36,\n \"score\": 111366.58737722444\n },\n {\n \"content\": \"class ThreadNetif;\\n\\n\\n\\n/**\\n\\n * @addtogroup core-security\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for Thread security material generation.\\n\\n *\\n\\n * @{\\n\\n */\\n\\n\\n\",\n \"file_path\": \"src/core/thread/key_manager.hpp\",\n \"rank\": 37,\n \"score\": 110944.59247700083\n },\n {\n \"content\": \"class ThreadExtMacAddressTlv: public ThreadTlv\\n\\n{\\n\\npublic:\\n\\n /**\\n\\n * This method initializes the TLV.\\n\\n *\\n\\n */\\n\\n void Init() { SetType(kExtMacAddress); SetLength(sizeof(*this) - sizeof(ThreadTlv)); }\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the TLV appears to be well-formed.\\n\\n *\\n\\n * @retval TRUE If the TLV appears to be well-formed.\\n\\n * @retval FALSE If the TLV does not appear to be well-formed.\\n\\n *\\n\\n */\\n\\n bool IsValid() const { return GetLength() == sizeof(*this) - sizeof(ThreadTlv); }\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the Extended MAC Address.\\n\",\n \"file_path\": \"src/core/thread/thread_tlvs.hpp\",\n \"rank\": 38,\n \"score\": 110136.77265292345\n },\n {\n \"content\": \"class ThreadNetif;\\n\\n\\n\\n/**\\n\\n * @addtogroup core-netdata-local\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for manipulating local Thread Network Data.\\n\\n *\\n\\n * @{\\n\\n */\\n\\n\\n\\nnamespace NetworkData {\\n\\n\\n\\n/**\\n\\n * This class implements the Thread Network Data contributed by the local device.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/thread/network_data_local.hpp\",\n \"rank\": 39,\n \"score\": 109138.64054876044\n },\n {\n \"content\": \"class ThreadNetif;\\n\\n\\n\\nnamespace NetworkData {\\n\\n\\n\\n/**\\n\\n * @addtogroup core-netdata-leader\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for manipulating Thread Network Data maanged by the Thread Leader.\\n\\n *\\n\\n * @{\\n\\n *\\n\\n */\\n\\n\\n\\n/**\\n\\n * This class implements the Thread Network Data maintained by the Leader.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/thread/network_data_leader.hpp\",\n \"rank\": 40,\n \"score\": 109138.64054876044\n },\n {\n \"content\": \"class ThreadTargetTlv;\\n\\n\\n\\n/**\\n\\n * @addtogroup core-arp\\n\\n *\\n\\n * @brief\\n\\n * This module includes definitions for Thread EID-to-RLOC mapping and caching.\\n\\n *\\n\\n * @{\\n\\n */\\n\\n\\n\\n/**\\n\\n * This class implements the EID-to-RLOC mapping and caching.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 41,\n \"score\": 109020.91638284735\n },\n {\n \"content\": \"\\n\\nusing Thread::Encoding::BigEndian::HostSwap16;\\n\\nusing Thread::Encoding::BigEndian::HostSwap32;\\n\\n\\n\\nnamespace Thread {\\n\\nnamespace Ip6 {\\n\\n\\n\\nbool Address::IsUnspecified(void) const\\n\\n{\\n\\n return (m32[0] == 0 && m32[1] == 0 && m32[2] == 0 && m32[3] == 0);\\n\\n}\\n\\n\\n\\nbool Address::IsLoopback(void) const\\n\\n{\\n\\n return (m32[0] == 0 && m32[1] == 0 && m32[2] == 0 && m32[3] == HostSwap32(1));\\n\\n}\\n\\n\\n\\nbool Address::IsLinkLocal(void) const\\n\\n{\\n\\n return (m8[0] == 0xfe) && ((m8[1] & 0xc0) == 0x80);\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 42,\n \"score\": 106463.91362158509\n },\n {\n \"content\": \"\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n return rval;\\n\\n}\\n\\n\\n\\nbool Address::operator==(const Address &aOther) const\\n\\n{\\n\\n return memcmp(m8, aOther.m8, sizeof(m8)) == 0;\\n\\n}\\n\\n\\n\\nbool Address::operator!=(const Address &aOther) const\\n\\n{\\n\\n return memcmp(m8, aOther.m8, sizeof(m8)) != 0;\\n\\n}\\n\\n\\n\\nThreadError Address::FromString(const char *aBuf)\\n\\n{\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 43,\n \"score\": 106462.21781361669\n },\n {\n \"content\": \" if (ch == '\\\\0' || ch == ' ')\\n\\n {\\n\\n break;\\n\\n }\\n\\n\\n\\n continue;\\n\\n }\\n\\n else\\n\\n {\\n\\n VerifyOrExit('0' <= ch && ch <= '9', error = kThreadError_Parse);\\n\\n }\\n\\n\\n\\n first = false;\\n\\n val = (val << 4) | d;\\n\\n VerifyOrExit(++count <= 4, error = kThreadError_Parse);\\n\\n }\\n\\n\\n\\n while (colonp && dst > colonp)\\n\\n {\\n\\n *endp-- = *dst--;\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 44,\n \"score\": 106458.0339054554\n },\n {\n \"content\": \" }\\n\\n\\n\\n while (endp > dst)\\n\\n {\\n\\n *endp-- = 0;\\n\\n }\\n\\n\\n\\nexit:\\n\\n return error;\\n\\n}\\n\\n\\n\\nconst char *Address::ToString(char *aBuf, uint16_t aSize) const\\n\\n{\\n\\n snprintf(aBuf, aSize, \\\"%x:%x:%x:%x:%x:%x:%x:%x\\\",\\n\\n HostSwap16(m16[0]), HostSwap16(m16[1]),\\n\\n HostSwap16(m16[2]), HostSwap16(m16[3]),\\n\\n HostSwap16(m16[4]), HostSwap16(m16[5]),\\n\\n HostSwap16(m16[6]), HostSwap16(m16[7]));\\n\\n return aBuf;\\n\\n}\\n\\n\\n\\n} // namespace Ip6\\n\\n} // namespace Thread\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 45,\n \"score\": 106457.2436781186\n },\n {\n \"content\": \" ThreadError error = kThreadError_None;\\n\\n uint8_t *dst = reinterpret_cast<uint8_t *>(m8);\\n\\n uint8_t *endp = reinterpret_cast<uint8_t *>(m8 + 15);\\n\\n uint8_t *colonp = NULL;\\n\\n uint16_t val = 0;\\n\\n uint8_t count = 0;\\n\\n bool first = true;\\n\\n uint8_t ch;\\n\\n uint8_t d;\\n\\n\\n\\n memset(m8, 0, 16);\\n\\n\\n\\n dst--;\\n\\n\\n\\n for (;;)\\n\\n {\\n\\n ch = *aBuf++;\\n\\n d = ch & 0xf;\\n\\n\\n\\n if (('a' <= ch && ch <= 'f') || ('A' <= ch && ch <= 'F'))\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 46,\n \"score\": 106454.70405725768\n },\n {\n \"content\": \" */\\n\\n bool IsLinkLocal(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a multicast address.\\n\\n *\\n\\n */\\n\\n bool IsMulticast(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is a link-local multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a link-local multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a link-local multicast address.\\n\\n *\\n\\n */\\n\\n bool IsLinkLocalMulticast(void) const;\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 47,\n \"score\": 106454.18232279213\n },\n {\n \"content\": \"namespace Thread {\\n\\nnamespace Ip6 {\\n\\n\\n\\n/**\\n\\n * @addtogroup core-ip6-ip6\\n\\n *\\n\\n * @{\\n\\n *\\n\\n */\\n\\n\\n\\n/**\\n\\n * This class implements an IPv6 address object.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 48,\n \"score\": 106453.92147669538\n },\n {\n \"content\": \" * @retval FALSE If the IPv6 address is not the Loopback Address.\\n\\n *\\n\\n */\\n\\n bool IsLoopback(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address scope is Interafce-Local.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address scope is Interface-Local.\\n\\n * @retval FALSE If the IPv6 address scope is not Interface-Local.\\n\\n *\\n\\n */\\n\\n bool IsInterfaceLocal(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address scope is Link-Local.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address scope is Link-Local.\\n\\n * @retval FALSE If the IPv6 address scope is not Link-Local.\\n\\n *\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 49,\n \"score\": 106452.74901331998\n },\n {\n \"content\": \"private:\\n\\n enum\\n\\n {\\n\\n kInterfaceIdentifierOffset = 8, ///< Interface Identifier offset in bytes.\\n\\n };\\n\\n} __attribute__((packed));\\n\\n\\n\\n/**\\n\\n * @}\\n\\n *\\n\\n */\\n\\n\\n\\n} // namespace Ip6\\n\\n} // namespace Thread\\n\\n\\n\\n#endif // NET_IP6_ADDRESS_HPP_\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 50,\n \"score\": 106452.70843862837\n },\n {\n \"content\": \" {\\n\\n d += 9;\\n\\n }\\n\\n else if (ch == ':' || ch == '\\\\0' || ch == ' ')\\n\\n {\\n\\n if (count)\\n\\n {\\n\\n VerifyOrExit(dst + 2 <= endp, error = kThreadError_Parse);\\n\\n *(dst + 1) = static_cast<uint8_t>(val >> 8);\\n\\n *(dst + 2) = static_cast<uint8_t>(val);\\n\\n dst += 2;\\n\\n count = 0;\\n\\n val = 0;\\n\\n }\\n\\n else if (ch == ':')\\n\\n {\\n\\n VerifyOrExit(colonp == NULL || first, error = kThreadError_Parse);\\n\\n colonp = dst;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 51,\n \"score\": 106452.24470221254\n },\n {\n \"content\": \" *\\n\\n * @param[in] aBuf A pointer to the NULL-terminated string.\\n\\n *\\n\\n * @retval kThreadError_None Successfully parsed the IPv6 address string.\\n\\n * @retval kTheradError_InvalidArgs Failed to parse the IPv6 address string.\\n\\n *\\n\\n */\\n\\n ThreadError FromString(const char *aBuf);\\n\\n\\n\\n /**\\n\\n * This method converts an IPv6 address object to a NULL-terminated string.\\n\\n *\\n\\n * @param[out] aBuf A pointer to the buffer.\\n\\n * @param[in] aSize The maximum size of the buffer.\\n\\n *\\n\\n * @returns A pointer to the buffer.\\n\\n *\\n\\n */\\n\\n const char *ToString(char *aBuf, uint16_t aSize) const;\\n\\n\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 52,\n \"score\": 106452.23065638776\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is a link-local all nodes multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a link-local all nodes multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a link-local all nodes multicast address.\\n\\n *\\n\\n */\\n\\n bool IsLinkLocalAllNodesMulticast(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is a link-local all routers multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a link-local all routers multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a link-local all routers multicast address.\\n\\n *\\n\\n */\\n\\n bool IsLinkLocalAllRoutersMulticast(void) const;\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 53,\n \"score\": 106452.17441599857\n },\n {\n \"content\": \" * This method indicates whether or not the IPv6 address is a realm-local multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a realm-local multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a realm-local multicast address.\\n\\n *\\n\\n */\\n\\n bool IsRealmLocalMulticast(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is a realm-local all nodes multicast address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is a realm-local all nodes multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a realm-local all nodes multicast address.\\n\\n *\\n\\n */\\n\\n bool IsRealmLocalAllNodesMulticast(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is a realm-local all routers multicast address.\\n\\n *\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 54,\n \"score\": 106451.90676218623\n },\n {\n \"content\": \" * @retval TRUE If the IPv6 address is a realm-local all routers multicast address.\\n\\n * @retval FALSE If the IPv6 address scope is not a realm-local all routers multicast address.\\n\\n *\\n\\n */\\n\\n bool IsRealmLocalAllRoutersMulticast(void) const;\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the Interface Identifier.\\n\\n *\\n\\n * @returns A pointer to the Interface Identifier.\\n\\n *\\n\\n */\\n\\n const uint8_t *GetIid(void) const;\\n\\n\\n\\n /**\\n\\n * This method returns a pointer to the Interface Identifier.\\n\\n *\\n\\n * @returns A pointer to the Interface Identifier.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 55,\n \"score\": 106450.72977783885\n },\n {\n \"content\": \" kRealmLocalScope = 3, ///< Realm-Local scope\\n\\n kAdminLocalScope = 4, ///< Admin-Local scope\\n\\n kSiteLocalScope = 5, ///< Site-Local scope\\n\\n kOrgLocalScope = 8, ///< Organization-Local scope\\n\\n kGlobalScope = 14, ///< Global scope\\n\\n };\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is the Unspecified Address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is the Unspecified Address.\\n\\n * @retval FALSE If the IPv6 address is not the Unspecified Address.\\n\\n *\\n\\n */\\n\\n bool IsUnspecified(void) const;\\n\\n\\n\\n /**\\n\\n * This method indicates whether or not the IPv6 address is the Loopback Address.\\n\\n *\\n\\n * @retval TRUE If the IPv6 address is the Loopback Address.\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 56,\n \"score\": 106449.9335854148\n },\n {\n \"content\": \"}\\n\\n\\n\\nbool Address::IsMulticast(void) const\\n\\n{\\n\\n return m8[0] == 0xff;\\n\\n}\\n\\n\\n\\nbool Address::IsLinkLocalMulticast(void) const\\n\\n{\\n\\n return IsMulticast() && (GetScope() == kLinkLocalScope);\\n\\n}\\n\\n\\n\\nbool Address::IsLinkLocalAllNodesMulticast(void) const\\n\\n{\\n\\n return (m32[0] == HostSwap32(0xff020000) && m32[1] == 0 &&\\n\\n m32[2] == 0 && m32[3] == HostSwap32(0x01));\\n\\n}\\n\\n\\n\\nbool Address::IsLinkLocalAllRoutersMulticast(void) const\\n\\n{\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 57,\n \"score\": 106449.41535476582\n },\n {\n \"content\": \" *\\n\\n * @retval TRUE If the IPv6 addresses match.\\n\\n * @retval FALSE If the IPv6 addresses do not match.\\n\\n *\\n\\n */\\n\\n bool operator==(const Address &aOther) const;\\n\\n\\n\\n /**\\n\\n * This method evaluates whether or not the IPv6 addresses differ.\\n\\n *\\n\\n * @param[in] aOther The IPv6 address to compare.\\n\\n *\\n\\n * @retval TRUE If the IPv6 addresses differ.\\n\\n * @retval FALSE If the IPv6 addresses do not differ.\\n\\n *\\n\\n */\\n\\n bool operator!=(const Address &aOther) const;\\n\\n\\n\\n /**\\n\\n * This method converts an IPv6 address string to binary.\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 58,\n \"score\": 106448.41258194325\n },\n {\n \"content\": \" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file\\n\\n * This file includes definitions for IPv6 addresses.\\n\\n */\\n\\n\\n\\n#ifndef IP6_ADDRESS_HPP_\\n\\n#define IP6_ADDRESS_HPP_\\n\\n\\n\\n#include <stdint.h>\\n\\n\\n\\n#include <openthread-types.h>\\n\\n\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 59,\n \"score\": 106447.96289278283\n },\n {\n \"content\": \" return (m32[0] == HostSwap32(0xff020000) && m32[1] == 0 &&\\n\\n m32[2] == 0 && m32[3] == HostSwap32(0x02));\\n\\n}\\n\\n\\n\\nbool Address::IsRealmLocalMulticast(void) const\\n\\n{\\n\\n return IsMulticast() && (GetScope() == kRealmLocalScope);\\n\\n}\\n\\n\\n\\nbool Address::IsRealmLocalAllNodesMulticast(void) const\\n\\n{\\n\\n return (m32[0] == HostSwap32(0xff030000) && m32[1] == 0 &&\\n\\n m32[2] == 0 && m32[3] == HostSwap32(0x01));\\n\\n}\\n\\n\\n\\nbool Address::IsRealmLocalAllRoutersMulticast(void) const\\n\\n{\\n\\n return (m32[0] == HostSwap32(0xff030000) && m32[1] == 0 &&\\n\\n m32[2] == 0 && m32[3] == HostSwap32(0x02));\\n\\n}\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 60,\n \"score\": 106447.70419753097\n },\n {\n \"content\": \" * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\\n\\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\\n\\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\\n\\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\\n\\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\\n\\n * POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\n\\n\\n/**\\n\\n * @file\\n\\n * This file implements IPv6 addresses.\\n\\n */\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <common/code_utils.hpp>\\n\\n#include <common/encoding.hpp>\\n\\n#include <mac/mac_frame.hpp>\\n\\n#include <net/ip6_address.hpp>\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 61,\n \"score\": 106445.98352173381\n },\n {\n \"content\": \"uint8_t Address::PrefixMatch(const Address &aOther) const\\n\\n{\\n\\n uint8_t rval = 0;\\n\\n uint8_t diff;\\n\\n\\n\\n for (uint8_t i = 0; i < sizeof(Address); i++)\\n\\n {\\n\\n diff = m8[i] ^ aOther.m8[i];\\n\\n\\n\\n if (diff == 0)\\n\\n {\\n\\n rval += 8;\\n\\n }\\n\\n else\\n\\n {\\n\\n while ((diff & 0x80) == 0)\\n\\n {\\n\\n rval++;\\n\\n diff <<= 1;\\n\\n }\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 62,\n \"score\": 106443.21950482506\n },\n {\n \"content\": \"\\n\\nconst uint8_t *Address::GetIid(void) const\\n\\n{\\n\\n return m8 + kInterfaceIdentifierOffset;\\n\\n}\\n\\n\\n\\nuint8_t *Address::GetIid(void)\\n\\n{\\n\\n return m8 + kInterfaceIdentifierOffset;\\n\\n}\\n\\n\\n\\nvoid Address::SetIid(const uint8_t *aIid)\\n\\n{\\n\\n memcpy(m8 + kInterfaceIdentifierOffset, aIid, kInterfaceIdentifierSize);\\n\\n}\\n\\n\\n\\nvoid Address::SetIid(const Mac::ExtAddress &aEui64)\\n\\n{\\n\\n memcpy(m8 + kInterfaceIdentifierOffset, aEui64.m8, kInterfaceIdentifierSize);\\n\\n m8[kInterfaceIdentifierOffset] ^= 0x02;\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 63,\n \"score\": 106442.6989666933\n },\n {\n \"content\": \" uint8_t *GetIid(void);\\n\\n\\n\\n /**\\n\\n * This method sets the Interface Identifier.\\n\\n *\\n\\n * @param[in] aIid A reference to the Interface Identifier.\\n\\n *\\n\\n */\\n\\n void SetIid(const uint8_t *aIid);\\n\\n\\n\\n /**\\n\\n * This method sets the Interface Identifier.\\n\\n *\\n\\n * @param[in] aEui64 A reference to the IEEE EUI-64 address.\\n\\n *\\n\\n */\\n\\n void SetIid(const Mac::ExtAddress &aEui64);\\n\\n\\n\\n /**\\n\\n * This method returns the IPv6 address scope.\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 64,\n \"score\": 106442.3195440893\n },\n {\n \"content\": \" *\\n\\n * @returns The IPv6 address scope.\\n\\n *\\n\\n */\\n\\n uint8_t GetScope(void) const;\\n\\n\\n\\n /**\\n\\n * This method returns the number of IPv6 prefix bits that match.\\n\\n *\\n\\n * @param[in] aOther The IPv6 address to match against.\\n\\n *\\n\\n * @returns The number of IPv6 prefix bits that match.\\n\\n *\\n\\n */\\n\\n uint8_t PrefixMatch(const Address &aOther) const;\\n\\n\\n\\n /**\\n\\n * This method evaluates whether or not the IPv6 addresses match.\\n\\n *\\n\\n * @param[in] aOther The IPv6 address to compare.\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 65,\n \"score\": 106441.24631331959\n },\n {\n \"content\": \"}\\n\\n\\n\\nuint8_t Address::GetScope(void) const\\n\\n{\\n\\n if (IsMulticast())\\n\\n {\\n\\n return m8[1] & 0xf;\\n\\n }\\n\\n else if (IsLinkLocal())\\n\\n {\\n\\n return kLinkLocalScope;\\n\\n }\\n\\n else if (IsLoopback())\\n\\n {\\n\\n return kNodeLocalScope;\\n\\n }\\n\\n\\n\\n return kGlobalScope;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 66,\n \"score\": 106440.16098428724\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2016, Nest Labs, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n * 1. Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * 2. Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * 3. Neither the name of the copyright holder nor the\\n\\n * names of its contributors may be used to endorse or promote products\\n\\n * derived from this software without specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\",\n \"file_path\": \"src/core/net/ip6_address.hpp\",\n \"rank\": 67,\n \"score\": 106433.47519413303\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2016, Nest Labs, Inc.\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n * 1. Redistributions of source code must retain the above copyright\\n\\n * notice, this list of conditions and the following disclaimer.\\n\\n * 2. Redistributions in binary form must reproduce the above copyright\\n\\n * notice, this list of conditions and the following disclaimer in the\\n\\n * documentation and/or other materials provided with the distribution.\\n\\n * 3. Neither the name of the copyright holder nor the\\n\\n * names of its contributors may be used to endorse or promote products\\n\\n * derived from this software without specific prior written permission.\\n\\n *\\n\\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\\n\\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\\n\\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\\n\",\n \"file_path\": \"src/core/net/ip6_address.cpp\",\n \"rank\": 68,\n \"score\": 106433.47519413303\n },\n {\n \"content\": \"class ThreadMeshLocalEidTlv;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 69,\n \"score\": 105593.52283816083\n },\n {\n \"content\": \"class ThreadLastTransactionTimeTlv;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 70,\n \"score\": 105593.52283816083\n },\n {\n \"content\": \"class LinkAddress\\n\\n{\\n\\npublic :\\n\\n /**\\n\\n * Hardware types.\\n\\n *\\n\\n */\\n\\n enum HardwareType\\n\\n {\\n\\n kEui64 = 27,\\n\\n };\\n\\n HardwareType mType; ///< Link address type.\\n\\n uint8_t mLength; ///< Length of link address.\\n\\n Mac::ExtAddress mExtAddress; ///< Link address.\\n\\n};\\n\\n\\n\\n/**\\n\\n * This class implements an IPv6 network interface unicast address.\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"src/core/net/netif.hpp\",\n \"rank\": 71,\n \"score\": 104232.2058515706\n },\n {\n \"content\": \" }\\n\\n\\n\\nexit:\\n\\n {}\\n\\n}\\n\\n\\n\\nvoid AddressResolver::SendAddressQueryResponse(const ThreadTargetTlv &aTargetTlv,\\n\\n const ThreadMeshLocalEidTlv &aMlIidTlv,\\n\\n const ThreadLastTransactionTimeTlv *aLastTransactionTimeTlv,\\n\\n const Ip6::Address &aDestination)\\n\\n{\\n\\n ThreadError error;\\n\\n Message *message;\\n\\n Coap::Header header;\\n\\n ThreadRloc16Tlv rloc16Tlv;\\n\\n Ip6::MessageInfo messageInfo;\\n\\n\\n\\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\\n\\n\\n\\n header.Init();\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 72,\n \"score\": 103971.99509999841\n },\n {\n \"content\": \" ThreadTargetTlv targetTlv;\\n\\n ThreadMeshLocalEidTlv mlIidTlv;\\n\\n Child *children;\\n\\n uint8_t numChildren;\\n\\n Mac::ExtAddress macAddr;\\n\\n Ip6::Address destination;\\n\\n\\n\\n VerifyOrExit(aHeader.GetCode() == Coap::Header::kCodePost, error = kThreadError_Drop);\\n\\n\\n\\n otLogInfoArp(\\\"Received address error notification\\\\n\\\");\\n\\n\\n\\n SuccessOrExit(error = ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\\n\\n VerifyOrExit(targetTlv.IsValid(), error = kThreadError_Parse);\\n\\n\\n\\n SuccessOrExit(error = ThreadTlv::GetTlv(aMessage, ThreadTlv::kMeshLocalEid, sizeof(mlIidTlv), mlIidTlv));\\n\\n VerifyOrExit(mlIidTlv.IsValid(), error = kThreadError_Parse);\\n\\n\\n\\n for (const Ip6::NetifUnicastAddress *address = mNetif.GetUnicastAddresses(); address; address = address->GetNext())\\n\\n {\\n\\n if (memcmp(&address->mAddress, targetTlv.GetTarget(), sizeof(address->mAddress)) == 0 &&\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 73,\n \"score\": 103970.90226299173\n },\n {\n \"content\": \" break;\\n\\n\\n\\n case Cache::kStateCached:\\n\\n aRloc16 = entry->mRloc16;\\n\\n break;\\n\\n }\\n\\n\\n\\nexit:\\n\\n return error;\\n\\n}\\n\\n\\n\\nThreadError AddressResolver::SendAddressQuery(const Ip6::Address &aEid)\\n\\n{\\n\\n ThreadError error;\\n\\n Ip6::SockAddr sockaddr;\\n\\n Message *message;\\n\\n Coap::Header header;\\n\\n ThreadTargetTlv targetTlv;\\n\\n Ip6::MessageInfo messageInfo;\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 74,\n \"score\": 103970.37314704972\n },\n {\n \"content\": \" for (int j = 0; j < Child::kMaxIp6AddressPerChild; j++)\\n\\n {\\n\\n if (memcmp(&children[i].mIp6Address[j], targetTlv.GetTarget(), sizeof(children[i].mIp6Address[j])) == 0 &&\\n\\n memcmp(&children[i].mMacAddr, &macAddr, sizeof(children[i].mMacAddr)))\\n\\n {\\n\\n // Target EID matches child address and Mesh Local EID differs on child\\n\\n memset(&children[i].mIp6Address[j], 0, sizeof(children[i].mIp6Address[j]));\\n\\n\\n\\n memset(&destination, 0, sizeof(destination));\\n\\n destination.m16[0] = HostSwap16(0xfe80);\\n\\n destination.SetIid(children[i].mMacAddr);\\n\\n\\n\\n SendAddressError(targetTlv, mlIidTlv, &destination);\\n\\n ExitNow();\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\nexit:\\n\\n {}\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 75,\n \"score\": 103969.10304161055\n },\n {\n \"content\": \" }\\n\\n\\n\\n memset(&messageInfo, 0, sizeof(messageInfo));\\n\\n memcpy(&messageInfo.GetPeerAddr(), &aDestination, sizeof(messageInfo.GetPeerAddr()));\\n\\n messageInfo.mInterfaceId = messageInfo.mInterfaceId;\\n\\n messageInfo.mPeerPort = kCoapUdpPort;\\n\\n\\n\\n SuccessOrExit(error = mSocket.SendTo(*message, messageInfo));\\n\\n\\n\\n otLogInfoArp(\\\"Sent address notification\\\\n\\\");\\n\\n\\n\\nexit:\\n\\n\\n\\n if (error != kThreadError_None && message != NULL)\\n\\n {\\n\\n Message::Free(*message);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleTimer(void *aContext)\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 76,\n \"score\": 103968.77394261141\n },\n {\n \"content\": \"\\n\\n if (error != kThreadError_None && message != NULL)\\n\\n {\\n\\n Message::Free(*message);\\n\\n }\\n\\n}\\n\\n\\n\\nThreadError AddressResolver::SendAddressError(const ThreadTargetTlv &aTarget, const ThreadMeshLocalEidTlv &aEid,\\n\\n const Ip6::Address *aDestination)\\n\\n{\\n\\n ThreadError error;\\n\\n Message *message;\\n\\n Coap::Header header;\\n\\n Ip6::MessageInfo messageInfo;\\n\\n Ip6::SockAddr sockaddr;\\n\\n\\n\\n sockaddr.mPort = kCoapUdpPort;\\n\\n mSocket.Open(&HandleUdpReceive, this);\\n\\n mSocket.Bind(sockaddr);\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 77,\n \"score\": 103967.99379329135\n },\n {\n \"content\": \" {\\n\\n SendAddressError(targetTlv, mlIidTlv, NULL);\\n\\n }\\n\\n\\n\\n ExitNow();\\n\\n }\\n\\n }\\n\\n\\n\\n ExitNow();\\n\\n\\n\\nexit:\\n\\n {}\\n\\n}\\n\\n\\n\\nvoid AddressResolver::SendAddressNotificationResponse(const Coap::Header &aRequestHeader,\\n\\n const Ip6::MessageInfo &aRequestInfo)\\n\\n{\\n\\n ThreadError error;\\n\\n Message *message;\\n\\n Coap::Header responseHeader;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 78,\n \"score\": 103967.59804571696\n },\n {\n \"content\": \"#include <thread/address_resolver.hpp>\\n\\n#include <thread/mesh_forwarder.hpp>\\n\\n#include <thread/mle_router.hpp>\\n\\n#include <thread/thread_netif.hpp>\\n\\n#include <thread/thread_tlvs.hpp>\\n\\n#include <thread/thread_uris.hpp>\\n\\n\\n\\nusing Thread::Encoding::BigEndian::HostSwap16;\\n\\n\\n\\nnamespace Thread {\\n\\n\\n\\nAddressResolver::AddressResolver(ThreadNetif &aThreadNetif) :\\n\\n mAddressError(OPENTHREAD_URI_ADDRESS_ERROR, &HandleAddressError, this),\\n\\n mAddressQuery(OPENTHREAD_URI_ADDRESS_QUERY, &HandleAddressQuery, this),\\n\\n mAddressNotification(OPENTHREAD_URI_ADDRESS_NOTIFY, &HandleAddressNotification, this),\\n\\n mIcmpHandler(&HandleDstUnreach, this),\\n\\n mTimer(&HandleTimer, this),\\n\\n mMeshForwarder(aThreadNetif.GetMeshForwarder()),\\n\\n mCoapServer(aThreadNetif.GetCoapServer()),\\n\\n mMle(aThreadNetif.GetMle()),\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 79,\n \"score\": 103966.24268356853\n },\n {\n \"content\": \" uint8_t mFailures;\\n\\n\\n\\n enum State\\n\\n {\\n\\n kStateInvalid,\\n\\n kStateQuery,\\n\\n kStateCached,\\n\\n };\\n\\n State mState;\\n\\n };\\n\\n\\n\\n ThreadError SendAddressQuery(const Ip6::Address &aEid);\\n\\n ThreadError SendAddressError(const ThreadTargetTlv &aTarget, const ThreadMeshLocalEidTlv &aEid,\\n\\n const Ip6::Address *aDestination);\\n\\n void SendAddressQueryResponse(const ThreadTargetTlv &aTargetTlv, const ThreadMeshLocalEidTlv &aMlEidTlv,\\n\\n const ThreadLastTransactionTimeTlv *aLastTransactionTimeTlv,\\n\\n const Ip6::Address &aDestination);\\n\\n void SendAddressNotificationResponse(const Coap::Header &aRequestHeader, const Ip6::MessageInfo &aMessageInfo);\\n\\n\\n\\n static void HandleUdpReceive(void *aContext, otMessage aMessage, const otMessageInfo *aMessageInfo);\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 80,\n \"score\": 103965.52510042177\n },\n {\n \"content\": \"\\n\\n if (error != kThreadError_None && message != NULL)\\n\\n {\\n\\n Message::Free(*message);\\n\\n }\\n\\n\\n\\n return error;\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleAddressError(void *aContext, Coap::Header &aHeader,\\n\\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\\n\\n obj->HandleAddressError(aHeader, aMessage, aMessageInfo);\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleAddressError(Coap::Header &aHeader, Message &aMessage,\\n\\n const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n ThreadError error = kThreadError_None;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 81,\n \"score\": 103965.16459794847\n },\n {\n \"content\": \" mNetif(aThreadNetif)\\n\\n{\\n\\n memset(&mCache, 0, sizeof(mCache));\\n\\n\\n\\n mCoapServer.AddResource(mAddressError);\\n\\n mCoapServer.AddResource(mAddressQuery);\\n\\n mCoapServer.AddResource(mAddressNotification);\\n\\n mCoapMessageId = otPlatRandomGet();\\n\\n\\n\\n Ip6::Icmp::RegisterCallbacks(mIcmpHandler);\\n\\n}\\n\\n\\n\\nvoid AddressResolver::Clear()\\n\\n{\\n\\n memset(&mCache, 0, sizeof(mCache));\\n\\n}\\n\\n\\n\\nvoid AddressResolver::Remove(uint8_t routerId)\\n\\n{\\n\\n for (int i = 0; i < kCacheEntries; i++)\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 82,\n \"score\": 103964.50627574127\n },\n {\n \"content\": \" break;\\n\\n }\\n\\n }\\n\\n else if (entry == NULL)\\n\\n {\\n\\n entry = &mCache[i];\\n\\n }\\n\\n }\\n\\n\\n\\n VerifyOrExit(entry != NULL, error = kThreadError_NoBufs);\\n\\n\\n\\n switch (entry->mState)\\n\\n {\\n\\n case Cache::kStateInvalid:\\n\\n entry->mTarget = aEid;\\n\\n entry->mRloc16 = Mac::kShortAddrInvalid;\\n\\n entry->mTimeout = kAddressQueryTimeout;\\n\\n entry->mFailures = 0;\\n\\n entry->mRetryTimeout = kAddressQueryInitialRetryDelay;\\n\\n entry->mState = Cache::kStateQuery;\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 83,\n \"score\": 103964.37608314399\n },\n {\n \"content\": \" memset(&messageInfo, 0, sizeof(messageInfo));\\n\\n\\n\\n if (aDestination == NULL)\\n\\n {\\n\\n messageInfo.GetPeerAddr().m16[0] = HostSwap16(0xff03);\\n\\n messageInfo.GetPeerAddr().m16[7] = HostSwap16(0x0002);\\n\\n }\\n\\n else\\n\\n {\\n\\n memcpy(&messageInfo.GetPeerAddr(), aDestination, sizeof(messageInfo.GetPeerAddr()));\\n\\n }\\n\\n\\n\\n messageInfo.mPeerPort = kCoapUdpPort;\\n\\n messageInfo.mInterfaceId = mNetif.GetInterfaceId();\\n\\n\\n\\n SuccessOrExit(error = mSocket.SendTo(*message, messageInfo));\\n\\n\\n\\n otLogInfoArp(\\\"Sent address error\\\\n\\\");\\n\\n\\n\\nexit:\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 84,\n \"score\": 103963.86231067083\n },\n {\n \"content\": \" VerifyOrExit(aIcmpHeader.GetCode() == Ip6::IcmpHeader::kCodeDstUnreachNoRoute, ;);\\n\\n VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(ip6Header), &ip6Header) == sizeof(ip6Header), ;);\\n\\n\\n\\n for (int i = 0; i < kCacheEntries; i++)\\n\\n {\\n\\n if (mCache[i].mState != Cache::kStateInvalid &&\\n\\n memcmp(&mCache[i].mTarget, &ip6Header.GetDestination(), sizeof(mCache[i].mTarget)) == 0)\\n\\n {\\n\\n mCache[i].mState = Cache::kStateInvalid;\\n\\n otLogInfoArp(\\\"cache entry removed!\\\\n\\\");\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\nexit:\\n\\n {}\\n\\n}\\n\\n\\n\\n} // namespace Thread\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 85,\n \"score\": 103963.28196065738\n },\n {\n \"content\": \"{\\n\\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\\n\\n obj->HandleTimer();\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleTimer()\\n\\n{\\n\\n bool continueTimer = false;\\n\\n\\n\\n for (int i = 0; i < kCacheEntries; i++)\\n\\n {\\n\\n if (mCache[i].mState != Cache::kStateQuery)\\n\\n {\\n\\n continue;\\n\\n }\\n\\n\\n\\n continueTimer = true;\\n\\n\\n\\n if (mCache[i].mTimeout > 0)\\n\\n {\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 86,\n \"score\": 103962.74124781726\n },\n {\n \"content\": \" {\\n\\n if ((mCache[i].mRloc16 >> 10) == routerId)\\n\\n {\\n\\n mCache[i].mState = Cache::kStateInvalid;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nThreadError AddressResolver::Resolve(const Ip6::Address &aEid, uint16_t &aRloc16)\\n\\n{\\n\\n ThreadError error = kThreadError_None;\\n\\n Cache *entry = NULL;\\n\\n\\n\\n for (int i = 0; i < kCacheEntries; i++)\\n\\n {\\n\\n if (mCache[i].mState != Cache::kStateInvalid)\\n\\n {\\n\\n if (memcmp(&mCache[i].mTarget, &aEid, sizeof(mCache[i].mTarget)) == 0)\\n\\n {\\n\\n entry = &mCache[i];\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 87,\n \"score\": 103962.18486395813\n },\n {\n \"content\": \"\\n\\n otLogInfoArp(\\\"Received address query from %04x\\\\n\\\", HostSwap16(aMessageInfo.GetPeerAddr().m16[7]));\\n\\n\\n\\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\\n\\n VerifyOrExit(targetTlv.IsValid(), ;);\\n\\n\\n\\n mlIidTlv.Init();\\n\\n\\n\\n lastTransactionTimeTlv.Init();\\n\\n\\n\\n if (mNetif.IsUnicastAddress(*targetTlv.GetTarget()))\\n\\n {\\n\\n mlIidTlv.SetIid(mMle.GetMeshLocal64()->GetIid());\\n\\n SendAddressQueryResponse(targetTlv, mlIidTlv, NULL, aMessageInfo.GetPeerAddr());\\n\\n ExitNow();\\n\\n }\\n\\n\\n\\n children = mMle.GetChildren(&numChildren);\\n\\n\\n\\n for (int i = 0; i < Mle::kMaxChildren; i++)\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 88,\n \"score\": 103961.78845560494\n },\n {\n \"content\": \" Coap::Resource mAddressError;\\n\\n Coap::Resource mAddressQuery;\\n\\n Coap::Resource mAddressNotification;\\n\\n Cache mCache[kCacheEntries];\\n\\n uint16_t mCoapMessageId;\\n\\n uint8_t mCoapToken[2];\\n\\n Ip6::IcmpHandler mIcmpHandler;\\n\\n Ip6::UdpSocket mSocket;\\n\\n Timer mTimer;\\n\\n\\n\\n MeshForwarder &mMeshForwarder;\\n\\n Coap::Server &mCoapServer;\\n\\n Mle::MleRouter &mMle;\\n\\n Ip6::Netif &mNetif;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @}\\n\\n */\\n\\n\\n\\n} // namespace Thread\\n\\n\\n\\n#endif // ADDRESS_RESOLVER_HPP_\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 89,\n \"score\": 103961.21684873708\n },\n {\n \"content\": \" mTimer.Start(kStateUpdatePeriod);\\n\\n }\\n\\n\\n\\n if (error != kThreadError_None && message != NULL)\\n\\n {\\n\\n Message::Free(*message);\\n\\n }\\n\\n\\n\\n return error;\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleUdpReceive(void *aContext, otMessage aMessage, const otMessageInfo *aMessageInfo)\\n\\n{\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleAddressNotification(void *aContext, Coap::Header &aHeader, Message &aMessage,\\n\\n const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\\n\\n obj->HandleAddressNotification(aHeader, aMessage, aMessageInfo);\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 90,\n \"score\": 103961.17952986823\n },\n {\n \"content\": \" {\\n\\n if (children[i].mState != Neighbor::kStateValid || (children[i].mMode & Mle::ModeTlv::kModeFFD) != 0)\\n\\n {\\n\\n continue;\\n\\n }\\n\\n\\n\\n for (int j = 0; j < Child::kMaxIp6AddressPerChild; j++)\\n\\n {\\n\\n if (memcmp(&children[i].mIp6Address[j], targetTlv.GetTarget(), sizeof(children[i].mIp6Address[j])))\\n\\n {\\n\\n continue;\\n\\n }\\n\\n\\n\\n children[i].mMacAddr.m8[0] ^= 0x2;\\n\\n mlIidTlv.SetIid(children[i].mMacAddr.m8);\\n\\n children[i].mMacAddr.m8[0] ^= 0x2;\\n\\n lastTransactionTimeTlv.SetTime(Timer::GetNow() - children[i].mLastHeard);\\n\\n SendAddressQueryResponse(targetTlv, mlIidTlv, &lastTransactionTimeTlv, aMessageInfo.GetPeerAddr());\\n\\n ExitNow();\\n\\n }\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 91,\n \"score\": 103960.66286684625\n },\n {\n \"content\": \" Ip6::MessageInfo responseInfo;\\n\\n\\n\\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\\n\\n\\n\\n responseHeader.Init();\\n\\n responseHeader.SetVersion(1);\\n\\n responseHeader.SetType(Coap::Header::kTypeAcknowledgment);\\n\\n responseHeader.SetCode(Coap::Header::kCodeChanged);\\n\\n responseHeader.SetMessageId(aRequestHeader.GetMessageId());\\n\\n responseHeader.SetToken(aRequestHeader.GetToken(), aRequestHeader.GetTokenLength());\\n\\n responseHeader.Finalize();\\n\\n SuccessOrExit(error = message->Append(responseHeader.GetBytes(), responseHeader.GetLength()));\\n\\n\\n\\n memcpy(&responseInfo, &aRequestInfo, sizeof(responseInfo));\\n\\n memset(&responseInfo.mSockAddr, 0, sizeof(responseInfo.mSockAddr));\\n\\n SuccessOrExit(error = mCoapServer.SendMessage(*message, responseInfo));\\n\\n\\n\\n otLogInfoArp(\\\"Sent address notification acknowledgment\\\\n\\\");\\n\\n\\n\\nexit:\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 92,\n \"score\": 103959.98136486729\n },\n {\n \"content\": \" memcmp(mMle.GetMeshLocal64()->GetIid(), mlIidTlv.GetIid(), 8))\\n\\n {\\n\\n // Target EID matches address and Mesh Local EID differs\\n\\n mNetif.RemoveUnicastAddress(*address);\\n\\n ExitNow();\\n\\n }\\n\\n }\\n\\n\\n\\n children = mMle.GetChildren(&numChildren);\\n\\n\\n\\n memcpy(&macAddr, mlIidTlv.GetIid(), sizeof(macAddr));\\n\\n macAddr.m8[0] ^= 0x2;\\n\\n\\n\\n for (int i = 0; i < Mle::kMaxChildren; i++)\\n\\n {\\n\\n if (children[i].mState != Neighbor::kStateValid || (children[i].mMode & Mle::ModeTlv::kModeFFD) != 0)\\n\\n {\\n\\n continue;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 93,\n \"score\": 103958.50357118623\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid AddressResolver::HandleAddressNotification(Coap::Header &aHeader, Message &aMessage,\\n\\n const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n ThreadTargetTlv targetTlv;\\n\\n ThreadMeshLocalEidTlv mlIidTlv;\\n\\n ThreadRloc16Tlv rloc16Tlv;\\n\\n\\n\\n VerifyOrExit(aHeader.GetType() == Coap::Header::kTypeConfirmable &&\\n\\n aHeader.GetCode() == Coap::Header::kCodePost, ;);\\n\\n\\n\\n otLogInfoArp(\\\"Received address notification from %04x\\\\n\\\", HostSwap16(aMessageInfo.GetPeerAddr().m16[7]));\\n\\n\\n\\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kTarget, sizeof(targetTlv), targetTlv));\\n\\n VerifyOrExit(targetTlv.IsValid(), ;);\\n\\n\\n\\n SuccessOrExit(ThreadTlv::GetTlv(aMessage, ThreadTlv::kMeshLocalEid, sizeof(mlIidTlv), mlIidTlv));\\n\\n VerifyOrExit(mlIidTlv.IsValid(), ;);\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 94,\n \"score\": 103957.87440603384\n },\n {\n \"content\": \" for (size_t i = 0; i < sizeof(mCoapToken); i++)\\n\\n {\\n\\n mCoapToken[i] = otPlatRandomGet();\\n\\n }\\n\\n\\n\\n VerifyOrExit((message = Ip6::Udp::NewMessage(0)) != NULL, error = kThreadError_NoBufs);\\n\\n\\n\\n header.Init();\\n\\n header.SetVersion(1);\\n\\n header.SetType(Coap::Header::kTypeNonConfirmable);\\n\\n header.SetCode(Coap::Header::kCodePost);\\n\\n header.SetMessageId(++mCoapMessageId);\\n\\n header.SetToken(NULL, 0);\\n\\n header.AppendUriPathOptions(OPENTHREAD_URI_ADDRESS_ERROR);\\n\\n header.AppendContentFormatOption(Coap::Header::kApplicationOctetStream);\\n\\n header.Finalize();\\n\\n SuccessOrExit(error = message->Append(header.GetBytes(), header.GetLength()));\\n\\n SuccessOrExit(error = message->Append(&aTarget, sizeof(aTarget)));\\n\\n SuccessOrExit(error = message->Append(&aEid, sizeof(aEid)));\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 95,\n \"score\": 103957.33178874559\n },\n {\n \"content\": \" */\\n\\n void Remove(uint8_t aRouterId);\\n\\n\\n\\n /**\\n\\n * This method returns the RLOC16 for a given EID, or initiates an Address Query if the mapping is not known.\\n\\n *\\n\\n * @param[in] aEid A reference to the EID.\\n\\n * @param[out] aRloc16 The RLOC16 corresponding to @p aEid.\\n\\n *\\n\\n * @retval kTheradError_None Successfully provided the RLOC16.\\n\\n * @retval kThreadError_AddressQuery Initiated an Address Query.\\n\\n *\\n\\n */\\n\\n ThreadError Resolve(const Ip6::Address &aEid, Mac::ShortAddress &aRloc16);\\n\\n\\n\\nprivate:\\n\\n enum\\n\\n {\\n\\n kCacheEntries = OPENTHREAD_CONFIG_ADDRESS_CACHE_ENTRIES,\\n\\n kStateUpdatePeriod = 1000u, ///< State update period in milliseconds.\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 96,\n \"score\": 103956.57721448313\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid AddressResolver::HandleAddressQuery(void *aContext, Coap::Header &aHeader, Message &aMessage,\\n\\n const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n AddressResolver *obj = reinterpret_cast<AddressResolver *>(aContext);\\n\\n obj->HandleAddressQuery(aHeader, aMessage, aMessageInfo);\\n\\n}\\n\\n\\n\\nvoid AddressResolver::HandleAddressQuery(Coap::Header &aHeader, Message &aMessage,\\n\\n const Ip6::MessageInfo &aMessageInfo)\\n\\n{\\n\\n ThreadTargetTlv targetTlv;\\n\\n ThreadMeshLocalEidTlv mlIidTlv;\\n\\n ThreadLastTransactionTimeTlv lastTransactionTimeTlv;\\n\\n Child *children;\\n\\n uint8_t numChildren;\\n\\n\\n\\n VerifyOrExit(aHeader.GetType() == Coap::Header::kTypeNonConfirmable &&\\n\\n aHeader.GetCode() == Coap::Header::kCodePost, ;);\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 97,\n \"score\": 103956.34494763383\n },\n {\n \"content\": \" SendAddressQuery(aEid);\\n\\n error = kThreadError_AddressQuery;\\n\\n break;\\n\\n\\n\\n case Cache::kStateQuery:\\n\\n if (entry->mTimeout > 0)\\n\\n {\\n\\n error = kThreadError_AddressQuery;\\n\\n }\\n\\n else if (entry->mTimeout == 0 && entry->mRetryTimeout == 0)\\n\\n {\\n\\n entry->mTimeout = kAddressQueryTimeout;\\n\\n SendAddressQuery(aEid);\\n\\n error = kThreadError_AddressQuery;\\n\\n }\\n\\n else\\n\\n {\\n\\n error = kThreadError_Drop;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.cpp\",\n \"rank\": 98,\n \"score\": 103955.8436242316\n },\n {\n \"content\": \"\\n\\n static void HandleAddressError(void *aContext, Coap::Header &aHeader,\\n\\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n void HandleAddressError(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n\\n\\n static void HandleAddressQuery(void *aContext, Coap::Header &aHeader,\\n\\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n void HandleAddressQuery(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n\\n\\n static void HandleAddressNotification(void *aContext, Coap::Header &aHeader,\\n\\n Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n void HandleAddressNotification(Coap::Header &aHeader, Message &aMessage, const Ip6::MessageInfo &aMessageInfo);\\n\\n\\n\\n static void HandleDstUnreach(void *aContext, Message &aMessage, const Ip6::MessageInfo &aMessageInfo,\\n\\n const Ip6::IcmpHeader &aIcmpHeader);\\n\\n void HandleDstUnreach(Message &aMessage, const Ip6::MessageInfo &aMessageInfo, const Ip6::IcmpHeader &aIcmpHeader);\\n\\n\\n\\n static void HandleTimer(void *aContext);\\n\\n void HandleTimer(void);\\n\\n\\n\",\n \"file_path\": \"src/core/thread/address_resolver.hpp\",\n \"rank\": 99,\n \"score\": 103954.78050249818\n }\n]","isConversational":false}}},{"rowIdx":399,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"MUON/MUONgraphics/AliMUONPCBPainter.cxx"},"repo_name":{"kind":"string","value":"AllaMaevskaya/AliRoot"},"commit":{"kind":"string","value":"c53712645bf1c7d5f565b0d3228e3a6b9b09011a"},"file_code":{"kind":"string","value":"\n\n#include \"AliMUONPCBPainter.h\"\n\n#include \"AliMUONManuPainter.h\"\n#include \"AliMUONContour.h\"\n#include \"AliMUONPainterHelper.h\"\n#include \"AliMUONVCalibParam.h\"\n#include \"AliMUONVTrackerData.h\"\n#include \"AliMpDEManager.h\"\n#include \"AliMpMotifPosition.h\"\n#include \"AliMpPCB.h\"\n#include \"AliMpPlaneType.h\"\n#include \"AliMpSlat.h\"\n#include \"AliLog.h\"\n\nClassImp(AliMUONPCBPainter)\n\nAliMUONPCBPainter::AliMUONPCBPainter(TRootIOCtor* ioCtor)\n: AliMUONVPainter(ioCtor),\nfDetElemId(-1),\nfPCBIndex(-1)\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter()\n: AliMUONVPainter(),\nfDetElemId(-1),\nfPCBIndex(-1)\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter(const AliMUONAttPainter& att,\n Int_t detElemId,\n Int_t pcbNumber)\n: AliMUONVPainter(\"PCB\"),\n fDetElemId(detElemId),\n fPCBIndex(pcbNumber)\n{\n \n \n SetAttributes(att);\n \n AliMUONPainterHelper* h = AliMUONPainterHelper::Instance();\n \n AliMp::PlaneType planeType = ( att.IsBendingPlane() ? AliMp::kBendingPlane : AliMp::kNonBendingPlane );\n \n const AliMpSlat* slat = AliMUONPainterHelper::Instance()->GetSlat(fDetElemId,planeType);\n \n SetID(detElemId,pcbNumber);\n SetName(h->PCBName(pcbNumber));\n SetPathName(h->PCBPathName(detElemId,pcbNumber));\n \n AliMpPCB* pcb = slat->GetPCB(fPCBIndex);\n \n AliMUONContour* contour = h->GetContour(ContourName());\n TObjArray contourArray;\n \n for ( Int_t imp = 0 ; imp < pcb->GetSize(); ++imp ) \n {\n AliMpMotifPosition* mp = pcb->GetMotifPosition(imp);\n AliMUONVPainter* painter = new AliMUONManuPainter(Attributes(),fDetElemId,mp->GetID());\n Add(painter);\n if (!contour)\n {\n contourArray.Add(painter->Contour());\n }\n }\n \n Double_t x,y,z;\n \n h->Local2Global(fDetElemId,\n pcb->X()-slat->GetPositionX(),\n pcb->Y()-slat->GetPositionY(),\n 0.0,\n x,y,z);\n \n if (!contour)\n {\n contour = h->MergeContours(contourArray,ContourName());\n }\n \n SetContour(contour);\n}\n\nAliMUONPCBPainter::~AliMUONPCBPainter()\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter(const AliMUONPCBPainter& rhs)\n: AliMUONVPainter(rhs),\n fDetElemId(-1),\n fPCBIndex(-1)\n{\n \n rhs.Copy(*this);\n}\n\nAliMUONPCBPainter&\nAliMUONPCBPainter::operator=(const AliMUONPCBPainter& rhs)\n{\n \n if ( this != &rhs )\n {\n rhs.Copy(*this);\n }\n return *this;\n}\n\nvoid \nAliMUONPCBPainter::ComputeDataRange(const AliMUONVTrackerData& data, Int_t dataIndex, \n Double_t& dataMin, Double_t& dataMax) const\n{\n \n dataMin = dataMax = data.PCB(fDetElemId, fPCBIndex,dataIndex);\n}\n\nvoid\nAliMUONPCBPainter::Copy(TObject& object) const\n{\n \n AliMUONVPainter::Copy((AliMUONVPainter&)(object));\n ((AliMUONPCBPainter&)(object)).fDetElemId = fDetElemId;\n ((AliMUONPCBPainter&)(object)).fPCBIndex = fPCBIndex;\n}\n\nTString\nAliMUONPCBPainter::Describe(const AliMUONVTrackerData& data, Int_t dataIndex,\n Double_t, Double_t)\n{\n \n \n if (!data.HasPCB(fDetElemId,fPCBIndex)) return \"\";\n \n Double_t value = data.PCB(fDetElemId,fPCBIndex,dataIndex);\n \n return AliMUONPainterHelper::Instance()->FormatValue(data.DimensionName(dataIndex).Data(),value);\n}\n\nBool_t\nAliMUONPCBPainter::IsIncluded() const\n{\n \n return ( InteractiveReadOutConfig()->PCB(fDetElemId,fPCBIndex) > 0 );\n}\n\nvoid\nAliMUONPCBPainter::PaintArea(const AliMUONVTrackerData& data, Int_t dataIndex,\n Double_t min, Double_t max)\n{\n \n if (!data.HasPCB(fDetElemId,fPCBIndex)) return;\n \n Double_t value = data.PCB(fDetElemId,fPCBIndex,dataIndex);\n \n if ( value >= AliMUONVCalibParam::InvalidFloatValue() ) return;\n \n Int_t color = AliMUONPainterHelper::Instance()->ColorFromValue(value,min,max);\n \n PaintArea(color);\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#include \"AliMUONPCBPainter.h\"\n\n#include \"AliMUONManuPainter.h\"\n#include \"AliMUONContour.h\"\n#include \"AliMUONPainterHelper.h\"\n#include \"AliMUONVCalibParam.h\"\n#include \"AliMUONVTrackerData.h\"\n#include \"AliMpDEManager.h\"\n#include \"AliMpMotifPosition.h\"\n#include \"AliMpPCB.h\"\n#include \"AliMpPlaneType.h\"\n#include \"AliMpSlat.h\"\n#include \"AliLog.h\"\n\nClassImp(AliMUONPCBPainter)\n\nAliMUONPCBPainter::AliMUONPCBPainter(TRootIOCtor* ioCtor)\n: AliMUONVPainter(ioCtor),\nfDetElemId(-1),\nfPCBIndex(-1)\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter()\n: AliMUONVPainter(),\nfDetElemId(-1),\nfPCBIndex(-1)\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter(const AliMUONAttPainter& att,\n Int_t detElemId,\n Int_t pcbNumber)\n: AliMUONVPainter(\"PCB\"),\n fDetElemId(detElemId),\n fPCBIndex(pcbNumber)\n{\n \n \n SetAttributes(att);\n \n AliMUONPainterHelper* h = AliMUONPainterHelper::Instance();\n \n AliMp::PlaneType planeType = ( att.IsBendingPlane() ? AliMp::kBendingPlane : AliMp::kNonBendingPlane );\n \n const AliMpSlat* slat = AliMUONPainterHelper::Instance()->GetSlat(fDetElemId,planeType);\n \n SetID(detElemId,pcbNumber);\n SetName(h->PCBName(pcbNumber));\n SetPathName(h->PCBPathName(detElemId,pcbNumber));\n \n AliMpPCB* pcb = slat->GetPCB(fPCBIndex);\n \n AliMUONContour* contour = h->GetContour(ContourName());\n TObjArray contourArray;\n \n for ( Int_t imp = 0 ; imp < pcb->GetSize(); ++imp ) \n {\n AliMpMotifPosition* mp = pcb->GetMotifPosition(imp);\n AliMUONVPainter* painter = new AliMUONManuPainter(Attributes(),fDetElemId,mp->GetID());\n Add(painter);\n if (!contour)\n {\n contourArray.Add(painter->Contour());\n }\n }\n \n Double_t x,y,z;\n \n "},"suffix":{"kind":"string","value":";\n \n if (!contour)\n {\n contour = h->MergeContours(contourArray,ContourName());\n }\n \n SetContour(contour);\n}\n\nAliMUONPCBPainter::~AliMUONPCBPainter()\n{\n \n}\n\nAliMUONPCBPainter::AliMUONPCBPainter(const AliMUONPCBPainter& rhs)\n: AliMUONVPainter(rhs),\n fDetElemId(-1),\n fPCBIndex(-1)\n{\n \n rhs.Copy(*this);\n}\n\nAliMUONPCBPainter&\nAliMUONPCBPainter::operator=(const AliMUONPCBPainter& rhs)\n{\n \n if ( this != &rhs )\n {\n rhs.Copy(*this);\n }\n return *this;\n}\n\nvoid \nAliMUONPCBPainter::ComputeDataRange(const AliMUONVTrackerData& data, Int_t dataIndex, \n Double_t& dataMin, Double_t& dataMax) const\n{\n \n dataMin = dataMax = data.PCB(fDetElemId, fPCBIndex,dataIndex);\n}\n\nvoid\nAliMUONPCBPainter::Copy(TObject& object) const\n{\n \n AliMUONVPainter::Copy((AliMUONVPainter&)(object));\n ((AliMUONPCBPainter&)(object)).fDetElemId = fDetElemId;\n ((AliMUONPCBPainter&)(object)).fPCBIndex = fPCBIndex;\n}\n\nTString\nAliMUONPCBPainter::Describe(const AliMUONVTrackerData& data, Int_t dataIndex,\n Double_t, Double_t)\n{\n \n \n if (!data.HasPCB(fDetElemId,fPCBIndex)) return \"\";\n \n Double_t value = data.PCB(fDetElemId,fPCBIndex,dataIndex);\n \n return AliMUONPainterHelper::Instance()->FormatValue(data.DimensionName(dataIndex).Data(),value);\n}\n\nBool_t\nAliMUONPCBPainter::IsIncluded() const\n{\n \n return ( InteractiveReadOutConfig()->PCB(fDetElemId,fPCBIndex) > 0 );\n}\n\nvoid\nAliMUONPCBPainter::PaintArea(const AliMUONVTrackerData& data, Int_t dataIndex,\n Double_t min, Double_t max)\n{\n \n if (!data.HasPCB(fDetElemId,fPCBIndex)) return;\n \n Double_t value = data.PCB(fDetElemId,fPCBIndex,dataIndex);\n \n if ( value >= AliMUONVCalibParam::InvalidFloatValue() ) return;\n \n Int_t color = AliMUONPainterHelper::Instance()->ColorFromValue(value,min,max);\n \n PaintArea(color);\n}\n\n"},"middle":{"kind":"string","value":"h->Local2Global(fDetElemId,\n pcb->X()-slat->GetPositionX(),\n pcb->Y()-slat->GetPositionY(),\n 0.0,\n x,y,z)"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"class AliMpPCB;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpPCBPainter.h","rank":0,"score":278175.9464289656},{"content":"class AliMpSlat;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpSlatPainter.h","rank":1,"score":278174.1546947528},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":2,"score":264430.56506290764},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":3,"score":259277.16579607318},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpPCBPadIterator.h","rank":4,"score":254384.2957201721},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONgraphics/AliMUONPainterHelper.h","rank":5,"score":240368.33029013552},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONgraphics/AliMUONPainterHelper.h","rank":6,"score":240366.83742970304},{"content":"class AliMpPCBPainter : public AliMpVPainter\n\n{\n\npublic:\n\n AliMpPCBPainter(AliMpPCB* pcb);\n\n virtual ~AliMpPCBPainter();\n\n\n\n void Draw(Option_t* option);\n\n\n\n void Paint(Option_t* option);\n\n\n\n TVector2 GetDimensions() const;\n\n TVector2 GetPosition() const;\n\n\n\n private:\n\n /// Not implemented\n\n AliMpPCBPainter(const AliMpPCBPainter& right);\n\n /// Not implemented\n\n AliMpPCBPainter& operator = (const AliMpPCBPainter& right);\n\n\n\n AliMpPCB* fPCB; //!<! PCB to be plotted.\n\n\n\n ClassDef(AliMpPCBPainter,1) // A painter for a PCB of stations 3,4,5\n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONmpgraphics/AliMpPCBPainter.h","rank":7,"score":234720.473310315},{"content":"class AliMpSlatPainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpSlatPainter();\n\n AliMpSlatPainter(const AliMpSlat* slat);\n\n virtual ~AliMpSlatPainter();\n\n\n\n TVector2 GetDimensions() const;\n\n\n\n TVector2 GetPosition() const;\n\n\n\n void Draw(Option_t* option);\n\n\n\n void Paint(Option_t* option);\n\n\n\n private:\n\n /// Not implemented\n\n AliMpSlatPainter(const AliMpSlatPainter& right);\n\n /// Not implemented\n\n AliMpSlatPainter& operator = (const AliMpSlatPainter& right);\n\n\n\n const AliMpSlat* fkSlat; //!<! pointer to the slat to be drawn\n\n\n\n ClassDef(AliMpSlatPainter,1) // A painter for a slat of stations 3,4,5\n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONmpgraphics/AliMpSlatPainter.h","rank":8,"score":234719.34622992607},{"content":"class AliMpSlat;\n\n\n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":9,"score":217650.46522541248},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpSlatPadIterator.h","rank":10,"score":214685.71017554423},{"content":"class AliMpPCB;\n","file_path":"MUON/mapping/data/station345/flipPCB.h","rank":11,"score":202099.47371030317},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONmapping/AliMpTrigger.h","rank":12,"score":202090.20745070712},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpSegmentation.h","rank":13,"score":202088.68602874433},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpTrigger.h","rank":14,"score":202088.68602874433},{"content":"class AliMpPCB : public TObject\n\n{\n\n public:\n\n\n\n AliMpPCB();\n\n /** Ctor. The sizes are given in mm.\n\n See full doc for the meaning of enveloppe parameters.\n\n */\n\n AliMpPCB(AliMpSlatMotifMap* motifMap,\n\n const char* id, Double_t padSizeX, Double_t padSizeY,\n\n Double_t enveloppeSizeX, Double_t enveloppeSizeY);\n\n \n\n AliMpPCB(const char* id, AliMpMotifSpecial* ms);\n\n \n\n AliMpPCB(const AliMpPCB& o);\n\n AliMpPCB& operator=(const AliMpPCB& o);\n\n\n\n virtual ~AliMpPCB();\n\n\n\n TObject* Clone(const char* newname=\"\") const;\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":15,"score":200619.4666104194},{"content":"class AliMpSlat : public TObject\n\n{\n\n public:\n\n\n\n AliMpSlat(TRootIOCtor* ioCtor);\n\n AliMpSlat(const char* id, AliMp::PlaneType bendingOrNonBending);\n\n virtual ~AliMpSlat();\n\n\n\n /// Return x position\n\n Double_t GetPositionX() const { return fPositionX; }\n\n /// Return y position\n\n Double_t GetPositionY() const { return fPositionY; }\n\n \n\n const char* GetName() const;\n\n \n\n const char* GetID() const;\n\n\n\n void Add(const AliMpPCB& pcbType, const TArrayI& manuList);\n\n\n\n Double_t DX() const;\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":16,"score":200617.82309104822},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n// $MpId: AliMpPCBPainter.h,v 1.7 2006/05/24 13:58:13 ivana Exp $\n\n\n\n/// \\ingroup mpgraphics\n\n/// \\class AliMpPCBPainter\n\n/// \\brief Class for drawing a PCB into canvas\n\n///\n\n// Author: Laurent Aphecetche\n\n\n\n#ifndef ALIMPPCBPAINTER_H\n\n#define ALIMPPCBPAINTER_H\n\n\n\n#include \"AliMpVPainter.h\"\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpPCBPainter.h","rank":17,"score":198896.23792636566},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n// $MpId: AliMpSlatPainter.h,v 1.10 2006/05/24 13:58:13 ivana Exp $\n\n\n\n/// \\ingroup mpgraphics\n\n/// \\class AliMpSlatPainter\n\n/// \\brief Class for drawing a slat into canvas\n\n///\n\n// Author: Laurent Aphecetche\n\n\n\n#ifndef ALIMPSLATPAINTER_H\n\n#define ALIMPSLATPAINTER_H\n\n\n\n#ifndef ALI_MP_V_PAINTER_H\n\n# include \"AliMpVPainter.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpSlatPainter.h","rank":18,"score":198896.0965947113},{"content":"class AliMUONContour;\n\n\n","file_path":"MUON/MUONgraphics/AliMUONContourPainter.h","rank":19,"score":198772.36019048808},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONmapping/AliMpTriggerReader.h","rank":20,"score":198743.749472236},{"content":"class AliMpPCB;\n","file_path":"MUON/MUONmapping/AliMpSt345Reader.h","rank":21,"score":198743.749472236},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpTriggerReader.h","rank":22,"score":198742.25661180352},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmapping/AliMpSt345Reader.h","rank":23,"score":198742.25661180352},{"content":"class AliMpSlat;\n","file_path":"MUON/MUONmpgraphics/AliMpDEVisu.h","rank":24,"score":198742.25661180352},{"content":"class AliMpSlatMotifMap;\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":25,"score":195578.84746264954},{"content":"class AliMpSlatSegmentation;\n\n\n","file_path":"MUON/MUONmapping/AliMpPCBPadIterator.h","rank":26,"score":190927.6859698033},{"content":" inline const EntryType &operator[](size_t i) const;\n","file_path":"Vc/include/Vc/common/memorybase.h","rank":27,"score":183995.50074769324},{"content":"class AliMUONContour;\n","file_path":"MUON/MUONgraphics/AliMUONVPainter.h","rank":28,"score":183477.57308309356},{"content":"class AliMUONContour;\n","file_path":"MUON/MUONgraphics/AliMUONPainterHelper.h","rank":29,"score":179863.9628174143},{"content":"class TObjArray;\n","file_path":"MUON/MUONmpgraphics/AliMpIteratorPainter.h","rank":30,"score":179769.8338001894},{"content":"class AliMpSlatMotifMap;\n\n\n\nconst char* NameIt(const TString& baseName);\n\n\n\nAliMpPCB* Duplicate(const AliMpPCB& src, AliMpSlatMotifMap& motifMap);\n\n\n\nvoid flipPCB(const char* srcName);\n\n\n\n#endif","file_path":"MUON/mapping/data/station345/flipPCB.h","rank":31,"score":176457.43699235687},{"content":"class AliMpMotifPainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpMotifPainter();\n\n AliMpMotifPainter(AliMpMotifType* motifType);\n\n AliMpMotifPainter(AliMpMotifPosition *motifPos);\n\n virtual ~AliMpMotifPainter();\n\n \n\n virtual void DumpObject(); //-MENU-\n\n virtual void Paint(Option_t *option);\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n\n\n private:\n\n /// Not implemented\n\n AliMpMotifPainter(const AliMpMotifPainter& right);\n\n /// Not implemented\n\n AliMpMotifPainter& operator = (const AliMpMotifPainter& right);\n\n\n\n void PaintContour(Option_t* option, Bool_t fill);\n\n\n\n AliMpMotifPosition *fMotifPos; ///< the motif to draw\n\n \n\n ClassDef(AliMpMotifPainter,1) // Motif painter\n\n};\n\n#endif //ALI_MP_MOTIF_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpMotifPainter.h","rank":32,"score":163414.7603895825},{"content":"class AliMpRowPainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpRowPainter();\n\n AliMpRowPainter(AliMpRow *row);\n\n virtual ~AliMpRowPainter();\n\n \n\n virtual void DumpObject(); //-MENU-\n\n virtual void Draw(Option_t *option);\n\n virtual void Paint(Option_t *option);\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n\n\n private: \n\n /// Not implemented\n\n AliMpRowPainter(const AliMpRowPainter& right);\n\n /// Not implemented\n\n AliMpRowPainter& operator = (const AliMpRowPainter& right);\n\n\n\n AliMpRow *fRow; ///< the row to paint\n\n \n\n ClassDef(AliMpRowPainter,1) // Row painter\n\n};\n\n#endif //ALI_MP_ROW_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpRowPainter.h","rank":33,"score":163414.7603895825},{"content":"class AliMpSectorPainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpSectorPainter();\n\n AliMpSectorPainter(AliMpSector *sector);\n\n virtual ~AliMpSectorPainter();\n\n \n\n virtual void Draw(Option_t* option);\n\n virtual void Paint(Option_t* /*option*/);\n\n virtual void DumpObject(); // -MENU-\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n\n\n private:\n\n /// Not implemented\n\n AliMpSectorPainter(const AliMpSectorPainter& right);\n\n /// Not implemented\n\n AliMpSectorPainter& operator = (const AliMpSectorPainter& right);\n\n\n\n AliMpSector *fSector; ///< the sector to draw\n\n\n\n ClassDef(AliMpSectorPainter,1) // Sector painter\n\n};\n\n#endif //ALI_MP_SECTOR_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpSectorPainter.h","rank":34,"score":163414.7603895825},{"content":"class AliMpIteratorPainter : public AliMpVPainter\n\n{\n\npublic:\n\n AliMpIteratorPainter(AliMpVPadIterator* it);\n\n virtual ~AliMpIteratorPainter();\n\n \n\n void Draw(Option_t* option);\n\n void Paint(Option_t* option);\n\n \n\n TVector2 GetDimensions() const { return fDimensions; }\n\n TVector2 GetPosition() const { return fPosition; }\n\n\n\nprivate:\n\n /// Not implemented\n\n AliMpIteratorPainter();\n\n /// Not implemented\n\n AliMpIteratorPainter(const AliMpIteratorPainter&);\n\n /// Not implemented\n\n AliMpIteratorPainter& operator=(const AliMpIteratorPainter&);\n\n \n\n TObjArray* fPads; //!<! pads of the iterator\n\n TVector2 fPosition; //!<! position\n\n TVector2 fDimensions; //!<! dimension\n\n \n\n ClassDef(AliMpIteratorPainter,1) // Painter for a group of pads\n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONmpgraphics/AliMpIteratorPainter.h","rank":35,"score":163414.7603895825},{"content":"class AliMpZonePainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpZonePainter();\n\n AliMpZonePainter(AliMpZone *zone);\n\n virtual ~AliMpZonePainter();\n\n \n\n virtual void DumpObject(); //-MENU-\n\n virtual void Draw(Option_t *option);\n\n virtual void Paint(Option_t *option);\n\n // get/set methods\n\n\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n virtual Int_t DistancetoPrimitive(Int_t x, Int_t y);\n\n\n\n private: \n\n /// Not implemented\n\n AliMpZonePainter(const AliMpZonePainter& right);\n\n /// Not implemented\n\n AliMpZonePainter& operator = (const AliMpZonePainter& right);\n\n\n\n AliMpZone *fZone; ///< the zone to draw\n\n\n\n ClassDef(AliMpZonePainter,1) // Zone painter\n\n};\n\n#endif //ALI_MP_ZONE_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpZonePainter.h","rank":36,"score":163414.7603895825},{"content":"class AliMpSubZonePainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpSubZonePainter();\n\n AliMpSubZonePainter(AliMpSubZone *subZone);\n\n virtual ~AliMpSubZonePainter();\n\n \n\n virtual void DumpObject(); //-MENU-\n\n virtual void Draw(Option_t *option);\n\n virtual void Paint(Option_t *option);\n\n // get/set methods\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n virtual Int_t DistancetoPrimitive(Int_t x, Int_t y);\n\n\n\n private: \n\n /// Not implemented\n\n AliMpSubZonePainter(const AliMpSubZonePainter& right);\n\n /// Not implemented\n\n AliMpSubZonePainter& operator = (const AliMpSubZonePainter& right);\n\n\n\n AliMpSubZone *fSubZone; ///< the subzone to draw\n\n\n\n ClassDef(AliMpSubZonePainter,1) // SubZone painter\n\n};\n\n#endif //ALI_MP_SUB_ZONE_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpSubZonePainter.h","rank":37,"score":159259.53618424773},{"content":"class AliMpRowSegmentPainter : public AliMpVPainter\n\n{\n\n public:\n\n AliMpRowSegmentPainter();\n\n AliMpRowSegmentPainter(AliMpVRowSegment *rowSegment);\n\n virtual ~AliMpRowSegmentPainter();\n\n \n\n virtual void DumpObject(); //-MENU-\n\n virtual void Draw(Option_t* option);\n\n virtual void Paint(Option_t* /*option*/);\n\n virtual TVector2 GetPosition() const;\n\n virtual TVector2 GetDimensions() const;\n\n\n\n private: \n\n /// Not implemented\n\n AliMpRowSegmentPainter(const AliMpRowSegmentPainter& right);\n\n /// Not implemented\n\n AliMpRowSegmentPainter& operator = (const AliMpRowSegmentPainter& right);\n\n\n\n AliMpVRowSegment *fRowSegment; ///< the row segment to draw\n\n\n\n ClassDef(AliMpRowSegmentPainter,1) // Row Segment painter\n\n};\n\n#endif //ALI_MP_ROW_SEGMENT_PAINTER_H\n","file_path":"MUON/MUONmpgraphics/AliMpRowSegmentPainter.h","rank":38,"score":159259.53618424773},{"content":"class AliMpSlatSegmentation : public AliMpVSegmentation\n\n{\n\n public:\n\n AliMpSlatSegmentation();\n\n AliMpSlatSegmentation(const AliMpSlat* slat, Bool_t own = false);\n\n virtual ~AliMpSlatSegmentation();\n\n\n\n virtual AliMpVPadIterator* CreateIterator(const AliMpArea& area) const;\n\n virtual AliMpVPadIterator* CreateIterator() const;\n\n\n\n virtual Int_t GetNeighbours(const AliMpPad& pad, TObjArray& neighbours,\n\n Bool_t includeSelf=kFALSE,\n\n Bool_t includeVoid=kFALSE) const;\n\n \n\n const char* GetName() const;\n\n \n\n Int_t MaxPadIndexX() const;\n\n Int_t MaxPadIndexY() const;\n\n Int_t NofPads() const;\n\n \n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":39,"score":152998.86475975215},{"content":"class AliMUONAttPainter : public TObject\n\n{\n\npublic:\n\n \n\n /// Internal status bits\n\n enum EBits {\n\n kIsCathode0 = BIT(14),\n\n kIsCathode1 = BIT(15),\n\n kIsBendingPlane = BIT(16),\n\n kIsNonBendingPlane = BIT(17),\n\n kIsFrontView = BIT(18),\n\n kIsBackView = BIT(19),\n\n kIsCathodeAndPlaneMutuallyExclusive = BIT(20),\n\n kIsValid = BIT(21),\n\n kIsSinglePainter = BIT(22),\n\n kIsCathodeAndPlaneDisabled = BIT(23)\n\n };\n\n \n\n AliMUONAttPainter();\n\n virtual ~AliMUONAttPainter();\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":40,"score":147640.8152421612},{"content":"class AliMUONContourPainter : public TObject\n\n{\n\npublic:\n\n AliMUONContourPainter();\n\n virtual ~AliMUONContourPainter();\n\n \n\n using TObject::Paint;\n\n \n\n static void Paint(const AliMUONContour& contour, \n\n Int_t lineColor=1, Int_t lineStyle=1, \n\n Int_t fillColor=-1, Int_t fillStyle=1001);\n\n\n\n ClassDef(AliMUONContourPainter,1) // \n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONgraphics/AliMUONContourPainter.h","rank":41,"score":147639.21773399287},{"content":"class AliMpVPainter : public TObject\n\n{\n\n public:\n\n AliMpVPainter();\n\n virtual ~AliMpVPainter();\n\n\n\n void DumpObject() const; // *MENU*\n\n /// Paint the associated object\n\n virtual void Paint(Option_t *option)=0;\n\n virtual TObject* Clone(const char* newname=\"\") const;\n\n virtual TObject* DrawClone(Option_t* option) const; // *MENU*\n\n\n\n //\n\n // get methods\n\n //\n\n /// Return the position inside the graphics pad\n\n TVector2 GetPadPosition() const {return fPadPosition;}\n\n /// Return the dimensions inside the graphics pad\n\n TVector2 GetPadDimensions() const {return fPadDimensions;}\n\n /// Return the color\n","file_path":"MUON/MUONmpgraphics/AliMpVPainter.h","rank":42,"score":147602.95086792452},{"content":"class AliMpPCBPadIterator : public AliMpVPadIterator\n\n{\n\npublic:\n\n AliMpPCBPadIterator(const AliMpSlat* slat, const AliMpArea& area);\n\n virtual ~AliMpPCBPadIterator();\n\n \n\n void First();\n\n void Next();\n\n Bool_t IsDone() const;\n\n AliMpPad CurrentItem() const;\n\n void Invalidate();\n\n \n\n void Print(Option_t* opt=\"\") const;\n\n \n\nprivate:\n\n /// Not implemented\n\n AliMpPCBPadIterator(const AliMpPCBPadIterator& right);\n\n /// Not implemented\n\n AliMpPCBPadIterator& operator = (const AliMpPCBPadIterator& right);\n\n \n","file_path":"MUON/MUONmapping/AliMpPCBPadIterator.h","rank":43,"score":146449.2575365213},{"content":"class AliMpSlatPadIterator : public AliMpVPadIterator\n\n{\n\n public:\n\n AliMpSlatPadIterator(); \n\n // Area position must be relative to bottom-left of slat.\n\n AliMpSlatPadIterator(const AliMpSlat* slat, const AliMpArea& area);\n\n virtual ~AliMpSlatPadIterator();\n\n\n\n void First();\n\n void Next();\n\n Bool_t IsDone() const;\n\n AliMpPad CurrentItem() const;\n\n void Invalidate();\n\n \n\n private:\n\n /// Not implemented\n\n AliMpSlatPadIterator(const AliMpSlatPadIterator&);\n\n /// Not implemented\n\n AliMpSlatPadIterator& operator=(const AliMpSlatPadIterator&);\n\n\n","file_path":"MUON/MUONmapping/AliMpSlatPadIterator.h","rank":44,"score":146448.18536621096},{"content":"class AliMpSlatMotifMap : public TObject\n\n{\n\npublic:\n\n AliMpSlatMotifMap();\n\n virtual ~AliMpSlatMotifMap();\n\n \n\n AliMpVMotif* FindMotif(const TString& id) const;\n\n AliMpMotifType* FindMotifType(const TString& id) const;\n\n \n\n Bool_t AddMotif(AliMpVMotif* motif, Bool_t warn=kTRUE);\n\n Bool_t AddMotifType(AliMpMotifType* motifType, Bool_t warn=kTRUE);\n\n \n\n void Print(Option_t* opt=\"\") const;\n\n \n\n void Reset();\n\n \n\nprivate:\n\n /// Not implemented\n\n AliMpSlatMotifMap(const AliMpSlatMotifMap& rhs);\n\n /// Not implemented\n\n AliMpSlatMotifMap& operator=(const AliMpSlatMotifMap& rhs);\n\n\n\n TMap fMotifs; ///< collection of motifs\n\n TMap fMotifTypes; ///< collection of motifTypes\n\n \n\n ClassDef(AliMpSlatMotifMap,3) // Slat motif map \n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONmapping/AliMpSlatMotifMap.h","rank":45,"score":142574.85489019577},{"content":"class AliMpMotifType;\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":46,"score":139937.76517950627},{"content":"class AliMpMotifSpecial;\n\n\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":47,"score":139937.76517950627},{"content":"class AliMpMotifPosition;\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":48,"score":139937.76517950627},{"content":"class AliMpMotifPosition;\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":49,"score":139936.80835428098},{"content":"class AliMpZone;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpZonePainter.h","rank":50,"score":139927.08149978417},{"content":"class AliMpRow;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpRowPainter.h","rank":51,"score":139927.08149978417},{"content":"class AliMpSector;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpSectorPainter.h","rank":52,"score":139927.08149978417},{"content":"class AliMpSectorAreaHPadIterator : public AliMpVPadIterator\n\n{\n\n public:\n\n AliMpSectorAreaHPadIterator(const AliMpSectorSegmentation* segmentation, \n\n const AliMpArea& area);\n\n AliMpSectorAreaHPadIterator(const AliMpSectorAreaHPadIterator& src);\n\n AliMpSectorAreaHPadIterator();\n\n virtual ~AliMpSectorAreaHPadIterator();\n\n\n\n // operators\n\n AliMpSectorAreaHPadIterator& \n\n operator = (const AliMpSectorAreaHPadIterator& right);\n\n\n\n // methods\n\n virtual void First();\n\n virtual void Next();\n\n virtual Bool_t IsDone() const;\n\n virtual AliMpPad CurrentItem() const;\n\n virtual void Invalidate();\n\n\n","file_path":"MUON/MUONmapping/AliMpSectorAreaHPadIterator.h","rank":53,"score":138527.801952308},{"content":"class AliMUONContour;\n\n\n","file_path":"MUON/MUONgraphics/AliMUONContourHandler.h","rank":54,"score":138248.67072114768},{"content":"class AliMUONContour;\n","file_path":"MUON/MUONgraphics/AliMUONContourMaker.h","rank":55,"score":138248.67072114768},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$ \n\n// $MpId: AliMpPCB.h,v 1.9 2006/05/24 13:58:24 ivana Exp $ \n\n\n\n/// \\ingroup slat\n\n/// \\class AliMpPCB\n\n/// \\brief A PCB for station 3,4 or 5\n\n/// \n\n// Author: Laurent Aphecetche\n\n\n\n#ifndef ALIMPPCB_H\n\n#define ALIMPPCB_H\n\n\n\n#ifndef ALI_MP_VPAD_ITERATOR_H\n\n# include \"AliMpVPadIterator.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_AREA_H\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":56,"score":136961.1117391558},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n// $MpId: AliMpSlat.h,v 1.8 2006/05/24 13:58:24 ivana Exp $\n\n\n\n/// \\ingroup slat\n\n/// \\class AliMpSlat\n\n/// \\brief A slat (building block of stations 3, 4 and 5)\n\n/// \n\n// Author: Laurent Aphecetche\n\n\n\n#ifndef ALI_MP_SLAT_H\n\n#define ALI_MP_SLAT_H\n\n\n\n#ifndef ALI_MP_PAD_H\n\n# include \"AliMpPad.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_V_SEGMENTATION_H\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":57,"score":136946.81382128684},{"content":"# include \"AliMpVSegmentation.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_PLANE_TYPE_H\n\n# include \"AliMpPlaneType.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_EX_MAP_H\n\n #include \"AliMpExMap.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TObject\n\n #include <TObject.h>\n\n#endif\n\n\n\n#ifndef ROOT_TString\n\n# include \"TString.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TObjArray\n\n# include \"TObjArray.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":58,"score":136939.16758486282},{"content":" TObjArray fPCBs; ///< array of AliMpPCB*\n\n Double_t fPositionX; ///< x Position of the slat center.\n\n Double_t fPositionY; ///< y Position of the slat center.\n\n Int_t fNofPads; ///< number of pads in this slat\n\n \n\n ClassDef(AliMpSlat,3) // A slat for stations 3,4,5\n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":59,"score":136936.9982032011},{"content":" Double_t DY() const;\n\n\n\n /// Find the PCB containing the pad at location (ix,any iy).\n\n AliMpPCB* FindPCB(Int_t ix) const;\n\n\n\n /// Find the index of the PCB containing the pad at location ix.\n\n Int_t FindPCBIndex(Int_t ix) const;\n\n\n\n /// Find the index of the PCB containing a given manu\n\n Int_t FindPCBIndexByMotifPositionID(Int_t manuId) const;\n\n \n\n /// Find the PCB containing location (x,y).\n\n AliMpPCB* FindPCB(Double_t x, Double_t y) const;\n\n\n\n /// Find the index of the PCB containing the pad at location (x,y).\n\n Int_t FindPCBIndex(Double_t x, Double_t y) const;\n\n\n\n /// Returns the i-th PCB of this slat.\n\n AliMpPCB* GetPCB(Int_t i) const;\n\n\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":60,"score":136935.82903399362},{"content":" TString fId; ///< PCB name\n\n Double_t fPadSizeX; ///< x-size of this PCB's pads (cm)\n\n Double_t fPadSizeY; ///< y-size of this PCB's pads (cm)\n\n Double_t fEnveloppeSizeX; ///< max x-size of this PCB (cm)\n\n Double_t fEnveloppeSizeY; ///< max y-size of this PCB (cm)\n\n Double_t fXoffset; ///< x-offset = x of first pad of this PCB (cm)\n\n Double_t fActiveXmin; ///< min x of an actual pad in this PCB (cm)\n\n Double_t fActiveXmax; ///< max x of an actual pad in this PCB (cm)\n\n Int_t fIxmin; ///< min pad index in x\n\n Int_t fIxmax; ///< max pad index in x\n\n Int_t fIymin; ///< min pad index in y\n\n Int_t fIymax; ///< max pad index in y\n\n TObjArray fMotifPositions; ///< array of motifs\n\n Int_t fNofPads; ///< number of pads in this PCB\n\n AliMpSlatMotifMap* fMotifMap; ///< to keep track of things to avoid duplications of motif and motiftypes, and get proper deletion\n\n \n\n ClassDef(AliMpPCB,3) // A PCB for Stations 3,4,5\n\n};\n\n\n\n#endif \n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":61,"score":136933.68959882858},{"content":" Int_t GetNofPadsX() const;\n\n Int_t GetNofPadsY() const;\n\n\n\n Int_t Ixmin() const;\n\n Int_t Ixmax() const;\n\n \n\n Int_t Iymin() const;\n\n Int_t Iymax() const;\n\n \n\n const char* GetID() const;\n\n \n\n /// Return the number of pads in this PCB \n\n Int_t NofPads() const { return fNofPads; }\n\n \n\n /// Return the motif map\n\n AliMpSlatMotifMap* MotifMap() const { return fMotifMap; }\n\n \n\n void Save() const;\n\n \n\n private:\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":62,"score":136932.09352469502},{"content":" AliMp::PlaneType PlaneType() const { return fPlaneType; }\n\n \n\n /// Return the number of pads in this slat\n\n Int_t NofPads() const { return fNofPads; }\n\n \n\n private:\n\n /// Not implemented\n\n AliMpSlat();\n\n /// Not implemented\n\n AliMpSlat(const AliMpSlat& rhs);\n\n /// Not implemented\n\n AliMpSlat& operator=(const AliMpSlat& rhs);\n\n\n\n TString fId; ///< The name of this slat, e.g. 112233N\n\n AliMp::PlaneType fPlaneType; ///< Whether it's bending or non-bending plane\n\n Double_t fDX; ///< Half-size in X (cm)\n\n Double_t fDY; ///< Half-size in Y (cm)\n\n Int_t fNofPadsX; ///< Actual number of pads in x direction\n\n Int_t fMaxNofPadsY; ///< Maximum number of pads in y direction\n\n mutable AliMpExMap fManuMap; ///< map of int to AliMpMotifPosition*\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":63,"score":136930.91858821752},{"content":"# include \"AliMpArea.h\"\n\n#endif\n\n\n\n\n\n#ifndef ROOT_TObject\n\n# include \"TObject.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TString\n\n# include \"TString.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TArraI\n\n# include \"TArrayI.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TObjArray\n\n# include \"TObjArray.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":64,"score":136929.33605223196},{"content":"\n\n /** Duplicate this PCB. The copy has the manuids of its motifs changed \n\n according to the manuid vector, and its x-offset according to ix \n\n and x.\n\n */ \n\n AliMpPCB* Clone(const TArrayI& manuids,\n\n Int_t ixOffset, Double_t xOffset) const;\n\n\n\n void Copy(TObject& o) const;\n\n\n\n /** Add a motif to this PCB. (ix,iy) are the coordinates of one corner \n\n of the motif, in pad-units. Which corner depends on the sign(s) of (ix,iy):\n\n (ix>0,iy>0) : bottom-left corner\n\n (ix<0,iy>0) : bottom-right corner\n\n (ix<0,iy<0) : top-right corner\n\n (ix>0,iy<0) : top-left corner.\n\n */\n\n void Add(AliMpMotifType* motifType, Int_t ix, Int_t iy);\n\n\n\n AliMpArea Area() const;\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":65,"score":136929.07752813827},{"content":" /// Returns the MotifPosition containing location (x,y).\n\n AliMpMotifPosition* FindMotifPosition(Double_t x, Double_t y) const;\n\n\n\n /// Returns the MotifPosition which id is manuid.\n\n AliMpMotifPosition* FindMotifPosition(Int_t manuid) const;\n\n\n\n /// Returns the MotifPosition containing the pad located at (ix,iy).\n\n AliMpMotifPosition* FindMotifPosition(Int_t ix, Int_t iy) const;\n\n\n\n /// Return the ids of the electronic cards (either manu or local board).\n\n void GetAllMotifPositionsIDs(TArrayI& ecn) const;\n\n \n\n /** Returns the max. number of pads in the x-direction contained in this slat.\n\n This is a max only as for e.g. non-bending slats, the y-dimension depends\n\n on the x-position.\n\n */\n\n Int_t GetMaxNofPadsY() const;\n\n \n\n /** Returns the max index useable in x-direction. \n\n Note that this can be different from GetNofPadsX()-1 for rounded slats.\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":66,"score":136927.34160806995},{"content":" Double_t Ymin() const;\n\n Double_t Ymax() const;\n\n\n\n Double_t PadSizeX() const;\n\n Double_t PadSizeY() const;\n\n\n\n /** Returns the i-th motifPosition of this PCB.\n\n i : [0..GetSize()-1]\n\n */\n\n AliMpMotifPosition* GetMotifPosition(Int_t i) const;\n\n\n\n /// Returns the motifPosition which contains the pad at (ix,iy).\n\n AliMpMotifPosition* FindMotifPosition(Int_t ix, Int_t iy) const;\n\n\n\n /// Returns the motifPosition which contains the pad at (x,y).\n\n AliMpMotifPosition* FindMotifPosition(Double_t x, Double_t y) const;\n\n\n\n /// The number of motifs, aka manus.\n\n Int_t GetSize() const;\n\n\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":67,"score":136926.85235078214},{"content":" */\n\n Int_t GetMaxPadIndexX() const;\n\n \n\n /// Return the number of electronic cards (either manu or local board).\n\n Int_t GetNofElectronicCards() const;\n\n \n\n /// Returns the number of pads in the x-direction contained in this slat.\n\n Int_t GetNofPadsX() const;\n\n \n\n /// Returns the number of PCBs of this slat.\n\n Int_t GetSize() const;\n\n \n\n void Print(Option_t* option=\"\") const;\n\n\n\n /** This is normally only used by triggerSlats, as for ST345 slats,\n\n the position is DX(),DY() simply.\n\n */\n\n void ForcePosition(Double_t x, Double_t y);\n\n \n\n /// Return the plane type\n","file_path":"MUON/MUONmapping/AliMpSlat.h","rank":68,"score":136920.59067273815},{"content":" \n\n void Print(Option_t* option = \"\") const;\n\n\n\n Bool_t HasMotifPositionID(Int_t manuId) const;\n\n \n\n Double_t ActiveDX() const;\n\n Double_t ActiveDY() const;\n\n\n\n Double_t DX() const;\n\n Double_t DY() const;\n\n\n\n Double_t X() const;\n\n Double_t Y() const;\n\n\n\n Double_t Xmin() const;\n\n Double_t Xmax() const;\n\n \n\n Double_t ActiveXmin() const;\n\n Double_t ActiveXmax() const;\n\n\n","file_path":"MUON/MUONmapping/AliMpPCB.h","rank":69,"score":136912.32432057956},{"content":"class AliMUONAttPainter;\n","file_path":"MUON/MUONgraphics/AliMUONPainterHelper.h","rank":70,"score":136776.49714664457},{"content":"class AliMUONContour;\n","file_path":"MUON/MUONgraphics/AliMUONContourMakerTest.h","rank":71,"score":136765.92159605812},{"content":"class AliMUONContour;\n\n\n","file_path":"MUON/MUONgraphics/AliMUONManuContourMaker.h","rank":72,"score":136765.92159605812},{"content":"class AliMpArea;\n","file_path":"MUON/MUONmapping/AliMpPCBPadIterator.h","rank":73,"score":136750.57431952187},{"content":"class AliMpSlatMotifMap;\n","file_path":"MUON/MUONmapping/AliMpSegmentation.h","rank":74,"score":136749.6444467487},{"content":"class AliMpMotifPosition;\n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":75,"score":136749.6444467487},{"content":"class AliMpArea;\n\n\n","file_path":"MUON/MUONmapping/AliMpSlatPadIterator.h","rank":76,"score":136749.6444467487},{"content":"class AliMpMotifType;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpMotifPainter.h","rank":77,"score":136740.1915843809},{"content":"class AliMpVPainter;\n","file_path":"MUON/MUONmpgraphics/AliMpDEVisu.h","rank":78,"score":136740.1915843809},{"content":"class AliMpMotifPosition;\n","file_path":"MUON/MUONmpgraphics/AliMpMotifPainter.h","rank":79,"score":136740.1915843809},{"content":"class AliMUONAttPainterSelectorFrame : public TGHorizontalFrame\n\n{\n\npublic:\n\n AliMUONAttPainterSelectorFrame(TGWindow* p=0x0, UInt_t w=1, UInt_t h=1);\n\n virtual ~AliMUONAttPainterSelectorFrame();\n\n \n\n void Update(const AliMUONAttPainter& att);\n\n \n\n void Clicked(const AliMUONAttPainter* newValues); // *SIGNAL*\n\n \n\n void CathodeClicked(Int_t buttonId);\n\n \n\n void PlaneClicked(Int_t buttonId);\n\n \n\n void ViewClicked(Int_t buttonId);\n\n \n\nprivate:\n\n /// Not implemented\n\n AliMUONAttPainterSelectorFrame(const AliMUONAttPainterSelectorFrame& rhs);\n\n /// Not implemented\n","file_path":"MUON/MUONgraphics/AliMUONAttPainterSelectorFrame.h","rank":80,"score":135652.66005706473},{"content":"class AliMUONAttPainter;\n","file_path":"MUON/MUONgraphics/AliMUONPainterMasterFrame.h","rank":81,"score":133736.5641694888},{"content":"class AliMpSlatMotifMap;\n","file_path":"MUON/MUONmapping/AliMpSt345Reader.h","rank":82,"score":133710.2203582974},{"content":"class AliMpSlatMotifMap;\n","file_path":"MUON/MUONmapping/AliMpTriggerReader.h","rank":83,"score":133710.2203582974},{"content":"class AliMpMotifType;\n","file_path":"MUON/MUONmapping/AliMpSlatMotifMap.h","rank":84,"score":133710.2203582974},{"content":"class AliMpVMotif;\n","file_path":"MUON/MUONmapping/AliMpSlatMotifMap.h","rank":85,"score":133710.2203582974},{"content":"class AliMpSubZone;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpSubZonePainter.h","rank":86,"score":133701.0264749923},{"content":"class AliMpVPadIterator;\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpIteratorPainter.h","rank":87,"score":133701.0264749923},{"content":"#ifndef ALIMUONATTPAINTER_H\n\n#define ALIMUONATTPAINTER_H\n\n\n\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n* See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n\n\n/// \\ingroup graphics\n\n/// \\class AliMUONAttPainter\n\n/// \\brief Basic attributes shared by all painters\n\n/// \n\n// Author Laurent Aphecetche, Subatech\n\n\n\n#ifndef ROOT_TObject\n\n# include \"TObject.h\"\n\n#endif\n\n#ifndef ROOT_TString\n\n# include \"TString.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":88,"score":132627.50440838},{"content":"#ifndef ALIMUONCONTOURPAINTER_H\n\n#define ALIMUONCONTOURPAINTER_H\n\n\n\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n* See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n\n\n/// \\ingroup graphics\n\n/// \\class AliMUONContourPainter\n\n/// \\brief Class to draw AliMUONContour objects\n\n/// \n\n// Author Laurent Aphecetche, Subatech\n\n\n\n#ifndef ROOT_TObject\n\n# include \"TObject.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONgraphics/AliMUONContourPainter.h","rank":89,"score":132616.85633101067},{"content":"\n\n void SetCathodeAndPlaneMutuallyExclusive(Bool_t value);\n\n\n\n void SetValid(Bool_t value);\n\n\n\n void SetCathodeAndPlaneDisabled(Bool_t value);\n\n\n\nprivate:\n\n void SetName();\n\n\n\nprivate:\n\n TString fName; ///< name of the attributes\n\n\n\n ClassDef(AliMUONAttPainter,2) // Basic attributes of painters\n\n};\n\n\n\n#endif\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":90,"score":132603.69774529492},{"content":" /// Whether the painter is to be represented from front (as seen from IP)\n\n Bool_t IsFrontView() const { return TestBit(kIsFrontView); }\n\n \n\n /// Whether the painter is to be represented from back (as seen from IP)\n\n Bool_t IsBackView() const { return TestBit(kIsBackView); }\n\n \n\n\n\n /// Whether we represent attributes of a single painter (if false, means it's a painter group)\n\n Bool_t IsSinglePainter() const { return TestBit(kIsSinglePainter); }\n\n \n\n\n\n void Print(Option_t* opt=\"\") const;\n\n \n\n void SetCathode(Bool_t cath0, Bool_t cath1);\n\n\n\n void SetPlane(Bool_t bending, Bool_t nonBending);\n\n\n\n void SetSingle(Bool_t value);\n\n\n\n void SetViewPoint(Bool_t front, Bool_t back);\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":91,"score":132598.00768188614},{"content":"#ifndef ROOT_TString\n\n#include \"TString.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_V_SEGMENTATION_H\n\n#include \"AliMpVSegmentation.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_PAD_H\n\n#include \"AliMpPad.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":92,"score":132593.2231301429},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n// $MpId: AliMpSlatSegmentation.h,v 1.12 2006/05/24 13:58:24 ivana Exp $\n\n\n\n/// \\ingroup slat\n\n/// \\class AliMpSlatSegmentation\n\n/// \\brief Implementation of AliMpVSegmentation for St345 slats.\n\n/// \n\n/// Note that integer indices start at (0,0) on the bottom-left of the slat,\n\n/// while floating point positions are relative to the center of the slat\n\n/// (where the slat is to be understood as N PCBs of fixed size = 40cm\n\n/// even if not all pads of a given PCBs are actually physically there).\n\n///\n\n/// \\author Laurent Aphecetche\n\n\n\n#ifndef ALI_MP_SLAT_SEGMENTATION_H\n\n#define ALI_MP_SLAT_SEGMENTATION_H\n\n\n","file_path":"MUON/MUONmapping/AliMpSlatSegmentation.h","rank":93,"score":132592.1694276391},{"content":"#ifndef ALIMPITERATORPAINTER_H\n\n#define ALIMPITERATORPAINTER_H\n\n\n\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n* See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n\n\n/// \\ingroup mpgraphics\n\n/// \\class AliMpIteratorPainter\n\n/// \\brief Painter for a group of pads defined by an iterator\n\n/// \n\n// Author Laurent Aphecetche\n\n\n\n#ifndef ALI_MP_V_PAINTER_H\n\n# include \"AliMpVPainter.h\"\n\n#endif\n\n\n\n#ifndef ROOT_TVector2\n\n# include \"TVector2.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpIteratorPainter.h","rank":94,"score":132589.6694322039},{"content":"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n * See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n// $MpId: AliMpVPainter.h,v 1.8 2006/05/24 13:58:13 ivana Exp $\n\n\n\n/// \\ingroup mpgraphics\n\n/// \\class AliMpVPainter\n\n/// \\brief Abstract base class for drawing objects into canvas\n\n///\n\n/// \\author David Guez, IPN Orsay\n\n\n\n#ifndef ALI_MP_V_PAINTER_H\n\n#define ALI_MP_V_PAINTER_H\n\n\n\n#include <TObject.h>\n\n#include <TVector2.h>\n\n\n","file_path":"MUON/MUONmpgraphics/AliMpVPainter.h","rank":95,"score":132589.37607637042},{"content":" \n\n /// Return our name\n\n virtual const char* GetName() const { return fName.Data(); }\n\n \n\n TString CathodeName() const;\n\n \n\n TString ViewPointName() const;\n\n\n\n TString PlaneName() const;\n\n \n\n /// Whether cathode & plane are disabled\n\n Bool_t IsCathodeAndPlaneDisabled() const { return TestBit(kIsCathodeAndPlaneDisabled); }\n\n \n\n /// Whether we are representing bending plane\n\n Bool_t IsBendingPlane() const { return TestBit(kIsBendingPlane); }\n\n \n\n /// Whether we are representing cathode 0\n\n Bool_t IsCathode0() const { return TestBit(kIsCathode0); }\n\n \n\n /// Whether we are representing cathode 1\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":96,"score":132588.2715651534},{"content":" Bool_t IsCathode1() const { return TestBit(kIsCathode1); }\n\n \n\n /// Whether we can select both cathode and plane\n\n Bool_t IsCathodeAndPlaneMutuallyExclusive() const { return TestBit(kIsCathodeAndPlaneMutuallyExclusive); }\n\n \n\n /// Whether we are defined by cathode\n\n Bool_t IsCathodeDefined() const { return IsCathode0() || IsCathode1(); }\n\n \n\n /// Whether we are representing non bending plane\n\n Bool_t IsNonBendingPlane() const { return TestBit(kIsNonBendingPlane); }\n\n \n\n /// Whether we are defined by plane\n\n Bool_t IsPlaneDefined() const { return IsBendingPlane() || IsNonBendingPlane(); }\n\n \n\n /// Whether we are valid\n\n Bool_t IsValid() const { return TestBit(kIsValid); }\n\n \n\n void Invert();\n\n \n\n\n","file_path":"MUON/MUONgraphics/AliMUONAttPainter.h","rank":97,"score":132588.2715651534},{"content":"#ifndef ALIMUONVPAINTER_H\n\n#define ALIMUONVPAINTER_H\n\n\n\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n\n* See cxx source for full Copyright notice */\n\n\n\n// $Id$\n\n\n\n/// \\ingroup graphics\n\n/// \\class AliMUONVPainter\n\n/// \\brief Base class for a graphical object representing some part of the\n\n/// MUON tracking system\n\n/// \n\n// Author Laurent Aphecetche, Subatech\n\n\n\n#ifndef ALIMUONATTPAINTER_H\n\n# include \"AliMUONAttPainter.h\"\n\n#endif\n\n#ifndef ROOT_TQObject\n\n# include <TQObject.h>\n","file_path":"MUON/MUONgraphics/AliMUONVPainter.h","rank":98,"score":45.97334943628283},{"content":"#endif\n\n\n\n#ifndef ROOT_TVector2\n\n# include \"TVector2.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_PLANE_TYPE_H\n\n# include \"AliMpPlaneType.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_CATHOD_TYPE_H\n\n# include \"AliMpCathodType.h\"\n\n#endif\n\n\n\n#ifndef ALIMUONVPAINTER_H\n\n# include \"AliMUONVPainter.h\"\n\n#endif\n\n\n\n#ifndef ALI_MP_PAD_H\n\n# include \"AliMpPad.h\"\n\n#endif\n\n\n","file_path":"MUON/MUONgraphics/AliMUONPainterHelper.h","rank":99,"score":42.619541971163294}],"string":"[\n {\n \"content\": \"class AliMpPCB;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpPCBPainter.h\",\n \"rank\": 0,\n \"score\": 278175.9464289656\n },\n {\n \"content\": \"class AliMpSlat;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSlatPainter.h\",\n \"rank\": 1,\n \"score\": 278174.1546947528\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 2,\n \"score\": 264430.56506290764\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 3,\n \"score\": 259277.16579607318\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCBPadIterator.h\",\n \"rank\": 4,\n \"score\": 254384.2957201721\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterHelper.h\",\n \"rank\": 5,\n \"score\": 240368.33029013552\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterHelper.h\",\n \"rank\": 6,\n \"score\": 240366.83742970304\n },\n {\n \"content\": \"class AliMpPCBPainter : public AliMpVPainter\\n\\n{\\n\\npublic:\\n\\n AliMpPCBPainter(AliMpPCB* pcb);\\n\\n virtual ~AliMpPCBPainter();\\n\\n\\n\\n void Draw(Option_t* option);\\n\\n\\n\\n void Paint(Option_t* option);\\n\\n\\n\\n TVector2 GetDimensions() const;\\n\\n TVector2 GetPosition() const;\\n\\n\\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpPCBPainter(const AliMpPCBPainter& right);\\n\\n /// Not implemented\\n\\n AliMpPCBPainter& operator = (const AliMpPCBPainter& right);\\n\\n\\n\\n AliMpPCB* fPCB; //!<! PCB to be plotted.\\n\\n\\n\\n ClassDef(AliMpPCBPainter,1) // A painter for a PCB of stations 3,4,5\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpPCBPainter.h\",\n \"rank\": 7,\n \"score\": 234720.473310315\n },\n {\n \"content\": \"class AliMpSlatPainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpSlatPainter();\\n\\n AliMpSlatPainter(const AliMpSlat* slat);\\n\\n virtual ~AliMpSlatPainter();\\n\\n\\n\\n TVector2 GetDimensions() const;\\n\\n\\n\\n TVector2 GetPosition() const;\\n\\n\\n\\n void Draw(Option_t* option);\\n\\n\\n\\n void Paint(Option_t* option);\\n\\n\\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpSlatPainter(const AliMpSlatPainter& right);\\n\\n /// Not implemented\\n\\n AliMpSlatPainter& operator = (const AliMpSlatPainter& right);\\n\\n\\n\\n const AliMpSlat* fkSlat; //!<! pointer to the slat to be drawn\\n\\n\\n\\n ClassDef(AliMpSlatPainter,1) // A painter for a slat of stations 3,4,5\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSlatPainter.h\",\n \"rank\": 8,\n \"score\": 234719.34622992607\n },\n {\n \"content\": \"class AliMpSlat;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 9,\n \"score\": 217650.46522541248\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatPadIterator.h\",\n \"rank\": 10,\n \"score\": 214685.71017554423\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/mapping/data/station345/flipPCB.h\",\n \"rank\": 11,\n \"score\": 202099.47371030317\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpTrigger.h\",\n \"rank\": 12,\n \"score\": 202090.20745070712\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSegmentation.h\",\n \"rank\": 13,\n \"score\": 202088.68602874433\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpTrigger.h\",\n \"rank\": 14,\n \"score\": 202088.68602874433\n },\n {\n \"content\": \"class AliMpPCB : public TObject\\n\\n{\\n\\n public:\\n\\n\\n\\n AliMpPCB();\\n\\n /** Ctor. The sizes are given in mm.\\n\\n See full doc for the meaning of enveloppe parameters.\\n\\n */\\n\\n AliMpPCB(AliMpSlatMotifMap* motifMap,\\n\\n const char* id, Double_t padSizeX, Double_t padSizeY,\\n\\n Double_t enveloppeSizeX, Double_t enveloppeSizeY);\\n\\n \\n\\n AliMpPCB(const char* id, AliMpMotifSpecial* ms);\\n\\n \\n\\n AliMpPCB(const AliMpPCB& o);\\n\\n AliMpPCB& operator=(const AliMpPCB& o);\\n\\n\\n\\n virtual ~AliMpPCB();\\n\\n\\n\\n TObject* Clone(const char* newname=\\\"\\\") const;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 15,\n \"score\": 200619.4666104194\n },\n {\n \"content\": \"class AliMpSlat : public TObject\\n\\n{\\n\\n public:\\n\\n\\n\\n AliMpSlat(TRootIOCtor* ioCtor);\\n\\n AliMpSlat(const char* id, AliMp::PlaneType bendingOrNonBending);\\n\\n virtual ~AliMpSlat();\\n\\n\\n\\n /// Return x position\\n\\n Double_t GetPositionX() const { return fPositionX; }\\n\\n /// Return y position\\n\\n Double_t GetPositionY() const { return fPositionY; }\\n\\n \\n\\n const char* GetName() const;\\n\\n \\n\\n const char* GetID() const;\\n\\n\\n\\n void Add(const AliMpPCB& pcbType, const TArrayI& manuList);\\n\\n\\n\\n Double_t DX() const;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 16,\n \"score\": 200617.82309104822\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n// $MpId: AliMpPCBPainter.h,v 1.7 2006/05/24 13:58:13 ivana Exp $\\n\\n\\n\\n/// \\\\ingroup mpgraphics\\n\\n/// \\\\class AliMpPCBPainter\\n\\n/// \\\\brief Class for drawing a PCB into canvas\\n\\n///\\n\\n// Author: Laurent Aphecetche\\n\\n\\n\\n#ifndef ALIMPPCBPAINTER_H\\n\\n#define ALIMPPCBPAINTER_H\\n\\n\\n\\n#include \\\"AliMpVPainter.h\\\"\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpPCBPainter.h\",\n \"rank\": 17,\n \"score\": 198896.23792636566\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n// $MpId: AliMpSlatPainter.h,v 1.10 2006/05/24 13:58:13 ivana Exp $\\n\\n\\n\\n/// \\\\ingroup mpgraphics\\n\\n/// \\\\class AliMpSlatPainter\\n\\n/// \\\\brief Class for drawing a slat into canvas\\n\\n///\\n\\n// Author: Laurent Aphecetche\\n\\n\\n\\n#ifndef ALIMPSLATPAINTER_H\\n\\n#define ALIMPSLATPAINTER_H\\n\\n\\n\\n#ifndef ALI_MP_V_PAINTER_H\\n\\n# include \\\"AliMpVPainter.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSlatPainter.h\",\n \"rank\": 18,\n \"score\": 198896.0965947113\n },\n {\n \"content\": \"class AliMUONContour;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourPainter.h\",\n \"rank\": 19,\n \"score\": 198772.36019048808\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpTriggerReader.h\",\n \"rank\": 20,\n \"score\": 198743.749472236\n },\n {\n \"content\": \"class AliMpPCB;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSt345Reader.h\",\n \"rank\": 21,\n \"score\": 198743.749472236\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpTriggerReader.h\",\n \"rank\": 22,\n \"score\": 198742.25661180352\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSt345Reader.h\",\n \"rank\": 23,\n \"score\": 198742.25661180352\n },\n {\n \"content\": \"class AliMpSlat;\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpDEVisu.h\",\n \"rank\": 24,\n \"score\": 198742.25661180352\n },\n {\n \"content\": \"class AliMpSlatMotifMap;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 25,\n \"score\": 195578.84746264954\n },\n {\n \"content\": \"class AliMpSlatSegmentation;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCBPadIterator.h\",\n \"rank\": 26,\n \"score\": 190927.6859698033\n },\n {\n \"content\": \" inline const EntryType &operator[](size_t i) const;\\n\",\n \"file_path\": \"Vc/include/Vc/common/memorybase.h\",\n \"rank\": 27,\n \"score\": 183995.50074769324\n },\n {\n \"content\": \"class AliMUONContour;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONVPainter.h\",\n \"rank\": 28,\n \"score\": 183477.57308309356\n },\n {\n \"content\": \"class AliMUONContour;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterHelper.h\",\n \"rank\": 29,\n \"score\": 179863.9628174143\n },\n {\n \"content\": \"class TObjArray;\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpIteratorPainter.h\",\n \"rank\": 30,\n \"score\": 179769.8338001894\n },\n {\n \"content\": \"class AliMpSlatMotifMap;\\n\\n\\n\\nconst char* NameIt(const TString& baseName);\\n\\n\\n\\nAliMpPCB* Duplicate(const AliMpPCB& src, AliMpSlatMotifMap& motifMap);\\n\\n\\n\\nvoid flipPCB(const char* srcName);\\n\\n\\n\\n#endif\",\n \"file_path\": \"MUON/mapping/data/station345/flipPCB.h\",\n \"rank\": 31,\n \"score\": 176457.43699235687\n },\n {\n \"content\": \"class AliMpMotifPainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpMotifPainter();\\n\\n AliMpMotifPainter(AliMpMotifType* motifType);\\n\\n AliMpMotifPainter(AliMpMotifPosition *motifPos);\\n\\n virtual ~AliMpMotifPainter();\\n\\n \\n\\n virtual void DumpObject(); //-MENU-\\n\\n virtual void Paint(Option_t *option);\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n\\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpMotifPainter(const AliMpMotifPainter& right);\\n\\n /// Not implemented\\n\\n AliMpMotifPainter& operator = (const AliMpMotifPainter& right);\\n\\n\\n\\n void PaintContour(Option_t* option, Bool_t fill);\\n\\n\\n\\n AliMpMotifPosition *fMotifPos; ///< the motif to draw\\n\\n \\n\\n ClassDef(AliMpMotifPainter,1) // Motif painter\\n\\n};\\n\\n#endif //ALI_MP_MOTIF_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpMotifPainter.h\",\n \"rank\": 32,\n \"score\": 163414.7603895825\n },\n {\n \"content\": \"class AliMpRowPainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpRowPainter();\\n\\n AliMpRowPainter(AliMpRow *row);\\n\\n virtual ~AliMpRowPainter();\\n\\n \\n\\n virtual void DumpObject(); //-MENU-\\n\\n virtual void Draw(Option_t *option);\\n\\n virtual void Paint(Option_t *option);\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n\\n\\n private: \\n\\n /// Not implemented\\n\\n AliMpRowPainter(const AliMpRowPainter& right);\\n\\n /// Not implemented\\n\\n AliMpRowPainter& operator = (const AliMpRowPainter& right);\\n\\n\\n\\n AliMpRow *fRow; ///< the row to paint\\n\\n \\n\\n ClassDef(AliMpRowPainter,1) // Row painter\\n\\n};\\n\\n#endif //ALI_MP_ROW_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpRowPainter.h\",\n \"rank\": 33,\n \"score\": 163414.7603895825\n },\n {\n \"content\": \"class AliMpSectorPainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpSectorPainter();\\n\\n AliMpSectorPainter(AliMpSector *sector);\\n\\n virtual ~AliMpSectorPainter();\\n\\n \\n\\n virtual void Draw(Option_t* option);\\n\\n virtual void Paint(Option_t* /*option*/);\\n\\n virtual void DumpObject(); // -MENU-\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n\\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpSectorPainter(const AliMpSectorPainter& right);\\n\\n /// Not implemented\\n\\n AliMpSectorPainter& operator = (const AliMpSectorPainter& right);\\n\\n\\n\\n AliMpSector *fSector; ///< the sector to draw\\n\\n\\n\\n ClassDef(AliMpSectorPainter,1) // Sector painter\\n\\n};\\n\\n#endif //ALI_MP_SECTOR_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSectorPainter.h\",\n \"rank\": 34,\n \"score\": 163414.7603895825\n },\n {\n \"content\": \"class AliMpIteratorPainter : public AliMpVPainter\\n\\n{\\n\\npublic:\\n\\n AliMpIteratorPainter(AliMpVPadIterator* it);\\n\\n virtual ~AliMpIteratorPainter();\\n\\n \\n\\n void Draw(Option_t* option);\\n\\n void Paint(Option_t* option);\\n\\n \\n\\n TVector2 GetDimensions() const { return fDimensions; }\\n\\n TVector2 GetPosition() const { return fPosition; }\\n\\n\\n\\nprivate:\\n\\n /// Not implemented\\n\\n AliMpIteratorPainter();\\n\\n /// Not implemented\\n\\n AliMpIteratorPainter(const AliMpIteratorPainter&);\\n\\n /// Not implemented\\n\\n AliMpIteratorPainter& operator=(const AliMpIteratorPainter&);\\n\\n \\n\\n TObjArray* fPads; //!<! pads of the iterator\\n\\n TVector2 fPosition; //!<! position\\n\\n TVector2 fDimensions; //!<! dimension\\n\\n \\n\\n ClassDef(AliMpIteratorPainter,1) // Painter for a group of pads\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpIteratorPainter.h\",\n \"rank\": 35,\n \"score\": 163414.7603895825\n },\n {\n \"content\": \"class AliMpZonePainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpZonePainter();\\n\\n AliMpZonePainter(AliMpZone *zone);\\n\\n virtual ~AliMpZonePainter();\\n\\n \\n\\n virtual void DumpObject(); //-MENU-\\n\\n virtual void Draw(Option_t *option);\\n\\n virtual void Paint(Option_t *option);\\n\\n // get/set methods\\n\\n\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n virtual Int_t DistancetoPrimitive(Int_t x, Int_t y);\\n\\n\\n\\n private: \\n\\n /// Not implemented\\n\\n AliMpZonePainter(const AliMpZonePainter& right);\\n\\n /// Not implemented\\n\\n AliMpZonePainter& operator = (const AliMpZonePainter& right);\\n\\n\\n\\n AliMpZone *fZone; ///< the zone to draw\\n\\n\\n\\n ClassDef(AliMpZonePainter,1) // Zone painter\\n\\n};\\n\\n#endif //ALI_MP_ZONE_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpZonePainter.h\",\n \"rank\": 36,\n \"score\": 163414.7603895825\n },\n {\n \"content\": \"class AliMpSubZonePainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpSubZonePainter();\\n\\n AliMpSubZonePainter(AliMpSubZone *subZone);\\n\\n virtual ~AliMpSubZonePainter();\\n\\n \\n\\n virtual void DumpObject(); //-MENU-\\n\\n virtual void Draw(Option_t *option);\\n\\n virtual void Paint(Option_t *option);\\n\\n // get/set methods\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n virtual Int_t DistancetoPrimitive(Int_t x, Int_t y);\\n\\n\\n\\n private: \\n\\n /// Not implemented\\n\\n AliMpSubZonePainter(const AliMpSubZonePainter& right);\\n\\n /// Not implemented\\n\\n AliMpSubZonePainter& operator = (const AliMpSubZonePainter& right);\\n\\n\\n\\n AliMpSubZone *fSubZone; ///< the subzone to draw\\n\\n\\n\\n ClassDef(AliMpSubZonePainter,1) // SubZone painter\\n\\n};\\n\\n#endif //ALI_MP_SUB_ZONE_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSubZonePainter.h\",\n \"rank\": 37,\n \"score\": 159259.53618424773\n },\n {\n \"content\": \"class AliMpRowSegmentPainter : public AliMpVPainter\\n\\n{\\n\\n public:\\n\\n AliMpRowSegmentPainter();\\n\\n AliMpRowSegmentPainter(AliMpVRowSegment *rowSegment);\\n\\n virtual ~AliMpRowSegmentPainter();\\n\\n \\n\\n virtual void DumpObject(); //-MENU-\\n\\n virtual void Draw(Option_t* option);\\n\\n virtual void Paint(Option_t* /*option*/);\\n\\n virtual TVector2 GetPosition() const;\\n\\n virtual TVector2 GetDimensions() const;\\n\\n\\n\\n private: \\n\\n /// Not implemented\\n\\n AliMpRowSegmentPainter(const AliMpRowSegmentPainter& right);\\n\\n /// Not implemented\\n\\n AliMpRowSegmentPainter& operator = (const AliMpRowSegmentPainter& right);\\n\\n\\n\\n AliMpVRowSegment *fRowSegment; ///< the row segment to draw\\n\\n\\n\\n ClassDef(AliMpRowSegmentPainter,1) // Row Segment painter\\n\\n};\\n\\n#endif //ALI_MP_ROW_SEGMENT_PAINTER_H\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpRowSegmentPainter.h\",\n \"rank\": 38,\n \"score\": 159259.53618424773\n },\n {\n \"content\": \"class AliMpSlatSegmentation : public AliMpVSegmentation\\n\\n{\\n\\n public:\\n\\n AliMpSlatSegmentation();\\n\\n AliMpSlatSegmentation(const AliMpSlat* slat, Bool_t own = false);\\n\\n virtual ~AliMpSlatSegmentation();\\n\\n\\n\\n virtual AliMpVPadIterator* CreateIterator(const AliMpArea& area) const;\\n\\n virtual AliMpVPadIterator* CreateIterator() const;\\n\\n\\n\\n virtual Int_t GetNeighbours(const AliMpPad& pad, TObjArray& neighbours,\\n\\n Bool_t includeSelf=kFALSE,\\n\\n Bool_t includeVoid=kFALSE) const;\\n\\n \\n\\n const char* GetName() const;\\n\\n \\n\\n Int_t MaxPadIndexX() const;\\n\\n Int_t MaxPadIndexY() const;\\n\\n Int_t NofPads() const;\\n\\n \\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 39,\n \"score\": 152998.86475975215\n },\n {\n \"content\": \"class AliMUONAttPainter : public TObject\\n\\n{\\n\\npublic:\\n\\n \\n\\n /// Internal status bits\\n\\n enum EBits {\\n\\n kIsCathode0 = BIT(14),\\n\\n kIsCathode1 = BIT(15),\\n\\n kIsBendingPlane = BIT(16),\\n\\n kIsNonBendingPlane = BIT(17),\\n\\n kIsFrontView = BIT(18),\\n\\n kIsBackView = BIT(19),\\n\\n kIsCathodeAndPlaneMutuallyExclusive = BIT(20),\\n\\n kIsValid = BIT(21),\\n\\n kIsSinglePainter = BIT(22),\\n\\n kIsCathodeAndPlaneDisabled = BIT(23)\\n\\n };\\n\\n \\n\\n AliMUONAttPainter();\\n\\n virtual ~AliMUONAttPainter();\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 40,\n \"score\": 147640.8152421612\n },\n {\n \"content\": \"class AliMUONContourPainter : public TObject\\n\\n{\\n\\npublic:\\n\\n AliMUONContourPainter();\\n\\n virtual ~AliMUONContourPainter();\\n\\n \\n\\n using TObject::Paint;\\n\\n \\n\\n static void Paint(const AliMUONContour& contour, \\n\\n Int_t lineColor=1, Int_t lineStyle=1, \\n\\n Int_t fillColor=-1, Int_t fillStyle=1001);\\n\\n\\n\\n ClassDef(AliMUONContourPainter,1) // \\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourPainter.h\",\n \"rank\": 41,\n \"score\": 147639.21773399287\n },\n {\n \"content\": \"class AliMpVPainter : public TObject\\n\\n{\\n\\n public:\\n\\n AliMpVPainter();\\n\\n virtual ~AliMpVPainter();\\n\\n\\n\\n void DumpObject() const; // *MENU*\\n\\n /// Paint the associated object\\n\\n virtual void Paint(Option_t *option)=0;\\n\\n virtual TObject* Clone(const char* newname=\\\"\\\") const;\\n\\n virtual TObject* DrawClone(Option_t* option) const; // *MENU*\\n\\n\\n\\n //\\n\\n // get methods\\n\\n //\\n\\n /// Return the position inside the graphics pad\\n\\n TVector2 GetPadPosition() const {return fPadPosition;}\\n\\n /// Return the dimensions inside the graphics pad\\n\\n TVector2 GetPadDimensions() const {return fPadDimensions;}\\n\\n /// Return the color\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpVPainter.h\",\n \"rank\": 42,\n \"score\": 147602.95086792452\n },\n {\n \"content\": \"class AliMpPCBPadIterator : public AliMpVPadIterator\\n\\n{\\n\\npublic:\\n\\n AliMpPCBPadIterator(const AliMpSlat* slat, const AliMpArea& area);\\n\\n virtual ~AliMpPCBPadIterator();\\n\\n \\n\\n void First();\\n\\n void Next();\\n\\n Bool_t IsDone() const;\\n\\n AliMpPad CurrentItem() const;\\n\\n void Invalidate();\\n\\n \\n\\n void Print(Option_t* opt=\\\"\\\") const;\\n\\n \\n\\nprivate:\\n\\n /// Not implemented\\n\\n AliMpPCBPadIterator(const AliMpPCBPadIterator& right);\\n\\n /// Not implemented\\n\\n AliMpPCBPadIterator& operator = (const AliMpPCBPadIterator& right);\\n\\n \\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCBPadIterator.h\",\n \"rank\": 43,\n \"score\": 146449.2575365213\n },\n {\n \"content\": \"class AliMpSlatPadIterator : public AliMpVPadIterator\\n\\n{\\n\\n public:\\n\\n AliMpSlatPadIterator(); \\n\\n // Area position must be relative to bottom-left of slat.\\n\\n AliMpSlatPadIterator(const AliMpSlat* slat, const AliMpArea& area);\\n\\n virtual ~AliMpSlatPadIterator();\\n\\n\\n\\n void First();\\n\\n void Next();\\n\\n Bool_t IsDone() const;\\n\\n AliMpPad CurrentItem() const;\\n\\n void Invalidate();\\n\\n \\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpSlatPadIterator(const AliMpSlatPadIterator&);\\n\\n /// Not implemented\\n\\n AliMpSlatPadIterator& operator=(const AliMpSlatPadIterator&);\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatPadIterator.h\",\n \"rank\": 44,\n \"score\": 146448.18536621096\n },\n {\n \"content\": \"class AliMpSlatMotifMap : public TObject\\n\\n{\\n\\npublic:\\n\\n AliMpSlatMotifMap();\\n\\n virtual ~AliMpSlatMotifMap();\\n\\n \\n\\n AliMpVMotif* FindMotif(const TString& id) const;\\n\\n AliMpMotifType* FindMotifType(const TString& id) const;\\n\\n \\n\\n Bool_t AddMotif(AliMpVMotif* motif, Bool_t warn=kTRUE);\\n\\n Bool_t AddMotifType(AliMpMotifType* motifType, Bool_t warn=kTRUE);\\n\\n \\n\\n void Print(Option_t* opt=\\\"\\\") const;\\n\\n \\n\\n void Reset();\\n\\n \\n\\nprivate:\\n\\n /// Not implemented\\n\\n AliMpSlatMotifMap(const AliMpSlatMotifMap& rhs);\\n\\n /// Not implemented\\n\\n AliMpSlatMotifMap& operator=(const AliMpSlatMotifMap& rhs);\\n\\n\\n\\n TMap fMotifs; ///< collection of motifs\\n\\n TMap fMotifTypes; ///< collection of motifTypes\\n\\n \\n\\n ClassDef(AliMpSlatMotifMap,3) // Slat motif map \\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatMotifMap.h\",\n \"rank\": 45,\n \"score\": 142574.85489019577\n },\n {\n \"content\": \"class AliMpMotifType;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 46,\n \"score\": 139937.76517950627\n },\n {\n \"content\": \"class AliMpMotifSpecial;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 47,\n \"score\": 139937.76517950627\n },\n {\n \"content\": \"class AliMpMotifPosition;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 48,\n \"score\": 139937.76517950627\n },\n {\n \"content\": \"class AliMpMotifPosition;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 49,\n \"score\": 139936.80835428098\n },\n {\n \"content\": \"class AliMpZone;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpZonePainter.h\",\n \"rank\": 50,\n \"score\": 139927.08149978417\n },\n {\n \"content\": \"class AliMpRow;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpRowPainter.h\",\n \"rank\": 51,\n \"score\": 139927.08149978417\n },\n {\n \"content\": \"class AliMpSector;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSectorPainter.h\",\n \"rank\": 52,\n \"score\": 139927.08149978417\n },\n {\n \"content\": \"class AliMpSectorAreaHPadIterator : public AliMpVPadIterator\\n\\n{\\n\\n public:\\n\\n AliMpSectorAreaHPadIterator(const AliMpSectorSegmentation* segmentation, \\n\\n const AliMpArea& area);\\n\\n AliMpSectorAreaHPadIterator(const AliMpSectorAreaHPadIterator& src);\\n\\n AliMpSectorAreaHPadIterator();\\n\\n virtual ~AliMpSectorAreaHPadIterator();\\n\\n\\n\\n // operators\\n\\n AliMpSectorAreaHPadIterator& \\n\\n operator = (const AliMpSectorAreaHPadIterator& right);\\n\\n\\n\\n // methods\\n\\n virtual void First();\\n\\n virtual void Next();\\n\\n virtual Bool_t IsDone() const;\\n\\n virtual AliMpPad CurrentItem() const;\\n\\n virtual void Invalidate();\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSectorAreaHPadIterator.h\",\n \"rank\": 53,\n \"score\": 138527.801952308\n },\n {\n \"content\": \"class AliMUONContour;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourHandler.h\",\n \"rank\": 54,\n \"score\": 138248.67072114768\n },\n {\n \"content\": \"class AliMUONContour;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourMaker.h\",\n \"rank\": 55,\n \"score\": 138248.67072114768\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$ \\n\\n// $MpId: AliMpPCB.h,v 1.9 2006/05/24 13:58:24 ivana Exp $ \\n\\n\\n\\n/// \\\\ingroup slat\\n\\n/// \\\\class AliMpPCB\\n\\n/// \\\\brief A PCB for station 3,4 or 5\\n\\n/// \\n\\n// Author: Laurent Aphecetche\\n\\n\\n\\n#ifndef ALIMPPCB_H\\n\\n#define ALIMPPCB_H\\n\\n\\n\\n#ifndef ALI_MP_VPAD_ITERATOR_H\\n\\n# include \\\"AliMpVPadIterator.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_AREA_H\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 56,\n \"score\": 136961.1117391558\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n// $MpId: AliMpSlat.h,v 1.8 2006/05/24 13:58:24 ivana Exp $\\n\\n\\n\\n/// \\\\ingroup slat\\n\\n/// \\\\class AliMpSlat\\n\\n/// \\\\brief A slat (building block of stations 3, 4 and 5)\\n\\n/// \\n\\n// Author: Laurent Aphecetche\\n\\n\\n\\n#ifndef ALI_MP_SLAT_H\\n\\n#define ALI_MP_SLAT_H\\n\\n\\n\\n#ifndef ALI_MP_PAD_H\\n\\n# include \\\"AliMpPad.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_V_SEGMENTATION_H\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 57,\n \"score\": 136946.81382128684\n },\n {\n \"content\": \"# include \\\"AliMpVSegmentation.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_PLANE_TYPE_H\\n\\n# include \\\"AliMpPlaneType.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_EX_MAP_H\\n\\n #include \\\"AliMpExMap.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TObject\\n\\n #include <TObject.h>\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TString\\n\\n# include \\\"TString.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TObjArray\\n\\n# include \\\"TObjArray.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 58,\n \"score\": 136939.16758486282\n },\n {\n \"content\": \" TObjArray fPCBs; ///< array of AliMpPCB*\\n\\n Double_t fPositionX; ///< x Position of the slat center.\\n\\n Double_t fPositionY; ///< y Position of the slat center.\\n\\n Int_t fNofPads; ///< number of pads in this slat\\n\\n \\n\\n ClassDef(AliMpSlat,3) // A slat for stations 3,4,5\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 59,\n \"score\": 136936.9982032011\n },\n {\n \"content\": \" Double_t DY() const;\\n\\n\\n\\n /// Find the PCB containing the pad at location (ix,any iy).\\n\\n AliMpPCB* FindPCB(Int_t ix) const;\\n\\n\\n\\n /// Find the index of the PCB containing the pad at location ix.\\n\\n Int_t FindPCBIndex(Int_t ix) const;\\n\\n\\n\\n /// Find the index of the PCB containing a given manu\\n\\n Int_t FindPCBIndexByMotifPositionID(Int_t manuId) const;\\n\\n \\n\\n /// Find the PCB containing location (x,y).\\n\\n AliMpPCB* FindPCB(Double_t x, Double_t y) const;\\n\\n\\n\\n /// Find the index of the PCB containing the pad at location (x,y).\\n\\n Int_t FindPCBIndex(Double_t x, Double_t y) const;\\n\\n\\n\\n /// Returns the i-th PCB of this slat.\\n\\n AliMpPCB* GetPCB(Int_t i) const;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 60,\n \"score\": 136935.82903399362\n },\n {\n \"content\": \" TString fId; ///< PCB name\\n\\n Double_t fPadSizeX; ///< x-size of this PCB's pads (cm)\\n\\n Double_t fPadSizeY; ///< y-size of this PCB's pads (cm)\\n\\n Double_t fEnveloppeSizeX; ///< max x-size of this PCB (cm)\\n\\n Double_t fEnveloppeSizeY; ///< max y-size of this PCB (cm)\\n\\n Double_t fXoffset; ///< x-offset = x of first pad of this PCB (cm)\\n\\n Double_t fActiveXmin; ///< min x of an actual pad in this PCB (cm)\\n\\n Double_t fActiveXmax; ///< max x of an actual pad in this PCB (cm)\\n\\n Int_t fIxmin; ///< min pad index in x\\n\\n Int_t fIxmax; ///< max pad index in x\\n\\n Int_t fIymin; ///< min pad index in y\\n\\n Int_t fIymax; ///< max pad index in y\\n\\n TObjArray fMotifPositions; ///< array of motifs\\n\\n Int_t fNofPads; ///< number of pads in this PCB\\n\\n AliMpSlatMotifMap* fMotifMap; ///< to keep track of things to avoid duplications of motif and motiftypes, and get proper deletion\\n\\n \\n\\n ClassDef(AliMpPCB,3) // A PCB for Stations 3,4,5\\n\\n};\\n\\n\\n\\n#endif \\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 61,\n \"score\": 136933.68959882858\n },\n {\n \"content\": \" Int_t GetNofPadsX() const;\\n\\n Int_t GetNofPadsY() const;\\n\\n\\n\\n Int_t Ixmin() const;\\n\\n Int_t Ixmax() const;\\n\\n \\n\\n Int_t Iymin() const;\\n\\n Int_t Iymax() const;\\n\\n \\n\\n const char* GetID() const;\\n\\n \\n\\n /// Return the number of pads in this PCB \\n\\n Int_t NofPads() const { return fNofPads; }\\n\\n \\n\\n /// Return the motif map\\n\\n AliMpSlatMotifMap* MotifMap() const { return fMotifMap; }\\n\\n \\n\\n void Save() const;\\n\\n \\n\\n private:\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 62,\n \"score\": 136932.09352469502\n },\n {\n \"content\": \" AliMp::PlaneType PlaneType() const { return fPlaneType; }\\n\\n \\n\\n /// Return the number of pads in this slat\\n\\n Int_t NofPads() const { return fNofPads; }\\n\\n \\n\\n private:\\n\\n /// Not implemented\\n\\n AliMpSlat();\\n\\n /// Not implemented\\n\\n AliMpSlat(const AliMpSlat& rhs);\\n\\n /// Not implemented\\n\\n AliMpSlat& operator=(const AliMpSlat& rhs);\\n\\n\\n\\n TString fId; ///< The name of this slat, e.g. 112233N\\n\\n AliMp::PlaneType fPlaneType; ///< Whether it's bending or non-bending plane\\n\\n Double_t fDX; ///< Half-size in X (cm)\\n\\n Double_t fDY; ///< Half-size in Y (cm)\\n\\n Int_t fNofPadsX; ///< Actual number of pads in x direction\\n\\n Int_t fMaxNofPadsY; ///< Maximum number of pads in y direction\\n\\n mutable AliMpExMap fManuMap; ///< map of int to AliMpMotifPosition*\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 63,\n \"score\": 136930.91858821752\n },\n {\n \"content\": \"# include \\\"AliMpArea.h\\\"\\n\\n#endif\\n\\n\\n\\n\\n\\n#ifndef ROOT_TObject\\n\\n# include \\\"TObject.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TString\\n\\n# include \\\"TString.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TArraI\\n\\n# include \\\"TArrayI.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TObjArray\\n\\n# include \\\"TObjArray.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 64,\n \"score\": 136929.33605223196\n },\n {\n \"content\": \"\\n\\n /** Duplicate this PCB. The copy has the manuids of its motifs changed \\n\\n according to the manuid vector, and its x-offset according to ix \\n\\n and x.\\n\\n */ \\n\\n AliMpPCB* Clone(const TArrayI& manuids,\\n\\n Int_t ixOffset, Double_t xOffset) const;\\n\\n\\n\\n void Copy(TObject& o) const;\\n\\n\\n\\n /** Add a motif to this PCB. (ix,iy) are the coordinates of one corner \\n\\n of the motif, in pad-units. Which corner depends on the sign(s) of (ix,iy):\\n\\n (ix>0,iy>0) : bottom-left corner\\n\\n (ix<0,iy>0) : bottom-right corner\\n\\n (ix<0,iy<0) : top-right corner\\n\\n (ix>0,iy<0) : top-left corner.\\n\\n */\\n\\n void Add(AliMpMotifType* motifType, Int_t ix, Int_t iy);\\n\\n\\n\\n AliMpArea Area() const;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 65,\n \"score\": 136929.07752813827\n },\n {\n \"content\": \" /// Returns the MotifPosition containing location (x,y).\\n\\n AliMpMotifPosition* FindMotifPosition(Double_t x, Double_t y) const;\\n\\n\\n\\n /// Returns the MotifPosition which id is manuid.\\n\\n AliMpMotifPosition* FindMotifPosition(Int_t manuid) const;\\n\\n\\n\\n /// Returns the MotifPosition containing the pad located at (ix,iy).\\n\\n AliMpMotifPosition* FindMotifPosition(Int_t ix, Int_t iy) const;\\n\\n\\n\\n /// Return the ids of the electronic cards (either manu or local board).\\n\\n void GetAllMotifPositionsIDs(TArrayI& ecn) const;\\n\\n \\n\\n /** Returns the max. number of pads in the x-direction contained in this slat.\\n\\n This is a max only as for e.g. non-bending slats, the y-dimension depends\\n\\n on the x-position.\\n\\n */\\n\\n Int_t GetMaxNofPadsY() const;\\n\\n \\n\\n /** Returns the max index useable in x-direction. \\n\\n Note that this can be different from GetNofPadsX()-1 for rounded slats.\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 66,\n \"score\": 136927.34160806995\n },\n {\n \"content\": \" Double_t Ymin() const;\\n\\n Double_t Ymax() const;\\n\\n\\n\\n Double_t PadSizeX() const;\\n\\n Double_t PadSizeY() const;\\n\\n\\n\\n /** Returns the i-th motifPosition of this PCB.\\n\\n i : [0..GetSize()-1]\\n\\n */\\n\\n AliMpMotifPosition* GetMotifPosition(Int_t i) const;\\n\\n\\n\\n /// Returns the motifPosition which contains the pad at (ix,iy).\\n\\n AliMpMotifPosition* FindMotifPosition(Int_t ix, Int_t iy) const;\\n\\n\\n\\n /// Returns the motifPosition which contains the pad at (x,y).\\n\\n AliMpMotifPosition* FindMotifPosition(Double_t x, Double_t y) const;\\n\\n\\n\\n /// The number of motifs, aka manus.\\n\\n Int_t GetSize() const;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 67,\n \"score\": 136926.85235078214\n },\n {\n \"content\": \" */\\n\\n Int_t GetMaxPadIndexX() const;\\n\\n \\n\\n /// Return the number of electronic cards (either manu or local board).\\n\\n Int_t GetNofElectronicCards() const;\\n\\n \\n\\n /// Returns the number of pads in the x-direction contained in this slat.\\n\\n Int_t GetNofPadsX() const;\\n\\n \\n\\n /// Returns the number of PCBs of this slat.\\n\\n Int_t GetSize() const;\\n\\n \\n\\n void Print(Option_t* option=\\\"\\\") const;\\n\\n\\n\\n /** This is normally only used by triggerSlats, as for ST345 slats,\\n\\n the position is DX(),DY() simply.\\n\\n */\\n\\n void ForcePosition(Double_t x, Double_t y);\\n\\n \\n\\n /// Return the plane type\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlat.h\",\n \"rank\": 68,\n \"score\": 136920.59067273815\n },\n {\n \"content\": \" \\n\\n void Print(Option_t* option = \\\"\\\") const;\\n\\n\\n\\n Bool_t HasMotifPositionID(Int_t manuId) const;\\n\\n \\n\\n Double_t ActiveDX() const;\\n\\n Double_t ActiveDY() const;\\n\\n\\n\\n Double_t DX() const;\\n\\n Double_t DY() const;\\n\\n\\n\\n Double_t X() const;\\n\\n Double_t Y() const;\\n\\n\\n\\n Double_t Xmin() const;\\n\\n Double_t Xmax() const;\\n\\n \\n\\n Double_t ActiveXmin() const;\\n\\n Double_t ActiveXmax() const;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCB.h\",\n \"rank\": 69,\n \"score\": 136912.32432057956\n },\n {\n \"content\": \"class AliMUONAttPainter;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterHelper.h\",\n \"rank\": 70,\n \"score\": 136776.49714664457\n },\n {\n \"content\": \"class AliMUONContour;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourMakerTest.h\",\n \"rank\": 71,\n \"score\": 136765.92159605812\n },\n {\n \"content\": \"class AliMUONContour;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONManuContourMaker.h\",\n \"rank\": 72,\n \"score\": 136765.92159605812\n },\n {\n \"content\": \"class AliMpArea;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpPCBPadIterator.h\",\n \"rank\": 73,\n \"score\": 136750.57431952187\n },\n {\n \"content\": \"class AliMpSlatMotifMap;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSegmentation.h\",\n \"rank\": 74,\n \"score\": 136749.6444467487\n },\n {\n \"content\": \"class AliMpMotifPosition;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 75,\n \"score\": 136749.6444467487\n },\n {\n \"content\": \"class AliMpArea;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatPadIterator.h\",\n \"rank\": 76,\n \"score\": 136749.6444467487\n },\n {\n \"content\": \"class AliMpMotifType;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpMotifPainter.h\",\n \"rank\": 77,\n \"score\": 136740.1915843809\n },\n {\n \"content\": \"class AliMpVPainter;\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpDEVisu.h\",\n \"rank\": 78,\n \"score\": 136740.1915843809\n },\n {\n \"content\": \"class AliMpMotifPosition;\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpMotifPainter.h\",\n \"rank\": 79,\n \"score\": 136740.1915843809\n },\n {\n \"content\": \"class AliMUONAttPainterSelectorFrame : public TGHorizontalFrame\\n\\n{\\n\\npublic:\\n\\n AliMUONAttPainterSelectorFrame(TGWindow* p=0x0, UInt_t w=1, UInt_t h=1);\\n\\n virtual ~AliMUONAttPainterSelectorFrame();\\n\\n \\n\\n void Update(const AliMUONAttPainter& att);\\n\\n \\n\\n void Clicked(const AliMUONAttPainter* newValues); // *SIGNAL*\\n\\n \\n\\n void CathodeClicked(Int_t buttonId);\\n\\n \\n\\n void PlaneClicked(Int_t buttonId);\\n\\n \\n\\n void ViewClicked(Int_t buttonId);\\n\\n \\n\\nprivate:\\n\\n /// Not implemented\\n\\n AliMUONAttPainterSelectorFrame(const AliMUONAttPainterSelectorFrame& rhs);\\n\\n /// Not implemented\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainterSelectorFrame.h\",\n \"rank\": 80,\n \"score\": 135652.66005706473\n },\n {\n \"content\": \"class AliMUONAttPainter;\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterMasterFrame.h\",\n \"rank\": 81,\n \"score\": 133736.5641694888\n },\n {\n \"content\": \"class AliMpSlatMotifMap;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSt345Reader.h\",\n \"rank\": 82,\n \"score\": 133710.2203582974\n },\n {\n \"content\": \"class AliMpSlatMotifMap;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpTriggerReader.h\",\n \"rank\": 83,\n \"score\": 133710.2203582974\n },\n {\n \"content\": \"class AliMpMotifType;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatMotifMap.h\",\n \"rank\": 84,\n \"score\": 133710.2203582974\n },\n {\n \"content\": \"class AliMpVMotif;\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatMotifMap.h\",\n \"rank\": 85,\n \"score\": 133710.2203582974\n },\n {\n \"content\": \"class AliMpSubZone;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpSubZonePainter.h\",\n \"rank\": 86,\n \"score\": 133701.0264749923\n },\n {\n \"content\": \"class AliMpVPadIterator;\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpIteratorPainter.h\",\n \"rank\": 87,\n \"score\": 133701.0264749923\n },\n {\n \"content\": \"#ifndef ALIMUONATTPAINTER_H\\n\\n#define ALIMUONATTPAINTER_H\\n\\n\\n\\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n* See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n\\n\\n/// \\\\ingroup graphics\\n\\n/// \\\\class AliMUONAttPainter\\n\\n/// \\\\brief Basic attributes shared by all painters\\n\\n/// \\n\\n// Author Laurent Aphecetche, Subatech\\n\\n\\n\\n#ifndef ROOT_TObject\\n\\n# include \\\"TObject.h\\\"\\n\\n#endif\\n\\n#ifndef ROOT_TString\\n\\n# include \\\"TString.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 88,\n \"score\": 132627.50440838\n },\n {\n \"content\": \"#ifndef ALIMUONCONTOURPAINTER_H\\n\\n#define ALIMUONCONTOURPAINTER_H\\n\\n\\n\\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n* See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n\\n\\n/// \\\\ingroup graphics\\n\\n/// \\\\class AliMUONContourPainter\\n\\n/// \\\\brief Class to draw AliMUONContour objects\\n\\n/// \\n\\n// Author Laurent Aphecetche, Subatech\\n\\n\\n\\n#ifndef ROOT_TObject\\n\\n# include \\\"TObject.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONContourPainter.h\",\n \"rank\": 89,\n \"score\": 132616.85633101067\n },\n {\n \"content\": \"\\n\\n void SetCathodeAndPlaneMutuallyExclusive(Bool_t value);\\n\\n\\n\\n void SetValid(Bool_t value);\\n\\n\\n\\n void SetCathodeAndPlaneDisabled(Bool_t value);\\n\\n\\n\\nprivate:\\n\\n void SetName();\\n\\n\\n\\nprivate:\\n\\n TString fName; ///< name of the attributes\\n\\n\\n\\n ClassDef(AliMUONAttPainter,2) // Basic attributes of painters\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 90,\n \"score\": 132603.69774529492\n },\n {\n \"content\": \" /// Whether the painter is to be represented from front (as seen from IP)\\n\\n Bool_t IsFrontView() const { return TestBit(kIsFrontView); }\\n\\n \\n\\n /// Whether the painter is to be represented from back (as seen from IP)\\n\\n Bool_t IsBackView() const { return TestBit(kIsBackView); }\\n\\n \\n\\n\\n\\n /// Whether we represent attributes of a single painter (if false, means it's a painter group)\\n\\n Bool_t IsSinglePainter() const { return TestBit(kIsSinglePainter); }\\n\\n \\n\\n\\n\\n void Print(Option_t* opt=\\\"\\\") const;\\n\\n \\n\\n void SetCathode(Bool_t cath0, Bool_t cath1);\\n\\n\\n\\n void SetPlane(Bool_t bending, Bool_t nonBending);\\n\\n\\n\\n void SetSingle(Bool_t value);\\n\\n\\n\\n void SetViewPoint(Bool_t front, Bool_t back);\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 91,\n \"score\": 132598.00768188614\n },\n {\n \"content\": \"#ifndef ROOT_TString\\n\\n#include \\\"TString.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_V_SEGMENTATION_H\\n\\n#include \\\"AliMpVSegmentation.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_PAD_H\\n\\n#include \\\"AliMpPad.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 92,\n \"score\": 132593.2231301429\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n// $MpId: AliMpSlatSegmentation.h,v 1.12 2006/05/24 13:58:24 ivana Exp $\\n\\n\\n\\n/// \\\\ingroup slat\\n\\n/// \\\\class AliMpSlatSegmentation\\n\\n/// \\\\brief Implementation of AliMpVSegmentation for St345 slats.\\n\\n/// \\n\\n/// Note that integer indices start at (0,0) on the bottom-left of the slat,\\n\\n/// while floating point positions are relative to the center of the slat\\n\\n/// (where the slat is to be understood as N PCBs of fixed size = 40cm\\n\\n/// even if not all pads of a given PCBs are actually physically there).\\n\\n///\\n\\n/// \\\\author Laurent Aphecetche\\n\\n\\n\\n#ifndef ALI_MP_SLAT_SEGMENTATION_H\\n\\n#define ALI_MP_SLAT_SEGMENTATION_H\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmapping/AliMpSlatSegmentation.h\",\n \"rank\": 93,\n \"score\": 132592.1694276391\n },\n {\n \"content\": \"#ifndef ALIMPITERATORPAINTER_H\\n\\n#define ALIMPITERATORPAINTER_H\\n\\n\\n\\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n* See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n\\n\\n/// \\\\ingroup mpgraphics\\n\\n/// \\\\class AliMpIteratorPainter\\n\\n/// \\\\brief Painter for a group of pads defined by an iterator\\n\\n/// \\n\\n// Author Laurent Aphecetche\\n\\n\\n\\n#ifndef ALI_MP_V_PAINTER_H\\n\\n# include \\\"AliMpVPainter.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ROOT_TVector2\\n\\n# include \\\"TVector2.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpIteratorPainter.h\",\n \"rank\": 94,\n \"score\": 132589.6694322039\n },\n {\n \"content\": \"/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n * See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n// $MpId: AliMpVPainter.h,v 1.8 2006/05/24 13:58:13 ivana Exp $\\n\\n\\n\\n/// \\\\ingroup mpgraphics\\n\\n/// \\\\class AliMpVPainter\\n\\n/// \\\\brief Abstract base class for drawing objects into canvas\\n\\n///\\n\\n/// \\\\author David Guez, IPN Orsay\\n\\n\\n\\n#ifndef ALI_MP_V_PAINTER_H\\n\\n#define ALI_MP_V_PAINTER_H\\n\\n\\n\\n#include <TObject.h>\\n\\n#include <TVector2.h>\\n\\n\\n\",\n \"file_path\": \"MUON/MUONmpgraphics/AliMpVPainter.h\",\n \"rank\": 95,\n \"score\": 132589.37607637042\n },\n {\n \"content\": \" \\n\\n /// Return our name\\n\\n virtual const char* GetName() const { return fName.Data(); }\\n\\n \\n\\n TString CathodeName() const;\\n\\n \\n\\n TString ViewPointName() const;\\n\\n\\n\\n TString PlaneName() const;\\n\\n \\n\\n /// Whether cathode & plane are disabled\\n\\n Bool_t IsCathodeAndPlaneDisabled() const { return TestBit(kIsCathodeAndPlaneDisabled); }\\n\\n \\n\\n /// Whether we are representing bending plane\\n\\n Bool_t IsBendingPlane() const { return TestBit(kIsBendingPlane); }\\n\\n \\n\\n /// Whether we are representing cathode 0\\n\\n Bool_t IsCathode0() const { return TestBit(kIsCathode0); }\\n\\n \\n\\n /// Whether we are representing cathode 1\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 96,\n \"score\": 132588.2715651534\n },\n {\n \"content\": \" Bool_t IsCathode1() const { return TestBit(kIsCathode1); }\\n\\n \\n\\n /// Whether we can select both cathode and plane\\n\\n Bool_t IsCathodeAndPlaneMutuallyExclusive() const { return TestBit(kIsCathodeAndPlaneMutuallyExclusive); }\\n\\n \\n\\n /// Whether we are defined by cathode\\n\\n Bool_t IsCathodeDefined() const { return IsCathode0() || IsCathode1(); }\\n\\n \\n\\n /// Whether we are representing non bending plane\\n\\n Bool_t IsNonBendingPlane() const { return TestBit(kIsNonBendingPlane); }\\n\\n \\n\\n /// Whether we are defined by plane\\n\\n Bool_t IsPlaneDefined() const { return IsBendingPlane() || IsNonBendingPlane(); }\\n\\n \\n\\n /// Whether we are valid\\n\\n Bool_t IsValid() const { return TestBit(kIsValid); }\\n\\n \\n\\n void Invert();\\n\\n \\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONAttPainter.h\",\n \"rank\": 97,\n \"score\": 132588.2715651534\n },\n {\n \"content\": \"#ifndef ALIMUONVPAINTER_H\\n\\n#define ALIMUONVPAINTER_H\\n\\n\\n\\n/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\\n\\n* See cxx source for full Copyright notice */\\n\\n\\n\\n// $Id$\\n\\n\\n\\n/// \\\\ingroup graphics\\n\\n/// \\\\class AliMUONVPainter\\n\\n/// \\\\brief Base class for a graphical object representing some part of the\\n\\n/// MUON tracking system\\n\\n/// \\n\\n// Author Laurent Aphecetche, Subatech\\n\\n\\n\\n#ifndef ALIMUONATTPAINTER_H\\n\\n# include \\\"AliMUONAttPainter.h\\\"\\n\\n#endif\\n\\n#ifndef ROOT_TQObject\\n\\n# include <TQObject.h>\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONVPainter.h\",\n \"rank\": 98,\n \"score\": 45.97334943628283\n },\n {\n \"content\": \"#endif\\n\\n\\n\\n#ifndef ROOT_TVector2\\n\\n# include \\\"TVector2.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_PLANE_TYPE_H\\n\\n# include \\\"AliMpPlaneType.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_CATHOD_TYPE_H\\n\\n# include \\\"AliMpCathodType.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALIMUONVPAINTER_H\\n\\n# include \\\"AliMUONVPainter.h\\\"\\n\\n#endif\\n\\n\\n\\n#ifndef ALI_MP_PAD_H\\n\\n# include \\\"AliMpPad.h\\\"\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"MUON/MUONgraphics/AliMUONPainterHelper.h\",\n \"rank\": 99,\n \"score\": 42.619541971163294\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":3,"numItemsPerPage":100,"numTotalItems":13489,"offset":300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTMwNTYzNCwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzkzMDkyMzQsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.aebWLbFGQRIj_B5twmGpjV3Y2AOtS6ferXW6nXanHRmX6wfykwE8pG864Lkq3xZSt6PZ_sGcXRGAuxWBO0m7Cw","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++ | Samples/NiUserSelection/DefaultTrackingInitializer.cpp | Wessi/OpenNI | 613b0a43e66e1e97488624dec285341bc047d6d4 |
#include "DefaultTrackingInitializer.h"
DefaultTrackingInitializer::DefaultTrackingInitializer(xn::UserGenerator *pUserGenerator) :
TrackingInitializer(pUserGenerator),
m_hCalibrationStartCallback(NULL... |
#include "DefaultTrackingInitializer.h"
DefaultTrackingInitializer::DefaultTrackingInitializer(xn::UserGenerator *pUserGenerator) :
TrackingInitializer(pUserGenerator),
m_hCalibrationStartCallback(NULL... |
XnStatus DefaultTrackingInitializer::CalibrationStart(XnUserID )
{
return XN_STATUS_OK;
}
XnStatus DefaultTrackingInitializer::CalibrationComplete(XnUserID nUserId,XnCalibrationStatus eStatus)
{
XnBool retVal=FALSE;
if (eStatus == XN_CALIBRATION_STATUS_OK)
{
if(m_pUserGenerator->GetSk... | if(m_pUserGenerator->GetSkeletonCap().IsTracking(nUserId)==TRUE)
{
XnStatus res=m_pUserGenerator->GetSkeletonCap().StopTracking(nUserId);
return res;
}
return m_pUserGenerator->GetSkeletonCap().AbortCalibration(nUserId);
} | function_block-function_prefix_line | [
{
"content": "XN_C_API XnBool XN_C_DECL xnProfilingIsActive();\n",
"file_path": "Include/XnProfiling.h",
"rank": 0,
"score": 107637.93107806591
},
{
"content": "XN_C_API XnBool XN_C_DECL xnLoggerIsEnabled(XnLogger* pLogger, XnLogSeverity severity);\n",
"file_path": "Include/XnLog.h",
... |
C++ | src/game/scenes/GameScene.cpp | rkolovanov/game-sapper | b59b6a8ac56b5337c880ba26dbabf0200318dd93 | #include "GameScene.h"
#include "../Game.h"
#include "../audio/MusicManager.h"
#include "MainMenuScene.h"
#include <random>
#include <iostream>
Game::Scenes::GameScene::GameScene(Game& game, size_t sizeX, size_t sizeY, size_t minesNumber)
: Scene(game), m_field(sizeX, sizeY) {
this->m_minesNumber = minesNumber;
... | #include "GameScene.h"
#include "../Game.h"
#include "../audio/MusicManager.h"
#include "MainMenuScene.h"
#include <random>
#include <iostream>
Game::Scenes::GameScene::GameScene(Game& game, size_t sizeX, size_t sizeY, size_t minesNumber)
: Scene(game), m_field(sizeX, sizeY) {
this->m_minesNumber = minesNumber;
... | } else {
++markedCells;
}
} else {
++uncheckedCells;
}
}
} catch (const std::invalid_argument&) {
}
}
}
if (markedMines... | if (cell.isChecked) {
return;
}
cell.isChecked = true;
if (cell.nearbyMinesNumber == 0) {
std::vector<std::pair<size_t, size_t>> shifts = {{-1, -1}, {-1, 0}, {-1, 1},
{0, -1}, {0, 1},
... | random | [
{
"content": "#ifndef GAME_SAPPER_SRC_GAME_FIELD_CELL_H\n\n#define GAME_SAPPER_SRC_GAME_FIELD_CELL_H\n\n\n\n#include <cstddef>\n\n\n\n\n\nstruct Cell {\n\n size_t nearbyMinesNumber;\n\n bool isMine;\n\n bool isChecked;\n\n bool isMarked;\n\n};\n\n\n\n\n",
"file_path": "src/game/field/Cell.h",
... |
C++ | include/torquis/split.hpp | devfix/torquis | 5d42ee8e6af332bbfc5aaa2741405e72109e3d14 |
#ifndef TORQUIS_INCLUDE_GUARD
#error "Do not include this file directly, include tho torquis.hpp"
#endif
#ifndef TORQUIS_SPLIT_HPP
#define TORQUIS_SPLIT_HPP
namespace torquis
{
template<typename CharT>
[[nodiscard]] std::vector<std::basic_string_view<CharT>> split(const std::basic_string_view<CharT> str, const ... |
#ifndef TORQUIS_INCLUDE_GUARD
#error "Do not include this file directly, include tho torquis.hpp"
#endif
#ifndef TORQUIS_SPLIT_HPP
#define TORQUIS_SPLIT_HPP
namespace torquis
{
template<typename CharT>
[[nodiscard]] std::vector<std::basic_string_view<CharT>> split(const std::basic_string_view<CharT> str, const ... | ())
{
std::size_t prev = 0, curr;
do
{
curr = str.find(delim, prev);
if (curr == std::string::npos) { parts.push_back(str.substr(prev)); }
else { parts.push_back(str.substr(prev, curr - prev)); }
prev = curr + delim.length();
} while (curr != std::string::npos && prev <= str.length());
}... | d::basic_string_view<CharT>> parts;
std::size_t prev = 0, curr;
do
{
curr = str.find(delim, prev);
if (curr == std::string::npos) { parts.push_back(str.substr(prev)); }
else { parts.push_back(str.substr(prev, curr - prev)); }
prev = curr + 1;
} while (curr != std::string::npos);
return parts;
}
... | random | [
{
"content": "\n\n#define TORQUIS_INCLUDE_GUARD\n\n#include \"torquis/join.hpp\"\n\n#include \"torquis/replace.hpp\"\n\n#include \"torquis/split.hpp\"\n\n#include \"torquis/tolower.hpp\"\n\n#include \"torquis/toupper.hpp\"\n\n#undef TORQUIS_INCLUDE_GUARD\n\n\n\n#endif //TORQUIS_HPP\n",
"file_path": "include... |
C++ | atlas_npu/ascendbase/src/Base/SingleOpProcess/SingleOpProcess.cpp | wangshankun/Tengine_Atlas | b5485039e72b4a624c795ff95d73eb6d719c7706 |
#include "SingleOpProcess.h"
#include "acl/acl.h"
SingleOpProcess::SingleOpProcess()
: inputTensorNum_(0), outputTensorNum_(0), stream_(nullptr), attr_(nullptr), withHandle_(false), opHandle_(nullptr)
{}
SingleOpProcess::SingleOpProcess(const aclrtStream &stream)
: inputTensorNum_(0), outputTensorNum_(0), a... |
#include "SingleOpProcess.h"
#include "acl/acl.h"
SingleOpProcess::SingleOpProcess()
: inputTensorNum_(0), outputTensorNum_(0), stream_(nullptr), attr_(nullptr), withHandle_(false), opHandle_(nullptr)
{}
SingleOpProcess::SingleOpProcess(const aclrtStream &stream)
: inputTensorNum_(0), outputTensorNum_(0), a... | e);
}
return APP_ERR_OK;
}
void SingleOpProcess::SetInputTensorNum(int num)
{
inputTensorNum_ = num;
}
int SingleOpProcess::GetInputTensorNum() const
{
return inputTensorNum_;
}
void SingleOpProcess::SetOutputTensorNum(int num)
{
outputTensorNum_ = num;
}
int SingleOpProcess::GetOutputTensorNum() ... | tream_ = nullptr;
}
void SingleOpProcess::SetTypeName(std::string typeName)
{
typeName_ = typeName;
}
std::string SingleOpProcess::GetTypeName()
{
return typeName_;
}
APP_ERROR SingleOpProcess::SetInputTensor(std::vector<Tensor> tensors)
{
inputTensorDesc_.clear();
for (int i = 0; i < inputTensorNum_; ... | random | [
{
"content": " uint8_t *data = nullptr; // Image data\n",
"file_path": "atlas_npu/ascendbase/src/Base/CommonDataType/CommonDataType.h",
"rank": 0,
"score": 95849.1341938177
},
{
"content": "template<typename T> FLATBUFFERS_CONSTEXPR inline bool IsConst... |
C++ | src/scanner/src/scanner.cpp | zainmehdi/graphslam | 7abb9fd99e03f422e98571b89c6fb03208a7a64f | #include "utils.hpp"
#include "scanner.hpp"
#include <iostream>
int gicp_maximum_iterations;
double gicp_maximum_correspondence_distance, gicp_transformation_epsilon, gicp_euclidean_fitness_epsilon;
int loop_closure_skip;
double fitness_keyframe_threshold, fitness_loop_threshold, distance_threshold, rotation_threshol... | #include "utils.hpp"
#include "scanner.hpp"
#include <iostream>
int gicp_maximum_iterations;
double gicp_maximum_correspondence_distance, gicp_transformation_epsilon, gicp_euclidean_fitness_epsilon;
int loop_closure_skip;
double fitness_keyframe_threshold, fitness_loop_threshold, distance_threshold, rotation_threshol... |
void scanner_callback(const sensor_msgs::LaserScan& input)
{
common::Registration output;
output.first_frame_flag = false;
output.keyframe_flag = false;
output.loop_closure_flag = false;
common::LastKeyframe keyframe_last_request;
bool keyframe_last_request_retu... | if (fitness > fitness_keyframe_threshold)
return true;
if (fabs(Delta.pose.theta) > rotation_threshold)
return true;
if ((Delta.pose.x*Delta.pose.x+Delta.pose.y*Delta.pose.y) > distance_threshold*distance_threshold)
return true;
return false;
} | function_block-function_prefix_line | [
{
"content": "struct Alignement{\n\n bool converged;\n\n float fitness;\n\n pcl::registration::DefaultConvergenceCriteria<float>::ConvergenceState convergence_state;\n\n Eigen::Matrix4f transform;\n\n common::Pose2DWithCovariance Delta;\n\n};\n\n\n\n\n\n/**\n\n * \\brief Creat... |
C++ | Stream.cpp | chrisoldwood/WCL | 608a83f9e41f4c1d2a7ac6991abbcf264d5924e0 |
#include "Common.hpp"
#include "Stream.hpp"
#include <Core/AnsiWide.hpp>
CStream::CStream()
: m_nMode(GENERIC_NONE)
, m_nFormat(0)
, m_nVersion(0)
{
}
CStream::~CStream()
{
}
template<typename CharT>
size_t CStream::ReadLine(std::vector<CharT>& vBuffer)
{
if (!IsEOF())
{
CharT cChar;
do
{
Read(&... |
#include "Common.hpp"
#include "Stream.hpp"
#include <Core/AnsiWide.hpp>
CStream::CStream()
: m_nMode(GENERIC_NONE)
, m_nFormat(0)
, m_nVersion(0)
{
}
CStream::~CStream()
{
}
template<typename CharT>
size_t CStream::ReadLine(std::vector<CharT>& vBuffer)
{
if (!IsEOF())
{
CharT cChar;
do
{
Read(&... |
uint32 CStream::Format() const
{
return m_nFormat;
}
void CStream::SetFormat(uint32 nFormat)
{
m_nFormat = nFormat;
}
uint32 CStream::Version() const
{
return m_nVersion;
}
void CStream::SetVersion(uint32 nVersion)
{
m_nVersion = nVersion;
}
| void CStream::WriteLine(const CString& str, TextFormat eFormat)
{
size_t nChars = str.Length();
if (eFormat == ANSI_TEXT)
{
#ifdef ANSI_BUILD
Write(str.Buffer(), Core::numBytes<char>(nChars));
#else
Write(T2A(str), Core::numBytes<char>(nChars));
#endif
Write("\r\n", Core::numBytes<char>(2));
}
else
{
#i... | function_block-full_function | [
{
"content": "class CString\n\n{\n\npublic:\n\n\t//\n\n\t// Constructors/Destructor.\n\n\t//\n\n\tCString();\n\n\tCString(uint iRscID);\n\n\tCString(const tchar* pszBuffer);\n\n\tCString(const tchar* pszBuffer, size_t iChars);\n\n\tCString(const CString& strSrc);\n\n\t~CString();\n\n\n\n\tvoid BufferSize(size_t... |
C++ | libraries/AD520X/AD520X.cpp | AndreTeixeira1998/Arduino | 16918bada3cf9dfee0f6baa72ee1de87602b84ca |
#include "AD520X.h"
AD520X::AD520X(uint8_t select, uint8_t reset, uint8_t shutdown, uint8_t dataOut, uint8_t clock)
{
_pmCount = 6;
_select = select;
_dataOut = dataOut;
_clock = clock;
_reset = reset;
_shutdown = shutdown;
_hwSPI = (dataOut == 255) && (clock == 255);
}
void AD520X::begin... |
#include "AD520X.h"
AD520X::AD520X(uint8_t select, uint8_t reset, uint8_t shutdown, uint8_t dataOut, uint8_t clock)
{
_pmCount = 6;
_select = select;
_dataOut = dataOut;
_clock = clock;
_reset = reset;
_shutdown = shutdown;
_hwSPI = (dataOut == 255) && (clock == 255);
}
void AD520X::begin... |
#endif
bool AD520X::setValue(uint8_t pm, uint8_t value)
{
if (pm >= _pmCount) return false;
_value[pm] = value;
updateDevice(pm);
return true;
}
void AD520X::setAll(uint8_t value)
{
for (uint8_t pm = 0; pm < _pmCount; pm++)
{
setValue(pm, value);
}
}
uint8_t AD520X::getValue(uint8_t pm)
{
if (p... | void AD520X::setGPIOpins(uint8_t clk, uint8_t miso, uint8_t mosi, uint8_t select)
{
_clock = clk;
_dataOut = mosi;
_select = select;
pinMode(_select, OUTPUT);
digitalWrite(_select, HIGH);
mySPI->end();
mySPI->begin(clk, miso, mosi, select);
} | function_block-function_prefix_line | [
{
"content": "class MS5611_SPI\n\n{\n\npublic:\n\n explicit MS5611_SPI(uint8_t select, uint8_t dataOut = 255, uint8_t dataIn = 255, uint8_t clock = 255);\n\n\n\n bool begin();\n\n\n\n // reset command + get constants\n\n // returns false if ROM constants == 0;\n\n bool reset();\n\n\n\n // the actu... |
C++ | src/particle_subscriber.cpp | tstellanova/particle_subscriber | 175440928aaa8d9d92299787ecac352758171d2c |
#include <Particle.h>
#include <Adafruit_SSD1306_RK.h>
#include <Adafruit_GFX_RK.h>
void evt_doorbell_handler(const char *event, const char *data);
int render_string(String command);
int tone_test(String name);
void blank_screen();
void oneshot_timer_cb();
const uint8_t SCREEN_WIDTH = 128;
const uint8_t SCREEN_HEIG... |
#include <Particle.h>
#include <Adafruit_SSD1306_RK.h>
#include <Adafruit_GFX_RK.h>
void evt_doorbell_handler(const char *event, const char *data);
int render_string(String command);
int tone_test(String name);
void blank_screen();
void oneshot_timer_cb();
const uint8_t SCREEN_WIDTH = 128;
const uint8_t SCREEN_HEIG... |
void loop() {
delay(5000);
Particle.process();
if (g_clear_screen) {
g_clear_screen = false;
blank_screen();
}
}
| T);
Particle.syncTime();
Particle.function("render",render_string);
Particle.function("tone_test",tone_test);
Particle.subscribe("household/frontdoor/bell01", evt_doorbell_handler);
Log.info("My device ID: %s", (const char*)System.deviceID());
Particle.publishVitals(120);
display_s... | function_block-function_prefixed | [] |
C++ | src/Cropper.cpp | stippi/WonderBrush-v3 | 7f88c3e4fbe0bca9ef2df7a92d44789877edfe1e | #include "Cropper.h"
#include <Bitmap.h>
#include <BitmapStream.h>
#include <Directory.h>
#include <File.h>
#include <Rect.h>
#include <TranslationUtils.h>
#include <TranslatorRoster.h>
#include "RenderBuffer.h"
#include "RenderEngine.h"
Cropper::Cropper()
: BApplication("application/x-vnd.yellowbites.Cropper")
, ... | #include "Cropper.h"
#include <Bitmap.h>
#include <BitmapStream.h>
#include <Directory.h>
#include <File.h>
#include <Rect.h>
#include <TranslationUtils.h>
#include <TranslatorRoster.h>
#include "RenderBuffer.h"
#include "RenderEngine.h"
Cropper::Cropper()
: BApplication("application/x-vnd.yellowbites.Cropper")
, ... | roppedRect,
B_BITMAP_NO_SERVER_LINK, B_RGBA32);
status_t ret = resultBitmap->InitCheck();
if (ret != B_OK) {
fprintf(stderr, "Failed to create bitmap: %s\n", strerror(ret));
delete bitmap;
return ret;
}
uint8* src = (uint8*)bitmap->Bits();
uint8* dst = (uint8*)resultBitmap->Bits();
uint32 srcBPR = bitmap... | PrintUsage(true)
, fTargetWidth(-1)
, fTargetHeight(-1)
, fTargetFolder("/boot/home/Desktop")
, fTargetFormat(B_JPEG_FORMAT)
{
}
void
Cropper::MessageReceived(BMessage* message)
{
switch (message->what) {
default:
BApplication::MessageReceived(message);
break;
}
}
void
Cropper::ReadyToRun()
{
if (fPrin... | random | [
{
"content": " class GradientF, \n",
"file_path": "src/agg/include/agg_span_gradient.h",
"rank": 0,
"score": 99143.10744643904
},
{
"content": " class ColorF>\n",
"file_path": "src/agg/include/agg_span_gradient.h",
"rank": 1,
"score": 99143.10744643904
}... |
C++ | kernel/arch/amd64/mp/mp.cpp | griwes/reaveros | 01cc1be330e920d45445db32e44eb4b91491f36c |
#include "mp.h"
#include "../../../memory/vm.h"
#include "../../../scheduler/thread.h"
#include "../../../time/time.h"
#include "../cpu/cpu.h"
#include "../cpu/lapic.h"
#include "../memory/vm.h"
#include <cstddef>
#include <cstdint>
extern "C" std::uint8_t trampoline_start[];
extern "C" std::uint8_t trampoline_end... |
#include "mp.h"
#include "../../../memory/vm.h"
#include "../../../scheduler/thread.h"
#include "../../../time/time.h"
#include "../cpu/cpu.h"
#include "../cpu/lapic.h"
#include "../memory/vm.h"
#include <cstddef>
#include <cstdint>
extern "C" std::uint8_t trampoline_start[];
extern "C" std::uint8_t trampoline_end... | ase_raw) / trampoline_size;
for (std::size_t booted = 0; booted < core_count; booted += boot_at_once)
{
for (std::size_t i = booted; i < booted + boot_at_once && i < core_count; ++i)
{
if (cores[i].apic_id() == cpu::get_current_core()->apic_id())
{
contin... | ipi_type::init, 0);
}
volatile bool timer_triggered = false;
auto handler = +[](volatile bool * flag) { *flag = true; };
using namespace std::literals;
time::get_high_precision_timer().one_shot(10ms, handler, &timer_triggered);
asm volatile("sti");
while (!timer_triggered)
{
... | random | [
{
"content": "/*\n\n * Copyright © 2021 Michał 'Griwes' Dominiak\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/LICEN... |
C++ | fulanghua_ekf_2d/src/pose_estimator.cpp | hoshianaaa/fulanghua_navigation | f6b5f5289c1b27ad45b6db6b6535b01ba4203001 |
#include <fulanghua_ekf_2d/pose_estimator.h>
#include <boost/assign.hpp>
#include <Eigen/LU>
#include <Eigen/Dense>
namespace fulanghua {
double normalize_rad(double th) {
while(th > M_PI) th -= 2 * M_PI;
while(th < -M_PI) th += 2 * M_PI;
return th;
}
PoseEstimator::PoseEstimator(ros::NodeHandle &no... |
#include <fulanghua_ekf_2d/pose_estimator.h>
#include <boost/assign.hpp>
#include <Eigen/LU>
#include <Eigen/Dense>
namespace fulanghua {
double normalize_rad(double th) {
while(th > M_PI) th -= 2 * M_PI;
while(th < -M_PI) th += 2 * M_PI;
return th;
}
PoseEstimator::PoseEstimator(ros::NodeHandle &no... |
}
int main(int argc, char *argv[]) {
ros::init(argc, argv, "pose_estimator");
ros::NodeHandle nh;
fulanghua::PoseEstimator estimator(nh);
estimator.spin();
return 0;
}
| est_pose.pose.covariance = boost::assign::list_of
(cov_xy_th(0)) (0) (0) (0) (0) (0)
(0) (cov_xy_th(1)) (0) (0) (0) (0)
(0) (0) (999999.9) (0) (0) (0)
(0) (0) (0) (999999.9) (0) (0)
(0) (0) (0) (0) (0) (cov_xy_th(2));
pose_pub_.publish(est_pose);
} | function_block-function_prefix_line | [
{
"content": " Eigen::Matrix4d motion_cov_;\n\n Eigen::Matrix4d observation_cov_;\n\n\n\n tf::StampedTransform old_odom_meas_;\n\n tf::Transformer transformer_;\n\n tf::TransformBroadcaster tf_broadcaster_;\n\n \n\n bool publish_odom_topic_;\n\n bool publish_pose_topic_;\n\n double up... |
C++ | drone_controller/src/proportional_rotate.cpp | MikeS96/autonomous_landing_uav | c402bc38119dfc1e9c09746e8376356ddabde07e |
#include <ros/ros.h>
#include <stdio.h>
#include <math.h>
#include "mavros_msgs/PositionTarget.h"
#include "object_detector/States.h"
#include "drone_controller/Error.h"
#define FACTORX 0.0015625 // Vx proportional gain
#define FACTORY 0.0020833 // Vy proportional gain
#define FACTORTH 0.0055 // Theta proporti... |
#include <ros/ros.h>
#include <stdio.h>
#include <math.h>
#include "mavros_msgs/PositionTarget.h"
#include "object_detector/States.h"
#include "drone_controller/Error.h"
#define FACTORX 0.0015625 // Vx proportional gain
#define FACTORY 0.0020833 // Vy proportional gain
#define FACTORTH 0.0055 // Theta proporti... |
void controllerCallBack(const object_detector::States& msg)
{
float ErX = imageW - msg.Xc;
float ErY = imageH - msg.Yc;
float ErTheta = msg.Theta;
drone_controller::Error er;
... | pub = po_nh.advertise<mavros_msgs::PositionTarget>("/mavros/setpoint_raw/local",10) ;
pub1 = po_nh.advertise<drone_controller::Error>("/error",10) ;
sub = po_nh.subscribe("/predicted_states", 10, &Controller::controllerCallBack, this);
lastTime = ros::Time:... | function_block-function_prefix_line | [
{
"content": "class Controller // Controller class\n\n{\n\n private: \n\n //Private class atributes\n\n ros::NodeHandle po_nh;\n\n ros::Subscriber sub;\n\n ros::Publisher pub;\n\n ros::Publisher pub1;\n\n ros::Time lastTime;\n\n float imageW; // Image Width\n\... |
C++ | cppcache/src/ThinClientLocatorHelper.cpp | rhoughton-pivot/geode-native | ab6fe7d996e5ec23832f90663d03f1d66b9f5fbd |
#include "ThinClientLocatorHelper.hpp"
#include <algorithm>
#include <set>
#include <boost/thread/lock_types.hpp>
#include <geode/DataInput.hpp>
#include <geode/DataOutput.hpp>
#include <geode/SystemProperties.hpp>
#include "CacheImpl.hpp"
#include "ClientConnectionRequest.hpp"
#include "ClientConnectionResponse.... |
#include "ThinClientLocatorHelper.hpp"
#include <algorithm>
#include <set>
#include <boost/thread/lock_types.hpp>
#include <geode/DataInput.hpp>
#include <geode/DataOutput.hpp>
#include <geode/SystemProperties.hpp>
#include "CacheImpl.hpp"
#include "ClientConnectionRequest.hpp"
#include "ClientConnectionResponse.... | ;
}
} else {
return std::unique_ptr<Connector>(new TcpConn(
hostname, static_cast<uint16_t>(port), timeout, buffer_size));
}
}
static constexpr int32_t kGossipVersion = 1002;
std::shared_ptr<Serializable> ThinClientLocatorHelper::sendRequest(
const ServerLocation& location,
const std::share... | std::unique_ptr<Connector>(new TcpSslConn(
hostname, static_cast<uint16_t>(port), m_sniProxyHost, m_sniProxyPort,
timeout, buffer_size, sys_prop.sslTrustStore(),
sys_prop.sslKeyStore(), sys_prop.sslKeystorePassword())) | call_expression | [
{
"content": "struct hash<apache::geode::client::ServerLocation> {\n\n typedef apache::geode::client::ServerLocation argument_type;\n\n typedef size_t result_type;\n\n size_t operator()(const apache::geode::client::ServerLocation& val) const {\n\n return val.hashcode();\n\n }\n\n};\n\n\n\n} // namespace... |
C++ | content/renderer/history_controller.cc | kjthegod/chromium | cf940f7f418436b77e15b1ea23e6fa100ca1c91a |
#include "content/renderer/history_controller.h"
#include "content/renderer/render_frame_impl.h"
#include "content/renderer/render_view_impl.h"
#include "third_party/WebKit/public/web/WebLocalFrame.h"
using blink::WebFrame;
using blink::WebHistoryCommitType;
using blink::WebHistoryItem;
using blink::WebURLRequest;
... |
#include "content/renderer/history_controller.h"
#include "content/renderer/render_frame_impl.h"
#include "content/renderer/render_view_impl.h"
#include "third_party/WebKit/public/web/WebLocalFrame.h"
using blink::WebFrame;
using blink::WebHistoryCommitType;
using blink::WebHistoryItem;
using blink::WebURLRequest;
... | new_item.isNull())
return;
if (old_item.isNull() ||
new_item.itemSequenceNumber() != old_item.itemSequenceNumber()) {
if (!old_item.isNull() &&
new_item.documentSequenceNumber() == old_item.documentSequenceNumber())
same_document_loads.push_back(std::make_pair(frame, new_item));
else
... | ) {
}
HistoryController::~HistoryController() {
}
void HistoryController::GoToEntry(scoped_ptr<HistoryEntry> target_entry,
WebURLRequest::CachePolicy cache_policy) {
HistoryFrameLoadVector same_document_loads;
HistoryFrameLoadVector different_document_loads;
provisional_entry_... | random | [] |
C++ | agent/src/beerocks/monitor/beerocks_monitor_main.cpp | ydx-coder/prplMesh | 6401b15c31c563f9e00ce6ff1b5513df3d39f157 |
#include "monitor_thread.h"
#include <bcl/beerocks_logging.h>
#include <bcl/beerocks_os_utils.h>
#include <bcl/beerocks_version.h>
#include <easylogging++.h>
BEEROCKS_INIT_BEEROCKS_VERSION
static bool g_running = true;
static int s_signal = 0;
static std::string monitor_iface;
static beerocks::logging *s_pLogge... |
#include "monitor_thread.h"
#include <bcl/beerocks_logging.h>
#include <bcl/beerocks_os_utils.h>
#include <bcl/beerocks_version.h>
#include <easylogging++.h>
BEEROCKS_INIT_BEEROCKS_VERSION
static bool g_running = true;
static int s_signal = 0;
static std::string monitor_iface;
static beerocks::logging *s_pLogge... |
std::string slave_config_file_path =
"./" + std::string(BEEROCKS_AGENT) + ".conf";
beerocks::config_file::sConfigSlave beerocks_slave_conf;
if (!beerocks::config_file::read_slave_config_file(slave_config_file_path,
beerocks_slave_conf)) ... | if (!parse_arguments(argc, argv)) {
std::cout << "Usage: " << argv[0] << " -i <monitor iface>" << std::endl;
return 0;
} | if_condition | [
{
"content": "struct json_object;\n\nnamespace mapf {\n",
"file_path": "framework/common/include/mapf/common/logger.h",
"rank": 0,
"score": 203256.10839559737
},
{
"content": "class Logger {\n\npublic:\n",
"file_path": "framework/common/include/mapf/common/logger.h",
"rank": 1,
"... |
C++ | LinkedLists/lab2-1.cpp | eva-rubio/Data-Structures-and-Algorithms | 97467f89a9a0dc928fd1f19301067dd565114470 |
#include<iostream>
using namespace std;
struct node
{
int num;
node * next;
};
void print(node * first);
void prependNode(int userNum, node * & first);
void deleteFirst(node * & first);
void findMax(node * & first);
int main()
{
node * first;
node * last;
char more_nodes = '... |
#include<iostream>
using namespace std;
struct node
{
int num;
node * next;
};
void print(node * first);
void prependNode(int userNum, node * & first);
void deleteFirst(node * & first);
void findMax(node * & first);
int main()
{
node * first;
node * last;
char more_nodes = '... |
}
void findMax(node * & first){
int biggest = -1;
while (first != NULL) {
if (biggest < first->num)
biggest = first->num;
first = first->next;
}
cout << "The largest value in the list is: " << biggest << endl;
} | if(first != NULL){
node * temp;
temp = first;
first = first -> next;
delete temp;
print(first);
}else{
cout << "The list is already empty, cant delete anything!";
} | if_condition | [
{
"content": "struct node {\n\n\tint numID;\t\t\t// A single integer field (called numID)\n\n\tstring name;\t\t// A single string field (called name)\n\n\tnode * next;\t\t// A pointer to the next node in the list\n\n};\n\n\n\nvoid print(node * first);\n\nvoid prepend(int userNum, string userName, node * & first... |
C++ | tumor2d/src/matrix.ipp | ICB-DCM/lookahead-study | b9849ce2b0cebbe55d6c9f7a248a5f4dff191007 | #ifndef MATRIX_IPP
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define SINGULAR 1e-16
template <class T>
T **allocMatrix( int n, int m)
{
T **A = (T**) malloc( n*sizeof(T*));
for( int i=0; i<n; i++){
A[i] = (T*) malloc( m*sizeof(T));
for( int j=0; j<m; j++)
A[i][j] = 0.;
}
return A;
}
templa... | #ifndef MATRIX_IPP
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define SINGULAR 1e-16
template <class T>
T **allocMatrix( int n, int m)
{
T **A = (T**) malloc( n*sizeof(T*));
for( int i=0; i<n; i++){
A[i] = (T*) malloc( m*sizeof(T));
for( int j=0; j<m; j++)
A[i][j] = 0.;
}
return A;
}
templa... | %1i-tem Eliminationschritt:\n", s+1);
MatOut (stdout, a, n, 2*n);
#endif
s++;
} while (s < n);
if (fehler) {
fprintf(fout, "Inverse: Matrix ist singulaer\n");
}
}
template <class T>
void solveLinearSystemB( T **A, T *b, T *x, int dim, T **B)
{
int i,
j;
int k;
for( i=0; i<dim; i++){... | o {
Maximum = fabs(a[s][s]);
if (pivot) {
pzeile = s;
for (i = s + 1; i < n; i++)
if (fabs(a[i][s]) > Maximum) {
Maximum = fabs(a[i][s]);
pzeile = i;
}
}
fehler = (Maximum < Epsilon);
if (fehler)
break;
if (pivot) {
if (pzeile != s)
{
double h;
... | random | [
{
"content": "extern SparseMatrix *J;\n",
"file_path": "tumor2d/src/SparseMatrix.h",
"rank": 0,
"score": 140394.67320057453
},
{
"content": "extern float *v1;\n",
"file_path": "tumor2d/src/SparseMatrix.h",
"rank": 1,
"score": 140394.67320057453
},
{
"content": "extern flo... |
C++ | gpAux/extensions/gps3ext/test/s3utils_test.cpp | chrishajas/gpdb | 564b9235a46e2ead1650b753b2d070796cced6f6 | #include "s3utils.cpp"
#include "gtest/gtest.h"
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
TEST(Utils, simplecurl) {
CURL *c = CreateCurlHandler(NULL);
EXPECT_EQ(c, (void *)NULL);
c = CreateCurlHandler("www.google.com");
EXPECT_NE(c, (void *)NULL);
curl_easy_cleanup(c);
}
TEST(Utils, nth)... | #include "s3utils.cpp"
#include "gtest/gtest.h"
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
TEST(Utils, simplecurl) {
CURL *c = CreateCurlHandler(NULL);
EXPECT_EQ(c, (void *)NULL);
c = CreateCurlHandler("www.google.com");
EXPECT_NE(c, (void *)NULL);
curl_easy_cleanup(c);
}
TEST(Utils, nth)... | ");
EXPECT_EQ("This is a & ", str1);
find_replace(str1, "This", "");
EXPECT_EQ(" is a & ", str1);
find_replace(str1, "is a", "abcdefghijklmn");
EXPECT_EQ(" abcdefghijklmn & ", str1);
find_replace(str1, " a", "a");
EXPECT_EQ("abcdefghijklmn & ", str1);
find_replace(str1, "abc", "a... | );
EXPECT_EQ(src4, uri_decode(dst4));
}
TEST(Utils, find_replace) {
string str1 = "This is a simple & short test.";
find_replace(str1, "simple", "");
EXPECT_EQ("This is a & short test.", str1);
find_replace(str1, "short ", "");
EXPECT_EQ("This is a & test.", str1);
find_replace(str1, "... | random | [
{
"content": "SELECT regexp_split_to_array('the quick brown fox jumped over the lazy dog', '');\n",
"file_path": "src/test/regress/sql/strings.sql",
"rank": 0,
"score": 651884.2648369842
},
{
"content": "SELECT regexp_split_to_array('the quick brown fox jumped over the lazy dog', 'nomatch');... |
C++ | toolsrc/src/vcpkg/parse.cpp | TheScarfix/vcpkg | 8db6db5dac70c25b04cd4dd84392484dee822fbe | #include "pch.h"
#include <utility>
#include <vcpkg/base/system.print.h>
#include <vcpkg/base/util.h>
#include <vcpkg/packagespec.h>
#include <vcpkg/paragraphparser.h>
#include <vcpkg/parse.h>
using namespace vcpkg;
namespace vcpkg::Parse
{
std::string ParseError::format() const
{
return Strings::con... | #include "pch.h"
#include <utility>
#include <vcpkg/base/system.print.h>
#include <vcpkg/base/util.h>
#include <vcpkg/packagespec.h>
#include <vcpkg/paragraphparser.h>
#include <vcpkg/parse.h>
using namespace vcpkg;
namespace vcpkg::Parse
{
std::string ParseError::format() const
{
return Strings::con... | _whitespace();
} while (true);
}
ExpectedS<std::vector<std::string>> parse_default_features_list(const std::string& str, CStringView origin)
{
Parse::ParserBase parser;
parser.init(str, origin);
auto opt = parse_list_until_eof<std::string>("default features", parser, &parse_... | ",
line,
"\"\n",
" ",
std::string(column - 1, ' '),
"^\n");
}
void ParserBase::add_error(std::string message, const ParserBase::SourceLoc&... | random | [
{
"content": "namespace vcpkg::Util\n\n{\n\n template<class Container>\n\n using ElementT =\n\n std::remove_reference_t<decltype(*std::declval<typename std::remove_reference_t<Container>::iterator>())>;\n\n\n\n namespace Vectors\n\n {\n\n template<class Container, class T = ElementT<Co... |
C++ | fly/logger/detail/win/styler_proxy_impl.cpp | ExternalRepositories/libfly | 5acfc424a68031c0004b3c1cb5bef9d76dd129fb | #include "fly/logger/detail/win/styler_proxy_impl.hpp"
namespace fly::logger::detail {
StylerProxyImpl::StylerProxyImpl(
std::ostream &stream,
std::stack<fly::logger::Style> &&styles,
std::stack<fly::logger::Color> &&colors,
std::stack<fly::logger::Cursor> &&cursors) noexcept :
StylerProxy(stream)... | #include "fly/logger/detail/win/styler_proxy_impl.hpp"
namespace fly::logger::detail {
StylerProxyImpl::StylerProxyImpl(
std::ostream &stream,
std::stack<fly::logger::Style> &&styles,
std::stack<fly::logger::Color> &&colors,
std::stack<fly::logger::Cursor> &&cursors) noexcept :
StylerProxy(stream)... |
if (m_handle == INVALID_HANDLE_VALUE)
{
return;
}
CONSOLE_SCREEN_BUFFER_INFO console_info;
if (!::GetConsoleScreenBufferInfo(m_handle, &console_info))
{
m_handle = INVALID_HANDLE_VALUE;
return;
}
if (!styles.empty() || !colors.empty())
{
apply_styl... | if (m_stream_is_stdout)
{
m_handle = ::GetStdHandle(STD_OUTPUT_HANDLE);
}
else if (m_stream_is_stderr)
{
m_handle = ::GetStdHandle(STD_ERROR_HANDLE);
} | if_condition | [
{
"content": "struct Color\n\n{\n\n /**\n\n * Constants for standard colors.\n\n *\n\n * On Linux and macOS, a color may be any value in the range [0, 255]. While only the 8 standard\n\n * colors are listed here, any 8-bit integer value may be cast to a color. The color values\n\n * corre... |
C++ | hoomd/dem/DEMEvaluator.cc | schwendp/hoomd-blue | df7970121b19bc4f8674348ab3241055ac87153b |
#ifndef __DEMEVALUATOR_CC__
#define __DEMEVALUATOR_CC__
#include "DEMEvaluator.h"
#include "WCAPotential.h"
#include <assert.h>
template<typename Real>
DEVICE inline Real clip(const Real &x)
{
return (x >= 0)*(x + (x > 1)*(1 - x));
}
template<typename Real, typename Real4, typename Potential> template<... |
#ifndef __DEMEVALUATOR_CC__
#define __DEMEVALUATOR_CC__
#include "DEMEvaluator.h"
#include "WCAPotential.h"
#include <assert.h>
template<typename Real>
DEVICE inline Real clip(const Real &x)
{
return (x >= 0)*(x + (x > 1)*(1 - x));
}
template<typename Real, typename Real4, typename Potential> template<... |
lambda = clip(dot(p11 - p00, r0)/r0sq);
candidateI = p00 + lambda*r0;
candidateJ = p11;
rContact = candidateJ - candidateI;
distsq = dot(rContact, rContact);
if(distsq < closestDistsq)
{
closestI = candidateI;
closestJ = candidateJ;
closestDistsq = distsq;
... | if(distsq < closestDistsq)
{
closestI = candidateI;
closestJ = candidateJ;
closestDistsq = distsq;
} | if_condition | [] |
C++ | src/multi_index_array/kennytm/vtmp.hpp | extragoya/LibNT | 60372bf4e3c5d6665185358c4756da4fe547f093 |
#ifndef VTMP_HPP_KFLYEISDKHB
#define VTMP_HPP_KFLYEISDKHB 1
#include <cstdlib>
#include <type_traits>
#include <utility>
#include <array>
#include "traits.hpp"
namespace utils { namespace vtmp {
template <size_t... ns>
struct integers
{
template <size_t n>
using push_back =... |
#ifndef VTMP_HPP_KFLYEISDKHB
#define VTMP_HPP_KFLYEISDKHB 1
#include <cstdlib>
#include <type_traits>
#include <utility>
#include <array>
#include "traits.hpp"
namespace utils { namespace vtmp {
template <size_t... ns>
struct integers
{
template <size_t n>
using push_back =... |
template <typename F, typename... T>
auto tuple_apply(const std::tuple<T...>& tup, F&& func)
-> decltype(func(std::declval<const T&>()...))
{
vtmp::template iota<sizeof...(T)> instance;
return xx_impl::tuple_funcs<T...>(std::forward<F>(func), xx_impl::no_op_func(),
... | p::template iota<sizeof...(T)> instance;
return xx_impl::tuple_funcs<T...>(std::forward<F>(func), xx_impl::no_op_func(),
instance, std::move(tup));
} | function_block-function_prefixed | [
{
"content": "struct MIANonlinearFuncType<MIA,typename boost::enable_if<internal::is_DenseMIA<typename std::remove_const<MIA>::type>>::type>{\n\n typedef typename std::remove_const<MIA>::type MIA_type;\n\n typedef DenseMIA<typename internal::data_type<MIA_type>::type,internal::order<MIA_type>::value> type... |
C++ | PROX/FOUNDATION/DIKUCL/DIKUCL/include/dikucl_context_manager.hpp | diku-dk/PROX | c6be72cc253ff75589a1cac28e4e91e788376900 | #ifndef DIKUCL_CONTEXT_MANAGER_HPP
#define DIKUCL_CONTEXT_MANAGER_HPP
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#include <dikucl.hpp>
#include <dikucl_device_manager.hpp>
namespace dikucl {
namespace details {
inline void opencl_notify( const char * e... | #ifndef DIKUCL_CONTEXT_MANAGER_HPP
#define DIKUCL_CONTEXT_MANAGER_HPP
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#include <dikucl.hpp>
#include <dikucl_device_manager.hpp>
namespace dikucl {
namespace details {
inline void opencl_notify( const char * e... | ager(ContextManager const&);
void operator=(ContextManager const&);
public:
static ContextManager& get_instance() {
static ContextManager instance;
return instance;
}
ContextHandle* get_context(
cl_int *err = NULL,
De... | operator==(const ContextHandle& ch1, const ContextHandle& ch2) {
return ch1.device_handle == ch2.device_handle;
}
};
class ContextManager {
private:
std::map< DeviceHandle, ContextHandle > contexts;
ContextManager() {
}
ContextMan | random | [
{
"content": "class Context : public detail::Wrapper<cl_context>\n\n{\n\npublic:\n\n Context(\n\n const VECTOR_CLASS<Device>& devices,\n\n cl_context_properties* properties = NULL,\n\n void (CL_CALLBACK * notifyFptr)(\n\n const char *,\n\n const void *,\n\n ... |
C++ | vislib/src/sys/MemoryFile.cpp | xge/megamol | 1e298dd3d8b153d7468ed446f6b2ed3ac49f0d5b |
#include "vislib/sys/MemoryFile.h"
using namespace vislib::sys;
MemoryFile::MemoryFile(void) : File(), accessMode(READ_ONLY), buffer(NULL), bufferLen(0), pos(0), storage(NULL) {}
MemoryFile::~MemoryFile(void) {
this->Close();
}
void MemoryFile::Close(void) {
this->accessMode = READ_ONLY;
this->buffer ... |
#include "vislib/sys/MemoryFile.h"
using namespace vislib::sys;
MemoryFile::MemoryFile(void) : File(), accessMode(READ_ONLY), buffer(NULL), bufferLen(0), pos(0), storage(NULL) {}
MemoryFile::~MemoryFile(void) {
this->Close();
}
void MemoryFile::Close(void) {
this->accessMode = READ_ONLY;
this->buffer ... | ;
this->pos += s;
}
return s;
}
File::FileSize MemoryFile::Seek(const File::FileOffset offset, const File::SeekStartPoint from) {
FileSize np = this->pos;
switch (from) {
case BEGIN:
if (offset >= 0) {
np = offset;
}
break;
case CURRENT:
if (o... | ::memcpy(outBuf,
(this->storage != NULL) ? this->storage->At(static_cast<SIZE_T>(this->pos)) : (this->buffer + this->pos),
static_cast<SIZE_T>(s)) | call_expression | [
{
"content": "class BufferedFile : public File {\n\npublic:\n\n /**\n\n * Answers the default size used when creating new BufferedFile objects\n\n *\n\n * @return size in bytes used when creating new buffers\n\n */\n\n inline static File::FileSize GetDefaultBufferSize(void) {\n\n re... |
C++ | external/include/mapnik/rule.hpp | Wujingli/OpenWebGlobeDataProcessing | 932eaa00c81fc0571122bc618ade010fa255735e |
#ifndef MAPNIK_RULE_HPP
#define MAPNIK_RULE_HPP
#include <mapnik/building_symbolizer.hpp>
#include <mapnik/line_symbolizer.hpp>
#include <mapnik/line_pattern_symbolizer.hpp>
#include <mapnik/polygon_symbolizer.hpp>
#include <mapnik/polygon_pattern_symbolizer.hpp>
#include <mapnik/point_symbolizer.hpp>
#i... |
#ifndef MAPNIK_RULE_HPP
#define MAPNIK_RULE_HPP
#include <mapnik/building_symbolizer.hpp>
#include <mapnik/line_sy | hield_symbolizer.hpp>
#include <mapnik/text_symbolizer.hpp>
#include <mapnik/markers_symbolizer.hpp>
#include <mapnik/debug_symbolizer.hpp>
#include <mapnik/feature.hpp>
#include <mapnik/expression.hpp>
#include <mapnik/expression_string.hpp>
#include <mapnik/config.hpp>
#include <boost/variant/variant_fwd.h... | mbolizer.hpp>
#include <mapnik/line_pattern_symbolizer.hpp>
#include <mapnik/polygon_symbolizer.hpp>
#include <mapnik/polygon_pattern_symbolizer.hpp>
#include <mapnik/point_symbolizer.hpp>
#include <mapnik/raster_symbolizer.hpp>
#include <mapnik/s | random | [] |
C++ | include/ensmallen_bits/problems/logistic_regression_function_impl.hpp | kilasuelika/ensmallen-eigen | d9df7ca4d0e519974d56441c132fb9326da4ea3d |
#ifndef ENSMALLEN_PROBLEMS_LOGISTIC_REGRESSION_FUNCTION_IMPL_HPP
#define ENSMALLEN_PROBLEMS_LOGISTIC_REGRESSION_FUNCTION_IMPL_HPP
#include "logistic_regression_function.hpp"
namespace ens {
namespace test {
template<typename MatType>
LogisticRegressionFunction<MatType>::LogisticRegressionFunction(
MatType& pred... |
#ifndef ENSMALLEN_PROBLEMS_LOGISTIC_REGRESSION_FUNCTION_IMPL_HPP
#define ENSMALLEN_PROBLEMS_LOGISTIC_REGRESSION_FUNCTION_IMPL_HPP
#include "logistic_regression_function.hpp"
namespace ens {
namespace test {
template<typename MatType>
LogisticRegressionFunction<MatType>::LogisticRegressionFunction(
MatType& pred... | ;
return objectiveRegularization - result;
}
template<typename MatType>
template<typename GradType>
typename MatType::Scalar
LogisticRegressionFunction<MatType>::EvaluateWithGradient(
const MatType& parameters,
const size_t begin,
GradType& gradient,
const size_t batchSize) const
{
typedef type... | arma::accu(arma::log(1.0 -
arma::conv_to<arma::Row<ElemType>>::from(responses) + sigmoids %
(2 * arma::conv_to<arma::Row<ElemType>>::from(responses) - 1.0))) | call_expression | [
{
"content": "//! Very, very simple test function which is the composite of three other\n\n//! functions. The gradient is not very steep far away from the optimum, so a\n\n//! larger step size may be required to optimize it in a reasonable number of\n\n//! iterations.\n\nclass GDTestFunction\n\n{\n\n public:\n... |
C++ | snake3d/wyShaderFunctions.cpp | wysaid/snake3d | 54e167c3b1f73a3c9890f8f0e0678ec68e2ffd0c |
#include "wyShaderFunctions.h"
#define GETUNIFORM(uniform, programID, name) \
GLint uniform = glGetUniformLocation(programID, name);\
if(uniform < 0) \
{\
LOG_ERROR("uniform name %s does not exist!\n", name);\
return ;\
}\
ShaderObject::ShaderObject() : m_shaderID(0)
{
m_shaderType = GL_FALSE;
}
ShaderObject::~S... |
#include "wyShaderFunctions.h"
#define GETUNIFORM(uniform, programID, name) \
GLint uniform = glGetUniformLocation(programID, name);\
if(uniform < 0) \
{\
LOG_ERROR("uniform name %s does not exist!\n", name);\
return ;\
}\
ShaderObject::ShaderObject() : m_shaderID(0)
{
m_shaderType = GL_FALSE;
}
ShaderObject::~S... |
LOG_INFO("LINK %d OK\n", m_programID);
htCheckGLError("Link Program");
return true;
}
void ProgramObject::bind()
{
glUseProgram(m_programID);
}
void ProgramObject::sendUniformf(const char* name, GLfloat x)
{
GETUNIFORM(uniform, m_programID, name);
glUniform1f(uniform, x);
}
void ProgramObject::sendUniformf(co... | if(programStatus != GL_TRUE)
{
GLint logLen = 0;
glGetProgramiv(m_programID, GL_INFO_LOG_LENGTH, &logLen);
if(logLen != 0)
{
char *buf = new char[logLen];
if(buf != NULL)
{
glGetProgramInfoLog(m_programID, logLen, &logLen, buf);
LOG_ERROR("Failed to link the program!\n%s", buf);
delete [] ... | if_condition | [
{
"content": "class ProgramObject\n\n{\n\npublic:\n\n\tProgramObject();\n\n\t~ProgramObject();\n\n\n\n\tbool initFragmentShaderSourceFromString(const char* fragShader);\n\n\tbool initVertexShaderSourceFromString(const char* vertShader);\n\n\n\n\tbool link();\n\n\tvoid bind();\n\n\n\n\t// For usage convenience, ... |
C++ | src/lookup/PerfectCount.cc | adigenova/discovarexp-51885 | f827bab9bd0e328fee3dd57b7fefebfeebd92be4 |
#include "Basevector.h"
#include "CoreTools.h"
#include "PackAlign.h"
#include "lookup/LookupTable.h"
#include "lookup/PerfectCount.h"
#include "random/RandomSampleFromStream.h"
void GetBestKmers( const vecbasevector query, const AlignDir direction,
const lookup_table& look, vec<int>& best_pos, vec<unsigned int... |
#include "Basevector.h"
#include "CoreTools.h"
#include "PackAlign.h"
#include "lookup/LookupTable.h"
#include "lookup/PerfectCount.h"
#include "random/RandomSampleFromStream.h"
void GetBestKmers( const vecbasevector query, const AlignDir direction,
const lookup_table& look, vec<int>& best_pos, vec<unsigned int... | void PerfectCountPlaces( const vecbasevector& query, const String& lookup_file,
const AlignDir direction, vec<int>& places )
{
places.resize_and_set( query.size( ), 0 );
if ( query.empty( ) ) return;
lookup_table look(lookup_file);
unsigned int K = look.K( );
... | function_block-full_function | [
{
"content": "/// Orders look aligns by 1) query id, then 2) complete position/structure of the target region(s)\n\n/// the query aligns to: first by target id, then start on target, then end on target, then number\n\n/// of gaps, then starts/ends of all blocks, and finally by number of mismatches.\n\nstruct or... | |
C++ | silo-scripts/myscripts/replay-file-27.cpp | shenweihai1/rolis-eurosys2022 | 59b3fd58144496a9b13415e30b41617b34924323 | #include <iostream>
#include <string>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <fstream>
#include <string.h>
#include <chrono>
#include <vector>
#include <map>
#include <cstring>
#include <algorithm>
#include <stdlib.h>
using namespace std;
std::map<long, std::string> table_map = {};
int... | #include <iostream>
#include <string>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <fstream>
#include <string.h>
#include <chrono>
#include <vector>
#include <map>
#include <cstring>
#include <algorithm>
#include <stdlib.h>
using namespace std;
std::map<long, std::string> table_map = {};
int... | unsigned long number, char* buffer )
{
if( number == 0 )
{
*buffer++ = '0';
}
else
{
char* p_first = buffer;
while( number != 0 )
{
*buffer++ = '0' + number % 10;
number /= 10;
}
... | ;
}
}
else
{
if (val >= 100)
{
if (val >= 1000)
size = 4;
else
size = 3;
}
else
{
if (val>=10)
size = 2;
... | random | [
{
"content": "struct RemoveConstFromKey<std::pair<const K, V> > {\n\n typedef std::pair<K, V> type;\n\n};\n\n\n\n// Mapping from booleans to types. Similar to boost::bool_<kValue> and\n\n// std::integral_constant<bool, kValue>.\n\ntemplate <bool kValue>\n",
"file_path": "third-party/paxos/dependencies/yaml... |
C++ | stereo_egomotion/base/evaluator.cc | bartn8/stereo-vision | 1180045fe560478e5c441e75202cc899fe90ec3d | #include "evaluator.h"
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <tuple>
#include <limits>
#include <algorithm>
#include <iomanip>
#include <dirent.h>
#include <sys/stat.h>
namespace egomotion {
typedef std::tuple<std::string,double,double> ResultTuple;
using namespace st... | #include "evaluator.h"
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <tuple>
#include <limits>
#include <algorithm>
#include <iomanip>
#include <dirent.h>
#include <sys/stat.h>
namespace egomotion {
typedef std::tuple<std::string,double,double> ResultTuple;
using namespace st... |
void Evaluator::Eval(const std::string& gt_fname, const std::vector<Eigen::Matrix4d>& egomotion_poses,
double& trans_error, double& rot_error) {
std::vector<libviso::Matrix> libviso_poses;
EigenVectorToLibvisoVector(egomotion_poses, libviso_poses);
Eval(gt_fname, libviso_poses, trans_error, rot_error)... | void Evaluator::EigenVectorToLibvisoVector(const std::vector<Eigen::Matrix4d>& vec1,
std::vector<libviso::Matrix>& vec2) {
vec2.clear();
for (const auto& rt : vec1)
vec2.push_back(EigenMatrixToLibvisoMatrix(rt));
} | function_block-full_function | [
{
"content": "struct greaterThanPtr : public std::binary_function<const float*, const float*, bool>\n\n{\n\n bool operator () (const float* a, const float* b) const\n\n { return *a > *b; }\n\n};\n\n\n\n}\n\n\n\nnamespace track {\n\n\n\nFeatureDetectorHarrisCV::FeatureDetectorHarrisCV(int block_size, int k... |
C++ | Source/Tools/Game/zmq/src/tcp_listener.cpp | 299299/tesla_hmi | d5f2ad158d1b69d46d7fc99898ec90e19f1ae419 |
#include "precompiled.hpp"
#include <new>
#include <string>
#include <stdio.h>
#include "tcp_listener.hpp"
#include "io_thread.hpp"
#include "config.hpp"
#include "err.hpp"
#include "ip.hpp"
#include "tcp.hpp"
#include "socket_base.hpp"
#include "address.hpp"
#ifndef ZMQ_HAVE_WINDOWS
#include <unistd.h>
#include <... |
#include "precompiled.hpp"
#include <new>
#include <string>
#include <stdio.h>
#include "tcp_listener.hpp"
#include "io_thread.hpp"
#include "config.hpp"
#include "err.hpp"
#include "ip.hpp"
#include "tcp.hpp"
#include "socket_base.hpp"
#include "address.hpp"
#ifndef ZMQ_HAVE_WINDOWS
#include <unistd.h>
#include <... | _socket->event_accept_failed (
make_unconnected_bind_endpoint_pair (_endpoint), zmq_errno ());
return;
}
create_engine (fd);
}
std::string
zmq::tcp_listener_t::get_socket_name (zmq::fd_t fd_,
socket_end_t socket_end_) const
{
return zmq::get_... | io_thread_t *io_thread_,
socket_base_t *socket_,
const options_t &options_) :
stream_listener_base_t (io_thread_, socket_, options_)
{
}
void zmq::tcp_listener_t::in_event ()
{
fd_t fd = accept ();
if (fd == retired_fd) {
... | random | [
{
"content": " FT_Byte* string; /* this string is *not* null-terminated! */\n",
"file_path": "Source/ThirdParty/FreeType/include/freetype/ftsnames.h",
"rank": 0,
"score": 203889.44645226406
},
{
"content": " FT_Byte* string;\n",
"file_path": "Source/ThirdParty/FreeType/inclu... |
C++ | framework/frontend/fsa/fsa_transition.hpp | aamshukov/frontend | 6be5fea43b7776691034f3b4f56d318d7cdf18f8 |
#ifndef __FSA_TRANSITION_H__
#define __FSA_TRANSITION_H__
#pragma once
BEGIN_NAMESPACE(frontend)
USINGNAMESPACE(core)
#define MAX_TRANSITION_RANK (5)
class fsa_transition
{
public:
using datum_type = text::datum_type;
using predicate_type = string_type;
using predicat... |
#ifndef __FSA_TRANSITION_H__
#define __FSA_TRANSITION_H__
#pragma once
BEGIN_NAMESPACE(frontend)
USINGNAMESPACE(core)
#define MAX_TRANSITION_RANK (5)
class fsa_transition
{
public:
using datum_type = text::datum_type;
using predicate_type = string_type;
using predicat... |
public:
fsa_transition();
fsa_transition(uint32_t s... | my_predicate;
datum_type my_switch_predicate;
int16_t my_rank;
| random | [
{
"content": "class string_data_provider : public data_provider, private noncopyable\n\n{\n\n public:\n\n using datum_type = data_provider::datum_type;\n\n\n\n private:\n\n string_type my_data_content;\n\n\n\n public:\n\n string_data_provider(const strin... |
C++ | spline_planner/src/eigen_spline.cpp | Veilkrand/drone_race | 7391f1a94bfe354aab3e24be61b76e1595481ad9 | #include <boost/python.hpp>
#include <boost/assert.hpp>
#include <vector>
#include <Eigen/Dense>
#include "eigen_spline.hpp"
using namespace spline_planner;
namespace py = boost::python;
py::list ColumnMajorMatrixToRowMajorPython2DList(const Eigen::MatrixXd& mat) {
py::list result;
const size_t cols = mat.cols(... | #include <boost/python.hpp>
#include <boost/assert.hpp>
#include <vector>
#include <Eigen/Dense>
#include "eigen_spline.hpp"
using namespace spline_planner;
namespace py = boost::python;
py::list ColumnMajorMatrixToRowMajorPython2DList(const Eigen::MatrixXd& mat) {
py::list result;
const size_t cols = mat.cols(... |
.def("sampleAndCollect", &CubicSpline3DWrapper::SampleAndCollect1)
.def("sampleAndCollect", &CubicSpline3DWrapper::SampleAndCollect2)
.def("sampleAndCollect", &CubicSpline3DWrapper::SampleAndCollect);
}
| py::class_<CubicSpline3DWrapper>("CubicSpline3DWrapper", py::init<py::list>())
.def(py::init<py::list, py::list, py::list>())
.def("sampleAndCollect", &CubicSpline3DWrapper::SampleAndCollect0) | call_expression | [
{
"content": "def vector_to_list(vec):\n",
"file_path": "spline_planner/scripts/ros_geometry.py",
"rank": 1,
"score": 85291.53639601504
},
{
"content": "def vec_to_quat(vec):\n\n \"\"\"To fully determine the orientation represented by the resulting quaternion, this method will assume the ... |
C++ | ThirdParty-mod/java2cpp/java/io/LineNumberInputStream.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 |
#ifndef J2CPP_INCLUDE_IMPLEMENTATION
#ifndef J2CPP_JAVA_IO_LINENUMBERINPUTSTREAM_HPP_DECL
#define J2CPP_JAVA_IO_LINENUMBERINPUTSTREAM_HPP_DECL
namespace j2cpp { namespace java { namespace io { class FilterInputStream; } } }
namespace j2cpp { namespace java { namespace io { class InputStream; } } }
... |
#ifndef J2CPP_INCLUDE_IMPLEMENTATION
#ifndef J2CPP_JAVA_IO_LINENUMBERINPUTSTREAM_HPP_DECL
#define J2CPP_JAVA_IO_LINENUMBERINPUTSTREAM_HPP_DECL
namespace j2cpp { namespace java { namespace io { class FilterInputStream; } } }
namespace j2cpp { namespace java { namespace io { class InputStream; } } }
... |
jint java::io::LineNumberInputStream::read()
{
return call_method<
java::io::LineNumberInputStream::J2CPP_CLASS_NAME,
java::io::LineNumberInputStream::J2CPP_METHOD_NAME(4),
java::io::LineNumberInputStream::J2CPP_METHOD_SIGNATURE(4),
jint
>(get_jobject());
}
jint java::io::LineNumberInputStream... | m::mark(jint a0)
{
return call_method<
java::io::LineNumberInputStream::J2CPP_CLASS_NAME,
java::io::LineNumberInputStream::J2CPP_METHOD_NAME(3),
java::io::LineNumberInputStream::J2CPP_METHOD_SIGNATURE(3),
void
>(get_jobject(), a0);
} | function_block-function_prefixed | [
{
"content": "\tclass Void;\n",
"file_path": "ThirdParty-mod/java2cpp/java/lang/Void.hpp",
"rank": 0,
"score": 307452.9692886499
},
{
"content": "\tclass Void\n\n\t\t: public object<Void>\n\n\t{\n\n\tpublic:\n\n\n\n\t\tJ2CPP_DECLARE_CLASS\n\n\n\n\t\tJ2CPP_DECLARE_METHOD(0)\n\n\t\tJ2CPP_DECLA... |
C++ | Funambol/source/common/http/DigestAuthentication.cpp | wbitos/funambol | 29f76caf9cee51d51ddf5318613411cb1cfb8e4e |
#include <Funambol/base/Log.h>
#include <Funambol/base/messages.h>
#include <Funambol/base/util/utils.h>
#include <Funambol/http/constants.h>
#include <Funambol/http/errors.h>
#include <Funambol/http/DigestAuthentication.h>
#include <Funambol/event/FireEvent.h>
USE_NAMESPACE
DigestAuthentication::DigestAuthenticati... |
#include <Funambol/base/Log.h>
#include <Funambol/base/messages.h>
#include <Funambol/base/util/utils.h>
#include <Funambol/http/constants.h>
#include <Funambol/http/errors.h>
#include <Funambol/http/DigestAuthentication.h>
#include <Funambol/event/FireEvent.h>
USE_NAMESPACE
DigestAuthentication::DigestAuthenticati... |
void DigestAuthentication::processAuthInfo(const char* authstr) {
if (strstr(authstr, "Digest") != authstr) {
return;
}
this->realm = extractDigestProp(authstr, "realm");
this->qop = extractDigestProp(authstr, "qop");
this->nonce = extractDigestProp(authstr, "nonce");
this->opaque = extractDigestProp(authstr,... | StringBuffer DigestAuthentication::extractDigestProp(const char* authstr, const char* prop) {
StringBuffer result = "";
const char* start;
const char* end;
const char* ptr;
char * temp = new char[100];
sprintf(temp, "%s=\"", prop);
start = strstr(authstr, temp);
if (start == NULL) {
... | function_block-full_function | [
{
"content": " class URL {\n\n\n\n public:\n\n char* fullURL ;\n\n char* protocol;\n\n char* host ;\n\n char* resource;\n\n int port ;\n\n\n\n URL();\n\n URL(const URL &url);\n\n URL(const char* url);\n\n ~URL();\n\n\n\n vo... |
C++ | bus/map_test.cpp | UndefeatedSunny/sc-platform | 5897c460bf7a4b9694324f09d2492f5e157a3955 | #include "bus/memory_map.hpp"
#include "report/report.hpp"
#include "report/summary.hpp"
#include "common/common.hpp"
#include <string>
#include <list>
#include <vector>
#include <map>
using namespace std;
using namespace sc_core;
namespace {
const char * const MSGID{ "/Doulos/Example/map_test" };
}
Port_t decode... | #include "bus/memory_map.hpp"
#include "report/report.hpp"
#include "report/summary.hpp"
#include "common/common.hpp"
#include <string>
#include <list>
#include <vector>
#include <map>
using namespace std;
using namespace sc_core;
namespace {
const char * const MSGID{ "/Doulos/Example/map_test" };
}
Port_t decode... |
void build_port_map( void )
{
string config_name;
string config_kind;
Depth_t config_size;
INFO( DEBUG, "Mapping port " << port << " " << config_name );
size_t matches{ 0 };
for( auto& mapping : m_addr_map ) {
Addr_t addr{ mapping.first };
Target_info& mapped{ mapping.second };
... | Addr_t reconstruct_address( Addr_t address, Port_t port, bool bias_upwards )
{
Addr_t base{ BAD_ADDR };
Addr_t last;
Addr_t min_address{ MAX_ADDR};
Addr_t max_address{ 0 };
Addr_t reconstructed{ BAD_ADDR };
for( const auto& mapping : m_addr_map ) {
if( mapping.second.port != port ) continue;
base = ... | function_block-full_function | [
{
"content": "#define UNASSIGNED 0\n\n#define UNLIMITED 0\n\nstruct Target_info {\n\n // Initial values chosen to force initialization discovery if need be\n\n Port_t port { BAD_PORT }; // get from probe\n\n Addr_t base { BAD_ADDR }; // get from YAML\n\n Addr_t last { 0 }; //... |
C++ | code/BDataPersonName.cpp | omerdagan84/neomem | 7d2f782bb37f1ab0ac6580d00672e114605afab7 |
#include "precompiled.h"
#include "BDataPersonName.h"
#include "ConstantsDatabase.h"
#include "BDoc.h"
#include "UI.h"
#include "NeoMem.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
IMPLEMENT_SERIAL(BDataPersonName, BData, VERSIONABLE_SCHEMA | versionFileStructur... |
#include "precompiled.h"
#include "BDataPersonName.h"
#include "ConstantsDatabase.h"
#include "BDoc.h"
#include "UI.h"
#include "NeoMem.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
IMPLEMENT_SERIAL(BDataPersonName, BData, VERSIONABLE_SCHEMA | versionFileStructur... | rFirst = str.Mid(n+1);
m_strFirst.TrimLeft();
}
else
{
int n = str.ReverseFind(' ');
if (n == -1)
{
m_strLast = str;
}
else
{
m_strFirst = str.Left(n);
m_strLast = str.Mid(n+1);
}
}
m_bCacheValid = FALSE;
return TRUE;
}
CString BDataPersonName::GetBDataText(BDoc* pDoc,... | D(this);
m_strTitle.Empty();
m_strFirst.Empty();
m_strMiddle.Empty();
m_strLast.Empty();
m_strNickname.Empty();
m_strSuffix.Empty();
int n = str.Find(',');
if (n != -1)
{
m_strLast = str.Left(n);
m_st | function_block-random_span | [
{
"content": "#define HID_STATIC 0x1FFFF\n",
"file_path": "help/HTMLDefines.h",
"rank": 0,
"score": 83671.20184086818
},
{
"content": "#define HIDD_NEW_FILE 0x2031E\n",
"file_path": "help/HTMLDefines.h",
"rank": 1,
"score": 8... |
C++ | examples/fft2d/fft2d.cpp | brycelelbach/upcxx | 9a3f3b18a631d8e924298e621729ef302636908d |
#include <upcxx.h>
#include <forkjoin.h>
#include "myfft.h"
#include <cstdlib>
#include <iostream>
#include <vector>
#include <cassert>
#include <time.h>
#include <sys/time.h>
#define VERIFY
using namespace upcxx;
#include <cstdlib>
size_t NX_default = 1024;
size_t NY_default = 1024;
global_ptr<complex_t>... |
#include <upcxx.h>
#include <forkjoin.h>
#include "myfft.h"
#include <cstdlib>
#include <iostream>
#include <vector>
#include <cassert>
#include <time.h>
#include <sys/time.h>
#define VERIFY
using namespace upcxx;
#include <cstdlib>
size_t NX_default = 1024;
size_t NY_default = 1024;
global_ptr<complex_t>... | nx_per_p);
}
barrier();
}
#endif
local_transpose2<T>((T *)W[myid].raw_ptr(), out, ny, nx_per_p);
#ifdef DEBUG
for (i=0; i<nprocs; i++) {
if (myid == i) {
printf("P%d transpose: After the second local_transpose2:\n",
myid);
print_matrix<T>(cout, out, nx_per_p, ny);
... | x::copy(all_Ws,
global_ptr< global_ptr<T> >(W),
nprocs);
#ifdef DEBUG
for (int i=0; i<nprocs; i++) {
fprintf(stderr, "transpose: myid %d, W[%d] ", myid, i);
cerr << W[i] << "\n";
}
#endif
tmp_in = allocate<T>(myid, nx_per_p * ny);
assert(tmp_in.raw_ptr() != NULL);
#ifdef... | random | [
{
"content": " int barrier();\n",
"file_path": "include/upcxx/upcxx_runtime.h",
"rank": 0,
"score": 169134.43952992093
},
{
"content": " static inline uint32_t myrank() {\n\n if (is_init() == false) return 0xFFFFFFFF; // return a special value if not inited\n\n return team::current_t... |
C++ | BlackVision/Test/Tools/TestLibCore/Source/Conversions/String2Integer.cpp | black-vision-engine/bv-engine | 85089d41bb22afeaa9de070646e12aa1777ecedf | #include "gtest/gtest.h"
#include "Serialization/SerializationHelper.h"
using namespace bv;
template< class Type >
class LibCore_String2T_Integer : public testing::Test
{
protected:
LibCore_String2T_Integer() {};
};
template< class Type >
class LibCore_String2T_IntegerSigned : public ... | #include "gtest/gtest.h"
#include "Serialization/SerializationHelper.h"
using namespace bv;
template< class Type >
class LibCore_String2T_Integer : public testing::Test
{
protected:
LibCore_String2T_Integer() {};
};
template< class Type >
class LibCore_String2T_IntegerSigned : public ... | mFloatStr )
{
Expected< TypeParam > intExp = Convert::String2T< TypeParam >( "1.0434" );
TypeParam intDef = Convert::String2T< TypeParam >( "1.0434", 5 );
EXPECT_FALSE( intExp.IsValid() );
EXPECT_EQ( intDef, 5 );
}
TYPED_TEST( LibCore_String2T_Integer, ConvertOverflowing )
{
Expected< ... | () {};
};
typedef testing::Types< UInt64, Int64, UInt32, Int32, UInt16, Int16, UInt8, Int8 > IntegerTypesList;
typedef testing::Types< Int64, Int32, Int16, Int8 > SignedIntegerTypesList;
typedef testing::Types< UInt64, UInt32, UInt16, UInt8 > UnsignedIntegerTypesList;
TYPED_TEST_CASE( LibCore_String2T_Integer,... | random | [
{
"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_ = \... |
C++ | Xenakios/FloatingInspector.cpp | lorenzopistolesi/sws | 6963f7563851c8dd919db426bae825843939077f |
#include "stdafx.h"
#include "../SnM/SnM_Dlg.h"
using namespace std;
HWND g_hItemInspector=NULL;
bool g_ItemInspectorVisible=false;
WDL_DLGRET MyItemInspectorDlgProc(HWND hwnd, UINT Message, WPARAM wParam, LPARAM lParam)
{
static HMENU g_hItemInspCtxMenu=0;
static int g_InspshowMode=1;
if (INT_... |
#include "stdafx.h"
#include "../SnM/SnM_Dlg.h"
using namespace std;
HWND g_hItemInspector=NULL;
bool g_ItemInspectorVisible=false;
WDL_DLGRET MyItemInspectorDlgProc(HWND hwnd, UINT Message, WPARAM wParam, LPARAM lParam)
{
static HMENU g_hItemInspCtxMenu=0;
static int g_InspshowMode=1;
if (INT_... | void DoTglFltItemInspector(COMMAND_T*)
{
if (g_ItemInspectorVisible)
{
g_ItemInspectorVisible = false;
KillTimer(g_hItemInspector, 1);
ShowWindow(g_hItemInspector, SW_HIDE);
}
else
{
g_ItemInspectorVisible = true;
SetTimer(g_hItemInspector, 1, 200, NULL);
ShowWindow(g_hItemInspector, SW_SHO... | function_block-full_function | [
{
"content": "class CmdSelectAllItemsOnTrackBetweenLoopPoints: public RprCommand\n\n{\n\npublic:\n\n\tCmdSelectAllItemsOnTrackBetweenLoopPoints(bool allInLoop) {m_allInLoop = allInLoop;}\n\nprivate:\n\n\tvirtual void doCommand(int flag);\n\n\tbool m_allInLoop;\n\n};\n\n\n",
"file_path": "Fingers/MediaItemCo... | |
C++ | Library/Source/Nanites/CoreFoundation/NCoreFoundation.cpp | refnum/Nano | dceb0907061f7845d8a3c662f309ca164e932e6f |
#include "NCoreFoundation.h"
NCFType ToCF(const NAny& theValue)
{
NNumber theNumber;
NCFType cfObject;
if (theValue.IsBool())
{
cfObject.Set(theValue.GetBool() ? kCFBooleanTrue : kCFBooleanFalse);
}
else if (theValue.IsArray())
{
cfObject.Set(ToCF(theValue.GetArray()));
}
else if (theValue.IsData(... |
#include "NCoreFoundation.h"
NCFType ToCF(const NAny& theValue)
{
NNumber theNumber;
NCFType cfObject;
if (theValue.IsBool())
{
cfObject.Set(theValue.GetBool() ? kCFBooleanTrue : kCFBooleanFalse);
}
else if (theValue.IsArray())
{
cfObject.Set(ToCF(theValue.GetArray()));
}
else if (theValue.IsData(... |
return cfObject;
}
NAny ToNN(CFTypeRef cfObject)
{
NAny theObject;
if (cfObject != nullptr)
{
CFTypeID cfType = CFGetTypeID(cfObject);
if (cfType == CFBooleanGetTypeID())
{
theObject = CFBooleanGetValue(CFBooleanRef(cfObject)) ? true : false;
}
else if (cfType == CFArrayGetTypeID())
{
NCF... | if (theNumber.SetValue(theValue))
{
cfObject.Set(ToCF(theNumber));
}
else
{
NN_LOG_ERROR("Unable to convert Nano object to CF!");
} | if_condition | [
{
"content": " ExprList *pReturnEL; /* List of expressions to return */\n",
"file_path": "Library/Source/Nano/Internal/Components/sqlite-3.36.0/sqlite3.36.0.c",
"rank": 0,
"score": 52241.32236349526
},
{
"content": "static const char KW_INCLUDE[]\n",
"file_path": "Library/Source/Nano/I... |
C++ | tests/server.test.cpp | lineCode/webrtc-datachannels | 0f814632361c829c3aff1764cb662bd6290d54d9 |
#include "algo/StringUtils.hpp"
#include "config/ServerConfig.hpp"
#include "log/Logger.hpp"
#include "storage/path.hpp"
#include <algorithm>
#include <boost/asio.hpp>
#include <boost/asio/bind_executor.hpp>
#include <boost/asio/buffer.hpp>
#include <boost/asio/ip/tcp.hpp>
#include <boost/asio/ssl.hpp>
#include <boos... |
#include "algo/StringUtils.hpp"
#include "config/ServerConfig.hpp"
#include "log/Logger.hpp"
#include "storage/path.hpp"
#include <algorithm>
#include <boost/asio.hpp>
#include <boost/asio/bind_executor.hpp>
#include <boost/asio/buffer.hpp>
#include <boost/asio/ip/tcp.hpp>
#include <boost/asio/ssl.hpp>
#include <boos... | {
REQUIRE(v.size() == 10);
REQUIRE(v.capacity() >= 10);
}
}
WHEN("the size is reduced") {
v.resize(0);
THEN("the size changes but not capacity") {
REQUIRE(v.size() == 0);
REQUIRE(v.capacity() >= 5);
}
}
WHEN("more capacity is reserved") {
v.... | ) == 5);
REQUIRE(v.capacity() >= 5);
WHEN("the size is increased") {
v.resize(10);
THEN("the size and capacity change") | random | [
{
"content": "// Sends a WebSocket message and prints the response\n\nclass session : public std::enable_shared_from_this<session>\n\n{\n\n tcp::resolver resolver_;\n\n websocket::stream<beast::tcp_stream> ws_;\n\n beast::flat_buffer buffer_;\n\n std::string host_;\n\n std::string text_;\n\n\n\np... |
C++ | Chapter-5-Loops-and-Files/Review Questions and Exercises/Programming Challenges/016.cpp | jesushilarioh/C-Plus-Plus | bbff921460ac4267af48558f040c7d82ccf42d5e |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
const int MONTHS = 12;
float starting_balance,
annual_interest_rate,
amount_deposited,
amount_withdrawn,
interest_rate,
monthly_interest_rate,
balance,
total_deposit... |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
const int MONTHS = 12;
float starting_balance,
annual_interest_rate,
amount_deposited,
amount_withdrawn,
interest_rate,
monthly_interest_rate,
balance,
total_deposit... | balance += interest_rate;
if (balance < 0)
break;
total_interest_earned += (interest_rate);
}
if (balance < 0)
{
cout << "I'm sorry, your account has been closed" << endl;
cout << "due to having a negative balance." << endl;
}
... | function_block-function_prefix_line | [
{
"content": "//********************************************************************\n\n// This program displays a list of numbers and\n\n// their squares.\n\n//\n\n// JESUS HILARIO HERNANDEZ\n\n// Last updated: October 5, 2016\n\n//\n\n//********************************************************************\n\n\... | |
C++ | lib/stages/pulsarNetworkProcess.cpp | james-s-willis/kotekan | 155e874bb039702cec72c1785362a017548aa00a | #include <arpa/inet.h>
#include <assert.h>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <math.h>
#include <netinet/in.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sys/socket.h>... | #include <arpa/inet.h>
#include <assert.h>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <math.h>
#include <netinet/in.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sys/socket.h>... |
INFO("{:s} ", my_ip_address[i]);
}
int frame_id = 0;
uint8_t* packet_buffer = NULL;
for (int i = 0; i < number_of_subnets; i++) {
sock_fd[i] = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
if (sock_fd[i] < 0) {
FATAL_ERROR("network thread: socket() failed: ");
... | if (std::snprintf(my_ip_address[i], 100, "10.%d.%d.1%d", i + 15, nos + rack, node) > 100) {
FATAL_ERROR("buffer spill over ");
return;
} | if_condition | [] |
C++ | chrome/browser/chromeos/cros_settings.cc | SlimKatLegacy/android_external_chromium | bc611cda58cc18d0dbaa8a7aee05eb3c0742e573 |
#include "chrome/browser/chromeos/cros_settings.h"
#include "base/lazy_instance.h"
#include "base/string_util.h"
#include "base/values.h"
#include "chrome/browser/chromeos/cros_settings_provider.h"
#include "chrome/browser/chromeos/user_cros_settings_provider.h"
#include "content/common/notification_details.h"
#incl... |
#include "chrome/browser/chromeos/cros_settings.h"
#include "base/lazy_instance.h"
#include "base/string_util.h"
#include "base/values.h"
#include "chrome/browser/chromeos/cros_settings_provider.h"
#include "chrome/browser/chromeos/user_cros_settings_provider.h"
#include "content/common/notification_details.h"
#incl... |
bool CrosSettings::GetBoolean(const std::string& path,
bool* bool_value) const {
DCHECK(CalledOnValidThread());
Value* value;
if (!Get(path, &value))
return false;
return value->GetAsBoolean(bool_value);
}
bool CrosSettings::GetInteger(const std::string& path,
... | CrosSettings::Get(const std::string& path, Value** out_value) const {
DCHECK(CalledOnValidThread());
CrosSettingsProvider* provider;
provider = GetProvider(path);
if (provider) {
return provider->Get(path, out_value);
}
return false;
} | function_block-function_prefixed | [
{
"content": "struct tuple_size<GTEST_0_TUPLE_(T)> { static const int value = 0; };\n\n\n\ntemplate <GTEST_1_TYPENAMES_(T)>\n",
"file_path": "testing/gtest/include/gtest/internal/gtest-tuple.h",
"rank": 0,
"score": 425778.8998875817
},
{
"content": "struct tuple_size<GTEST_3_TUPLE_(T)> { sta... |
C++ | aha/main.cpp | dlarudgus20/newly-aha | 4d80bf992af3d8e7a6ddcca3c38d5959059ec66f |
#include <iostream>
#include <string>
#include <type_traits>
#include <variant>
#include <locale>
#include <boost/program_options.hpp>
#include <boost/iterator/transform_iterator.hpp>
namespace bpo = boost::program_options;
#include "../libahafront/aha/front/source.hpp"
#include "../libahafront/aha/front/lexer.hpp"... |
#include <iostream>
#include <string>
#include <type_traits>
#include <variant>
#include <locale>
#include <boost/program_options.hpp>
#include <boost/iterator/transform_iterator.hpp>
namespace bpo = boost::program_options;
#include "../libahafront/aha/front/source.hpp"
#include "../libahafront/aha/front/lexer.hpp"... | ;
int main(int argc, char* argv[])
{
repl_source src;
lexer ll;
parser yy;
auto get_input = [&src] (bool fresh) {
std::string str;
std::cout << (fresh ? ">> " : "-- ");
if (!getline(std::cin, str))
{
src.feedEof();
}
else
{
... | inline std::string utf32narrow(std::u32string_view str)
{
auto fn = [](char32_t ch) { return static_cast<char>(ch); };
auto tbeg = boost::iterators::make_transform_iterator(str.begin(), fn);
auto tend = boost::iterators::make_transform_iterator(str.end(), fn);
return std::string(tbeg, tend);
} | function_block-full_function | [
{
"content": "// SOFTWARE.\n\n\n\n#pragma once\n\n\n\n#include <string>\n\n#include <string_view>\n\n#include <vector>\n\n#include <deque>\n\n#include <optional>\n\n#include <stdexcept>\n\n\n\nnamespace aha::front\n\n{\n",
"file_path": "libahafront/aha/front/source.hpp",
"rank": 1,
"score": 9.501183... |
C++ | cornellbox/Eyeo2012/Shockwaves/src/ShockwavesApp.cpp | eighteight/CinderEigh | d9dfc6a0ad9a9e6c5b82624971127f0335d91639 | #include "cinder/app/AppBasic.h"
#include "cinder/gl/gl.h"
#include "cinder/gl/Texture.h"
#include "cinder/Text.h"
#include "cinder/gl/Fbo.h"
#include "cinder/gl/Vbo.h"
#include "cinder/gl/GlslProg.h"
#include "cinder/ImageIo.h"
#include "cinder/Utilities.h"
#include "cinder/Camera.h"
#include "cinder/Rand.h"
#include ... | #include "cinder/app/AppBasic.h"
#include "cinder/gl/gl.h"
#include "cinder/gl/Texture.h"
#include "cinder/Text.h"
#include "cinder/gl/Fbo.h"
#include "cinder/gl/Vbo.h"
#include "cinder/gl/GlslProg.h"
#include "cinder/ImageIo.h"
#include "cinder/Utilities.h"
#include "cinder/Camera.h"
#include "cinder/Rand.h"
#include ... | oid ShockwavesApp::keyDown( KeyEvent event )
{
switch( event.getChar() ){
case '1': mController.preset( 1 ); break;
case '2': mController.preset( 2 ); break;
case ' ': mRoom.togglePower(); break;
case 's': mController.explode(); break;
default: break;
}
switch( event.getCode() ){
case KeyEvent... | _DIM;
mVboMesh = gl::VboMesh( numVertices * 8 * 3, 0, layout, GL_TRIANGLES );
float s = 10.0f;
Vec3f p0( 0.0f, s, 0.0f );
Vec3f p1( -s, 0.0f, 0.0f );
Vec3f p2( 0.0f, 0.0f, s );
Vec3f p3( s, 0.0f, 0.0f );
Vec3f p4( 0.0f, 0.0f, -s );
Vec3f p5( 0.0f, -s, 0.0f );
Vec3f n;
Vec3f n0 = Ve... | random | [] |
C++ | Core/GraphicsView.cpp | devonchenc/NovaImage | 3d17166f9705ba23b89f1aefd31ac2db97385b1c | #include "GraphicsView.h"
#include <QtMath>
#include <QMimeData>
#include <QDebug>
#include "View.h"
#include "MouseHandler.h"
#include "GlobalFunc.h"
#include "mainwindow.h"
#include "../Image/BaseImage.h"
#include "../Widget/MagnifierWidget.h"
GraphicsView::GraphicsView(View* view, QGraphicsScene* scene, QWidget* ... | #include "GraphicsView.h"
#include <QtMath>
#include <QMimeData>
#include <QDebug>
#include "View.h"
#include "MouseHandler.h"
#include "GlobalFunc.h"
#include "mainwindow.h"
#include "../Image/BaseImage.h"
#include "../Widget/MagnifierWidget.h"
GraphicsView::GraphicsView(View* view, QGraphicsScene* scene, QWidget* ... |
float GraphicsView::calcScale(float pixelSpacing)
{
float distance = 20.0f;
int flag = 0;
while (distance / pixelSpacing > 60)
{
if (flag == 0)
{
distance /= 2;
}
else if (flag == 1)
{
distance /= 2;
}
else if (flag == 2)
... | QString str = QString::number(horzDistance, 'f', 2) + " mm";
painter.drawText(QRect(rect().center().x(), y - 23, 9 * horzInterval, 20), Qt::AlignCenter, str);
painter.rotate(-90);
str = QString::number(vertDistance, 'f', 2) + " mm";
painter.drawText(QRect(-rect().center().y(), rect().width() - 23 - mar... | function_block-function_prefix_line | [
{
"content": "class View;\n",
"file_path": "Core/GraphicsScene.h",
"rank": 0,
"score": 120366.99674812447
},
{
"content": "class ImageQualityChartView : public ChartView\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n ImageQualityChartView(QWidget* parent = nullptr);\n\n\n\n void setData(const... |
C++ | targets/TARGET_NORDIC/TARGET_NRF5x/TARGET_NRF52/TARGET_MCU_NRF52832/TARGET_RIOT_MICRO_MODULE/ONBOARD_RM1000_AT.cpp | yogpan01/mbed | 1fb9dd7ddd94239f788683e864f2dac664f33a48 |
#if MBED_CONF_NSAPI_PRESENT
#include "ONBOARD_RM1000_AT.h"
#include "UARTSerial.h"
#include "mbed-trace/mbed_trace.h"
#ifndef TRACE_GROUP
#define TRACE_GROUP "RIOTMICRO"
#endif
#include "gpio_api.h"
#include "PinNames.h"
#include "hal/serial_api.h"
#include "platform/mbed_thread.h"
using namespace mbed;
ONBOAR... |
#if MBED_CONF_NSAPI_PRESENT
#include "ONBOARD_RM1000_AT.h"
#include "UARTSerial.h"
#include "mbed-trace/mbed_trace.h"
#ifndef TRACE_GROUP
#define TRACE_GROUP "RIOTMICRO"
#endif
#include "gpio_api.h"
#include "PinNames.h"
#include "hal/serial_api.h"
#include "platform/mbed_thread.h"
using namespace mbed;
ONBOAR... |
void ONBOARD_RM1000_AT::onboard_modem_deinit()
{
tr_debug("onboard_modem_deinit");
gpio_t gpio;
gpio_init_out_ex(&gpio, MDMRST, 0);
}
CellularDevice *CellularDevice::get_target_default_instance()
{
tr_debug("Calling CellularDevice::get_target_default_instance from ONBOARD_RM1000_AT");
sta... | unc__);
serial_getc(&bootrom_uart);
tr_debug("%s: MODEM first activity after reset", __func__);
for (int i = 0; i < 3; i++) {
do {
promptEnd = serial_getc(&bootrom_uart);
} while ('.' != promptEnd);
}
serial_putc(&bootrom_uart, ' ');
for (int i = 0; i < 2; ... | function_block-function_prefixed | [] |
C++ | rexec/RexecShell/Environment.cpp | RWTH-OS/MP-MPICH | f2ae296477bb9d812fda587221b3419c09f85b4a |
#include <vcl\vcl.h>
#pragma hdrstop
#include "Environment.h"
#include "..\mpirun\plugins\Plugin.h"
#if ((BCBVER > 1))
#include <stdio.h>
#endif
extern "C" {
__declspec(dllexport)
char* GetEnvString(HostData *Proc,char *Name,char *value,DWORD *BufSize) {
char *act,
*pos;
int res;
DWORD lenAll,lenStName,l... |
#include <vcl\vcl.h>
#pragma hdrstop
#include "Environment.h"
#include "..\mpirun\plugins\Plugin.h"
#if ((BCBVER > 1))
#include <stdio.h>
#endif
extern "C" {
|
__declspec(dllexport)
void PutEnvString(HostData *Proc,char *Name,char *value) {
char *OldPos;
DWORD oldLen,newLen,OldIndex,oldSize,namelen;
if(!value) value="";
namelen = strlen(Name);
newLen=namelen+strlen(value)+2;
oldLen = 0;
if(!Proc->ProcData) {
Proc->ProcData = (TProcessData*)malloc(sizeof(TPro... | __declspec(dllexport)
char* GetEnvString(HostData *Proc,char *Name,char *value,DWORD *BufSize) {
char *act,
*pos;
int res;
DWORD lenAll,lenStName,lenGName,lenValue;
if(!Proc || !Proc->ProcData) return 0;
act=Proc->ProcData->Environment;
if(value) *value=0;
if(!Name) {
return 0;
}
while(act&&*act) {
... | function_block-full_function | [
{
"content": "extern ADIOI_Flatlist_node *ADIOI_Flatlist;\n",
"file_path": "romio/adio/include/adio_extern.h",
"rank": 0,
"score": 127407.15731490849
},
{
"content": "extern MPI_Info *MPIR_Infotable;\n",
"file_path": "romio/adio/include/adio_extern.h",
"rank": 1,
"score": 127396.... |
C++ | image_processing/toolbox/classify/private/multiclassQuantizedTreeTrain1.cpp | bruceli-rw0/edge2pic-generation | e9ee6f89361d1a12b044c0ab665a09fca4a47089 |
#include <string.h>
#include <stdint.h>
#include <math.h>
#include <mex.h>
#include <iostream>
#include <vector>
#ifdef USEOMP
#include <omp.h>
#endif
typedef unsigned char uint8;
typedef unsigned int uint32;
#define gini(p) p*p
void constructCdfPerClass( uint8* data, uint32 *hs, float *wts,
... |
#include <string.h>
#include <stdint.h>
#include <math.h>
#include <mex.h>
#include <iostream>
#include <vector>
#ifdef USEOMP
#include <omp.h>
#endif
typedef unsigned char uint8;
typedef unsigned int uint32;
#define gini(p) p*p
void constructCdfPerClass( uint8* data, uint32 *hs, float *wts,
... |
void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) {
int H, N, N1, F1, F, split;
uint8 *data; uint32* fids, *dids;
float *wts, thr;
double gain;
uint32 *hs;
double cfactor, *costs_factor;
int nBins, nThreads;
data = (uint8*) mxGetData(prhs[0]);
hs = (uint32*) mxGetDa... | void constructCdf( uint8* data, float *wts,
int nBins, int N, uint32 *dids,
std::vector<double>& cdf )
{
for(int i=0; i<N; i++) cdf[data[dids[i]]] += wts[dids[i]];
for(int i=1; i<nBins; i++) cdf[i] += cdf[i-1];
} | function_block-full_function | [
{
"content": "/*******************************************************************************\n\n* Piotr's Computer Vision Matlab Toolbox Version 3.01\n\n* Copyright 2014 Piotr Dollar. [pdollar-at-gmail.com]\n\n* Licensed under the Simplified BSD License [see external/bsd.txt]\n\n************************... |
C++ | cpp/src/simulator.cpp | mamariomiamo/online_dmpc | 63a135ce6bf6f1c3a0970129a23e569797801b6c |
#include "iostream"
#include "simulator.h"
using namespace Eigen;
using namespace std;
using namespace std::chrono;
using json = nlohmann::json;
Simulator::Simulator(std::ifstream& config_file) {
Generator::Params p = parseJSON(config_file);
_generator = std::make_unique<Generator>(p);
_sim_model = std:... |
#include "iostream"
#include "simulator.h"
using namespace Eigen;
using namespace std;
using namespace std::chrono;
using json = nlohmann::json;
Simulator::Simulator(std::ifstream& config_file) {
Generator::Params p = parseJSON(config_file);
_generator = std::make_unique<Generator>(p);
_sim_model = std:... |
MatrixXd Simulator::generateRandomPoints(int N, const Vector3d &pmin,
const Vector3d &pmax, float rmin) {
MatrixXd pts = MatrixXd::Zero(3, N);
Vector3d candidate = MatrixXd::Zero(3, 1);
VectorXd dist;
bool pass = false;
pts.col(0) = pmin.array()
... | file << _po << endl;
file << _pf << endl;
for(int i=0; i < _Ncmd; ++i)
file << _trajectories[i] << endl;
file.close();
}
else
{
cerr << "Error while trying to open file" << endl;
}
} | function_block-function_prefix_line | [
{
"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": "cpp/include/json.hpp",
"rank": 0,
"score": 123715.87774488093
},
{
"content": " ... |
C++ | net/ias/mmc/nap/logcompd.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f |
#include "Precompiled.h"
#include "LogCompD.h"
#include "LogMacNd.h"
#include "LocalFileLoggingNode.h"
#include "LoggingMethodsNode.h"
#include "LogComp.h"
#include <stdio.h>
#include "ChangeNotification.h"
CLoggingComponentData::CLoggingComponentData()
{
ATLTRACE(_T("+NAPMMC+:# +++ CLogg... |
#include "Precompiled.h"
#include "LogCompD.h"
#include "LogMacNd.h"
#include "LocalFileLoggingNode.h"
#include "LoggingMethodsNode.h"
#include "LogComp.h"
#include <stdio.h>
#include "ChangeNotification.h"
CLoggingComponentData::CLoggingComponentData()
{
ATLTRACE(_T("+NAPMMC+:# +++ CLogg... | , LPARAM lParam
)
{
ATLTRACE(_T("# CLoggingComponentData::OnPropertyChange\n"));
_ASSERTE( m_spConsole != NULL );
HRESULT hr = S_FALSE;
if( lParam != NULL )
{
CChangeNotification * pChangeNotification = (CChangeNotification *) lParam;
... | **FAILED***: CLoggingComponentData::Initialize -- ImageListSetStrip\n"));
return E_UNEXPECTED;
}
INITCOMMONCONTROLSEX initCommCtrlsEx;
initCommCtrlsEx.dwSize = sizeof(INITCOMMONCONTROLSEX);
initCommCtrlsEx.dwICC = ICC_WIN95_CLASSES ;
if (!In... | random | [] |
C++ | include/El/core/Grid.hpp | pjt1988/Elemental | 71d3e2b98829594e9f52980a8b1ef7c1e99c724b |
#ifndef EL_GRID_HPP
#define EL_GRID_HPP
namespace El {
class Grid
{
public:
explicit Grid
( mpi::Comm comm=mpi::COMM_WORLD, GridOrder order=COLUMN_MAJOR );
explicit Grid( mpi::Comm comm, int height, GridOrder order=COLUMN_MAJOR );
~Grid();
int Row() const EL_NO_RELEASE_EXCEPT;
int Col(... |
#ifndef EL_GRID_HPP
#define EL_GRID_HPP
namespace El {
class Grid
{
public:
explicit Grid
( mpi::Comm comm=mpi::COMM_WORLD, GridOrder order=COLUMN_MAJOR );
explicit Grid( mpi::Comm comm, int height, GridOrder order=COLUMN_MAJOR );
~Grid();
int Row() const EL_NO_RELEASE_EXCEPT;
int Col(... |
}
#endif
| inline bool GridCompare
( const Grid & g1, const Grid & g2 )
{
if( g1.Height() != g2.Height() )
return false;
if( g1.Order() != g2.Order() )
return false;
if( !Congruent( g1.ViewingComm(), g2.ViewingComm() ) )
return false;
if( !Congruent( g1.OwningGroup(),... | function_block-full_function | [
{
"content": "struct IsIntegral<BigInt> { static const bool value = true; };\n\n#endif\n\n\n\n// For querying whether an element's type is a scalar\n\n// --------------------------------------------------\n\ntemplate<typename T> struct IsScalar\n\n{ static const bool value=false; };\n\ntemplate<> struct IsScala... |
C++ | packages/utility/stats/src/Utility_SampleMoment.hpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 |
#ifndef UTILITY_SAMPLE_MOMENT_HPP
#define UTILITY_SAMPLE_MOMENT_HPP
#include <type_traits>
#include "Utility_QuantityTraits.hpp"
namespace Utility{
template<size_t N, typename T, typename Enabled = void>
class SampleMoment
{ };
template<size_t N, typename T>
class SampleMoment<N,T,typename std::enable_if<(N>0) ... |
#ifndef UTILITY_SAMPLE_MOMENT_HPP
#define UTILITY_SAMPLE_MOMENT_HPP
#include <type_traits>
#include "Utility_QuantityTraits.hpp"
namespace Utility{
template<size_t N, typename T, typename Enabled = void>
class SampleMoment
{ };
template<size_t N, typename T>
class SampleMoment<N,T,typename std::enable_if<(N>0) ... | t<1,T>& first_moment,
const size_t number_of_samples );
template<typename T>
typename QuantityTraits<T>::template GetQuantityToPowerType<2>::type
calculateVariance( const SampleMoment<1,T>& first_moment,
const SampleMoment<2,T>& second_moment,
const size_t numb... | ename QuantityTraits<T>::template GetQuantityToPowerType<N>::type
ValueType;
static ValueType processRawScore( const T& raw_score );
SampleMoment();
SampleMoment( const ValueType& starting_score );
SampleMoment( const SampleMoment& other_moment );
SampleMoment& operator=( const Sampl... | random | [
{
"content": "struct RawRationalPowerHelper<N,D,T,typename std::enable_if<N<0 && D<0 && N!=D>::type> : public RawRationalPowerHelper<-N,-D,T>\n\n{ /* ... */ };\n\n\n\n/*! The true or false type\n\n * \\ingroup quantity_traits\n\n */\n\ntemplate<bool is_true>\n",
"file_path": "packages/utility/core/src/Utili... |
C++ | src/csapex_remote/src/io/protocol/core_requests.cpp | betwo/csapex | f2c896002cf6bd4eb7fba2903ebeea4a1e811191 |
#include <csapex/io/protcol/core_requests.h>
#include <csapex/serialization/request_serializer.h>
#include <csapex/serialization/io/std_io.h>
#include <csapex/io/feedback.h>
#include <csapex/utility/uuid_provider.h>
#include <csapex/model/graph_facade_impl.h>
#include <csapex/serialization/parameter_serializer.h>
#in... |
#include <csapex/io/protcol/core_requests.h>
#include <csapex/serialization/request_serializer.h>
#include <csapex/serialization/io/std_io.h>
#include <csapex/io/feedback.h>
#include <csapex/utility/uuid_provider.h>
#include <csapex/model/graph_facade_impl.h>
#include <csapex/serialization/parameter_serializer.h>
#in... |
} break;
case CoreRequestType::CoreLoad: {
int args = parameters_.size();
if (args == 0) {
core.load(core.getSettings().get<std::string>("config"));
} else {
core.load(std::any_cast<std::string>(parameters_.at(0)));
}
... | if (args == 1) {
core.saveAs(std::any_cast<std::string>(parameters_.at(0)));
} else {
core.saveAs(std::any_cast<std::string>(parameters_.at(0)), std::any_cast<bool>(parameters_.at(1)));
} | if_condition | [
{
"content": "struct ArgumentExtractor<0, Arg, Args...>\n\n{\n\n using type = Arg;\n\n};\n\n\n\ntemplate <int pos, typename Signature>\n",
"file_path": "src/csapex_util/include/csapex/utility/slim_signal_invoker.hpp",
"rank": 0,
"score": 173639.98887121578
},
{
"content": "struct function... |
C++ | src/demo/hellocpp/main.cpp | rochus-keller/nappgui_src | 394875dfc11c9c73cd7995d56f77dcd4629d70b5 |
#include "nappgui.h"
class App;
class MainWindow : public IListener
{
public:
MainWindow(App *app);
~MainWindow();
void *operator new(size_t size) { return (void*)heap_malloc((uint32_t)size, "MainWindow"); }
void operator delete(void *ptr, size_t size) { heap_free((byte_t**)&ptr, (uint32_t)siz... |
#include "nappgui.h"
class App;
class MainWindow : public IListener
{
public:
MainWindow(App *app);
~MainWindow();
void *operator new(size_t size) { return (void*)heap_malloc((uint32_t)size, "MainWindow"); }
void operator delete(void *ptr, size_t size) { heap_free((byte_t**)&ptr, (uint32_t)siz... |
MainWindow::~MainWindow()
{
window_destroy(&this->window);
}
App::App(void)
{
this->main_window = new MainWindow(this);
}
App::~App()
{
delete this->main_window;
}
static App *i_create(void)
{
return new App();
}
static void i_destroy(App **app)
{
delete *app;
*app = NULL;
}
#include "osm... | D);
this->clicks = 0;
window_panel(this->window, panel);
window_title(this->window, "Hello, C++!");
window_origin(this->window, v2df(500, 200));
window_OnClose(this->window, IListen(app, App, i_OnClose));
window_show(this->window);
} | function_block-function_prefixed | [
{
"content": " String *text;\n",
"file_path": "src/gui/label.c",
"rank": 3,
"score": 145566.12840869065
},
{
"content": " String *text;\n",
"file_path": "src/gui/button.c",
"rank": 4,
"score": 145561.48196416028
},
{
"content": " Window *window;\n",
"file_pat... |
C++ | src/projects/fea/test_FEA_ancf_cable.cpp | rserban/chrono | bee5e30b2ce3b4ac62324799d1366b6db295830e | #include <assert.h>
#include <iostream>
#include <string>
#include <vector>
#include "chrono/ChConfig.h"
#include "chrono/physics/ChSystemSMC.h"
#include "chrono/solver/ChIterativeSolverLS.h"
#include "chrono/utils/ChUtilsInputOutput.h"
#include "chrono_irrlicht/ChIrrApp.h"
#include "chrono_mkl/ChSolverMKL.h"
#incl... | #include <assert.h>
#include <iostream>
#include <string>
#include <vector>
#include "chrono/ChConfig.h"
#include "chrono/physics/ChSystemSMC.h"
#include "chrono/solver/ChIterativeSolverLS.h"
#include "chrono/utils/ChUtilsInputOutput.h"
#include "chrono_irrlicht/ChIrrApp.h"
#include "chrono_mkl/ChSolverMKL.h"
#incl... | int main(int argc, char* argv[]) {
bool use_MKL = true;
bool use_HHT = true;
ChSystemSMC mphysicalSystem;
mphysicalSystem.Set_G_acc(ChVector<>(0.01, 0.0, 0.0));
auto ground = chrono_types::make_shared<ChBody>();
ground->SetIdentifier(-1);
ground->SetBodyFixed(true)... | function_block-full_function | [] | |
C++ | Qt/Components/pqDisplayColorWidget.cxx | certik/paraview | 973d37b466552ce770ac0674f30040bb7e31d7fe |
#include "pqDisplayColorWidget.h"
#include "vtkEventQtSlotConnect.h"
#include "vtkPVArrayInformation.h"
#include "vtkPVDataSetAttributesInformation.h"
#include "vtkPVGeometryInformation.h"
#include "vtkSMIntVectorProperty.h"
#include "vtkSMPVRepresentationProxy.h"
#include "vtkSMStringVectorProperty.h"
#include <QC... |
#include "pqDisplayColorWidget.h"
#include "vtkEventQtSlotConnect.h"
#include "vtkPVArrayInformation.h"
#include "vtkPVDataSetAttributesInformation.h"
#include "vtkPVGeometryInformation.h"
#include "vtkSMIntVectorProperty.h"
#include "vtkSMPVRepresentationProxy.h"
#include "vtkSMStringVectorProperty.h"
#include <QC... | ;
QObject::connect(this->Display, SIGNAL(updated()),
this, SLOT(reloadGUI()), Qt::QueuedConnection);
}
QTimer::singleShot(0, this, SLOT(reloadGUI()));
}
pqPipelineRepresentation* pqDisplayColorWidget::getRepresentation() const
{
return this->Display;
}
void pqDisplayColorWidget::reloadGU... | this->VTKConnect->Connect(
repr->GetProperty("Representation"), vtkCommand::ModifiedEvent,
this, SLOT(reloadGUI()),
NULL, 0.0,
Qt::QueuedConnection) | call_expression | [
{
"content": "extern struct obj_stats* els;\n",
"file_path": "VTK/Utilities/vtkexodus2/include/exodusII_int.h",
"rank": 0,
"score": 239731.76580513327
},
{
"content": "class VTK_PARALLEL_EXPORT vtkPCellDataToPointData : public vtkCellDataToPointData\n\n{\n\npublic:\n\n vtkTypeRevisionMacro(... |
C++ | src/ellipse.cpp | DavidR86/mxd | bf0a72305701dd5c76c2b3daa4bdba14d638b29d |
#include "ellipse.hpp"
#include <cmath>
#include <iostream>
#include <memory>
#include "program.hpp"
#include "shader.hpp"
#include "time_point.hpp"
#include "utilities.hpp"
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <glm/glm.hpp>
namespace {
nzl::Program create_program() {
const std::string vertex... |
#include "ellipse.hpp"
#include <cmath>
#include <iostream>
#include <memory>
#include "program.hpp"
#include "shader.hpp"
#include "time_point.hpp"
#include "utilities.hpp"
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <glm/glm.hpp>
namespace {
nzl::Program create_program() {
const std::string vertex... |
}
namespace nzl {
struct Ellipse::IDContainer {
glm::vec3 m_color;
unsigned int m_vao_id;
unsigned int m_vbo_id;
int m_number_of_points{0};
nzl::Program m_program;
IDContainer(glm::vec3 color, float rX, float rY, float number_of_points)
: m_color{color}, m_program{create_program()} {
glGenVe... | i < number_of_points; i++) {
float x = rX * cos(i * step_size);
float y = rY * sin(i * step_size);
points.emplace_back(x, y, 0.0f);
}
return points;
} | function_block-function_prefixed | [
{
"content": "class Program {\n\n public:\n\n /// @brief Create a Program from the given @link Shader Shaders@endlink.\n\n /// @param shaders Shaders to be used to create this Program.\n\n Program(std::vector<nzl::Shader> shaders);\n\n\n\n /// @brief Creates a Program with an empty @link Shader@endlink vect... |
C++ | Ai.cpp | NicoSchumann/TicTacToe | df7349ebd82dfbc2561b4dc1b4627917d4067845 | #include "Ai.hpp"
#include <ctime>
#include <climits>
Ai::Ai(Mark aiPlayer)
: m_aiPlayer(aiPlayer)
, m_pointsAtLost(-1)
, m_pointsAtWin(1)
, m_pointsAtDraw(0)
{}
Ai::Ai()
: Ai(Mark::empty)
{}
RandomAi::RandomAi(const Mark aiPlayer)
: Ai::Ai(aiPlayer)
, m_randomRounds(100)
{
std::srand(std::time(0));
}
RandomAi:... | #include "Ai.hpp"
#include <ctime>
#include <climits>
Ai::Ai(Mark aiPlayer)
: m_aiPlayer(aiPlayer)
, m_pointsAtLost(-1)
, m_pointsAtWin(1)
, m_pointsAtDraw(0)
{}
Ai::Ai()
: Ai(Mark::empty)
{}
RandomAi::RandomAi(const Mark aiPlayer)
: Ai::Ai(aiPlayer)
, m_randomRounds(100)
{
std::srand(std::time(0));
}
RandomAi:... | No = -1;
int fieldVal;
if(currPlayer == Mark::cross)
{
fieldVal = INT_MIN;
}
else if (currPlayer == Mark::ring)
{
fieldVal = INT_MAX;
}
Mark changedPlayer = (currPlayer == Mark::cross ? Mark::ring : Mark::cross);
for (int i = 0; i < 9; ++i)
{
i... | ield;
}
MinimaxAi::MinimaxAi(const Mark aiPlayer)
: Ai::Ai(aiPlayer)
{}
MinimaxAi::MinimaxAi()
: MinimaxAi(Mark::empty)
{}
int
MinimaxAi::getSuggestedField(const Board & board, const Mark currPlayer)
{
if (board.evaluate() != State::inProgress)
{
return -1;
}
int field | random | [
{
"content": "class Board\n\n{\n\npublic:\n\n Board();\n\n Board(const Board &);\n\n\n\n /** Sets all fields of Board to Mark::empty */\n\n void reset();\n\n\n\n /** Sets a field of the Board class */\n\n void setMark( Mark mark, std::size_t field);\n\n\n\n /** Returns a Board's field value... |
C++ | hxalignmicrotubules/mtalign/matchingGreedy.cpp | zibamira/microtubulestitching | 8322b71701e33fde0400715cd5b4e855779e4eda | #include <hxalignmicrotubules/mtalign/matchingGreedy.h>
#include <mclib/internal/McComparators.h>
#include <mclib/McDArray.h>
#include <mclib/McMath.h>
#include <mclib/McPlane.h>
#include <mclib/internal/McSorter.h>
#include <mclib/McVec3.h>
#include <hxalignmicrotubules/mtalign/NullPointRepresentation.h>
#include <h... | #include <hxalignmicrotubules/mtalign/matchingGreedy.h>
#include <mclib/internal/McComparators.h>
#include <mclib/McDArray.h>
#include <mclib/McMath.h>
#include <mclib/McPlane.h>
#include <mclib/internal/McSorter.h>
#include <mclib/McVec3.h>
#include <hxalignmicrotubules/mtalign/NullPointRepresentation.h>
#include <h... |
}
bool getNextMatchingPair(int& set1PointIx, int& set2PointIx,
double& dist2) {
if (currListIndex < sortedDist2List.size()) {
int ix1, ix2;
do {
ix1 = pointCorrespondence[sortedDist2List[currListIndex]][0];
if (pointS... | if (pointDist2.size() > 0) {
McIndexByValueComparator<double> comparator(&pointDist2[0]);
sort(&(sortedDist2List[0]), sortedDist2List.size(), comparator);
} | if_condition | [
{
"content": "/// Approximate inference algorithm \"Tree Expectation Propagation\" [\\ref MiQ04]\n\nclass TreeEP : public JTree {\n\n private:\n\n /// Maximum difference encountered so far\n\n Real _maxdiff;\n\n /// Number of iterations needed\n\n size_t ... |
C++ | net/ias/mmc/nap/machineenumtask.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f |
#include "Precompiled.h"
#include "MachineEnumTask.h"
#include "MachineNode.h"
CMachineEnumTask::CMachineEnumTask( CMachineNode * pMachineNode )
{
TRACE_FUNCTION("CMachineEnumTask::CMachineEnumTask");
_ASSERTE( pMachineNode != NULL );
m_pMachineNode = pMachineNode;
}
C... |
#include "Precompiled.h"
#include "MachineEnumTask.h"
#include "MachineNode.h"
CMachineEnumTask::CMachineEnumTask( CMachineNode * pMachineNode )
{
TRACE_FUNCTION("CMachineEnumTask::CMachineEnumTask");
_ASSERTE( pMachineNode != NULL );
m_pMachineNode = pMachineNode;
}
C... |
STDMETHODIMP CMachineEnumTask::CopyState( CMachineEnumTask * pSourceMachineEnumTask )
{
TRACE_FUNCTION("CMachineEnumTask::CopyState");
m_pMachineNode = pSourceMachineEnumTask->m_pMachineNode;
m_index = pSourceMachineEnumTask->m_index;
m_type = pSourceMachineEnumTask->m_type;
return S_OK;
}
... | STDMETHODIMP CMachineEnumTask::Next (ULONG celt, MMC_TASK *rgelt, ULONG *pceltFetched)
{
TRACE_FUNCTION("CMachineEnumTask::Next");
if ((rgelt == NULL) || (pceltFetched == NULL))
{
return E_INVALIDARG;
}
_ASSERTE(!IsBadWritePtr (rgelt, celt*sizeof(MMC_TASK)));
_ASSERTE(!IsBadWritePtr (pce... | function_block-full_function | [] |
C++ | Analysis/AnalysisOrg/IO/CaptureImageState.cpp | konradotto/TS | bf088bd8432b1e3f4b8c8c083650a30d9ef2ae2e |
#include "CaptureImageState.h"
#include "IonH5File.h"
#include "IonH5Arma.h"
#include "ImageTransformer.h"
#include "Vecs.h"
#include <malloc.h>
CaptureImageState::CaptureImageState(std::string _h5File)
{
h5file = _h5File;
}
void CaptureImageState::CleanUpOldFile()
{
if (isFile (h5file.c_str()))
remove(h5fi... |
#include "CaptureImageState.h"
#include "IonH5File.h"
#include "IonH5Arma.h"
#include "ImageTransformer.h"
#include "Vecs.h"
#include <malloc.h>
CaptureImageState::CaptureImageState(std::string _h5File)
{
h5file = _h5File;
}
void CaptureImageState::CleanUpOldFile()
{
if (isFile (h5file.c_str()))
remove(h5fi... |
void CaptureImageState::LoadImageGainCorrection(int rows, int cols)
{
std::string h5_name = h5file + ":/imgGain/gain_corr";
std::vector<float> gain;
printf("[CaptureImageState] Loading Image gain correction from %s\n",h5file.c_str());
H5File::ReadVector (h5_name, gain);
if (ImageTransformer::gain_c... | assert ( !isnan(ImageTransformer::gain_correction[row*cols + col]) );
}
}
std::string h5_name = h5file + ":/imgGain/gain_corr";
assert(ImageTransformer::gain_correction != NULL);
std::vector<float> gain(ImageTransformer::gain_correction, ImageTransformer::gain_correction + rows*cols);
printf("[Captur... | function_block-function_prefix_line | [
{
"content": " int row, col; //upper left corner Row and Column\n",
"file_path": "Analysis/Region.h",
"rank": 0,
"score": 125457.39546282355
},
{
"content": "__device__\n",
"file_path": "Analysis/BkgModel/CUDA/CudaUtils.h",
"rank": 1,
"score": 119857.84740344397
},
{
"co... |
C++ | modules/audio_processing/aec3/aec_state_unittest.cc | imxiangpeng/webrtc | 8078c53c2f8ed487b1c6bbdf3d541f7a5884ed70 |
#include "webrtc/modules/audio_processing/aec3/aec_state.h"
#include "webrtc/modules/audio_processing/logging/apm_data_dumper.h"
#include "webrtc/test/gtest.h"
namespace webrtc {
TEST(AecState, NormalUsage) {
ApmDataDumper data_dumper(42);
AecState state;
FftBuffer X_buffer(Aec3Optimization::kNone, 30, std::... |
#include "webrtc/modules/audio_processing/aec3/aec_state.h"
#include "webrtc/modules/audio_processing/logging/apm_data_dumper.h"
#include "webrtc/test/gtest.h"
namespace webrtc {
TEST(AecState, NormalUsage) {
ApmDataDumper data_dumper(42);
AecState state;
FftBuffer X_buffer(Aec3Optimization::kNone, 30, std::... | ;
EXPECT_TRUE(state.ActiveRender());
state.Update(converged_filter_frequency_response, rtc::Optional<size_t>(2),
X_buffer, E2_main, E2_shadow, Y2, x, echo_path_variability,
false);
EXPECT_FALSE(state.EchoLeakageDetected());
state.Update(converged_filter_frequency_response, rtc... | state.Update(converged_filter_frequency_response, rtc::Optional<size_t>(2),
X_buffer, E2_main, E2_shadow, Y2, x, echo_path_variability,
false) | call_expression | [
{
"content": "namespace webrtc {\n\n\n\n// This function sleeps for the specified number of milliseconds.\n\n// It may return early if the thread is woken by some other event,\n\n// such as the delivery of a signal on Unix.\n\nvoid SleepMs(int msecs);\n\n\n",
"file_path": "system_wrappers/include/sleep.h",
... |
C++ | tests/src/memory_operations/interleavelo.cpp | mkeryell/MIPP | f562541b824d7d5a5cdbdecdf2bf357bc7b47f9e | #include <exception>
#include <algorithm>
#include <numeric>
#include <random>
#include <cmath>
#include <mipp.h>
#include <catch.hpp>
template <typename T>
void test_reg_interleavelo()
{
T inputs1[mipp::N<T>()], inputs2[mipp::N<T>()];
std::mt19937 g;
std::iota (inputs1, inputs1 + mipp::N<T>(), (T)0);
std::shuff... | #include <exception>
#include <algorithm>
#include <numeric>
#include <random>
#include <cmath>
#include <mipp.h>
#include <catch.hpp>
template <typename T>
void test_reg_interleavelo()
{
T inputs1[mipp::N<T>()], inputs2[mipp::N<T>()];
std::mt19937 g;
std::iota (inputs1, inputs1 + mipp::N<T>(), (T)0);
std::shuff... |
#if defined(MIPP_AVX512)
TEST_CASE("Interleave4 low - mipp::Reg", "[mipp::interleavelo4]")
{
#if defined(MIPP_64BIT)
SECTION("datatype = double") { test_Reg_interleavelo4<double>(); }
#endif
SECTION("datatype = float") { test_Reg_interleavelo4<float>(); }
#if defined(MIPP_64BIT)
SECTION("datatype = int64_t") { te... | ipp::N<T>(), (T)0);
std::shuffle(inputs1, inputs1 + mipp::N<T>(), g);
std::iota (inputs2, inputs2 + mipp::N<T>(), (T)0);
std::shuffle(inputs2, inputs2 + mipp::N<T>(), g);
mipp::Reg<T> r1 = inputs1;
mipp::Reg<T> r2 = inputs2;
mipp::Reg<T> ri = mipp::interleavelo4(r1, r2);
for (auto j = 0; j < 4; j++)
... | function_block-function_prefixed | [
{
"content": "struct Converter<float> {\n\n static_assert(sizeof(float) == sizeof(int32_t), \"Important ULP matcher assumption violated\");\n\n Converter(float f) {\n\n std::memcpy(&i, &f, sizeof(f));\n\n }\n\n int32_t i;\n\n};\n\n\n\ntemplate <>\n",
"file_path": "tests/lib/Catch2/include... |
C++ | MagicSquareAndPipes.cpp | Sigrec/School-Projects | 54dec4b6d38eb9b0c020c02d2a7f57b14e52bce2 |
#include <iostream>
#include <unistd.h>
#include <sys/utsname.h>
#include <math.h>
#include <cstring>
#include <sys/wait.h>
#define SQUARE_SIZE 9 // The max number of characters that can be used for a sequence
void DisplaySystemInfo(){
printf("System Info: \n");
char domainname[256];
char hostname... |
#include <iostream>
#include <unistd.h>
#include <sys/utsname.h>
#include <math.h>
#include <cstring>
#include <sys/wait.h>
#define SQUARE_SIZE 9 // The max number of characters that can be used for a sequence
void DisplaySystemInfo(){
printf("System Info: \n");
char domainname[256];
char hostname... |
if (uname(&userdata) == 0){
printf("System Name: %s\n", userdata.sysname);
printf("Node Name: %s\n", userdata.nodename);
printf("Release: %s\n", userdata.release);
printf("Version: %s\n", userdata.version);
printf("Machine: %s\n", userdata.machine);
printf("Domain ... | if (gethostname(hostname, 256) == 0){
printf("Host Name: %s\n", hostname);
}
else {
perror("gethostname() error");
} | if_condition | [
{
"content": "\tprivate final String cityName;\n",
"file_path": "Dijkstra Airport Project/City.java",
"rank": 0,
"score": 20715.04630860246
},
{
"content": "#include <iostream>\n\n#include <vector>\n\n#include \"Part3ThreadedModifier.h\"\n\n#include \"FileModifyException.h\"\n\n#include \"Fi... |
C++ | soundmaker.cpp | increpare/beatio | 68fa8400f4d97d85f1df1b0ffe372c6d9b5dae69 | #include "soundmaker.h"
extern "C" {
#include <sndfile.h>
}
#include <math.h>
#include <iostream>
#include <QFileInfo>
using namespace std;
#ifndef M_PI
#define M_PI 3.14159265358979323846264338
#endif
#define SAMPLE_RATE 44100
#define AMPLITUDE (0.5 * 0x7F000000)
#define LEFT_FREQ (344.0 / SAMPLE_... | #include "soundmaker.h"
extern "C" {
#include <sndfile.h>
}
#include <math.h>
#include <iostream>
#include <QFileInfo>
using namespace std;
#ifndef M_PI
#define M_PI 3.14159265358979323846264338
#endif
#define SAMPLE_RATE 44100
#define AMPLITUDE (0.5 * 0x7F000000)
#define LEFT_FREQ (344.0 / SAMPLE_... | int* SoundMaker::GenerateWave(QVector<Note> onsets, int& framecount)
{
if (onsets.size()==0)
return false;
int length = ceil(onsets.last().onset)+1;
int frame_count = SAMPLE_RATE*length;
framecount=frame_count;
SF_INFO sfinfo ;
int k ;
int *buffer ;
buffer = new int[2 *... | function_block-full_function | [
{
"content": " {\n\n //int value=(int)(32767.0*sin(2.0*M_PI*((double)(i))*(double)(400)/SYSTEM_FREQ));\n\n int value = _buffer[i];\n\n //putShort(start, value&65535);\n\n putShort(start, (value/65536)&65535);\n\n start += 2;\n\n }\n\n\n\n std::cout<<\"DELETE BUFFER2\"... | |
C++ | perf_test/blas/blas1/KokkosBlas_team_dot_perf_test.cpp | NexGenAnalytics/kokkos-kernels | 8381db0486674c1be943de23974821ddfb9e6c29 |
#include <Kokkos_Core.hpp>
#include <KokkosBlas1_team_dot.hpp>
#include <Kokkos_Random.hpp>
struct Params {
int use_cuda = 0;
int use_openmp = 0;
int use_threads = 0;
int m = 100000;
int repeat = 1;
};
void print_options() {
std::cerr << "Options:\n" << std::endl;
std::cerr << "\tBACKEND:... |
#include <Kokkos_Core.hpp>
#include <KokkosBlas1_team_dot.hpp>
#include <Kokkos_Random.hpp>
struct Params {
int use_cuda = 0;
int use_openmp = 0;
int use_threads = 0;
int m = 100000;
int repeat = 1;
};
void print_options() {
std::cerr << "Options:\n" << std::endl;
std::cerr << "\tBACKEND:... | eturn 1;
#endif
}
if (useSerial) {
#if defined(KOKKOS_ENABLE_SERIAL)
run<Kokkos::Serial>(params.m, params.repeat);
#else
std::cout << "ERROR: Serial device requested, but not available; here, "
"implementation of dot is explicitly parallel.\n";
return 1;
#endif
}
Kokkos::finalize();... | :cerr << "\t[Optional] --repeat :: how many times to repeat overall "
"dot (symbolic + repeated numeric)"
<< std::endl;
}
int parse_inputs(Params& params, int argc, char** argv) {
for (int i = 1; i < argc; ++i) {
if (0 == strcasecmp(argv[i], "--help") || 0 == strcasecmp(argv[i], "-h"))... | random | [
{
"content": "struct MultiGemm<int,int,int,Kokkos::Cuda,Kokkos::LayoutRight,Kokkos::LayoutRight,Kokkos::LayoutRight,int,2>{\n\n static void GEMM(const char transA, const char transB, int alpha,\n\n Kokkos::View<int**,Kokkos::LayoutRight,Kokkos::Cuda> A, Kokkos::View<int**,Kokkos::LayoutRight,Kok... |
C++ | tools/clang/lib/Analysis/CallGraph.cpp | nettrino/IntFlow | 0400aef5da2c154268d8b020e393c950435395b3 |
#include "clang/Analysis/CallGraph.h"
#include "clang/AST/ASTContext.h"
#include "clang/AST/Decl.h"
#include "clang/AST/StmtVisitor.h"
#include "llvm/Support/GraphWriter.h"
using namespace clang;
namespace {
class CGBuilder : public StmtVisitor<CGBuilder> {
CallGraph *G;
CallGraphNode *CallerNode;
public:
... |
#include "clang/Analysis/CallGraph.h"
#include "clang/AST/ASTContext.h"
#include "clang/AST/Decl.h"
#include "clang/AST/StmtVisitor.h"
#include "llvm/Support/GraphWriter.h"
using namespace clang;
namespace {
class CGBuilder : public StmtVisitor<CGBuilder> {
CallGraph *G;
CallGraphNode *CallerNode;
public:
... |
};
}
| static std::string getNodeLabel(const CallGraphNode *Node,
const CallGraph *CG) {
if (CG->getRoot() == Node) {
return "< root >";
}
return Node->getName();
} | function_block-function_prefix_line | [] |
C++ | source/code/iceshard/iceshard/private/world/iceshard_world.cxx | iceshard-engine/engine | 4f2092af8d2d389ea72addc729d0c2c8d944c95c | #include "iceshard_world.hxx"
#include <ice/world/world_trait.hxx>
#include <ice/engine_runner.hxx>
#include <ice/engine_frame.hxx>
#include <ice/engine_shards.hxx>
#include <ice/pod/hash.hxx>
#include <ice/assert.hxx>
#include "iceshard_world_portal.hxx"
namespace ice
{
IceshardWorld::IceshardWorld... | #include "iceshard_world.hxx"
#include <ice/world/world_trait.hxx>
#include <ice/engine_runner.hxx>
#include <ice/engine_frame.hxx>
#include <ice/engine_shards.hxx>
#include <ice/pod/hash.hxx>
#include <ice/assert.hxx>
#include "iceshard_world_portal.hxx"
namespace ice
{
IceshardWorld::IceshardWorld... | ;
}
}
auto IceshardWorld::traits() noexcept -> ice::pod::Array<ice::WorldTrait*>&
{
return _traits;
}
}
| entry.value->trait()->on_update(
runner.current_frame(),
runner,
*entry.value
) | call_expression | [
{
"content": "inline void* b2Alloc(void* alloc, ice::i32 size)\n\n{\n\n return reinterpret_cast<ice::Allocator*>(alloc)->allocate(static_cast<ice::u32>(size));\n",
"file_path": "source/code/framework/framework_base/private/traits/physics/b2_user_settings.h",
"rank": 0,
"score": 39755.43515219723
... |
C++ | Src/main.cpp | KuhakuPixel/TempestPixyEngine | 929d2952e2b4a83a85287c3030accade5ae449e2 | #include <string.h>
#include <iostream>
#include <string>
#include "board.h"
#include "CharHelper.h"
#include "math.h"
#include "chessLib.h"
#include "evaluation.h"
#include "search.h"
#include "stringHelper.h"
void StartEngineUci()
{
std::string startFenPosition = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQ... | #include <string.h>
#include <iostream>
#include <string>
#include "board.h"
#include "CharHelper.h"
#include "math.h"
#include "chessLib.h"
#include "evaluation.h"
#include "search.h"
#include "stringHelper.h"
void StartEngineUci()
{
std::string startFenPosition = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQ... |
int main(int argc, char *argv[])
{
printf("Tempest Pixy engine\n");
while (true)
{
std::string command = "";
std::cin >> command;
if (command == "uci")
{
printf("id name Tempest-Pixy-Engine 1.0.0\n");
printf("id author Kuhaku Pixel\n");
p... | 1);
evaluation.InitializeKnightPeriphery1(-0.18);
evaluation.InitializeKnightPeriphery2(+0.54);
evaluation.InitializeKnightPeriphery3(+0.1);
while (true)
{
std::string colorToMove = board.GetCurrentTurnStr();
std::string bestMove = "";
printf("Side to move %s \n", colorToMove... | function_block-function_prefixed | [
{
"content": "#pragma once\n\n#include <string>\n\n#include <map>\n\n#include \"CharHelper.h\"\n\n#include <vector>\n\n#include \"chessLib.h\"\n\n#include \"square.h\"\n\nclass Board\n\n{\n\nprivate:\n\n std::vector<MoveFlag> blackCastlingRights = {MoveFlag::shortCastle, MoveFlag::longCastle};\n\n std::ve... |
C++ | RedeNeural.cpp | AndreSFND/evolutive-agario | cb974d89d413e5db56fda06d6eb18a43aecf1658 |
#include <iostream>
#include <vector>
#include <list>
#include <cstdlib>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include "RedeNeural.h"
using namespace std;
RedeNeural::RedeNeural(double _input[], double _biasNeuron, double _biasOutput)
{
for(int i = 0; i < N_INPUTS; i++)
{
... |
#include <iostream>
#include <vector>
#include <list>
#include <cstdlib>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include "RedeNeural.h"
using namespace std;
RedeNeural::RedeNeural(double _input[], double _biasNeuron, double _biasOutput)
{
for(int i = 0; i < N_INPUTS; i++)
{
... |
void RedeNeural::setAxonsOut(double _axonsOut[][N_OUTPUTS])
{
for(int i = 0; i < N_NEURONS; i++)
{
for(int j = 0; j < N_OUTPUTS; j++)
{
axons.axonsOut[i][j] = _axonsOut[i][j];
}
}
}
void RedeNeural::setNeuron(double _neuron[])
{
for(int i = 0; i < N_NEURONS; i++)
{
neuron[i] = _neuron[i];
}
}
void Red... | void RedeNeural::setAxonsIn(double _axonsIn[][N_NEURONS])
{
for(int i = 0; i < N_INPUTS; i++)
{
for(int j = 0; j < N_NEURONS; j++)
{
axons.axonsIn[i][j] = _axonsIn[i][j];
}
}
} | function_block-full_function | [
{
"content": "// Leonardo Antonetti da Motta - ICMC USP 11275338\n\n\n\n#include <iostream> \n\n#include <vector>\n\n#include <list>\n\n#include <cstdlib>\n\n#include <math.h>\n\n#include <time.h>\n\n#include <stdlib.h>\n\n#include <stdio.h>\n\n\n\nusing namespace std;\n\n\n\n#define MIN_AXON -1\n\n#define MAX_... |
C++ | network/gameserver/proto.hpp | hbccdf/network-core | 37cbf03829bffd9c0903a1e755ce1f96f46e3dfa | #pragma once
#include "network/net/tcp_connect.hpp"
#include "msg_pack.hpp"
namespace cytx
{
namespace gameserver
{
namespace detail
{
using namespace cytx;
using namespace cytx::gameserver;
class Proto;
class game_server;
using game_... | #pragma once
#include "network/net/tcp_connect.hpp"
#include "msg_pack.hpp"
namespace cytx
{
namespace gameserver
{
namespace detail
{
using namespace cytx;
using namespace cytx::gameserver;
class Proto;
class game_server;
using game_... |
protected:
Proto(uint32_t id)
: protocol_id_(id)
, has_ctx_process_(false)
{}
uint32_t protocol_id_;
bool has_ctx_process_;
};
template<typename T>
auto make_proto_p... | static void RegisterProto(proto_ptr_t proto)
{
uint32_t proto_id = proto->get_protocol_id();
if (!GetProto(proto_id))
{
auto& proto_map = GetMap();
proto_map.emplace(proto_id, proto);
... | function_block-full_function | [
{
"content": "class UseSkill : public virtual ::apache::thrift::TBase {\n\n public:\n\n\n\n UseSkill(const UseSkill&);\n\n UseSkill& operator=(const UseSkill&);\n\n UseSkill() : skillId(0) {\n\n }\n\n\n\n virtual ~UseSkill() throw();\n\n int32_t skillId;\n\n std::vector<int32_t> targetIds;\n\n\n\n _Use... |
C++ | ModuleObstacle.cpp | BravoXavi/Space-Harrier-MVJ- | cfc3d6f392b926faa0b88a2acb8c89db24a626d7 | #include <math.h>
#include "ModuleObstacle.h"
#include "Application.h"
#include "ModuleAudio.h"
#include "ModuleTextures.h"
#include "ModuleRender.h"
#include "ModuleCollision.h"
#include "ModuleParticles.h"
#include "ModuleShadows.h"
#include "ModulePlayer.h"
#include "SDL/include/SDL_timer.h"
ModuleObstacle::ModuleO... | #include <math.h>
#include "ModuleObstacle.h"
#include "Application.h"
#include "ModuleAudio.h"
#include "ModuleTextures.h"
#include "ModuleRender.h"
#include "ModuleCollision.h"
#include "ModuleParticles.h"
#include "ModuleShadows.h"
#include "ModulePlayer.h"
#include "SDL/include/SDL_timer.h"
ModuleObstacle::ModuleO... | oat)anim.GetCurrentFrame().w * scaleValue;
float newHeight = (float)anim.GetCurrentFrame().h * scaleValue;
if (newHeight < 2.0f)
newHeight = 2.0f;
if (newWidth < 1.0f)
newWidth = 1.0f;
worldPosition.z = ((float)SCREEN_HEIGHT - tempY) / (App->renderer->horizonY / (float)MAX_Z);
xOffset -= App->render... | or it = active.begin(); it != active.end(); ++it)
RELEASE(*it);
active.clear();
return true;
}
update_status ModuleObstacle::PreUpdate()
{
for (list<Obstacle*>::iterator it = active.begin(); it != active.end();)
{
if ((*it)->to_delete == true)
{
RELEASE(*it);
it = active.erase(it);
}
else
++it... | random | [
{
"content": "struct Obstacle\n\n{\n\n\tObstacle();\n\n\tObstacle(const Obstacle& p);\n\n\t~Obstacle();\n\n\n\n\tvoid Update();\n\n\n\n\tconst float calculateScaleValue(float yRender) const;\n\n\tvoid setRect(SDL_Texture* texture, const float& x, const float& y, const float& z, const float& newWidth, const floa... |
C++ | Sources/Modules/Core/Logger.cpp | benkaraban/anima-games-engine | 8aa7a5368933f1b82c90f24814f1447119346c3b |
#include <Core/Logger.h>
#include <Core/IO/FileStream.h>
#include <Core/System/Files.h>
namespace Core
{
using namespace Core::System;
LoggerMessage::LoggerMessage() :
_msg(new Core::BufferStream())
{
}
LoggerMessage::~LoggerMessage()
{
}
String LoggerMessage::getLastLine()
{
String8 str... |
#include <Core/Logger.h>
#include <Core/IO/FileStream.h>
#include <Core/System/Files.h>
namespace Core
{
using namespace Core::System;
LoggerMessage::LoggerMessage() :
_msg(new Core::BufferStream())
{
}
LoggerMessage::~LoggerMessage()
{
}
String LoggerMessage::getLastLine()
{
String8 str... |
if (_showTagMsgLevel)
{
switch(_msgLevel)
{
case L_ERROR:
str += L"ERR";
break;
case L_WARNING:
str += L"WAR";
break;
case L_INFO:
str += L"INF";
break;
... | if (_showTagThreadId)
{
str += Core::toStringHex(Thread::getCurrentThreadID(), 4);
str += LOGGER_TAG_SEPARATOR;
} | if_condition | [] |
C++ | problem/Tree/Shortest distance between two nodes.cpp | mechusatveer/coding-questions | a86b41f753ffd70001357ab059ee0cb63c7914ff |
#include<iostream>
#include<list>
using namespace std;
struct Node {
int val;
Node *plft;
Node *prgt;
Node(int v) : val(v), plft(NULL), prgt(NULL) {}
};
bool GetNodePath(Node *root, Node *node, list<Node*>& path) {
if (root == node) return true;
path.push_back(root);
bool found = fals... |
#include<iostream>
#include<list>
using namespace std;
struct Node {
int val;
Node *plft;
Node *prgt;
Node(int v) : val(v), plft(NULL), prgt(NULL) {}
};
bool GetNodePath(Node *root, Node *node, list<Node*>& path) {
if (root == node) return true;
path.push_back(root);
bool found = fals... |
}
int main() {
Node *root = new Node(1);
root->plft = new Node(2);
root->prgt = new Node(3);
root->plft->plft = new Node(4);
root->plft->prgt = new Node(5);
root->prgt->plft = new Node(6);
root->prgt->prgt = new Node(7);
root->prgt->prgt->plft = new Node(8);
root->prgt->prgt->prgt... | if (lca) {
bool found = false;
int dist1 = Height(lca, node1, found);
cout<<"Distance of "<<node1->val<<": "<<dist1<<endl;
found = false;
int dist2 = Height(lca,node2,found);
cout<<"Distance of "<<node2->val<<": "<<dist2<<endl;
return dist1 + dist2;
} else {
... | if_condition | [
{
"content": "struct Node {\n\n int val;\n\n Node* plft;\n\n Node* prgt;\n\n\n\n\tNode(int v) : val(v), plft(NULL), prgt(NULL) {}\n\n};\n\n\n\n\n\n//need finish this version\n\n\n\nint main() {\n\n\n\n\t/*\n\n\tNode *root = new Node(1);\n\n\troot->plft = new Node(2);\n\n\troot->prgt = new Node(3);\n\n\... |
C++ | mindspore/ccsrc/runtime/device/memory_offload_strategy.cc | zhz44/mindspore | 6044d34074c8505dd4b02c0a05419cbc32a43f86 |
#include "runtime/device/memory_offload_strategy.h"
#include <vector>
#include <map>
#include <memory>
#include <utility>
#include "utils/log_adapter.h"
namespace mindspore {
namespace device {
constexpr size_t kFirstGetMemEventIndex = 1;
constexpr size_t kInitOrMallocMemEventIndex = 0;
std::vector<std::shared_ptr<M... |
#include "runtime/device/memory_offload_strategy.h"
#include <vector>
#include <map>
#include <memory>
#include <utility>
#include "utils/log_adapter.h"
namespace mindspore {
namespace device {
constexpr size_t kFirstGetMemEventIndex = 1;
constexpr size_t kInitOrMallocMemEventIndex = 0;
std::vector<std::shared_ptr<M... | rt(min_swap_index_before_update);
}
return swap_out_event_index;
}
}
}
| ) {
(void)swap_events_.emplace(event);
}
}
return;
}
std::vector<size_t> cur_mem_used(min_mem_used_.begin(), min_mem_used_.end());
for (const auto &iter : event_span_) {
auto span = iter.second.second;
auto &event = iter.second.first;
auto start_index = ((event->index + total... | random | [] |
C++ | example-ofxDownloadCentral/src/ofApp.cpp | hushstudios/ofxSimpleHttp | 5dd8f761381a5abb05913d0a7c50f5611a7aebcf | #include "ofApp.h"
void ofApp::setup(){
ofSetFrameRate(60);
ofBackground(22);
ofSetWindowPosition(20, 20);
downloader.setNeedsChecksumMatchToSkipDownload(true);
downloader.setIdleTimeAfterEachDownload(0.2);
downloader.setVerbose(false);
downloader.setMaxConcurrentDownloads(3);
}
void ofApp::downloadFinis... | #include "ofApp.h"
void ofApp::setup(){
ofSetFrameRate(60);
ofBackground(22);
ofSetWindowPosition(20, 20);
downloader.setNeedsChecksumMatchToSkipDownload(true);
downloader.setIdleTimeAfterEachDownload(0.2);
downloader.setVerbose(false);
downloader.setMaxConcurrentDownloads(3);
}
void ofApp::downloadFinis... | allURLS,
allSha1s,
this,
&ofApp::downloadFinished,
"downloads_"
);
downloader.startDownloading();
}else
if(key == '3'){
for(int i = 0; i < allURLS.size(); i++){
downloader.downloadResources(allURLS[i],
this,
... | ort.responses.size()){
if (report.responses[i].ok){
}
i++;
}
}
void ofApp::update(){
downloader.update();
}
void ofApp::draw(){
ofSetColor(255);
drawClock();
downloader.draw(30,30, true, false);
string msg = "press 1 to download a file and supply a correct SHA1\n";
msg += "press 2 to download a f... | random | [
{
"content": "struct ofxBatchDownloaderReport{\n\n\tstd::string downloadPath;\t\t\t\t\t\t//full path to the directory that holds the downloads\n\n\tofxBatchDownloader* owner;\t\t\t\t\t//pointer to the object in charge of the downloads\n\n\tstd::vector<std::string> attemptedDownloads;\t\t\t//this vector contains... |
C++ | lizy1.kurisu/include/lizy1/impl/kurisu/BuiltInCase.hpp | li-zhong-yuan/lizy1.kurisu | dba9136bfc966e2e81bee2b469ae4cc3a8157ca4 |
namespace lizy1::kurisu::impl_K {
template<class T> constexpr std::uint64_t fundamental_digest()
{
if constexpr(std::same_as<T, std::nullptr_t>)
return 0x0000000000000000;
if constexpr(_in<T, _P<signed char, unsigned char>>::value)
return 0x3CFE619CFCD8... |
namespace lizy1::kurisu::impl_K {
template<class T> constexpr std::uint64_t fundamental_digest()
{
if constexpr(std::same_as<T, std::nullptr_t>)
return 0x0000000000000000;
if constexpr(_in<T, _P<signed char, unsigned char>>::value)
return 0x3CFE619CFCD8... | constexpr std::uint64_t size = sizeof(T) / sizeof(U);
return combine_digests({ feature_code, element_digest, size });
}
template<class Os> requires Dumpable<const U, Os> static void __dump__(Os &os, T const& t) { for(auto &x : t) dump(os, x); }
template<class Os> requires Dumpable<U... | ); }
template<OStream Os> static void __dump__(Os &os, T const& t) { dump_machine_bytes(os, t); }
template<IStream Is> static void __load__(Is &is, T & t) { load_machine_bytes(is, t); }
};
template<lizy1::kurisu::Enumeration T> struct lizy1::kurisu::impl_K::BuiltInCase<T>
{
using U = std::underlying_... | random | [] |
C++ | ttk/core/vtk/ttkFiberSurface/ttkFiberSurface.cpp | julesvidal/wasserstein-pd-barycenter | 1f62a5e1c40700030357b2bfb9a2f86fe4736861 | #include <ttkFiberSurface.h>
using namespace std;
using namespace ttk;
vtkStandardNewMacro(ttkFiberSurface)
ttkFiberSurface::ttkFiberSurface(){
UseAllCores = true;
RangeCoordinates = true;
EdgeParameterization = true;
EdgeIds = true;
TetIds = true;
CaseIds = true;
PointMerge = false;
... | #include <ttkFiberSurface.h>
using namespace std;
using namespace ttk;
vtkStandardNewMacro(ttkFiberSurface)
ttkFiberSurface::ttkFiberSurface(){
UseAllCores = true;
RangeCoordinates = true;
EdgeParameterization = true;
EdgeIds = true;
TetIds = true;
CaseIds = |
ttkFiberSurface::~ttkFiberSurface(){
}
int ttkFiberSurface::doIt(vector<vtkDataSet *> &inputs,
vector<vtkDataSet *> &outputs){
Memory m;
Timer t;
vtkDataSet *input = inputs[0];
vtkUnstructuredGrid *polygon = vtkUnstructuredGrid::SafeDownCast(inputs[1]);
vtkPolyData *output = vtkPolyData::SafeDownCas... | true;
PointMerge = false;
RangeOctree = true;
PointMergeDistanceThreshold = 0.000001;
SetNumberOfInputPorts(2);
} | function_block-function_prefixed | [
{
"content": " class AtomicVector : public std::vector<type>\n\n {\n\n private:\n\n std::size_t nextId;\n\n // for initialization\n\n const type defaultValue;\n\n\n\n public:\n\n AtomicVector(const std::size_t initSize = 1, const type &dv = type{})\n\n : std::vector<type... |
C++ | src/GrainViewer/Ui/Gui.cpp | eliemichel/GrainViewer | 91d4922b3185ada90508f0944f2691ba8eba45e3 |
#include <OpenGL>
#include "Logger.h"
#include "Gui.h"
#include "Window.h"
#include "Scene.h"
#include "Dialog.h"
#include "RuntimeObject.h"
#include "ShaderPool.h"
#include "GlobalTimer.h"
#include "Ui/SceneDialog.h"
#include "Ui/DeferredShadingDialog.h"
#include "Ui/WorldDialog.h"
#include "Ui/GlobalTimerDialog.h"... |
#include <OpenGL>
#include "Logger.h"
#include "Gui.h"
#include "Window.h"
#include "Scene.h"
#include "Dialog.h"
#include "RuntimeObject.h"
#include "ShaderPool.h"
#include "GlobalTimer.h"
#include "Ui/SceneDialog.h"
#include "Ui/DeferredShadingDialog.h"
#include "Ui/WorldDialog.h"
#include "Ui/GlobalTimerDialog.h"... |
void Gui::update() {
updateImGui();
if (m_scene) {
m_scene->update(static_cast<float>(glfwGetTime()) - m_startTime);
if (auto window = m_window.lock()) {
if (m_scene->mustQuit()) {
glfwSetWindowShouldClose(window->glfw(), GL_TRUE);
}
}
}
}
void Gui::updateImGui() {
NewFrame();
ImVec4 clear_color... | g>("Timers", GlobalTimer::GetInstance());
addDialogGroup<SceneDialog>("Scene:", m_scene);
for (const auto& obj : m_scene->objects()) {
DialogGroup group;
group.title = " - " + obj->name;
IBehaviorHolder::ConstBehaviorIterator it, end;
for (it = obj->cbeginBehaviors(), end = obj->cendBehaviors(); it != ... | function_block-function_prefixed | [
{
"content": "class DeferredShadingDialog : public Dialog {\n\npublic:\n\n\tvoid draw() override;\n\n\tvoid drawHandles(float x, float y, float w, float h) override;\n\n\tvoid setController(std::weak_ptr<GlDeferredShader> shading) { m_cont = shading; }\n\n\n\nprivate:\n\n\tstd::weak_ptr<GlDeferredShader> m_cont... |
C++ | main/main.cpp | jmautari/playsound | 5885c693d486c5a417a9ec1a96465d83f5492b1c | #include "shared/platform.h"
#include <mmdeviceapi.h>
#include <Endpointvolume.h>
#include <audioclient.h>
#include <atlbase.h>
#include <Mmsystem.h>
#include <string>
#include <iostream>
#include <filesystem>
constexpr wchar_t kEventName[] = L"PlaySoundEvent";
constexpr wchar_t kOptRepeat[] = L"-r";
constexpr wchar_t... | #include "shared/platform.h"
#include <mmdeviceapi.h>
#include <Endpointvolume.h>
#include <audioclient.h>
#include <atlbase.h>
#include <Mmsystem.h>
#include <string>
#include <iostream>
#include <filesystem>
constexpr wchar_t kEventName[] = L"PlaySoundEvent";
constexpr wchar_t kOptRepeat[] = L"-r";
constexpr wchar_t... | rue, muted);
if (!reset_mic) {
std::cout << "Couldn't get current mic volume. Not muting mic"
<< std::endl;
}
}
} else if (time > 0) {
flags |= SND_ASYNC;
}
PlaySoundW(filename.native().c_str(), nullptr, flags);
if (event_handle != nullptr) {
WaitForSingle... | s = false;
do {
if (!PickDevice(&endPoint)) {
break;
}
hr = endPoint->Activate(__uuidof(IAudioClient), CLSCTX_ALL, NULL,
reinterpret_cast<void**>(&audioClient));
if (FAILED(hr)) {
break;
}
hr = endPoint->Activate(__uuidof(IAudioEndpointVolume),
CLSCTX_INPROC_SERV... | random | [
{
"content": "# Playsound\n\n\n\nSimple utility program to play a wav file.\n\n\n\nPrimarily used by [Widgets][1]\n\n\n\n## Usage\n\n\n\n```\n\nplaysound [options] [path-to-file]\n\n```\n\n\n\nWhere `options` can be:\n\n\n\n`-r` repeat the sound until `playsound` is called again with `-s` option\n\n\n\n`-m` sam... |
C++ | CODE_S1_Wed_Friday/CODE_S1_Wed_Friday/theMainFunction.cpp | Freethetan/INFO3111-S21 | b0526d641c5e744c38e6a48d1b66a47f0d8dd592 | #include "globalStuff.h"
#include <glm/glm.hpp>
#include <glm/vec3.hpp>
#include <glm/vec4.hpp>
#include <glm/mat4x4.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#in... | #include "globalStuff.h"
#include <glm/glm.hpp>
#include <glm/vec3.hpp>
#include <glm/vec4.hpp>
#include <glm/mat4x4.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#in... | eX = glm::rotate(glm::mat4(1.0f),
curMesh.orientation.x,
glm::vec3(1.0f, 0.0, 0.0f));
float uniformScale = curMesh.scale;
matScale = glm::scale(glm::mat4(1.0f), glm::vec3(uniformScale, uniformScale, uniformScale));
matTranslate = glm::tra... | break;
}
glfwSetWindowTitle(window, ssTitle.str().c_str());
glfwSwapBuffers(window);
glfwPollEvents();
doKeyboardMouseStuffAsync(window);
}
delete pShaderManager;
delete pVAOMan;
glfwDestroyWindow(window);
glfwTerminate(... | random | [] |
C++ | tools/trainers/retargetTrainer/src/RetargetArguments.cpp | kernhanda/ELL | 370c0de4e4c190ca0cb43654b4246b3686bca464 |
#include "RetargetArguments.h"
namespace ell
{
void ParsedRetargetArguments::AddArgs(utilities::CommandLineParser& parser)
{
using namespace common;
parser.AddOption(inputModelFilename,
"inputModelFilename",
"imf",
"Name of the pre-trained ELL model file (... |
#include "RetargetArguments.h"
namespace ell
{
void ParsedRetargetArguments::AddArgs(utilities::CommandLineParser& parser)
{
using namespace common;
parser.AddOption(inputModelFilename,
"inputModelFilename",
"imf",
"Name of the pre-trained ELL model file (... |
}
| recision",
"de",
"The desired duality gap at which to stop optimizing",
1.0e-5);
parser.AddOption(maxEpochs,
"maxEpochs",
"me",
"The maximum number of optimization epochs to run",
1000);
parser.AddOption(permute,
... | function_block-function_prefixed | [
{
"content": "class NeuralNetworkPredictorNode : public model::Node\n\n{\n\npublic:\n\n /// @name Input and Output Ports\n\n /// @{\n\n const model::InputPort<ValueType>& input = _input;\n\n const model::OutputPort<ValueType>& output = _output;\n\n /// @}\n\n\n\n using PredictorType = typename... |
C++ | src/Titon/Io/Node.hh | ciklon-z/framework | cbf44729173d3a83b91a2b0a217c6b3827512e44 | <?hh
namespace Titon\Io;
use Titon\Io\Exception\MissingFileException;
use Titon\Io\Exception\ExistingFileException;
use Titon\Utility\Path;
abstract class Node {
const int OVERWRITE = 0;
const int MERGE = 1;
const int SKIP = 2;
protected ?Folder $parent;
protected string $path = '';... | <?hh
namespace Titon\Io;
use Titon\Io\Exception\MissingFileException;
use Titon\Io\Exception\ExistingFileException;
use Titon\Utility\Path;
abstract class Node {
const int OVERWRITE = 0;
const int MERGE = 1;
const int SKIP = 2;
protected ?Folder $parent;
protected string $path = '';... |
public function modifyTime(): int {
if ($this->exists()) {
return filemtime($this->path());
}
return 0;
}
public function move(string $target, bool $overwrite = true): bool {
if (!$this->exists()) {
return false;
}
i... | ->path(), $mode);
}
public function chown(int $user, bool $recursive = false): bool {
if (!$this->exists()) {
return false;
}
$path = $this->path();
$this->reset();
if (is_link($path)) {
return lchown($path, $user);
}
retu... | random | [
{
"content": " public function copy(string $target, int $process = self::MERGE, int $mode = 0755): ?Node {\n\n if (!$this->exists()) {\n\n return null;\n\n }\n\n\n\n // Delete the target folder if overwrite is true\n\n if ($process === self::OVERWRITE && file_exists($ta... |
C++ | net/instaweb/rewriter/webp_optimizer.cc | dimitrilongo/mod_pagespeed | d0d3bc51aa4feddf010b7085872c64cc46b5aae0 |
#include "net/instaweb/rewriter/public/webp_optimizer.h"
#include <csetjmp>
#include <cstddef>
#include "base/logging.h"
#include "pagespeed/kernel/base/basictypes.h"
#include "pagespeed/kernel/base/string.h"
#include "pagespeed/kernel/image/jpeg_reader.h"
#include "pagespeed/kernel/image/jpeg_utils.h"
extern "C" ... |
#include "net/instaweb/rewriter/public/webp_optimizer.h"
#include <csetjmp>
#include <cstddef>
#include "base/logging.h"
#include "pagespeed/kernel/base/basictypes.h"
#include "pagespeed/kernel/base/string.h"
#include "pagespeed/kernel/image/jpeg_reader.h"
#include "pagespeed/kernel/image/jpeg_utils.h"
extern "C" ... |
class WebpOptimizer {
public:
explicit WebpOptimizer(MessageHandler* handler);
~WebpOptimizer();
bool CreateOptimizedWebp(const GoogleString& original_jpeg,
int configured_quality,
WebpProgressHook progress_hook,
void* prog... | int GoogleStringWebpWriter(const uint8_t* data, size_t data_size,
const WebPPicture* const picture) {
GoogleString* compressed_webp =
static_cast<GoogleString*>(picture->custom_ptr);
compressed_webp->append(reinterpret_cast<const char*>(data), data_size);
return 1;
} | function_block-full_function | [
{
"content": "// Bool that is auto-initialized to false\n\nclass Bool {\n\n public:\n\n Bool() : value_(false) {}\n\n Bool(bool value) : value_(value) {} // Copy constructor // NOLINT\n\n const bool Test() const { return value_; }\n\n\n\n private:\n\n bool value_;\n\n};\n\n\n",
"file_path": "pagespeed/... |
C++ | lite/tnn/cv/tnn_rvm.cpp | azuredsky/lite.ai | 2751a7f0cf0970c1ab94b865b96c2f53ee28d545 |
#include "tnn_rvm.h"
using tnncv::TNNRobustVideoMatting;
TNNRobustVideoMatting::TNNRobustVideoMatting(
const std::string &_proto_path,
const std::string &_model_path,
unsigned int _num_threads
) : proto_path(_proto_path.data()),
model_path(_model_path.data()),
log_id(_proto_path.data()),
num... |
#include "tnn_rvm.h"
using tnncv::TNNRobustVideoMatting;
TNNRobustVideoMatting::TNNRobustVideoMatting(
const std::string &_proto_path,
const std::string &_model_path,
unsigned int _num_threads
) : proto_path(_proto_path.data()),
model_path(_model_path.data()),
log_id(_proto_path.data()),
num... |
int TNNRobustVideoMatting::value_size_of(tnn::DimsVector &shape)
{
if (shape.empty()) return 0;
int _size = 1;
for (auto &s: shape) _size *= s;
return _size;
}
void TNNRobustVideoMatting::print_debug_string()
{
std::cout << "LITETNN_DEBUG LogId: " << log_id << "\n";
std::cout << "=============== Input-Di... | else
{
#ifdef LITETNN_DEBUG
std::cout << "src input only support NCHW and NHWC "
"input_data_format, but found others.\n";
#endif
return;
}
src_size = 1 * 3 * input_height * input_width;
for (auto &name: output_names)
output_shapes[name] = BasicTNNHandler::get_output_shape(instan... | function_block-function_prefixed | [
{
"content": "enum Dimensionformat { NHWC, NC4HW4, NCHW };\n",
"file_path": "MNN/expr/Expr.hpp",
"rank": 0,
"score": 159329.26997513027
},
{
"content": "function should be prototyped as void Foo(int,void\\*); , where the first parameter is the trackbar\n\nposition and the second parameter is... |
C++ | stlio.hpp | legokangpalla/FileSTL | 675b2cc1364e8d70be43ec09423dbc45b7b574b0 |
#pragma once
#include <vector>
#include <type_traits>
#include <utility>
#include <fstream>
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix_core.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <boost/spirit/include/phoenix_... |
#pragma once
#include <vector>
#include <type_traits>
#include <utility>
#include <fstream>
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix_core.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <boost/spirit/include/phoenix_... | const size_t num_triangles{ s.normals.size() };
s.attributes.resize(num_triangles);
out.write(reinterpret_cast<const char*>(&num_triangles), 4);
out << num_triangles;
for (size_t i = 0; i < num_triangles; ++i)
{
d... |
inline std::pair< solid, bool > read(IterT begin, IterT end)
{
return read<float>(begin, end);
}
template<typename T>
inline bool read(basic_solid<T>& out, const std::string& fileName)
{
std::ifstream f(fileName, std::ios::binary);
... | random | [
{
"content": "#define BOOST_TEST_MODULE STL_IO\n\n\n\n#include <boost/test/included/unit_test.hpp>\n\n#include <boost/mpl/list.hpp>\n\n\n\n#include <sstream>\n\n\n\n#include \"../stlio.hpp\"\n\n\n\nusing test_types = boost::mpl::list<float, double>;\n\n\n\nusing namespace tyti;\n\n\n\nBOOST_AUTO_TEST_CASE_TEMPL... |
C++ | mxflib/vbi.cpp | Jamaika1/mxflib | 7eefe6da1f76f7de4f2de48322311533369f8ba5 |
#include <mxflib/mxflib.h>
using namespace mxflib;
int ANCVBISource::Field2Offset(void)
{
if(F2Offset >= 0) return F2Offset;
MDObjectPtr Descriptor = MasterSource->GetDescriptor();
if(!Descriptor)
{
error("EssenceDescriptor not defined for master source of ANCVBISource before calling Field2Offset()\n");
F2... |
#include <mxflib/mxflib.h>
using namespace mxflib;
int ANCVBISource::Field2Offset(void)
{
if(F2Offset >= 0) return F2Offset;
MDObjectPtr Descriptor = MasterSource->GetDescriptor();
if(!Descriptor)
{
error("EssenceDescriptor not defined for master source of ANCVBISource before calling Field2Offset()\n");
F2... | );
LS_it++;
}
if(Lines.empty())
{
DataChunkPtr Ret = new DataChunk(2);
PutU16(0, Ret->Data);
return Ret;
}
VBILineMap::iterator it = Lines.begin();
size_t BufferSize = ((*it).second->GetFullDataSize() * Lines.size()) + 2;
DataChunkPtr Ret = new DataChunk(BufferSize);
UInt8 *pBuf... | ANCLineMap::value_type(
LineNumber,
new ANCLine(LineNumber,
(*LS_it)->GetWrappingType(),
(*LS_it)->GetSampleCoding(),
(*LS_it)->GetLineData(),
(*LS_it)->GetDID(),
(*LS_it)->GetSDID())) | call_expression | [
{
"content": "namespace mxflib {}\n",
"file_path": "mxflib/mxflib.h",
"rank": 0,
"score": 89973.22926212748
},
{
"content": "namespace mxflib\n\n{\n\n\n\n\t//! Load classes and types from a Metadictionary object\n\n\t/*! At the point where this function is called, you need to have all the co... |
C++ | include/ftk/mesh/lattice_partitioner.hh | hguo/FTT | f1d5387d6353cf2bd165c51fc717eb5d6b2675ef | #ifndef _FTK_LATTICE_PARTITIONER_HH
#define _FTK_LATTICE_PARTITIONER_HH
#include <ftk/mesh/lattice.hh>
namespace ftk {
struct lattice_partitioner {
lattice_partitioner(const lattice& l_) : l(l_) {}
friend std::ostream& operator<<(std::ostream& os, const lattice_partitioner&);
size_t nd() const {return l.nd... | #ifndef _FTK_LATTICE_PARTITIONER_HH
#define _FTK_LATTICE_PARTITIONER_HH
#include <ftk/mesh/lattice.hh>
namespace ftk {
struct lattice_partitioner {
lattice_partitioner(const lattice& l_) : l(l_) {}
friend std::ostream& operator<<(std::ostream& os, const lattice_partitioner&);
size_t nd() const {return l.nd... | (curr + 1) % ndim;
}
}
partition(prime_factors_dims);
if (cores.size() == 0) return;
for(const auto& core : cores) {
#if 0
auto starts = core.starts(),
sizes = core.sizes();
for(int d = 0; d < ndim; ++d) {
{
size_t offset = starts[d] - l.start(d);
if... |
return factors;
}
inline bool is_vector_zero(const std::vector<size_t> vec) {
if(vec.size() == 0 || (vec.size() == 1 && vec[0] == 0)) {
return true;
}
return false;
}
inline void lattice_partitioner::partition(size_t np) {
std::vector<size_t> vector_zero(0, nd());
partition(np, vector_zero, vector... | random | [
{
"content": "struct formatter<void*, Char> : formatter<const void*, Char> {\n\n template <typename FormatContext>\n\n auto format(void* val, FormatContext& ctx) -> decltype(ctx.out()) {\n\n return formatter<const void*, Char>::format(val, ctx);\n\n }\n\n};\n\n\n\ntemplate <typename Char, size_t N>\n",
... |
C++ | src/menu.cpp | WMXZ-EU/basicSoundRecorder | 3ff2fd5aad50dcd8c29580a05a9247f079a28cc3 |
#include "config.h"
#include "filing.h"
#include "utils.h"
#include "mTime.h"
#include "menu.h"
#define CONFIG_FILE "/Config.txt"
#define LOCK_FILE "/cVAS.lock"
extern SDClass sdx[];
uint16_t store[16];
extern int t_acq;
void storeConfig(uint16_t *store, int ns)
{
File configFile;
char text[32];
... |
#include "config.h"
#include "filing.h"
#include "utils.h"
#include "mTime.h"
#include "menu.h"
#define CONFIG_FILE "/Config.txt"
#define LOCK_FILE "/cVAS.lock"
extern SDClass sdx[];
uint16_t store[16];
extern int t_acq;
void storeConfig(uint16_t *store, int ns)
{
File configFile;
char text[32];
... | e()) ; ch=Serial.read();
if(ch=='s') { Serial.print("\n"); Serial.print("start"); return +1;}
else if(ch=='e') { Serial.print("\n"); Serial.print("stop"); return -1;}
else if(ch=='h') { printMenu(); return 0;}
else if(ch=='w') { saveParameters(); return 0;}
else if(ch=='l') { listDisks(); re... | function_block-function_prefixed | [
{
"content": "void resetMTP(void) ;\n",
"file_path": "src/menu.h",
"rank": 0,
"score": 67831.51723899825
},
{
"content": "void listDisks(void);\n",
"file_path": "src/menu.h",
"rank": 1,
"score": 67804.58596994064
},
{
"content": " void listDisks(void);\n",
"file_pa... | |
C++ | alljoyn_c/samples/about/about_service.cc | liuxiang88/core-alljoyn | 549c966482d9b89da84aa528117584e7049916cb |
#include <alljoyn_c/AboutData.h>
#include <alljoyn_c/AboutListener.h>
#include <alljoyn_c/AboutObj.h>
#include <alljoyn_c/AboutObjectDescription.h>
#include <alljoyn_c/AboutProxy.h>
#include <alljoyn_c/BusAttachment.h>
#include <alljoyn_c/Init.h>
#include <alljoyn/BusAttachment.h>
#include <alljoyn/BusListener.h>
#i... |
#include <alljoyn_c/AboutData.h>
#include <alljoyn_c/AboutListener.h>
#include <alljoyn_c/AboutObj.h>
#include <alljoyn_c/AboutObjectDescription.h>
#include <alljoyn_c/AboutProxy.h>
#include <alljoyn_c/BusAttachment.h>
#include <alljoyn_c/Init.h>
#include <alljoyn/BusAttachment.h>
#include <alljoyn/BusListener.h>
#i... | 256] = { 0 };
#if defined(QCC_OS_GROUP_WINDOWS)
_snprintf(
#else
snprintf(
#endif
interface, ArraySize(interface), "<node>" \
"<interface name='%s'>" \
" <method name='Echo'>" \
" <arg name='out_... | function_block-function_prefixed | [
{
"content": "class BasicService: NSObject, AJNBusListener, AJNSessionPortListener, AJNSessionListener {\n\n\n\n weak var delegate: BasicServiceDelegate?\n\n\n\n private var bus: AJNBusAttachment?\n\n private var basicObject: BasicObject?\n\n\n\n func startServiceAsync() {\n\n DispatchQueue.g... | |
C++ | src/Sound/AttenuationShapes.cpp | SparkyStudios/AmplitudeSDK | bcfb9d9c2fcea8ecd3a540576508f062fb3d5e21 |
#include <Sound/AttenuationShapes.h>
#include <SparkyStudios/Audio/Amplitude/Core/Engine.h>
#include <SparkyStudios/Audio/Amplitude/Core/Log.h>
#include <Core/EngineInternalState.h>
namespace SparkyStudios::Audio::Amplitude
{
AttenuationShape::AttenuationShape()
: m_maxAttenuationFactor(1.0f)
{}
... |
#include <Sound/AttenuationShapes.h>
#include <SparkyStudios/Audio/Amplitude/Core/Engine.h>
#include <SparkyStudios/Audio/Amplitude/Core/Log.h>
#include <Core/EngineInternalState.h>
namespace SparkyStudios::Audio::Amplitude
{
AttenuationShape::AttenuationShape()
: m_maxAttenuationFactor(1.0f)
{}
... | const float outerHalfHeight = _outerHalfHeight - _outerRadius;
hmm_vec3 iA, iB, oA, oB;
switch (amEngine->GetState()->up_axis)
{
default:
case GameEngineUpAxis_Y:
iA = AM_Multiply(lookAt, AM_Vec4(0.0f, innerHalfHeight, 0.0f, 1.0f)).XYZ;
iB = AM_Multipl... | lookAt);
const hmm_vec3& x = listener->GetLocation();
const float distanceToOrigin = AM_Length(x - soundLocation);
const float innerHalfHeight = _innerHalfHeight - _innerRadius;
| random | [
{
"content": " class AttenuationShape\n\n {\n\n public:\n\n /**\n\n * @brief Returns the attenuation factor.\n\n *\n\n * This method is used only for position based sound sources.\n\n *\n\n * @param attenuation The Attenuator object to use for distance att... |
C++ | LargeBarrelAnalysis/tests/TimeWindowCreatorToolsTest.cpp | kdulski/j-pet-framework-examples | ab2592a2c6cf8f901f5732f8878b750b9a7b6a49 |
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE TimeWindowCreatorToolsTest
#include "../TimeWindowCreatorTools.h"
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE(TimeWindowCreatorToolsTestSuite)
BOOST_AUTO_TEST_CASE(sortByValue_test) {
JPetPM pm1(1, "first");
JPetSigCh sigCh1(JPetSigCh::Leadin... |
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE TimeWindowCreatorToolsTest
#include "../TimeWindowCreatorTools.h"
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE(TimeWindowCreatorToolsTestSuite)
BOOST_AUTO_TEST_CASE(sortByValue_test) {
JPetPM pm1(1, "first");
JPetSigCh sigCh1(JPetSigCh::Leadin... |
BOOST_AUTO_TEST_CASE(flagSigChs_test)
{
JPetSigCh sigCh00(JPetSigCh::Leading, 10.0);
JPetSigCh sigCh01(JPetSigCh::Trailing, 11.0);
JPetSigCh sigCh02(JPetSigCh::Leading, 12.0);
JPetSigCh sigCh03(JPetSigCh::Leading, 13.0);
JPetSigCh sigCh04(JPetSigCh::Trailing, 14.0);
JPetSigCh sigCh05(JPetSigCh::Leading,... | ling,
true);
auto epsilon = 0.0001;
BOOST_REQUIRE_EQUAL(sigCh.getType(), JPetSigCh::Trailing);
BOOST_REQUIRE_EQUAL(sigCh.getPM().getID(), 23);
BOOST_REQUIRE_EQUAL(sigCh.getFEB().getID(), 1);
BOOST_REQUIRE_EQUAL(sigCh.getTRB().getID(), 2);
BOOST_REQUIRE_EQUAL(sigCh.getDAQch(), 123);
BOOST_REQUIRE_EQ... | function_block-function_prefixed | [
{
"content": "Description of available parameters in TimeCalibration example.\n\nNote that configuration/calibration filed can be obtained from PetWiki:\n\nhttp://koza.if.uj.edu.pl/petwiki/index.php/Default_settings_and_parameters_used_in_the_analyses\n\n--------\n\n\n\nSave_Control_Histograms_bool\n\n--- Commo... |
C++ | UnitTests/Physics/HeightFieldShapeTests.cpp | All8Up/JoltPhysics | 751d13891f5bd8850863ad236eaa3c340e90de9a |
#include "UnitTestFramework.h"
#include "PhysicsTestContext.h"
#include <Physics/Collision/RayCast.h>
#include <Physics/Collision/CastResult.h>
#include <Physics/Collision/Shape/HeightFieldShape.h>
#include <Physics/Collision/PhysicsMaterialSimple.h>
TEST_SUITE("HeightFieldShapeTests")
{
static void sRandomizeMater... |
#include "UnitTestFramework.h"
#include "PhysicsTestContext.h"
#include <Physics/Collision/RayCast.h>
#include <Physics/Collision/CastResult.h>
#include <Physics/Collision/Shape/HeightFieldShape.h>
#include <Physics/Collision/PhysicsMaterialSimple.h>
TEST_SUITE("HeightFieldShapeTests")
{
static void sRandomizeMater... |
TEST_CASE("TestPlane")
{
HeightFieldShapeSettings settings;
settings.mOffset = Vec3(3, 5, 7);
settings.mScale = Vec3(9, 13, 17);
settings.mSampleCount = 32;
settings.mBitsPerSample = 1;
settings.mBlockSize = 4;
settings.mHeightSamples.resize(Square(settings.mSampleCount));
for (float &h : setting... | else if (!inSettings.mMaterials.empty())
m1 = inSettings.mMaterials.front();
const PhysicsMaterial *m2 = shape->GetMaterial(x, y);
CHECK(m1 == m2);
}
if (x > 0 && y > 0 && x < inSettings.mSampleCount - 1 && y < inSettings.mSampleCount - 1)
{
Vec3 hit_pos = ray.mOri... | function_block-function_prefix_line | [
{
"content": "/// A height field shape. Cannot be used as a dynamic object.\n\nclass HeightFieldShape final : public Shape\n\n{\n\npublic:\n\n\t/// Constructor\n\n\t\t\t\t\t\t\t\t\tHeightFieldShape() : Shape(EShapeType::HeightField, EShapeSubType::HeightField) { }\n\n\t\t\t\t\t\t\t\t\tHeightFieldShape(const Hei... |
C++ | include/sharpen/MemoryTable.hpp | TalexDreamSoul/Sharpen | 9167c4080438a1f150232d733c4da878639d6f66 | #pragma once
#ifndef _SHARPEN_MEMORYTABLE_HPP
#define _SHARPEN_MEMORYTABLE_HPP
#include <stdexcept>
#include <map>
#include <cassert>
#include "ByteBuffer.hpp"
#include "CompressedPair.hpp"
#include "MemoryTableConcepts.hpp"
#include "Noncopyable.hpp"
#include "Optional.hpp"
namespace sharpen
{
class MemoryTa... | #pragma once
#ifndef _SHARPEN_MEMORYTABLE_HPP
#define _SHARPEN_MEMORYTABLE_HPP
#include <stdexcept>
#include <map>
#include <cassert>
#include "ByteBuffer.hpp"
#include "CompressedPair.hpp"
#include "MemoryTableConcepts.hpp"
#include "Noncopyable.hpp"
#include "Optional.hpp"
namespace sharpen
{
class MemoryTa... | key_,begin->value_);
}
else
{
this->InternalDelete(begin->key_);
}
}
}
public:
enum class ExistStatus
{
Exist,
Deleted,
NotFound
};
templa... | ++begin)
{
if (begin->type_ == sharpen::WriteBatch::ActionType::Put)
{
this->InternalPut(begin-> | function_block-random_span | [] |
C++ | Code/Components/swcorrelator/current/swcorrelator/BasicMonitor.cc | rtobar/askapsoft | 6bae06071d7d24f41abe3f2b7f9ee06cb0a9445e |
#include <askap_swcorrelator.h>
#include <swcorrelator/BasicMonitor.h>
#include <askap/AskapLogging.h>
#include <askap/AskapError.h>
#include <askap/AskapUtil.h>
#include <utils/DelayEstimator.h>
#include <fstream>
ASKAP_LOGGER(logger, ".basicmonitor");
namespace askap {
namespace swcorrelator {
BasicMonitor::Ba... |
#include <askap_swcorrelator.h>
#include <swcorrelator/BasicMonitor.h>
#include <askap/AskapLogging.h>
#include <askap/AskapError.h>
#include <askap/AskapUtil.h>
#include <utils/DelayEstimator.h>
#include <fstream>
ASKAP_LOGGER(logger, ".basicmonitor");
namespace askap {
namespace swcorrelator {
BasicMonitor::Ba... |
}
}
| casa::Vector<casa::Float> BasicMonitor::estimateDelays(const casa::Matrix<casa::Complex> &vis)
{
casa::Vector<casa::Float> result(vis.nrow(),0.);
if (vis.ncolumn() >= 2) {
scimath::DelayEstimator de(1e6);
for (casa::uInt row = 0; row < vis.nrow(); ++row) {
result[row] = float(de.getDelay(vis... | function_block-full_function | [
{
"content": "namespace askap {\n\n\n\nnamespace swcorrelator {\n\n\n\n/// @brief a collection of data monitors\n\n/// @details This class is just a container of data monitors. It implements basic calls\n\n/// of the IMonitor interface and translates them to each monitor held in the container.\n\n/// @ingroup s... |
C++ | src/core/net/netif.cpp | jjzhang166/openthread | e68e38b8e85fe4eeb3810727cd3583b5f87a4e70 |
#include <common/code_utils.hpp>
#include <common/debug.hpp>
#include <common/message.hpp>
#include <net/netif.hpp>
namespace Thread {
namespace Ip6 {
Netif *Netif::sNetifListHead = NULL;
int Netif::sNextInterfaceId = 1;
Netif::Netif() :
mUnicastChangedTask(&HandleUnicastChangedTask, this)
{
mHandlers = NU... |
#include <common/code_utils.hpp>
#include <common/debug.hpp>
#include <common/message.hpp>
#include <net/netif.hpp>
namespace Thread {
namespace Ip6 {
Netif *Netif::sNetifListHead = NULL;
int Netif::sNextInterfaceId = 1;
Netif::Netif() :
mUnicastChangedTask(&HandleUnicastChangedTask, this)
{
mHandlers = NU... |
int Netif::GetOnLinkNetif(const Address &aAddress)
{
int rval = -1;
for (Netif *netif = sNetifListHead; netif; netif = netif->mNext)
{
for (NetifUnicastAddress *cur = netif->mUnicastAddresses; cur; cur = cur->GetNext())
{
if (cur->GetAddress().PrefixMatch(aAddress) >= cur->mPr... | GetAddress().GetScope() < destination->GetScope())
{
rvalAddr = addr;
rvalIface = candidateId;
}
}
else if (addr->mPreferredLifetime != 0 && rvalAddr->mPreferredLifetime == 0)
{
r... | function_block-function_prefixed | [
{
"content": "class ThreadNetif: public Ip6::Netif\n\n{\n\npublic:\n\n /**\n\n * This constructor initializes the Thread network interface.\n\n *\n\n */\n\n ThreadNetif(void);\n\n\n\n /**\n\n * This method enables the Thread network interface.\n\n *\n\n */\n\n ThreadError Up(... |
C++ | MUON/MUONgraphics/AliMUONPCBPainter.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a |
#include "AliMUONPCBPainter.h"
#include "AliMUONManuPainter.h"
#include "AliMUONContour.h"
#include "AliMUONPainterHelper.h"
#include "AliMUONVCalibParam.h"
#include "AliMUONVTrackerData.h"
#include "AliMpDEManager.h"
#include "AliMpMotifPosition.h"
#include "AliMpPCB.h"
#include "AliMpPlaneType.h"
#include "AliMpSl... |
#include "AliMUONPCBPainter.h"
#include "AliMUONManuPainter.h"
#include "AliMUONContour.h"
#include "AliMUONPainterHelper.h"
#include "AliMUONVCalibParam.h"
#include "AliMUONVTrackerData.h"
#include "AliMpDEManager.h"
#include "AliMpMotifPosition.h"
#include "AliMpPCB.h"
#include "AliMpPlaneType.h"
#include "AliMpSl... | ;
if (!contour)
{
contour = h->MergeContours(contourArray,ContourName());
}
SetContour(contour);
}
AliMUONPCBPainter::~AliMUONPCBPainter()
{
}
AliMUONPCBPainter::AliMUONPCBPainter(const AliMUONPCBPainter& rhs)
: AliMUONVPainter(rhs),
fDetElemId(-1),
fPCBIndex(-1)
{
rhs.Copy(*this);
}... | h->Local2Global(fDetElemId,
pcb->X()-slat->GetPositionX(),
pcb->Y()-slat->GetPositionY(),
0.0,
x,y,z) | call_expression | [
{
"content": "class AliMpPCB;\n\n\n",
"file_path": "MUON/MUONmpgraphics/AliMpPCBPainter.h",
"rank": 0,
"score": 278175.9464289656
},
{
"content": "class AliMpSlat;\n\n\n",
"file_path": "MUON/MUONmpgraphics/AliMpSlatPainter.h",
"rank": 1,
"score": 278174.1546947528
},
{
"c... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.