Serial Metrics: Machine Learning Solutions

Professional Services

Serial Metrics ensures that companies efficiently solve machine learning challenges. We offer both on site and off site professional services that cover the full stack.

        if(prevTable.find(Node.m_tableId) == prevTable.end()){
          prevTable.insert(make_pair(Node.m_tableId, srcNode));
          prevConn.insert(make_pair(Node.m_tableId, connection));
          m_log.writeLog(DEBUG, "joinTraverse Adding possible backwards connection ref (%s) to src (%s)\n", 
                         Node.getName().c_str(), prevTable[Node.m_tableId].getName().c_str()); 
        }
        Node.deleteConnection(srcNode.getName(), connection.getRefColumnName(), connection.getFKeyName());
        srcNode.deleteConnection(Node.getName(), connection.getFKeyName(), connection.getRefColumnName());
        int index2 = Node.m_tableId;
        if(m_userSelection.find(index2) != m_userSelection.end() &amp;&amp;
                  find(m_visitedNodes.begin(), m_visitedNodes.end(), index2) == m_visitedNodes.end())
          {
            m_visitedNodes.push_back(index2);                           
            curVisitedTables.push_back(Node);
            m_log.writeLog(DEBUG, "joinTraverse User-selected node has been visited for the first time src table (%s.%s) to ref table (%s.%s)\n",
                           srcNode.getName().c_str(), connection.getFKeyName().c_str(), Node.getName().c_str(), connection.getRefColumnName().c_str()); 
            if(m_visitedNodes.size() == m_userSelection.size()){
              //swaping an STL container with an empty version of itself will efficiently clear it
              queue&lt;NodeTable&gt; empty;
              m_log.writeLog(DEBUG, "joinTraverse EMPTYING QUEUE (all selected nodes found)\n\n");
              NodeQ = queue&lt;NodeTable&gt;();
              swap(NodeQ, empty);
              break;
            }
          }
        NodeQ.push(Node);
    }
  }
        if(prevTable.find(Node.m_tableId) == prevTable.end()){
          prevTable.insert(make_pair(Node.m_tableId, srcNode));
          prevConn.insert(make_pair(Node.m_tableId, connection));
          m_log.writeLog(DEBUG, "joinTraverse Adding possible backwards connection ref (%s) to src (%s)\n", 
                         Node.getName().c_str(), prevTable[Node.m_tableId].getName().c_str()); 
        }
        Node.deleteConnection(srcNode.getName(), connection.getRefColumnName(), connection.getFKeyName());
        srcNode.deleteConnection(Node.getName(), connection.getFKeyName(), connection.getRefColumnName());
        int index2 = Node.m_tableId;
        if(m_userSelection.find(index2) != m_userSelection.end() &amp;&amp;
                  find(m_visitedNodes.begin(), m_visitedNodes.end(), index2) == m_visitedNodes.end())
          {
            m_visitedNodes.push_back(index2);                           
            curVisitedTables.push_back(Node);
            m_log.writeLog(DEBUG, "joinTraverse User-selected node has been visited for the first time src table (%s.%s) to ref table (%s.%s)\n",
                           srcNode.getName().c_str(), connection.getFKeyName().c_str(), Node.getName().c_str(), connection.getRefColumnName().c_str()); 
            if(m_visitedNodes.size() == m_userSelection.size()){
              //swaping an STL container with an empty version of itself will efficiently clear it
              queue&lt;NodeTable&gt; empty;
              m_log.writeLog(DEBUG, "joinTraverse EMPTYING QUEUE (all selected nodes found)\n\n");
              NodeQ = queue&lt;NodeTable&gt;();
              swap(NodeQ, empty);
              break;
            }
          }
        NodeQ.push(Node);
    }
  }