⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ssrch_13.cc

📁 这是一个从音频信号里提取特征参量的程序
💻 CC
字号:
// file: $isip/class/search/StackSearch/ssrch_13.cc// version: $Id: ssrch_13.cc,v 1.1 2002/07/17 17:08:55 jelinek Exp $//// isip include files//#include "StackSearch.h"// method: getTraces//// arguments://  DoubleLinkedList<Trace>& trace_list: (output) traces at particular level//  long level: (input) level of the traces to output//// return: logical error status//// returns all traces active at particular level//boolean StackSearch::getTraces(DoubleLinkedList<Trace>& trace_list_a,			       long level_a) {  // loop over all traces at the top level and put them  // in the top_trace_list_a list  //  Trace* curr_trace = NULL;  while (trace_lists_d(level_a).removeFirst(curr_trace)) {    trace_list_a.insertLast(curr_trace);  }  if (level_a == 0) {    // get also valid hypotheses    //    while (valid_hyps_d.removeFirst(curr_trace)) {      trace_list_a.insertLast(curr_trace);    }  }  // make sure there is at least one trace in the list  //  if ((trace_list_a.length() < 1)) {    // exit ungracefully    //    return false;  }  else {    // exit gracefully    //    return true;  }}// method: setTopLevelTraces//// arguments://  DoubleLinkedList<Trace>& top_trace_list: (input) traces to be placed on the top level//// return: logical error status//// set the list of traces to be on the top level//boolean StackSearch::setTopLevelTraces(                       DoubleLinkedList<Trace>& top_trace_list_a) {  // make sure there is at least one trace in the list  //  Trace* curr_trace = NULL;  while (top_trace_list_a.removeFirst(curr_trace)) {    trace_lists_d(0).insertLast(curr_trace);  }  // exit gracefully  //  return true;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -