HarmonyOS应用内配置文件读写问题

import { Context } from '@ohos.abilityAccessCtrl'; 
import hilog from '@ohos.hilog'; 
import util from '@ohos.util'; 
const TAG: string = 'testTag' 
export class Nd { 
  public _id?: string; 
  public _name?: string; 
  public _other?: string; 
  constructor(id?: string, name?: string, other?: string) { 
    this._id = id; 
    this._name = name; 
    this._other = other; 
  } 
  public set id(id: string) { 
    this._id = id 
  } 
  public set name(name: string) { 
    this._name = name 
  } 
  public set other(other: string) { 
    this._other = other 
  } 
} 
export class FileUtils { 
  public static async getFileContent(context: Context, filePath: string): Promise<Nd | undefined> { 
    try { 
      hilog.info(0x00000, TAG, 'har包读取资源文件'); 
      let data = await context.resourceManager.getRawFileContent(filePath) 
 
      if (!data) { 
        hilog.error(0x00000, TAG, '读取的数据为空'); 
        return undefined 
      } else { 
        hilog.info(0x00000, TAG, 'data:' + data.byteLength); 
      } 
      let uc = util.TextDecoder.create() 
      let result = uc.decodeWithStream(data) 
      hilog.info(0x00000, TAG, '转string后：' + result); 
      let proArr: string[]; 
      if (result.includes('\r\n')) { 
        proArr = result.split('\r\n') 
      } else { 
        proArr = result.split('\n') 
      } 
      hilog.info(0x00000, TAG, 'proArr数组长度：' + proArr.length); 
      let nd = new Nd() 
      for (let i = 0; i < proArr.length; i++) { 
        if (!proArr[i].includes('=')) { 
          continue; 
        } 
        let oneProArr = proArr[i].split('=') 
        if (oneProArr.length != 2) { 
          continue; 
        } 
        let oneProKey = oneProArr[0].trim() 
        let oneProValue = oneProArr[1].trim() 
        switch (oneProKey) { 
          case 'id': 
            nd.id = oneProValue 
            break; 
          case 'name': 
            nd.name = oneProValue 
            break; 
          case 'other': 
            nd.other = oneProValue
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
62.
63.
64.
65.