CN115600557B

CN115600557B - Directory data processing method and device, electronic equipment and storage medium

Info

Publication number: CN115600557B
Application number: CN202211504603.6A
Authority: CN
Inventors: 黄彩峰; 周忠法; 李锦泉; 刘明星; 李杨
Original assignee: Mingdu Zhiyun Zhejiang Technology Co Ltd
Current assignee: Mingdu Zhiyun Zhejiang Technology Co Ltd
Priority date: 2022-11-29
Filing date: 2022-11-29
Publication date: 2023-03-21
Anticipated expiration: 2042-11-29
Also published as: CN115600557A

Abstract

The application provides a directory data processing method and device, electronic equipment and a storage medium, and relates to the technical field of page design. The method comprises the following steps: splitting each directory character string to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy of each directory path; storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path; reading the related directory paths from the containers of each hierarchy in sequence according to the hierarchy sequence of the containers of each hierarchy, and establishing an initial directory chain table according to the related directory paths; reordering the nodes in the initial directory chain table according to the directory hierarchical relationship to obtain a processed directory chain table; and returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying a directory tree structure obtained after rendering. The scheme solves the problem that in the prior art, all directories displayed by the terminal equipment are scattered.

Description

Directory data processing method and device, electronic equipment and storage medium

Technical Field

The invention relates to the technical field of page design, in particular to a directory data processing method and device, electronic equipment and a storage medium.

Background

With the increasing demand of people for processing document data of web pages, the requirements on the logicality and the aesthetic property of data display are higher and higher.

Currently, in the related art, a server at a back end acquires a directory character string returned by different Application Programming Interfaces (APIs), and the server performs processing such as deduplication and sorting on directory information in the directory character string to obtain a processed directory, and returns the processed directory to a terminal device for display.

However, the directories displayed on the terminal device are relatively scattered, so that the user cannot intuitively find the hierarchical relationship among the directories conveniently.

Disclosure of Invention

The present invention is directed to provide a method, an apparatus, an electronic device, and a storage medium for processing directory data, so as to solve the problem that directories displayed on a terminal device are relatively scattered in the prior art, and it is not convenient for a user to intuitively find a hierarchical relationship between the directories.

In order to achieve the above purpose, the technical solutions adopted in the embodiments of the present application are as follows:

in a first aspect, an embodiment of the present application provides a directory data processing method, where the method includes:

splitting each directory character string returned by each application program interface respectively to obtain a plurality of directory paths corresponding to each directory character string and the hierarchy of each directory path, wherein each directory path has an inclusion relationship in sequence according to the hierarchy;

storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path;

reading related directory paths from the containers in each hierarchy in sequence according to the hierarchy sequence of the containers in each hierarchy, and establishing an initial directory chain table according to the related directory paths, wherein the related directory paths meet the following conditions: if a first directory path in a first hierarchical container is contained in a second directory path in a second hierarchical container in the first hierarchical container and the second hierarchical container, the first directory path and the second directory path are associated directory paths, wherein the directory chain table comprises a plurality of nodes, and each node stores one directory path;

reordering the nodes in the initial directory chain table according to the directory hierarchical relationship to obtain a processed directory chain table;

and returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying a directory tree structure obtained after rendering.

Optionally, the splitting each directory character string returned by each application program interface to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy where each directory path is located includes:

splitting the directory character string into a plurality of directory paths according to a preset path separator;

and determining the hierarchy of each directory path according to the number of the path separators in each directory path.

Optionally, the reading, in order according to the hierarchical order of the containers in each hierarchy, the associated directory paths from the containers in each hierarchy, and establishing an initial directory chain table according to the associated directory paths includes:

reading a first directory path from a current first-level container, and adding the first directory path as a first newly-added node of the initial directory chain table to the initial directory chain table;

and querying at least one second directory path containing the first directory path in a second hierarchical container adjacent to the first hierarchical container and behind the first hierarchical container, taking each second directory path as a second newly-added node behind a first newly-added node in the initial directory chain table, and adding each second newly-added node into the initial directory chain table.

Optionally, the step of taking each second directory path as a second newly added node after the first newly added node in the initial directory chain table, and adding each second newly added node to the initial directory chain table includes:

and if the number of the second directory paths is multiple, adding the first read second directory path to the initial directory chain table after the first newly-added node, and sequentially adding other second directory paths to the initial directory chain table according to the reading sequence.

Optionally, the reordering the nodes in the initial directory chain table according to the directory hierarchy to obtain the processed directory chain table includes:

traversing each node in the initial directory chain table, determining a superior father directory and a subordinate subdirectory of a directory path in the node aiming at the currently traversed node, and reordering each node in the directory chain table according to the superior father directory and the subordinate subdirectory of the directory path;

and if all the nodes in the initial directory linked list are traversed, taking the reordered initial directory linked list as the processed directory linked list.

Optionally, the determining, for the currently traversed node, a superior parent directory and a subordinate child directory of a directory path in the node, and reordering the nodes in the directory chain table according to the superior parent directory and the subordinate child directory of the directory path includes:

for a currently traversed node, searching a child node containing a directory path in the traversed node and a parent node contained by the directory path in the traversed node in the initial directory chain table, moving the parent node to be in front of the currently traversed node, and moving the child node to be behind the currently traversed node.

Optionally, the storing each directory path into a hierarchical container corresponding to a hierarchy in which each directory path is located includes:

determining whether the directory path exists in a hierarchical container corresponding to the hierarchy of the directory path;

if not, storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path.

In a second aspect, an embodiment of the present application further provides a directory data processing apparatus, where the apparatus includes:

the splitting module is used for splitting each directory character string returned by each application program interface respectively to obtain a plurality of directory paths corresponding to each directory character string and the hierarchy of each directory path, wherein each directory path has an inclusion relationship in sequence according to the hierarchy;

the storage module is used for storing each directory path into a hierarchical container corresponding to the hierarchy where each directory path is located;

the establishing module is used for reading the associated directory paths from the containers in each hierarchy in sequence according to the hierarchy sequence of the containers in each hierarchy, and establishing an initial directory chain table according to the associated directory paths, wherein the associated directory paths meet the following conditions: if a first directory path in a first hierarchical container is contained in a second directory path in a second hierarchical container in the first hierarchical container and the second hierarchical container, the first directory path and the second directory path are associated directory paths, wherein the directory chain table comprises a plurality of nodes, and each node stores one directory path;

the sorting module is used for re-sorting the nodes in the initial directory linked list according to the directory hierarchical relationship to obtain a processed directory linked list;

and the return module is used for returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying a directory tree structure obtained after rendering.

Optionally, the splitting module is further configured to:

Optionally, the establishing module is further configured to:

if the number of the second directory paths is multiple, adding the first read second directory path to the initial directory chain table after the first newly added node, and sequentially adding other second directory paths to the initial directory chain table according to the reading sequence.

Optionally, the sorting module is further configured to:

Optionally, the storage module is further configured to:

and if not, storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path.

In a third aspect, an embodiment of the present application further provides an electronic device, including: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the electronic device is operating, the processor executing the machine-readable instructions to perform the steps of the method as provided by the first aspect.

In a fourth aspect, the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to perform the steps of the method as provided in the first aspect.

The beneficial effect of this application is:

the embodiment of the application provides a directory data processing method, a device, electronic equipment and a storage medium, in the scheme, directory character strings returned by application program interfaces are respectively split to obtain a plurality of directory paths corresponding to the directory character strings and the levels of the directory paths, and the directory paths are stored in level containers corresponding to the levels of the directory paths; then, reading the associated directory paths from the containers in each hierarchy in sequence according to the hierarchy sequence of the containers in each hierarchy, establishing an initial directory chain table according to the associated directory paths, and reordering the nodes in the initial directory chain table according to the directory hierarchy relationship to obtain a processed directory chain table; therefore, each directory path can be stored into different nodes in the processed directory chain table according to the directory hierarchy of each directory path, namely the directory paths stored in the processed directory chain table are ordered, and the directory hierarchical relationship between each directory path is clear, so that the terminal device renders each directory path according to the directory hierarchical relationship of each directory path in the processed directory chain table to obtain a directory tree structure, and thus, a user can obtain a complete directory structure and hidden directory contents at a glance according to the directory tree structure displayed on the terminal device interface, the hierarchical relationship between each directory can be more conveniently found visually by the user, and the problem that in the prior art, the directories displayed by the terminal device are relatively scattered is solved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.

Fig. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure;

fig. 2 is a schematic flowchart of a directory data processing method according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of a hierarchical container provided in an embodiment of the present application;

FIG. 4 is a diagram of an initial directory chain table provided in an embodiment of the present application;

FIG. 5 is a diagram illustrating a processed directory chain table according to an embodiment of the present application;

FIG. 6 is a diagram illustrating a directory tree structure according to an embodiment of the present application;

fig. 7 is a schematic flowchart of another directory data processing method according to an embodiment of the present application;

fig. 8 is a schematic flowchart of another directory data processing method according to an embodiment of the present application;

fig. 9 is a schematic flowchart of another directory data processing method according to an embodiment of the present application;

fig. 10 is a schematic flowchart of another directory data processing method according to an embodiment of the present application;

fig. 11 is a schematic structural diagram of a directory data processing apparatus according to an embodiment of the present application.

Detailed Description

In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and steps without logical context may be performed in reverse order or simultaneously. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.

In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.

It should be noted that the term "comprising" will be used in the embodiments of the present application to indicate the presence of the features stated hereinafter, but does not exclude the addition of further features.

Fig. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure; the electronic device may be a processing device such as a computer or a server, and is used to implement the directory data processing method provided by the present application. As shown in fig. 1, the electronic apparatus includes: a processor 101 and a memory 102.

The processor 101 and the memory 102 are electrically connected directly or indirectly to realize data transmission or interaction. For example, electrical connections may be made through one or more communication buses or signal lines.

The processor 101 may be an integrated circuit chip having signal processing capability. The Processor 101 may be a general-purpose Processor including a Central Processing Unit (CPU), a Network Processor (NP), and the like. The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The Memory 102 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.

It will be appreciated that the configuration of fig. 1 is merely illustrative and that the electronic device may also include more or fewer components than shown in fig. 1 or have a different configuration than shown in fig. 1. The components shown in fig. 1 may be implemented in hardware, software, or a combination thereof.

The memory 102 is used for storing a program, and the processor 101 calls the program stored in the memory 102 to execute the directory data processing method provided in the following embodiments.

The following describes a directory data processing method and corresponding beneficial effects provided by the present application through a plurality of embodiments.

Fig. 2 is a schematic flowchart of a directory data processing method provided in an embodiment of the present application, and optionally, an execution subject of the method may be an electronic device such as a server or a computer, and the electronic device has a data processing function.

It should be understood that in other embodiments, the order of some steps in the catalog data processing method may be interchanged according to actual needs, or some steps may be omitted or deleted. As shown in fig. 2, the method includes:

s201, splitting each directory character string returned by each application program interface respectively to obtain a plurality of directory paths corresponding to each directory character string and the hierarchy of each directory path.

Wherein, each directory path has an inclusion relation in sequence according to the hierarchy.

Illustratively, the following table 1 shows the directory strings returned for each api, specifically as follows:

application program interface serial number	Directory string returned by application program interface
		Application program interface 1	“ D 214\\D323 ”
Application program interface 2	“ D 214\\D32311\\D323111 ”
		Application program interface 3	“ D 214 ”
Application program interface 4	“ D 214\\D32311 ”
		Application program interface 5	“ D 72 ”
Application program interface 6	“ D 92 ”
		Application program interface 7	“ D 214\\D32311\\D323111\\D323222 ”

TABLE 1

For example, taking the directory string returned by the application program interface 2 as an example, the directory string "D214\ D32311\ D323111" is split, and the directory paths are "D214", "D214\ D323", "D214\ D32311\ D323111", respectively. Wherein, "D214\ D32311\ D323111" includes "D214", "D214\ D323", and "D214\ D323" includes "D214", that is, each directory path has a containment relationship in order according to the hierarchy.

According to the split directory paths, the hierarchy of the directory path 'D214' is a first-level directory, the hierarchy of the directory path 'D214 \ D323' is a second-level directory, and the hierarchy of the directory path 'D214 \ D32311\ D323111' is a third-level directory. Wherein, each directory path has an inclusion relationship in order according to the hierarchy.

Similarly, the directory character strings returned by other application program interfaces can be split in the same manner, and a plurality of directory paths corresponding to the directory character strings and the hierarchy of the directory paths can be obtained.

S202, storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path.

Wherein a hierarchical container is a container for storing objects. Illustratively, a hierarchical container may be a bucket, for example, where each object is stored in one bucket, and where multiple objects may be stored in one bucket.

For example, the bucket corresponding to the first-level directory is bucket 1, the bucket corresponding to the second-level directory is bucket 2, and the bucket corresponding to the third-level directory is bucket 4.

On the basis of the above embodiment, referring to fig. 3, the directory path "D214" may be stored to bucket 1 according to the hierarchy of the directory path "D214" as a first-level directory; storing the directory path D214\ D323 to the bucket 2 according to the hierarchy of the directory path D214\ D323 as a secondary directory; and storing the directory path "D214\ D32311\ D323111" to bucket 3 according to the directory path "D214\ D32311\ D323111" being a tertiary directory at the level.

Splitting the directory character string "D72" returned by the application program interface 5 to obtain the directory path "D72", and taking the hierarchy of the directory path "D72" as a first-level directory, that is, storing the directory path "D72" to the bucket 1 according to the hierarchy of the directory path "D72" as the first-level directory. That is, bucket 1 may store a plurality of directory paths such as "D214" and "D72", and the hierarchy of each directory path is a first-level directory.

S203, reading the related directory paths from the containers in each hierarchy in sequence according to the hierarchy sequence of the containers in each hierarchy, and establishing an initial directory chain table according to the related directory paths.

The associated directory path satisfies the following condition: if a first directory path in the first hierarchical container is contained in a second directory path in the second hierarchical container in the first hierarchical container and the second hierarchical container, the first directory path and the second directory path are associated directory paths, wherein a directory chain table comprises a plurality of nodes, and one directory path is stored in each node.

Illustratively, the hierarchical order of the hierarchical containers may be, for example, bucket 1 as a primary container, bucket 2 as a secondary container, bucket 3 as a tertiary container, and so on.

In this embodiment, the directory path "D214\ \ D323" associated with the directory path "D214" can be read from bucket 2 according to the directory path "D214" stored in bucket 1; from the directory path "D214\ \ D323" stored in bucket 2, the associated directory path "D214\ \ D32311\ \ D323111" is read from bucket 3. Referring to FIG. 4, an initial directory chain table A is created from the read associated directory paths "D214\ D323" and "D214\ D32311\ D323111".

Similarly, the directory path associated with the directory path "D72" may also be read from the bucket 2 according to the directory path "D72" stored in the bucket 1, and the directory path associated with the directory path "D72" is not stored in the bucket 2, that is, the directory path associated with the directory path "D72" in the bucket 1 does not exist, or the initial directory chain table B may also be established according to the directory path "D72".

And S204, reordering the nodes in the initial directory chain table according to the directory hierarchical relationship to obtain the processed directory chain table.

In this embodiment, it is considered that the operations in step S203 are implemented concurrently, so that the directory paths in the obtained initial directory list are not arranged sequentially. Therefore, the directory paths stored by each node in the initial directory linked list need to be sorted by a recursion principle to obtain a processed directory linked list, that is, each directory path stored in the processed directory linked list is ordered and structured, and the directory hierarchical relationship between each directory path is clear.

Referring to fig. 5, after the nodes in the initial directory chain table a are reordered according to the directory hierarchical relationship, a processed directory chain table a is obtained.

And S205, returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying the rendered directory tree structure.

In this embodiment, referring to fig. 6, the processed directory chain table a may be returned to the terminal device, and the terminal device performs rendering processing on each directory path according to the directory hierarchical relationship of each directory path in the processed directory chain table a to obtain a directory tree structure after the rendering processing, so that a user may obtain a complete directory structure and hidden directory contents at a glance according to the directory tree structure displayed on the terminal device interface, thereby solving the problem that in the prior art, the directories displayed by the terminal device are relatively scattered, and being not convenient for the user to directly find the hierarchical relationship between the directories.

Alternatively, the number of "processed directory lists" may be plural in consideration of returning to the terminal device. Therefore, the terminal device performs operations such as traversal and recursion operations on the plurality of processed directory lists, and renders the plurality of processed directory lists into a directory tree structure.

In addition, the display directories in the directory tree structure and the directory paths corresponding to the display directories can be linked according to the directory paths in the processed directory linked list, a click event of each display directory in the directory tree structure is generated, and after a target directory in the directory tree structure is clicked, data under the directory paths corresponding to the target directory can be obtained; meanwhile, the folding effect can be added to the generated directory tree structure, namely, after the target directory in the directory tree structure is clicked, the target directory and the subdirectories thereof can be displayed/hidden, and the required data can be flexibly displayed.

To sum up, in the present disclosure, a method for processing directory data is provided, in which each directory character string returned by each application program interface is split respectively to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy where each directory path is located, and each directory path is stored in a hierarchy container corresponding to the hierarchy where each directory path is located; then, reading the associated directory paths from the containers in each hierarchy in sequence according to the hierarchy sequence of the containers in each hierarchy, establishing an initial directory chain table according to the associated directory paths, and reordering the nodes in the initial directory chain table according to the directory hierarchy relationship to obtain a processed directory chain table; therefore, each directory path can be stored into different nodes in the processed directory chain table according to the directory hierarchy of each directory path, namely, the directory paths stored in the processed directory chain table are ordered, and the directory hierarchical relationship among the directory paths is clear, so that the terminal device can render each directory path according to the directory hierarchical relationship among the directory paths in the processed directory chain table to obtain a directory tree structure, and therefore, a user can obtain a complete directory structure and hidden directory contents at a glance according to the directory tree structure displayed on the terminal device interface, the hierarchical relationship among the directories can be conveniently found visually by the user, and the problem that the directories displayed by the terminal device in the prior art are scattered is solved.

How to split each directory character string returned by each application program interface in step S201 is specifically explained through the following embodiments, so as to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy of each directory path.

Alternatively, referring to fig. 7, the step S201 includes:

s701, splitting the directory character string into a plurality of directory paths according to preset path separators.

S702, determining the hierarchy of each directory path according to the number of the path separators in each directory path.

In this embodiment, the path separator is "\\". For example, continuing to take the directory string returned by the application program interface 2 as an example, the directory string "D214\ D32311\ D323111" may be split according to the path separator "\\" in the directory string, so as to obtain a plurality of directory paths such as "D214", "D214\ D323", "D214\ D32311\ D323111".

Meanwhile, the hierarchy of each directory path can be obtained according to the number of the path separators in the split directory paths. For example, if the number of the path separators in the directory path "D214" is 0, the hierarchy of the directory path "D214" is a first-level directory; if the number of the path separators in the directory path "D214\ D323" is 1, the level of the directory path "D214\ D323" is a secondary directory; the number of path separators in the directory path "D214\ D32311\ D323111" is 2, then the directory path "D214\ D32311\ D323111" is at a level of three levels of directory.

How to read the associated directory paths from the containers in each hierarchy in sequence according to the hierarchical order of the containers in each hierarchy in step S203 will be specifically explained through the following embodiments, and an initial directory chain table is established according to the associated directory paths.

Alternatively, referring to fig. 8, the step S203 includes:

s801, reading a first directory path from the current first-level container, and adding the first directory path as a first newly-added node of the initial directory linked list into the initial directory linked list.

In this embodiment, a first-level directory is used as a breakthrough, for example, a first directory path "D214" is read from bucket 1, and an initial directory chain table is created at the same time, where the initial directory chain table is an empty chain table, then "D214" is used as a first newly added node (i.e., an initial node) in the created initial directory chain table, and "D214" is stored in the first newly added node in the initial directory chain table.

S802, at least one second directory path containing the first directory path is inquired in a second hierarchical container which is adjacent to the first hierarchical container and behind the first hierarchical container, each second directory path is used as a second newly-added node behind the first newly-added node in the initial directory chain table, and each second newly-added node is added into the initial directory chain table.

On the basis of the above embodiment, for example, the directory path stored in the bucket 2 includes: "D214\ \ D323", that is, the second directory path containing the first directory path "D214" is queried in the second hierarchical container bucket 2 adjacent to and after the first hierarchical container as "D214\ \ D323", the "D214\ \ D323" is taken as the second new added node after the first new added node in the initial directory chain table, and the "D214\ \ D323" is stored in the second new added node in the initial directory chain table.

And circularly executing the steps S801-S802, inquiring at least one third directory path containing the second directory path in a third hierarchical container adjacent to the second hierarchical container and behind the second hierarchical container, taking each third directory path as a third newly-added node behind a second newly-added node in the initial directory chain table, adding each third newly-added node into the initial directory chain table, if the third hierarchical container is the last hierarchical container, adding the directory path inquired in the last hierarchical container to the last node in the initial directory chain table, and repeating the steps until all the hierarchical containers are traversed.

Optionally, taking each second directory path as a second newly-added node after the first newly-added node in the initial directory chain table, and adding each second newly-added node to the initial directory chain table, including:

and if the number of the second directory paths is multiple, adding the first read second directory path to the first newly-added node in the initial directory chain table, and sequentially adding other second directory paths to the initial directory chain table according to the reading sequence.

It should be understood that the number of querying second hierarchical containers adjacent to and subsequent to the first hierarchical container for second directory paths containing the first directory path may be 1 or more. For example, the directory character string "D214\ D32311" returned by the application program interface 4 is split to obtain multiple directory paths "D214", "D214\ D32311", and the like, where the directory path "D214" is at a first-level directory and the directory path "D214\ D32311" is at a second-level directory, that is, the directory path "D214" may be stored in bucket 1 and the directory path "D214\ D32311" may be stored in bucket 2.

At this time, the directory path stored in bucket 2 includes: "D214\ \ D323", "D214\ \ D32311", that is, the number of second directory paths containing the first directory path "D214" is 2, that is, "D214\ \ D323", "D214\ \ D32311", when queried in the second hierarchical container bucket 2 adjacent to and after the first hierarchical container.

Thus, after the second directory path "D214\ \ D323", "D214\ \ D32311" containing the first directory path "D214" is read in bucket 2 for the second directory path "D214\ \ D323", "D214\ \ D32311" adjacent to and subsequent to the first hierarchical container, D214\ \ D323"," D214\ \ D32311 "is added to the initial directory chain list in the order of reading of" D214\ \ D323"," D214\ \ D32311 "in the node subsequent to the first newly added node.

How to reorder the nodes in the initial directory linked list according to the directory hierarchical relationship in step S204 above will be specifically explained through the following embodiments, so as to obtain a processed directory linked list.

Alternatively, referring to fig. 9, the step S204 includes:

s901, traversing each node in the initial directory chain table, determining a superior father directory and a subordinate subdirectory of a directory path in the node aiming at the currently traversed node, and reordering each node in the directory chain table according to the superior father directory and the subordinate subdirectory of the directory path.

And S902, if all the nodes in the initial directory linked list are traversed, using the reordered initial directory linked list as a processed directory linked list.

In this embodiment, after the initial directory chain table is established, directory paths stored in each node of the initial directory chain table need to be traversed to find a higher parent directory and a lower child directory of each directory path.

For example, the currently traversed node is a first node in the initial directory chain table, the directory path stored in the first node is "D214", and since the hierarchy of the directory path "D214" is a first-level directory, there is no higher-level parent directory for the directory path "D214". Therefore, only the subordinate subdirectories of the directory path "D214" need to be determined, and after multiple traversal searches, the subordinate subdirectories of the directory path "D214" are "D214\ D323", "D214\ D32311"; meanwhile, the directory path "D214" may be referred to as the superior parent directory of "D214\ \ D323", "D214\ \ D32311". At this time, "D214", "D214\ D323" and "D214\ D32311" are rearranged according to the upper and lower directory relationships among the directory paths "D214", "D214\ D323" and "D214\ D32311", and the reordered initial directory chain table is used as a new processed directory chain table.

Then, the traversal of each node in the initial directory linked list is continued, the lower subdirectories of D214\ D323 and D214\ D32311 are respectively determined, the lower subdirectories of the directory path D214\ D323 are obtained through multiple traversal searches, the lower subdirectory of the directory path D214\ D32311 is not existed, the lower subdirectory of the directory path D214\ D32311 is D323111, and the upper and lower directory relations between the directory paths D214\ D323 and D214\ D32311 and D323111 are rearranged, and the newly sorted initial directory linked list is used as the newly processed linked list of the directory path D214\ D323, D214\ D32311 and D323111.

And continuing to circularly execute the step S901 until all the nodes in the initial directory chain table are traversed, and taking the reordered initial directory chain table as the finally obtained processed directory chain table.

Optionally, for a currently traversed node, determining a superior parent directory and a subordinate child directory of a directory path in the node, and reordering nodes in the initial directory chain table according to the superior parent directory and the subordinate child directory of the directory path, including:

and aiming at the currently traversed node, searching a child node containing a directory path in the traversed node and a parent node contained in the directory path in the traversed node in the initial directory linked list, moving the parent node to the front of the currently traversed node, and moving the child node to the back of the currently traversed node.

On the basis of the above embodiment, the currently traversed node is the first node in the initial directory chain table, the directory path stored in the first node is "D214", and when the subordinate subdirectories of the directory path "D214" are "D214\ D323" and "D214\ D32311".

At this time, if the directory path stored in the first node in the initial directory chain table is "D214", the directory path stored in the second node is "D214\ D32311\ D323111", the directory path stored in the third node is "D214\ D32311", and the directory path stored in the fourth node is "D214\ D323".

The parent node may be moved to a position before the currently traversed node (i.e., the directory path stored in the first node is continuously maintained as "D214"), and the child node is moved to a position after the currently traversed node, the subordinate subdirectories "D214\ D323" and "D214\ D32311" of the directory path "D214" are both moved to a position after the currently traversed first node, i.e., the "D214\ D323" is moved to a second node after the first node, and the "D214\ D32311" is moved to a third node after the third node; meanwhile, the originally stored "D214\ D32311\ D323111\ D323222" in the second node is moved to the originally located fourth node of "D214\ D323", and the originally stored directory path in the third node is "D214\ D32311" (i.e. the directory path stored in the third node can be kept unchanged).

Thus, in the reordered initial directory chain table, the directory path stored in the first node is "D214", the directory path stored in the second node is "D214\ D323", the directory path stored in the third node is "D214\ D32311", and the directory path stored in the fourth node is "D214\ D32311\ D323111\ D323222".

How to store each directory path into the hierarchical container corresponding to the hierarchy of each directory path in step S202 will be specifically explained through the following embodiments.

Alternatively, referring to fig. 10, the step S202 includes:

s1001, whether the directory path exists in the hierarchical container corresponding to the hierarchy where the directory path is located is determined.

And S1002, if not, storing each directory path into a hierarchical container corresponding to the hierarchy of each directory path.

In this embodiment, in order to avoid that a plurality of identical directory paths are stored in each hierarchical container, that is, when a directory path is stored into a hierarchical container corresponding to the hierarchy of the directory path according to the hierarchy of a certain directory path, it is necessary to determine whether the directory path is already stored in the hierarchical container corresponding to the hierarchy of the directory path; if not, the directory path is stored into the hierarchical container corresponding to the hierarchy where the directory path is located, and if yes, the directory path does not need to be stored repeatedly, so that the resource occupation amount is reduced, and the data processing efficiency is improved.

Based on the same inventive concept, the embodiment of the present application further provides a directory data processing apparatus corresponding to the directory data processing method, and since the principle of the apparatus in the embodiment of the present application for solving the problem is similar to the directory data processing method described above in the embodiment of the present application, the implementation of the apparatus may refer to the implementation of the method, and repeated details are not described again.

Optionally, referring to fig. 11, an embodiment of the present application further provides a directory data processing apparatus, where the apparatus includes:

the splitting module 1101 is configured to split each directory character string returned by each application program interface, so as to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy where each directory path is located, where each directory path has an inclusion relationship in sequence according to the hierarchy;

a storage module 1102, configured to store each directory path into a hierarchical container corresponding to a hierarchy where each directory path is located;

the establishing module 1103 is configured to sequentially read, according to a hierarchical order of each hierarchical container, associated directory paths from each hierarchical container, and establish an initial directory chain table according to the associated directory paths, where the associated directory paths satisfy the following conditions: if a first directory path in the first hierarchical container is contained in a second directory path in the second hierarchical container in the first hierarchical container and the second hierarchical container, the first directory path and the second directory path are associated directory paths, wherein the directory chain table comprises a plurality of nodes, and each node stores one directory path;

a sorting module 1104, configured to reorder, according to a directory hierarchy relationship, each node in the initial directory linked list to obtain a processed directory linked list;

a returning module 1105, configured to return the processed directory list to the terminal device, where the terminal device performs rendering processing on each directory path in the processed directory list, and displays a directory tree structure obtained after the rendering.

Optionally, the splitting module 1101 is further configured to:

Optionally, the establishing module 1103 is further configured to:

reading a first directory path from a current first-level container, and adding the first directory path as a first newly-added node of an initial directory chain table to the initial directory chain table;

and inquiring at least one second directory path containing the first directory path in a second hierarchical container adjacent to the first hierarchical container and behind the first hierarchical container, taking each second directory path as a second newly-added node behind the first newly-added node in the initial directory chain table, and adding each second newly-added node into the initial directory chain table.

Optionally, the establishing module 1103 is further configured to:

Optionally, the sorting module 1104 is further configured to:

and aiming at the currently traversed node, searching a child node containing the directory path in the traversed node and a parent node contained in the directory path in the traversed node in the initial directory chain table, moving the parent node to the front of the currently traversed node, and moving the child node to the back of the currently traversed node.

Optionally, the storage module 1102 is further configured to:

determining whether a directory path exists in a hierarchical container corresponding to the hierarchy of the directory path;

The above-mentioned apparatus is used for executing the method provided by the foregoing embodiment, and the implementation principle and technical effect are similar, which are not described herein again.

These above modules may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), among others. For another example, when one of the above modules is implemented in the form of a Processing element scheduler code, the Processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

Optionally, the invention also provides a program product, for example a computer-readable storage medium, comprising a program which, when being executed by a processor, is adapted to carry out the above-mentioned method embodiments.

In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.

The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a portable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other media capable of storing program codes.

Claims

1. A directory data processing method, the method comprising:

returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying a directory tree structure obtained after rendering;

the reordering of the nodes in the initial directory chain table according to the directory hierarchical relationship to obtain a processed directory chain table includes:

if all the nodes in the initial directory linked list are traversed, taking the reordered initial directory linked list as the processed directory linked list;

the method comprises the steps of determining a superior father directory and a subordinate subdirectory of a directory path in a node aiming at the currently traversed node, and reordering each node in the directory chain table according to the superior father directory and the subordinate subdirectory of the directory path, and comprises the following steps:

and aiming at the currently traversed node, searching a child node containing a directory path in the traversed node and a parent node contained by the directory path in the traversed node in the initial directory linked list, moving the parent node to the front of the currently traversed node, and moving the child node to the rear of the currently traversed node.

2. The method according to claim 1, wherein the splitting each directory character string returned by each application program interface to obtain a plurality of directory paths corresponding to each directory character string and a hierarchy of each directory path includes:

3. The method according to claim 1, wherein the sequentially reading the associated directory paths from the containers in each hierarchy according to the hierarchical order of the containers in each hierarchy, and establishing an initial directory chain table according to the associated directory paths comprises:

4. The method of claim 3, wherein the taking each second directory path as a second newly added node after a first newly added node in the initial directory chain table and adding each second newly added node to the initial directory chain table comprises:

5. The method according to any one of claims 1 to 4, wherein the storing each directory path into a hierarchical container corresponding to a hierarchy in which each directory path is located comprises:

6. A directory data processing apparatus, characterized in that the apparatus comprises:

the return module is used for returning the processed directory chain table to the terminal equipment, rendering each directory path in the processed directory chain table by the terminal equipment, and displaying a directory tree structure obtained after rendering;

the sorting module is further configured to:

7. An electronic device, comprising: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the electronic device is operating, the processor executing the machine-readable instructions to perform the steps of the method according to any one of claims 1 to 5.

8. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 5.