C++ std library

Preface

Record the std library used, usage and usage scenarios, etc., without the source code.
Also only write down the functions I have used

map

1. Map is an associative container, which stores the elements formed by the combination of the key value Key and the mapped value Value in a specific order.
2. In the map, the element always uses its internal comparison object (Compare) according to its key and follows the specified strict weak order criterion. If you don’t need sorting but a dictionary, use unordered_map

//引用
#include <map>
//创建
std::map<std::string,int> map
//迭代器遍历
for(std::map<std::string,int>::iterator i=map.begin();i!=map.end();++i)
{
    
    
//访问元素
std::cout<<i->first<<" "<<i->second<<std::endl;
}

Algorithm 1: Dynamic Scheduler
One One One One One One One One One One One One One One One One One One
Input the node that finish the task
Output
for $node$ in $nodeList$ do:
      $finishTime[node]$ $\leftarrow$ 0
      $loadTime[node]$ $\leftarrow$ 0
      $taskRemain\left[node\right]$ $\leftarrow$ 0
for $task$ in $tasklist$ do:
      find the $node$ such that $finishTime[node]$+$loadTime[node]\ast taskRemain[node]$ is minmum
      $target$ $\leftarrow$ $taskRemain[node]$++
      $target$ $\leftarrow$ $taskRemain\left[node\right]$ ++

Algorithm 2: Tail Latency Handler
One One One One One One One One One One One One One One One One