Processing method of self-description data object

• US 20040154023A1
• Filed: 12/30/2003
• Published: 08/05/2004
• Est. Priority Date: 12/31/2002
• Status: Abandoned Application

• Current Assignee: Koretide Company
• Original Assignee: Koretide Company
• Inventors: Wang, Weihan, Chen, Rong, Liang, Yuzhou, Ye, Zhongqiang
• Application Number:
  US10/747,231
• Publication Number:
  US 20040154023A1
• Time in Patent Office: Days
• US Class Current: 719/310
• CPC Class Codes: G06F 9/548 Object oriented; Remote method invocation [RMI] non-remote method invocation G06F9/449

Abstract

A processing method of self-description data object, in data object utilization, allocate the store space to data object sample and assign the data object sample, in canceling the utilization of the data object sample, release the store space occupied by the data object. The user needn'"'"'t know about the internal structure of the data class in present invention, and could access the relative internal structure element with only the method provided by this data class. In compatibility with COM technology, the present invention provides a store structure of data class. The present invention has the following advantages: the ideal data information could be obtained through limited parameter transfer; the service component load may be reduced effectively and response promptly to the application request; the data double meaning may be reduced, computing error is avoided and meet the compatibility requirement of component.

Claims

1. A processing method of self-description data object, characterized in that:

It includes at least;

in data object utilization, allocate the relative store space to data object sample and assign the data object sample, in canceling the utilization of the data object sample, release the store space occupied by the data object.

2. A processing method of self-description data object according to claim 1, characterized in that:

The method includes further;

judge the effectiveness of data object sample class, and return back the judge result.

3. A processing method of self-description data object according to claim 1, characterized in that:

The method includes further;

changeover with force the utilized data object sample class.

4. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is a character string object,

Said concrete operation of allocating the relative store space for data object includes at least;

create the character string object sample for specified character string in memory, allocate the store space of specified effective length to the character string object sample;

Said concrete operation of allocating the relative store space for data object sample includes at least;

re-create the character string object sample, and release the store space of original character string object sample;

re-create the character string object sample according to the effective length, and release the store space of original character string object sample.

5. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is a character string or character buffer storage object, the method includes further;

read out the character string length or character number.

6. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is a character string object, the method includes further;

compare two character string objects.

7. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is byte or character buffer storage object, said concrete operation of allocating the relative store space for data object sample is;

if the byte or character buffer storage object sample doesn'"'"'t existed, allocate non-initialized or initialized store space of specified quantity to the byte or character buffer storage object sample;

otherwise it doesn'"'"'t operate for store allocation.

8. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is byte buffer storage object, the method includes further;

read out the utilized byte number, set the utilized byte number, insert the specified new content in buffer storage space of byte buffer storage sample object, if it exceeds the volume of buffer storage space, the exceeded content would be truncated or lost.

9. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is byte or character buffer storage object, the method includes further;

read out the buffer area volume, assign new value to the existed byte buffer storage object, and add in new content behind the utilized buffer storage space, when it exceeds the buffer storage space, the exceeded part would be truncated.

10. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is array object, said method includes at least;

declare a array description, copy the array pointer;

declare a array object and allocate the store for buffer area at same time, if the array object sample doesn'"'"'t existed, allocate non-initialized or initialized store space of specified quantity to the array object sample, otherwise it doesn'"'"'t operate for store allocation.

11. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is array object, the method includes further;

obtain the array length, access the array element, and create dynamically the array object, allocate the store for buffer area at same time, and return back the array description.

12. A processing method of self-description data object according to claim 3, characterized in that:

When the data object sample is array object, and delete the array object, the method includes further;

delete the array buffer area, and release the occupied store space.

13. A processing method of self-description data object according to claim 4, characterized in that:

Said character string object has at least;

1^st area, 2^nd area and 3rd area;

in which, the 1^st area stores the 2^nd area length;

2^nd area stores the uniform character coding standard character string;

3^rd area stores end mark.

14. A processing method of self-description data object according to claim 13, characterized in that:

Said character string object variable may be allocated to stack or pile.

15. A processing method of self-description data object according to claim 7, characterized in that:

Said byte buffer object has at least;

1^st part, 2^nd part and 3^rd part;

in which, the 1^st part is for the 2^nd part length value;

2^nd part stores the byte data, 3^rd part stores end mark.

16. A processing method of self-description data object according to claim 15, characterized in that:

Said byte buffer object variable may be allocated to stack or pile.

17. A processing method of self-description data object according to claim 5, characterized in that:

Said character buffer storage object has at least;

1^st part, 2^nd part and 3^rd part;

in which, the 1^st part is for the 2^nd part length value;

2^nd part stores the byte data, 3^rd part stores end mark.

18. A processing method of self-description data object according to claim 17, characterized in that:

Said byte data includes at least;

1^st area, 2^nd area and 3^rd area;

in which, the 1^st area stores the 2^nd area length value;

2^nd area stores the uniform character coding standard character string;

3^rd area stores end mark.

19. A processing method of self-description data object according to claim 17, characterized in that:

Said character buffer storage object variable may be allocated to stack or pile.

20. A processing method of self-description data object according to claim 10, characterized in that:

Said array object has at least 3 parts;

in which, the 1^st part stores the public mark (GUID), 2^nd part stores the safe array (SAFEARRAY), 3^rd part stores array data.

21. A processing method of self-description data object according to claim 20, characterized in that:

Said array object may be allocated to stack or pile.