Last modified: 2013-04-26 20:00:48 UTC

Wikimedia Bugzilla is closed!

Wikimedia migrated from Bugzilla to Phabricator. Bug reports are handled in Wikimedia Phabricator.
This static website is read-only and for historical purposes. It is not possible to log in and except for displaying bug reports and their history, links might be broken. See T32657, the corresponding Phabricator task for complete and up-to-date bug report information.
Bug 30657 - Mbiama Assogo Roger
Mbiama Assogo Roger
Status: RESOLVED INVALID
Product: MediaWiki extensions
Classification: Unclassified
StringFunctionsEscaped (Other open bugs)
unspecified
All FreeBSD
: Normal normal (vote)
: ---
Assigned To: Jack D. Pond
:
Depends on:
Blocks:
  Show dependency treegraph
 
Reported: 2011-08-31 12:47 UTC by Roger Mbiama Assogo
Modified: 2013-04-26 20:00 UTC (History)
2 users (show)

See Also:
Web browser: ---
Mobile Platform: ---
Assignee Huggle Beta Tester: ---


Attachments

Description Roger Mbiama Assogo 2011-08-31 12:47:13 UTC
svn checkout http://svn.wikimedia.org/svnroot/mediawiki/trunk/Mbiama Assogo Roger wiki
Comment 1 Roan Kattouw 2011-08-31 12:50:46 UTC
You need to type that command into a shell, not into our bug tracker.
Comment 2 Roger Mbiama Assogo 2011-08-31 12:55:01 UTC
(In reply to comment #1)
Comment 3 Roger Mbiama Assogo 2011-08-31 13:06:29 UTC
tree.trunk like php inc. ini tree wiki
#include <algorithm>
#include <string>
#include <iostream>
#include "tree.hh"

using namespace std;

int main(int, char **)
   {
   tree<string> tr;
   tree<string>::iterator top, one, two, loc, banana;
   
   top=tr.begin();
   one=tr.insert(top, "name");
   two=tr.append_child(name, "name2");
   tr.append_child(two, "explorer");
   name=tr.append_child(name, "name2");
   tr.append_child(name,"subName");
   tr.append_child(Name2, "mbiama");
   tr.append_child(one,"three");
   
   loc=find(tr.begin(), tr.end(), "name2");
   if(loc!=tr.end()) {
   tree<string>::sibling_iterator sib=tr.begin(loc);
   while(sib!=tr.end(loc)) {
     cout << (*sib) << endl;
     ++sib;
     }
   cout << endl;
   tree<string>::iterator sib2=tr.begin(loc);
   tree<string>::iterator end2=tr.end(loc);
   while(sib2!=end2) {
     for(int i=0; i<tr.depth(sib2)-2; ++i) 
        cout << " ";
     cout << (*sib2) << endl;
     ++sib2;
     }
   }
}

Note You need to log in before you can comment on or make changes to this bug.


Navigation
Links