C++ (Cpp) stringList::push_back Examples

Programming Language: C++ (Cpp)

Class/Type: stringList

Method/Function: push_back

Examples at hotexamples.com: 5

The push_back function in the StringList class of C++ adds an element at the end of the linked list. It takes a string parameter and inserts it into the list.

Here are some code examples that use the StringList push_back function:

Example 1:

#include 
#include 

using namespace std;

int main() {
    StringList myList;
    myList.push_back("apple");
    myList.push_back("banana");
    myList.push_back("cherry");
 
    myList.print(); // prints: "apple banana cherry"
    
    return 0;
}

This example creates a StringList object called myList and adds three strings to it using the push_back function. It then calls the print function to display the contents of the list. This code uses a StringList package library.

Example 2:

#include 
#include 

using namespace std;

int main() {
    list myList;
    myList.push_back("dog");
    myList.push_back("cat");
    myList.push_back("bird");
 
    for(auto it = myList.begin(); it != myList.end(); ++it) {
        cout << *it << " ";
    }
    
    return 0;
}

This code example creates a list object called myList and adds three strings to it using the push_back function. It then uses a for loop to iterate through the list and print each element. This code uses the standard library list package.

C++ (Cpp) stringList::push_back - 5 examples found. These are the top rated real world C++ (Cpp) examples of stringList::push_back extracted from open source projects. You can rate examples to help us improve the quality of examples.

Frequently Used Methods

Show Hide

push_back(5)

size(4)

begin(3)

contains(3)

end(2)

indexOf(2)

assign(1)

at(1)

Example #1

Show file

File: main.cpp Project: AugRob/OALWrapper

 Playlist(int count, const char *const aSongs[]) : mStream(0), mSource(0)
 {
     for (int i = 0; i < count; ++i) {
         mSongs.push_back(aSongs[i]);
     }
     mCurrentSong = mSongs.begin();
     Init();
 }

Example #2

Show file

File: collectDataFromSam.cpp Project: wckdouglas/samData

// correct MD sepearte list
// also collect deletion base list
string correctMDstring(numList MDnum, stringList MDLetter, stringList &deletions)
{
    string MDList;
    int i = 0;
    //make deletion list
    for (int i = 0; i < MDnum.size(); i ++)
    {
        if (MDLetter[i][0] == '^')
        {
            deletions.push_back(MDLetter[i]);
        }
    }
    MDList  = creatMDstring(MDnum,MDLetter);
    return MDList;
}

Example #3

Show file

File: pwm.cpp Project: B-Rich/StochHMM

	//Split states into individual state strings
    bool PWM::_splitPositions(std::string& txt ,stringList& sts){
        
        size_t start=0;
        size_t end=0;
        
        while(start!=std::string::npos){
            end=txt.find("NAME:",start+1);
            
            std::string st = txt.substr(start,end-start);
            
            clear_whitespace(st, "#><");
            
			sts.push_back(st);
			
            start=txt.find("NAME:",end);
            
        }
        return true;
    }

Example #4

Show file

File: pwm.cpp Project: B-Rich/StochHMM

	//Get all Name in order
	bool PWM::_getOrderedPositionNames(stringList& pos, stringList& names){
        
		for(size_t i=0;i<pos.size();i++){
            size_t nameHeader=pos[i].find("NAME:");
			if (nameHeader == std::string::npos){
				continue;
			}
            size_t nameLineEnding=pos[i].find_first_of("\n",nameHeader);
            std::string name = pos[i].substr(nameHeader+5,nameLineEnding-(nameHeader+5));
            clear_whitespace(name, " \t\n");
            if (names.contains(name)){
                std::cerr << "Position with name of: " << name << " is defined twice in the model\n";
                return false;
            }
            else{
                names.push_back(name);
            }
        }
        return true;
    }

Example #5

Show file

File: collectDataFromSam.cpp Project: wckdouglas/samData

// Fix sequence, MDline, cigarLine
// i.  collect clipped bases
// ii.  collect insertion bases
// iii. remove insertion bases on 
//      1. query sequence and 
//      2. cigar line
// iv. count mismatch pattern (e.g. AtoG, GtoT)
stringList insertionAndMismatch(string cigarLine, string MDline, string sequence, stringList &insertion, 
                                string &softclippedHead, string &softclippedTail, string id, int numOfMis)
{
    stringList mismatchList(numOfMis);
    string fixedCigarLine, fixedSeq, mismatch, ref, read;
    int mis, i = 0, size = cigarLine.length();
    while( i < size)
    {
        if (cigarLine.at(i) == 'S')
        {
            if (i == 0)
            {
                while ( cigarLine.at(i) == 'S')
                {
                    i ++ ;
                }
				softclippedHead = sequence.substr(0,i);
            }
            else
            {
                softclippedTail = sequence.substr(i,size-i);
                i += size;
            }
        }
        else if (cigarLine.at(i) == 'I')
        {
            insertion.push_back(string(1,sequence[i]));
            i ++;
        }
        else
        {
            fixedCigarLine.push_back(cigarLine[i]);
            fixedSeq.push_back(sequence[i]);
            i ++;
        }
    }
	/*
    //debugging    
    cerr << fixedCigarLine << endl;
    cerr << MDline << endl;
    cerr << fixedSeq  <<endl;
    cerr << sequence << endl ;
    cerr << cigarLine << endl;
    cerr << softclippedHead << '\t' << softclippedTail << endl;
	*/
    //assertion
    assert(fixedCigarLine.length() == MDline.length());
    assert(fixedSeq.length() == MDline.length());
    
    //extract misincorporations
    mis = 0;
    for (int i = 0; i < fixedCigarLine.length(); i++)
    {
        if (fixedCigarLine.at(i) == 'M' && MDline.at(i) != '=')
        {
            ref = MDline.substr(i,1) ;
            read = fixedSeq.substr(i,1);
            assert (ref != read);
            mismatch = ref +"to"+ read;
            mismatchList[mis] = mismatch;
            mis ++;
        }
    }
    return mismatchList;
}