diff options
Diffstat (limited to 'src/dot.cpp')
-rw-r--r-- | src/dot.cpp | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/src/dot.cpp b/src/dot.cpp index 5aca277..9201624 100644 --- a/src/dot.cpp +++ b/src/dot.cpp @@ -694,7 +694,7 @@ static void checkDotResult(const char *imgExt, const char *imgName) { if (!(data[1]=='P' && data[2]=='N' && data[3]=='G')) { - err("Image `%s' produced by dot is not a valid PNG!\n" + err("Image '%s' produced by dot is not a valid PNG!\n" "You should either select a different format " "(DOT_IMAGE_FORMAT in the config file) or install a more " "recent version of graphviz (1.7+)\n",imgName @@ -703,13 +703,13 @@ static void checkDotResult(const char *imgExt, const char *imgName) } else { - err("Could not read image `%s' generated by dot!\n",imgName); + err("Could not read image '%s' generated by dot!\n",imgName); } fclose(f); } else { - err("Could not open image `%s' generated by dot!\n",imgName); + err("Could not open image '%s' generated by dot!\n",imgName); } } } @@ -2311,7 +2311,7 @@ void DotNode::renumberNodes(int &number) const DotNode *DotNode::findDocNode() const { if (!m_url.isEmpty()) return this; - //printf("findDocNode(): `%s'\n",m_label.data()); + //printf("findDocNode(): '%s'\n",m_label.data()); if (m_parents) { QListIterator<DotNode> dnli(*m_parents); @@ -2473,7 +2473,7 @@ void DotGfxHierarchyTable::writeGraph(FTextStream &out, void DotGfxHierarchyTable::addHierarchy(DotNode *n,const ClassDef *cd,bool hideSuper) { - //printf("addHierarchy `%s' baseClasses=%d\n",cd->name().data(),cd->baseClasses()->count()); + //printf("addHierarchy '%s' baseClasses=%d\n",cd->name().data(),cd->baseClasses()->count()); if (cd->subClasses()) { BaseClassListIterator bcli(*cd->subClasses()); @@ -2481,11 +2481,11 @@ void DotGfxHierarchyTable::addHierarchy(DotNode *n,const ClassDef *cd,bool hideS for ( ; (bcd=bcli.current()) ; ++bcli ) { ClassDef *bClass=bcd->classDef; - //printf(" Trying sub class=`%s' usedNodes=%d\n",bClass->name().data(),m_usedNodes->count()); + //printf(" Trying sub class='%s' usedNodes=%d\n",bClass->name().data(),m_usedNodes->count()); if (bClass->isVisibleInHierarchy() && hasVisibleRoot(bClass->baseClasses())) { DotNode *bn; - //printf(" Node `%s' Found visible class=`%s'\n",n->m_label.data(), + //printf(" Node '%s' Found visible class='%s'\n",n->m_label.data(), // bClass->name().data()); if ((bn=m_usedNodes->find(bClass->name()))) // node already present { @@ -2695,7 +2695,7 @@ void DotClassGraph::addClass(const ClassDef *cd,DotNode *n,int prot, { className=cd->displayName(); } - //printf("DotClassGraph::addClass(class=`%s',parent=%s,prot=%d,label=%s,dist=%d,usedName=%s,templSpec=%s,base=%d)\n", + //printf("DotClassGraph::addClass(class='%s',parent=%s,prot=%d,label=%s,dist=%d,usedName=%s,templSpec=%s,base=%d)\n", // className.data(),n->m_label.data(),prot,label,distance,usedName,templSpec,base); DotNode *bn = m_usedNodes->find(className); if (bn) // class already inserted @@ -2746,7 +2746,7 @@ void DotClassGraph::addClass(const ClassDef *cd,DotNode *n,int prot, } bn->setDistance(distance); m_usedNodes->insert(className,bn); - //printf(" add new child node `%s' to %s hidden=%d url=%s\n", + //printf(" add new child node '%s' to %s hidden=%d url=%s\n", // className.data(),n->m_label.data(),cd->isHidden(),tmp_url.data()); buildGraph(cd,bn,base,distance+1); @@ -2901,7 +2901,7 @@ void DotClassGraph::buildGraph(const ClassDef *cd,DotNode *n,bool base,int dista BaseClassDef *bcd; for ( ; (bcd=bcli.current()) ; ++bcli ) { - //printf("-------- inheritance relation %s->%s templ=`%s'\n", + //printf("-------- inheritance relation %s->%s templ='%s'\n", // cd->name().data(),bcd->classDef->name().data(),bcd->templSpecifiers.data()); addClass(bcd->classDef,n,bcd->prot,0,bcd->usedName, bcd->templSpecifiers,base,distance); @@ -3022,7 +3022,7 @@ void DotClassGraph::buildGraph(const ClassDef *cd,DotNode *n,bool base,int dista DotClassGraph::DotClassGraph(const ClassDef *cd,DotNode::GraphType t) { - //printf("--------------- DotClassGraph::DotClassGraph `%s'\n",cd->displayName().data()); + //printf("--------------- DotClassGraph::DotClassGraph '%s'\n",cd->displayName().data()); m_graphType = t; QCString tmp_url=""; if (cd->isLinkable() && !cd->isHidden()) @@ -3390,7 +3390,7 @@ void DotInclDepGraph::buildGraph(DotNode *n,const FileDef *fd,int distance) { const FileDef *bfd = ii->fileDef; QCString in = ii->includeName; - //printf(">>>> in=`%s' bfd=%p\n",ii->includeName.data(),bfd); + //printf(">>>> in='%s' bfd=%p\n",ii->includeName.data(),bfd); bool doc=TRUE,src=FALSE; if (bfd) { |