forked from nus-cs2113-AY2324S1/ip
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
resolve merging issues with branch-Level-6
- Loading branch information
Showing
5 changed files
with
172 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
1.[T][ ] kill akshay | ||
2.[T][ ] kill minjun | ||
3.[D][ ] kill (by: 9) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
[E][ ] rohit attend cs2113 lecture Friday 22 Sep 2023 (from: 4pm to: 6pm) | ||
|
||
how to merge files? | ||
|
||
|
||
save function: | ||
assume task list is empty: | ||
1. every new task is added to text file | ||
2. text file is hardcoded in | ||
subtasks: | ||
1. create file, done | ||
2. create filepath, done | ||
3. only want valid inputs into dukey, so it just copies the task array onto dukey. OKAY | ||
-> a function that after each iteration of the loop, updates dukey by what is inside the task array | ||
task array, array of items that are of the class 'tasks', so write a function that goes through each | ||
item in the array and then prints the task into dukey.txt, where should this function be? OKAY. | ||
|
||
**Ok now, I change fw.write to append, which means i only add the last element of the task array.** | ||
|
||
|
||
assume opening a pre-existing task list: | ||
1. every file in the task list should be added to the task arrays. | ||
yep, how tf do i do this. -> make a function fileToTaskArray | ||
iterate through each line of text in file, add the subclass and its properties accordingly into taskarray | ||
write function to print out the file first, then focus on the taskarray, WORKS! | ||
add the subclass and its properties accordingly into taskarray -> for each line, use the same function, | ||
dont care that they have outputs rn, | ||
2. the remaining function should work as normal | ||
assume no files to open: | ||
1. handle file doesnt exist case -> how? | ||
create new file, add the link to the dukey | ||
2. handle folder doesnt exist case -> how? | ||
|
||
set done, and mark is not working WORKS | ||
narrow the issue, when a perfect line from the file is input into the task file not solved but not important | ||
|
||
ok so what is the flow now. | ||
1. run program | ||
2. open file (if file exists) | ||
3. copy the shit in the file into array | ||
4. for every new insertion into the array, append it into the file | ||
5. have to modify this for deadline and event | ||
|
||
|
||
bugs: | ||
- something wrong with the indexing | ||
- | ||
|
||
ok deadline | ||
1. do i need to fix the description now?. no | ||
2. just do the file tasks first | ||
task arry to file function work for all :)) | ||
file to task array | ||
parse deadline | ||
|
||
goals: | ||
1. save should work | ||
2. implement the fkin make new file if file doesnt exist | ||
|
||
killminjun (by: 9pm on tuesday) -> parse into description and due | ||
use split -> split by: (end of this index) until ')' use indexat to find this | ||
make a duplicate | ||
use split -> (by: (start of this index) | ||
|
||
3.[D][ ] killminjun (by: 9) | ||
|
||
|
||
4.[E][ ] killmj (from: 5 to: 9pm ) | ||
substring from index 8 to (from |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
Manifest-Version: 1.0 | ||
Main-Class: Dukey | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters