LRU (Least Recently Used)

最新推荐文章于 2024-04-22 04:45:15 发布

xjtuse_mal

最新推荐文章于 2024-04-22 04:45:15 发布

阅读量699

点赞数

文章标签： iostream null include delete struct

本文链接：https://blog.csdn.net/xjtuse_mal/article/details/1815859

版权

#include <iostream>
#include <ctime>
#include <windows.h>
#include <climits>
using namespace std;

struct LRUELEM
{
    int data;
    time_t time;
};

#define FREEUP(p) if(p) {delete []p; p = NULL;}

static int getsmalltime(LRUELEM *e, int n);
static int getsameLRU(LRUELEM *e, int data);

int main()
{
    //LRUELEM *e = (LRUELEM*)malloc(3*sizeof(LRUELEM));

    int a[5] = {1, 2, 3, 4, 5};

    LRUELEM *e = new LRUELEM[3];

    for(int i=0; i<3; i++)
    {
        e[i].data = a[i];
        e[i].time = time(NULL);
        Sleep(1000);
    }

    for(i=2; i<5; i++)
    {
        if (getsameLRU(e, a[i]) == -1)
        {
            int pos = getsmalltime(e, 3);
            e[pos].data = a[i];
            e[pos].time = time(NULL);
            Sleep(1000);
        } else {
            e[getsameLRU(e, a[i])].time = time(NULL);
            Sleep(1000);
        }
        for(int i=0; i<3; i++)
        {
            cout << e[i].data << "   "<< e[i].time << endl;
        }
        cout << endl;
    }

    FREEUP(e);

    return 0;
}

static int getsmalltime(LRUELEM *e, int n)
{
    int smalltime = INT_MAX;
    int pos = -1;
    for(int i=0; i<n; i++)
    {
        if(e[i].time<smalltime)
        {
            smalltime = e[i].time;
            pos = i;
        }
    }
    return pos;
}

static int getsameLRU(LRUELEM *e, int data)
{
    for(int i=0; i<3; i++)
    {
        if(e[i].data == data)
        {
            return i;
        }
    }
    return -1;
}