#pragma once
#include "TimeNode.h"
#include <unordered_map>
#include <vector>
#include <unistd.h>
#include <pthread.h>
#include <iostream>

#define IS_LESS_STAMP(i,j) (m_container[(i)]->timestamp<m_container[(j)]->timestamp)
#define C_SIZE (m_container.size())

//precise to second
class HeapTimer
{
public:
    enum TimerManagerState
    {
        TIME_MANAGER_START,
        TIME_MANAGER_STOP
    };
public:
    ~HeapTimer();
    //this example prove only one timer
    static HeapTimer* instance();
    int addTimer(TimeNode* newnode) ;
    void deleteTimer(int id) ;
    void clear();
    void start();
    void stop();
private: 
    static void* process(void* arg);
    explicit HeapTimer(/* args */);
private:
    //try minheap 
    void sinkdown(int index);//for delete
    void popup(int index);//for insert
    void insertTimeNode(TimeNode* newnode);
    void deleteTimeNode(TimeNode* node);
    void swapTimeNode(int i,int j);
    TimeNode* front();
private:
    //vector is more comfortable
    std::vector<TimeNode*> m_container;
    //log(1) to find node  id->TimeNode
    std::unordered_map<int,TimeNode*> m_node_location;

    static std::atomic<HeapTimer*> smp_heaptimer;
    static std::atomic<TimerManagerState> m_status;//pthread is runing or not
    static pthread_mutex_t sm_mutex;
    pthread_t m_pid;
};