fix the bug that explorer has duplicate nodes

jdneo · jdneo · commit 8024c3db00a1 · 2018-02-22T16:16:10.000+08:00
diff --git a/src/leetCodeExplorer.ts b/src/leetCodeExplorer.ts
@@ -41,7 +41,6 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod
     constructor(private context: vscode.ExtensionContext, private channel: vscode.OutputChannel) { }
 
     public async refresh(): Promise<void> {
-        this.treeData.clear();
         await this.getProblemData();
         this.onDidChangeTreeDataEvent.fire();
     }
@@ -100,14 +99,14 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod
 
     private async getProblemData(): Promise<void> {
         const allProblems: list.IProblem[] = await list.listProblems(this.channel);
+        this.treeData.clear();
         for (const problem of allProblems) {
             const problems: list.IProblem[] | undefined = this.treeData.get(problem.difficulty);
             if (problems) {
                 problems.push(problem);
             } else {
                 this.treeData.set(problem.difficulty, [problem]);
             }
-
         }
     }
 
@@ -156,5 +155,4 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod
         });
         return difficultynodes;
     }
-
 }

Original file line number	Diff line number	Diff line change
`@@ -41,7 +41,6 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod`
`41`	`41`	`constructor(private context: vscode.ExtensionContext, private channel: vscode.OutputChannel) { }`
`42`	`42`
`43`	`43`	`public async refresh(): Promise<void> {`
`44`		`- this.treeData.clear();`
`45`	`44`	`await this.getProblemData();`
`46`	`45`	`this.onDidChangeTreeDataEvent.fire();`
`47`	`46`	`}`
`@@ -100,14 +99,14 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod`
`100`	`99`
`101`	`100`	`private async getProblemData(): Promise<void> {`
`102`	`101`	`const allProblems: list.IProblem[] = await list.listProblems(this.channel);`
	`102`	`+ this.treeData.clear();`
`103`	`103`	`for (const problem of allProblems) {`
`104`	`104`	`const problems: list.IProblem[] \| undefined = this.treeData.get(problem.difficulty);`
`105`	`105`	`if (problems) {`
`106`	`106`	`problems.push(problem);`
`107`	`107`	`} else {`
`108`	`108`	`this.treeData.set(problem.difficulty, [problem]);`
`109`	`109`	`}`
`110`		`-`
`111`	`110`	`}`
`112`	`111`	`}`
`113`	`112`
`@@ -156,5 +155,4 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod`
`156`	`155`	`});`
`157`	`156`	`return difficultynodes;`
`158`	`157`	`}`
`159`		`-`
`160`	`158`	`}`