int main(void) { char label[] = "Single"; PrintLabel(label); char *labelPtr = label; PrintLabel(labelPtr); return 0; }
void PrintError( const char *format, ... ) { va_list arguments; va_start( arguments, format ); PrintLabel( "Error: ", format, &arguments ); va_end( arguments ); }
void PrintWarning( const char *format, ... ) { va_list arguments; va_start( arguments, format ); PrintLabel( "Warning: ", format, &arguments ); va_end( arguments ); }
void PrintNotice( const char *format, ... ) { va_list arguments; va_start( arguments, format ); PrintLabel( "Notice: ", format, &arguments ); va_end( arguments ); }
SearchPointer& SearchPointer::operator--() { //prefix operator, to prevent copying itself if (!m_indices.empty()) { if (m_currentIndex == m_indices.begin()) { m_currentIndex = --m_indices.end(); PrintLabel(_("Search hit top, continuing at bottom").c_str()); } else { m_currentIndex--; PrintLabel(); } } else m_currentIndex = m_indices.end(); return *this; }
void PrintSub(Substructure *sub, Parameters *parameters) { // parameters used LabelList *labelList = parameters->labelList; ULONG outputLevel = parameters->outputLevel; if (sub != NULL) { printf("Substructure: value = %.*g", NUMERIC_OUTPUT_PRECISION, sub->value); // print instance/example statistics if output level high enough if (outputLevel > 2) { printf("\n pos instances = %lu",sub->numInstances); if (parameters->incremental) printf(", pos examples = %lu\n",(ULONG) sub->posIncrementValue); else printf(", pos examples = %lu\n",sub->numExamples); printf("\n neg instances = %lu",sub->numNegInstances); if (parameters->incremental) printf(", neg examples = %lu\n",(ULONG) sub->negIncrementValue); else printf(", neg examples = %lu\n",sub->numNegExamples); } else { if ((parameters->incremental) && (parameters->evalMethod == EVAL_SETCOVER)) printf(", pos examples = %lu, neg examples = %lu\n", (ULONG) sub->posIncrementValue, (ULONG) sub->negIncrementValue); else printf(", pos instances = %lu, neg instances = %lu\n", sub->numInstances, sub->numNegInstances); } // print subgraph if (sub->definition != NULL) { PrintGraph(sub->definition, labelList); } if (sub->recursive) { printf(" re "); PrintLabel(sub->recursiveEdgeLabel, labelList); printf("\n"); } // print instances if output level high enough if (outputLevel > 2) { printf("\n Positive instances:\n"); PrintPosInstanceList(sub, parameters); if (sub->numNegInstances > 0) { printf("\n Negative instances:\n"); PrintNegInstanceList(sub, parameters); } } } }
/* PrintList: print the given label list */ static void PrintList(LabList *ll) { int i; LLink p; for (p=ll->head->succ,i=1; p->succ!= NULL; p=p->succ,i++) { printf("%4d. ",i); PrintLabel(p,ll->maxAuxLab); } }
void PrintEdge(Graph *graph, ULONG edgeIndex, LabelList *labelList) { Edge *edge = & graph->edges[edgeIndex]; if (edge->directed) printf("d"); else printf("u"); printf(" %lu %lu ", edge->vertex1 + 1, edge->vertex2 + 1); PrintLabel(edge->label, labelList); printf("\n"); }
void PrintVertex(Graph *graph, ULONG vertexIndex, LabelList *labelList) { printf("v %lu ", vertexIndex + 1); PrintLabel(graph->vertices[vertexIndex].label, labelList); printf("\n"); }