Guest User

Untitled

a guest
Jun 24th, 2018
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.77 KB | None | 0 0
  1. #include <iostream>
  2. #include "ArrayList.h"
  3.  
  4. using namespace std;
  5.  
  6. void ArrayList::LInsert(const LData &data)
  7. {
  8. if (numOfData > LIST_LEN) {
  9. cout << "저장이 불가능합니다" << endl;
  10. return;
  11. }
  12.  
  13. arr[numOfData] = data;
  14. numOfData++;
  15. }
  16.  
  17. bool ArrayList::LFirst(LData &data)
  18. {
  19. if (numOfData == 0)
  20. return false;
  21.  
  22. curPosition = 0;
  23. data = arr[0];
  24. return true;
  25. }
  26.  
  27. bool ArrayList::LNext(LData &data)
  28. {
  29. if (curPosition >= numOfData - 1)
  30. return false;
  31.  
  32. curPosition++;
  33. data = arr[curPosition];
  34. return true;
  35. }
  36.  
  37. LData ArrayList::LRemove()
  38. {
  39. int rpos = curPosition;
  40. int num = numOfData;
  41. LData rdata = arr[rpos];
  42.  
  43. for (int i = rpos; i < num - 1; i++) {
  44. arr[i] = arr[i + 1];
  45. }
  46.  
  47. numOfData--;
  48. curPosition--;
  49. return rdata;
  50. }
  51.  
  52. int ArrayList::LCount()
  53. {
  54. return numOfData;
  55. }
Add Comment
Please, Sign In to add comment