From 07a62310a7480610663ffc608491cf46370d99b8 Mon Sep 17 00:00:00 2001
From: LYW <leeyeanwoo@diteam.co.kr>
Date: 금, 15 10월 2021 15:26:33 +0900
Subject: [PATCH] Ongoing90 #3671 CF AOI Review 전설비 Align Matching 방법 개선
---
ReviewHistory/include/akSTL/akQueueCircle.h | 151 ++++++++++++++++++++++++++++++++++++++++++++++++++
1 files changed, 151 insertions(+), 0 deletions(-)
diff --git a/ReviewHistory/include/akSTL/akQueueCircle.h b/ReviewHistory/include/akSTL/akQueueCircle.h
new file mode 100644
index 0000000..c0fb42a
--- /dev/null
+++ b/ReviewHistory/include/akSTL/akQueueCircle.h
@@ -0,0 +1,151 @@
+#pragma once
+
+
+#include "akSTLLinker.h"
+
+ template <typename T>
+ class CakQueueCircle
+ {
+ public:
+ CakQueueCircle();
+ ~CakQueueCircle();
+
+
+ void clear(); //메모리 삭제는 안됨
+ void setMemSize(unsigned int memsize); //memsize가 0일때 메모리 삭제
+
+ void pushData(T point);
+ void setData( unsigned int nindex , T point );
+ void getData(T* pPointBuffer, unsigned int nBufferLength);
+
+ int size(){return m_nPointNum;};
+
+ T& operator [](unsigned int nindex);
+ CakQueueCircle& operator= (CakQueueCircle& traj);
+
+ //static unsigned int s_TrajectorySize;
+
+
+ //가능하면 아래의 멤버 변수에 직접 수정은 하지 말것!!
+ public:
+ int m_nMemSize; //확보 메모리 사이즈
+ int m_nPointIndex; //현재 인덱스
+ int m_nPointNum; //현재 입력된 Point 갯수
+ T* m_pPoints; //데이터 변수
+ public:
+ unsigned long m_nPushCount;
+ };
+
+
+ template <typename T>
+ CakQueueCircle<T>::CakQueueCircle(void)
+ {
+ m_pPoints = NULL;
+ m_nMemSize = 0;
+ m_nPushCount = 0;
+
+ clear();
+ setMemSize(100);
+ };
+
+
+ template <typename T>
+ CakQueueCircle<T>::~CakQueueCircle(void)
+ {
+ setMemSize(0);
+ };
+
+ template <typename T>
+ void CakQueueCircle<T>::clear() //메모리 삭제는 안됨
+ {
+ m_nMemSize; //확보 메모리 사이즈
+ m_nPointIndex = -1; //현재 인덱스
+ m_nPointNum = 0; //현재 입력된 Point 갯수
+ //m_pPoints; //데이터 변수
+ m_nPushCount = 0;
+ }
+
+ template <typename T>
+ void CakQueueCircle<T>::setMemSize(unsigned int memsize) //memsize가 0일때 메모리 삭제
+ {
+ //clear
+ if(m_pPoints != NULL)
+ {
+ clear();
+ m_nMemSize = 0;
+ delete [] m_pPoints;
+ m_pPoints = NULL;
+ }
+
+ if(memsize > 0)
+ {
+ m_nMemSize = memsize;
+
+ m_pPoints = new T [m_nMemSize];
+ }
+
+ }
+
+ template <typename T>
+ void CakQueueCircle<T>::pushData(T point)
+ {
+ m_nPointIndex++;
+ if(m_nPointIndex >= m_nMemSize)
+ {
+ m_nPointIndex = 0;
+ }
+
+ m_nPointNum++;
+ if(m_nPointNum >= m_nMemSize)
+ {
+ m_nPointNum = m_nMemSize;
+ }
+
+ m_pPoints[m_nPointIndex] = point;
+ m_nPushCount++;
+ }
+
+ template <typename T>
+ void CakQueueCircle<T>::setData( unsigned int nindex , T point )
+ {
+ int pointindex = m_nPointIndex-nindex;
+
+ if(pointindex<0) pointindex = m_nPointNum + pointindex;
+
+ m_pPoints[pointindex] = point;
+ }
+
+ template <typename T>
+ T& CakQueueCircle<T>::operator[]( unsigned int nindex )
+ {
+ int pointindex = m_nPointIndex-nindex;
+
+ if(pointindex<0) pointindex = m_nPointNum + pointindex;
+
+ return m_pPoints[pointindex];
+ }
+
+ template <typename T>
+ CakQueueCircle<T>& CakQueueCircle<T>::operator=( CakQueueCircle<T>& queuecircle )
+ {
+ if(m_nMemSize != queuecircle.m_nMemSize)
+ {
+ if(m_pPoints)
+ {
+ delete [] m_pPoints;
+ }
+
+ m_pPoints = new T[queuecircle.m_nMemSize];
+ }
+
+
+ m_nMemSize = queuecircle.m_nMemSize;
+ m_nPointIndex = queuecircle.m_nPointIndex;
+ m_nPointNum = queuecircle.m_nPointNum;
+
+ memcpy(m_pPoints, queuecircle.m_pPoints, sizeof(T)*queuecircle.m_nMemSize);
+
+
+
+ return *this;
+ }
\ No newline at end of file
--
Gitblit v1.9.3