页面置换算法-LRU（Least Recently Used）c++实现-白红宇

页面置换算法-LRU（Least Recently Used）c++实现

阅读量：5061 次

发布时间：2019-06-12

本文共 1373 字，大约阅读时间需要 4 分钟。

最近最久未使用（LRU）置换算法

#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           #include 
            
             using namespace std;const int Maxn = 1500;typedef struct Page_Node{ struct Page_Node *next; int page_id; Page_Node(int v){page_id = v;}}*PNode, Node;class LRU{public: LRU(int num):blocks_limit(num){ head = NULL; } ~LRU(){ delete head; } void update_order(int page_id){ PNode p = head, last_node = NULL; while(p){ if(p -> page_id == page_id){ PNode next_node = p -> next; p -> next = head; if(last_node){ last_node -> next = next_node; }head = p; break; } last_node = p; p = p -> next; } } void insert_page(int page_id){ PNode new_node = new Node(page_id); PNode tmp = head; head = new_node; head -> next = tmp; existed[page_id] = 1; } void delete_tail_page(){ assert(NULL != head); PNode p = head, last_node = NULL; while(p){ if(p -> next == NULL){ existed.erase(p->page_id); if(last_node) last_node -> next = NULL; else{ head = NULL; } } last_node = p; p = p -> next; } } void disp_page_in_memory(){ cout<<"页面情况:"<
             
              page_id; p = p -> next; }cout<
              
                blocks_limit){ cout<<"页面置换"<
               
                existed; int blocks_limit;};int main(){ LRU lru(3); while(1){ int t; cin>>t; lru.call_page(t); } return 0;}