-
Notifications
You must be signed in to change notification settings - Fork 153
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* bug: intermediate commit to allow work on another bug * bug: add more robust handling of IllegalArgumentException in GCToolKit::analyize * tidy: remove debug to stdout to logging framework * refactor: Ensure DateTimeStamp cannot be malformed and it behaves if the timestamp is missing * refactor: update pom for new GC log test data bundle * tidy: address comments from PR * Update parser/src/main/java/com/microsoft/gctoolkit/parser/GCLogParser.java * feature: first push to combine CMS parser with GenerationalHeapParser * depreciate: depreciated the CMS preunified event source * refactor: get all tests to pass * refactor: continue to get tests to pass * refactor: continue to get tests to pass * refactor: collapse CMS phases parser into generational parser * refactor: GenerationalHeapParser was duplicating CMF failures under certain conditions * refactor: ensure GC log is closed when discovering the format * refactor: add test for reported bug * refactor: add ability to parse very simple logs preunified logs * refactor: remove no longer needed print statement * refactor: tidy from review --------- Co-authored-by: Martijn Verburg <[email protected]>
- Loading branch information
Showing
15 changed files
with
546 additions
and
365 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
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
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 |
---|---|---|
|
@@ -22,8 +22,6 @@ public interface Diarizer { | |
|
||
boolean completed(); | ||
|
||
void fillInKnowns(); | ||
|
||
boolean diarize(String line); | ||
|
||
} |
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 |
---|---|---|
|
@@ -76,13 +76,28 @@ public String getDateStamp() { | |
} | ||
} | ||
|
||
/** | ||
* | ||
* @return the date timestamp paring found at the beginning of the GC log line. | ||
*/ | ||
public DateTimeStamp getDateTimeStamp() { | ||
return getDateTimeStamp(1); | ||
} | ||
|
||
public DateTimeStamp getDateTimeStamp(int index) { | ||
/** | ||
* If a line contains multiple date timestamp group pairing then return the nth pair. | ||
* The following example contains 3 different date timestamps. index of 1 yields 57724.218 | ||
* whereas index 3 yields 2010-04-21T10:45:[email protected] | ||
* <code> | ||
* 57724.218: [Full GC 57724.218: [CMS2010-04-21T10:45:33.367+0100: 57724.319: [CMS-concurrent-mark: 2.519/2.587 secs] | ||
* <code/> | ||
* one time stamp or a date timestamp pairing | ||
* @param nth is date timestamp field pair to be returned | ||
* @return the nth date timestamp pairing | ||
*/ | ||
public DateTimeStamp getDateTimeStamp(int nth) { | ||
Matcher matcher = DATE_TIME_STAMP_RULE.matcher(trace.group(0)); | ||
for (int i = 0; i < index - 1; i++) | ||
for (int i = 0; i < nth - 1; i++) | ||
if (!matcher.find()) | ||
break; | ||
if (matcher.find()) { | ||
|
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
Oops, something went wrong.