GothenburgBitFactory/timewarrior
1
0
Fork 0
mirror of https://github.com/GothenburgBitFactory/timewarrior.git synced 2025-07-07 20:06:39 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Composite: Defined start of algorithm

Browse source
This commit is contained in:
Paul Beckingham 2016-04-01 22:19:33 -04:00
parent 53aa740480
commit 81e043ef2d
2 changed files with 7 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/Composite.cpp
View file

@ -61,8 +61,13 @@ void Composite::add (
////////////////////////////////////////////////////////////////////////////////
// overlay == true means there is no color blending.
// overlay == false means there is color blending.
std::string Composite::str (bool overlay)
std::string Composite::str (bool overlay) const
{
// TODO Find the longest string.
// TODO Create a vector of ints the same length, where each int is the index.
return "";
}

2
src/Composite.h
View file

@ -37,7 +37,7 @@ class Composite
public:
Composite () = default;
void add (const std::string&, std::string::size_type, const Color&);
std::string str (bool overlay = true);
std::string str (bool overlay = true) const;
private:
std::vector <std::tuple <std::string, std::string::size_type, Color>> _layers;