CN106293718B - method and system for moving adjacent windows in batches - Google Patents
method and system for moving adjacent windows in batches Download PDFInfo
- Publication number
- CN106293718B CN106293718B CN201610620952.2A CN201610620952A CN106293718B CN 106293718 B CN106293718 B CN 106293718B CN 201610620952 A CN201610620952 A CN 201610620952A CN 106293718 B CN106293718 B CN 106293718B
- Authority
- CN
- China
- Prior art keywords
- window
- adjacent
- windows
- rectangle
- moving
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/451—Execution arrangements for user interfaces
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Image Analysis (AREA)
- Digital Computer Display Output (AREA)
Abstract
the invention provides a method for moving adjacent windows in batches, which comprises the following steps: acquiring an adjacent window set of a window; moving the window, the other windows in the set of adjacent windows to the window move with the window. The invention also provides a system for moving the adjacent windows in batch. The method and the system can realize that the windows in the adjacent window set of the window can move along with the window at the same time by moving any one window.
Description
Technical Field
The invention relates to the technical field of window movement, in particular to a method and a system for moving adjacent windows in batch.
background
in some GUI applications, such as audio-video players, it is common to have multiple windows. The windows may be adjacent or separated. When a user moves one window in the using process, the window adjacent to the window is expected to move together, so that the user is prevented from moving a plurality of windows.
Disclosure of Invention
the technical problem to be solved by the invention is to provide a method for moving adjacent windows in batches, which can realize batch movement of the adjacent windows.
Another technical problem to be solved by the present invention is to provide a system for moving adjacent windows in batch, which can implement batch movement of adjacent windows.
in order to solve the technical problems, the technical scheme of the invention is as follows:
A method of moving adjacent windows in batches, comprising: acquiring an adjacent window set of a window; moving the window, the other windows in the set of adjacent windows to the window move with the window.
Further, before the step of obtaining a set of adjacent windows of a window, the method further comprises: initializing an adjacent window matrix, the initializing the adjacent window matrix comprising: sequentially judging the position relation between the window rw and any other window cw; if the two adjacent windows are adjacent, setting the matrix element matrix [ rw ] [ cw ] of the window rw relative to any other window cw as 1; after the position relation between the window rw and any other window cw is judged, marking the window cw as judged; and repeating the process in the undetermined window until the matrix elements between any two windows are set.
Further, the step of sequentially determining the positional relationship between the window rw and any other window cw includes: setting a rectangle according to the position of a window rw, wherein the window rw is located at the center of the rectangle, the length L of the rectangle is L + m +2, and the width D of the rectangle is D + h +2, where L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw; judging whether the center of any other window cw is positioned in the rectangle; and if the center of any other window cw is positioned in the rectangle, the any other window cw is adjacent to the window rw.
Further, the step of obtaining a set of adjacent windows of a window comprises: marking the window as visited; adding a second window with the matrix element of 1 to the adjacent window set of the window; if the second window is not marked as visited, marking the second window as visited, searching a third window with a matrix element of 1 with the second window, and adding the third window into an adjacent window set of the first window; the above process is iterated until all windows with matrix elements of 1 are added to the set of neighboring windows of the one window.
further, the step of moving the window so that other windows adjacent in sequence move along with the window includes: obtaining the offset of the target moving position of the window; acquiring another window from the adjacent window set; acquiring the current position of the other window; acquiring the target moving position of the other window according to the offset of the target moving position of the window and the current position of the other window; if the target moving position of the other window is different from the current position of the other window, moving the other window to the target moving position; the above process is repeated until all other windows in the set of adjacent windows for that window have completed moving.
And, a system for moving adjacent windows in batches, comprising: the acquisition module is used for acquiring an adjacent window set of a window; and the moving module is used for moving the window, and other windows in the adjacent window set of the window move along with the window.
further, still include: an initialize adjacent window matrix module, the initialize adjacent window matrix module comprising: a first judging submodule, configured to sequentially judge a positional relationship between a window rw and any other window cw before the step of obtaining an adjacent window set of a window; a first setting submodule, configured to set a matrix element matrix [ rw ] [ cw ] of a window rw relative to any other window cw to 1 if the two are adjacent; the first marking submodule is used for marking the window cw as judged after the position relation between the window rw and any other window cw is judged; and repeatedly calling the sub-modules in the undetermined windows until the matrix elements between any two windows are set.
further, the first judgment sub-module includes: the rectangle setting unit is used for setting a rectangle according to the position of a window rw, wherein the window rw is located at the center of the rectangle, the length L of the rectangle is L + m +2, and the width D of the rectangle is D + h +2, where L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw; a first determining unit, configured to determine whether a center of the any other window cw is located in the rectangle, and if the center of the any other window cw is located in the rectangle, the any other window cw is adjacent to the window rw.
Further, the obtaining module includes: a second marking submodule for marking the window as accessed; the adjacent window set adding submodule is used for adding a second window with the matrix element of 1 to the adjacent window set of the window; a third marking submodule, configured to mark the second window as accessed if the second window is not marked as accessed; the searching submodule is used for searching a third window with the matrix element of 1 in the second window; the adjacent window set adding submodule is also used for adding the third window into the adjacent window set of the window; and recursively calling the sub-modules until all the windows with the matrix elements of 1 are added into the adjacent window set of the window.
Further, the moving module includes: the offset acquisition submodule is used for acquiring the offset of the target moving position of the window; the other window acquisition submodule is used for acquiring one other window from the adjacent window set of the window; the current position obtaining submodule is used for obtaining the current position of the other window; the target moving position obtaining submodule is used for obtaining the target moving position of the other window according to the offset of the target moving position of the window and the current position of the other window; a moving submodule, configured to move the other window to the target moving position if the target moving position of the other window is different from the current position of the other window; the above-mentioned modules are repeatedly called until all other windows in the adjacent window set of the window have completed moving.
Compared with the prior art, the invention has the following advantages:
1. The method of the embodiment of the invention can realize that the windows in the adjacent window set of the window can move along with the window at the same time by moving any one window.
2. The system of the embodiment of the invention can realize that the windows in the adjacent window set of the window can move along with the window at the same time by moving any one window.
drawings
FIG. 1 is a flow chart of a method of bulk moving adjacent windows in accordance with an embodiment of the present invention;
FIG. 2 is a flowchart of the steps for initializing a neighboring window matrix according to an embodiment of the present invention;
Fig. 3 is a flowchart of the steps of sequentially determining the position relationship between the window rw and any other window cw according to the embodiment of the present invention;
FIG. 4 is a schematic illustration of a constructed rectangle of an embodiment of the present invention;
FIG. 5 is a flowchart of a specific implementation of the step of initializing a neighboring window matrix according to an embodiment of the present invention;
FIG. 6 is a flowchart of the steps for obtaining a set of adjacent windows for a window according to an embodiment of the present invention;
FIG. 7 is a flowchart of an embodiment of the steps for obtaining a set of adjacent windows for a window;
FIG. 8 is a flowchart of steps for moving the window such that other windows in the set of adjacent windows of the window follow the window movement, in accordance with an embodiment of the present invention;
FIG. 9 is a flowchart of an embodiment of the steps for moving the window such that other windows in the set of adjacent windows of the window follow the window movement;
FIG. 10 is a block diagram of a system for batch moving adjacent windows, in accordance with an embodiment of the present invention;
FIG. 11 is a block diagram of a system for batch moving adjacent windows, in accordance with another embodiment of the present invention.
Detailed Description
in order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
The embodiment of the invention discloses a method for moving adjacent windows in batches. The method can be applied to windows systems. Fig. 1 is a flowchart illustrating a method for batch moving adjacent windows according to an embodiment of the present invention. Specifically, the method comprises the following steps:
step S101: a set of adjacent windows for a window is obtained.
Step S102: moving the window, the other windows in the set of adjacent windows to the window move with the window.
The method of the embodiment of the invention can realize that the windows in the adjacent window set of the window can move along with the window at the same time by moving any one window.
Preferably, before step S101, the method further includes: the adjacent window matrix is initialized.
specifically, as shown in fig. 2, the step of initializing the adjacent window matrix includes:
Step S201: and sequentially judging the position relation between the window rw and any other window cw.
if they are adjacent, step S202 is performed.
step S202: the matrix element matrix [ rw ] [ cw ] of the window rw relative to any other window cw is set to 1.
Adjacent in the present invention means that two windows intersect or are tangent. Intersecting means that one window at least partially overlaps another window. Tangent means that one window is just next to another window. When two windows are neither intersecting nor tangent, the two windows are located apart.
Step S203: after the positional relationship between the window rw and any other window cw is determined, the window cw is marked as determined.
And repeating the process in the undetermined window until the matrix elements between any two windows are set.
through the above process, the matrix elements between any two windows can be set.
As shown in fig. 3, the specific process of step S201 is as follows:
Step S301: according to the position of the window rw, a rectangle a is set, and the window rw is located at the center P of the rectangle a. This rectangle is shown in fig. 4.
The length L of the rectangle a is L + m +2, and the width D is D + h +2, where L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw.
wherein "2" of "+ 2" represents 2 pixels. The purpose of this 2 pixel addition is to handle the case of two window tangents.
step S302: it is determined whether the center Q of any of the other windows cw is located within the rectangle a.
If the center Q of any other window cw is located within the rectangle a, step S303 is performed.
step S303: any other window cw is determined to be adjacent to the window rw.
through the above specific process, a specific rectangle is constructed to determine the position relationship between two windows.
Specifically, the above process may obtain the position relationship between any two windows by setting a window index and combining the inner and outer loops. The purpose of the inner loop is to determine the positional relationship between the window rw and any other window cw. The purpose of the outer loop is to determine another window rw after determining the positional relationship between the window rw and any other window cw. As shown in fig. 5, the above process can be implemented in the following specific manner:
Step S501: the window rw is initialized.
Step S502: and judging whether the index of the window rw is smaller than the maximum index.
If yes, go to step S503. If not, step S509 is performed.
Step S503: the window cw is initialized.
Step S504: it is determined whether the index of the window cw is not greater than the maximum index.
If yes, go to step S505; otherwise, the process returns to step S501.
Step S505: and judging the position relation of the window rw and the window cw.
If the position relationship is adjacent, go to step S506; otherwise, go to step S507.
Step S506: the matrix element matrix [ rw ] [ cw ] of window rw relative to window cw is set to 1.
If windows rw and cw are adjacent, matrix [ rw ] [ cw ] is 1, and because of symmetry, matrix [ cw ] [ rw ] of window cw relative to window rw is also 1; the opposite is true for the same reason.
step S507: the matrix element matrix [ rw ] [ cw ] of window rw relative to window cw is set to 0.
Similarly, the matrix element matrix [ cw ] [ rw ] of window cw for window rw is also 0.
After step S506 or S507 is completed, the process returns to step S503, another window cw is initialized again, and steps S504 to S507 are performed until the positional relationships between the window rw and all other windows cw are compared, and the internal loop is ended and the loop is skipped.
when the inner loop is skipped, the process returns to step S501, another window rw is initialized, and the above-described process is performed again.
Step S508: and returning.
through the above-described procedure, the positional relationship between windows can be stored using the adjacency matrix.
As shown in fig. 6, step S101 specifically includes the following steps:
Step S601: a window is marked as accessed.
Step S602: a second window having a matrix element of 1 with a window is added to a set of adjacent windows of a window.
step S603: and if the second window is not marked as accessed, marking the second window as accessed, searching a third window with the matrix element of 1 as the second window, and adding the third window into an adjacent window set of one window.
Step S604: the above process is iterated until all windows with matrix elements of 1 are added to the set of adjacent windows of a window.
Through the above process, all matrix elements are traversed, all windows with matrix elements of 1 are found, and the windows are added into the adjacent window set of one window.
Specifically, as shown in fig. 7, the above process can be implemented in a specific recursive manner as follows:
Step S701: marking window v as accessed.
Step S702: one adjacent window w of the window v is acquired.
The matrix element matrix v w of window v relative to window w is 1.
if the acquisition is successful, step S703 is performed, otherwise step S711 is performed.
Step S703: window w is added to the set of adjacent windows of window v.
Step S704: it is determined whether window w is marked as accessed.
If yes, returning to the step S702; otherwise, go to step S705.
Step S705: marking window w as accessed.
step S706: one adjacent window of window w is acquired.
If the acquisition is successful, go to step S707; otherwise, step S711 is performed.
Step S707: it is determined whether a window adjacent to window w is marked as visited.
if yes, returning to the step S706; otherwise, go to step S708
step S708: the adjacent window of window w is marked as visited.
Step S709: the neighboring windows of window w are added to the set of neighboring windows of window v.
Step S710: let window w be the window w adjacent to window w.
After step S710, the process returns to step S706, and the recursive process is performed until all windows with matrix element 1 are added to the neighboring window set of window v.
Step S711: and returning.
Through the above-mentioned specific process, a mode of recursion to the adjacent window of the search window w is adopted, and finally all the windows with the matrix element of 1 are added into the adjacent window set of the window v.
specifically, as shown in fig. 8, step S102 includes the following specific steps:
Step S801: and acquiring the offset of the target moving position of the window.
step S802: an additional window is obtained from the set of adjacent windows to the window.
Step S803: the current position of an other window is obtained.
step S804: and acquiring the target moving position of another window according to the offset of the target moving position of the window and the current position of another window.
Step S805: and if the target moving position of one other window is different from the current position of one other window, moving the other window to the target moving position.
Repeating the above steps S802 to S805 until all other windows in the adjacent window set of the window have been moved.
Through the above-mentioned process, it is realized that all windows in the adjacent window set of the window move following the movement of the window.
As shown in fig. 9, the above process can be implemented in the following specific manner:
step S901: the offset (x, y) of any one angle of the window v to the target movement position of that angle is acquired.
for example, either corner of window v is the upper left corner.
Step S902: a window w is obtained from a set of adjacent windows of window v.
Step S903: it is determined whether the end of the set of adjacent windows has been reached.
If yes, go to step S908; otherwise, go to step S904.
step S904: the current coordinates (a, b) of any corner of the window w corresponding to any corner of the window v are acquired.
For example, if any corner of window v is the upper left corner, then any corner of the corresponding window w is also the upper left corner.
step S905: the target coordinates of the target movement position at either corner of the acquisition window w are (a + x, b + y).
step S906: and judging whether the current coordinate of any corner of the window w is the same as the target coordinate of the same corner of the window w.
If not, go to step S907; otherwise, returning to step S902, repeating the above process until all other windows w in the adjacent window set of the window v have completed moving.
Step S907: the window w is moved until the current coordinates of either corner of the window w are (a + x, b + y).
Step S908: and returning.
Through the above-mentioned specific process, the position of any corner of the window is taken as a standard to perform judgment, so that all other windows in the adjacent window set of the window can be moved by moving one window.
the embodiment of the invention also provides a system for moving the adjacent windows in batch. Fig. 10 is a block diagram illustrating a system for batch moving adjacent windows according to an embodiment of the present invention.
The system for moving adjacent windows in batches comprises:
An obtaining module 101 is configured to obtain a set of adjacent windows of a window.
A moving module 102, configured to move the window, and then other windows in the neighboring window set of the window move along with the window.
The system for moving the adjacent windows in batches can move any one window, so that the windows in the adjacent window set of the window can move along with the window at the same time.
Fig. 11 is a block diagram of a system for batch moving adjacent windows according to another embodiment of the present invention.
preferably, the system further comprises: the adjacent window matrix module 103 is initialized. Initializing the adjacent window matrix module 103 includes:
the first determining submodule 1031 is configured to sequentially determine a position relationship between the window rw and any other window cw before the step of obtaining the adjacent window set of one window.
The first setting sub-module 1032 is configured to set the matrix element matrix [ rw ] [ cw ] of the window rw with respect to any other window cw to 1 if the two windows are adjacent.
The first marking sub-module 1033 is configured to mark the window cw as judged after the positional relationship between the window rw and any other window cw is judged.
And repeatedly calling the sub-modules in the undetermined windows until the matrix elements between any two windows are set.
Through the module design, the matrix elements between any two windows can be set.
Preferably, the first determining sub-module 1031 includes:
and a rectangle setting unit 1031-1, configured to set a rectangle according to a position of the window rw, where the window rw is located at a center of the rectangle.
The length L of the rectangle is L + m +2, the width D is D + h +2, L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw.
and a first judgment unit 1031-2, configured to judge whether the center of any other window cw is located in the rectangle.
If the center of any other window cw is located in the rectangle, any other window cw is adjacent to the window rw.
Through the module design, a specific rectangle is constructed to judge the position relation between two windows.
Preferably, the obtaining module 101 includes:
A second marking submodule 1011 for marking a window as accessed.
the neighboring window set adding sub-module 1012 is configured to add a second window having a matrix element of 1 to a window in the neighboring window set of the window.
A third marking sub-module 1013 for marking the second window as accessed if the second window is not marked as accessed.
The searching submodule 1014 is configured to search a third window whose matrix element is 1 with the second window.
Then the neighboring window set joining sub-module 1012 is also used to join a third window into a neighboring window set of a window.
The above sub-module is recursively invoked until all windows with matrix elements of 1 are added to a set of adjacent windows of a window.
Through the module design, all matrix elements are traversed, all windows with matrix elements of 1 are found, and the windows are added into the adjacent window set of one window.
Preferably, the mobile module 102 includes:
The offset obtaining submodule 1021 is configured to obtain an offset of the target moving position of the window.
the other window retrieving submodule 1022 is configured to retrieve an other window from the set of adjacent windows of the window.
The current position obtaining sub-module 1023 is used for obtaining the current position of another window.
the target moving position obtaining submodule 1024 is configured to obtain a target moving position of another window according to the offset of the target moving position of the window and the current position of another window.
The moving sub-module 1025 is configured to move another window to a target moving position if the target moving position of the another window is different from the current position of the another window.
The above-mentioned modules are repeatedly called until all other windows in the adjacent window set of the window have completed moving.
Through the module design, all windows in the adjacent window set of the window move along with the movement of the window.
In summary, the system for batch moving of adjacent windows according to another embodiment of the present invention can move any one window, so that the windows in the adjacent window set of the window can move along with the window at the same time.
the technical solutions provided by the present invention are described in detail above, and the principles and embodiments of the present invention are explained herein by using specific examples, which are merely used to help understanding the method and the core ideas of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (6)
1. a method for moving adjacent windows in a batch, comprising:
Acquiring an adjacent window set of a window;
Moving the window, and then other windows in the adjacent window set of the window move along with the window;
before the step of obtaining a set of adjacent windows of a window, further comprising: initializing an adjacent window matrix, the initializing the adjacent window matrix comprising:
Sequentially judging the position relation between the window rw and any other window cw;
if the two adjacent windows are adjacent, setting the matrix element matrix [ rw ] [ cw ] of the window rw relative to any other window cw as 1;
After the position relation between the window rw and any other window cw is judged, marking the window cw as judged;
Repeating the above process in the undetermined window until the matrix elements between any two windows are set;
The step of sequentially judging the position relationship between the window rw and any other window cw includes:
setting a rectangle according to the position of a window rw, wherein the window rw is located at the center of the rectangle, the length L of the rectangle is L + m +2, and the width D of the rectangle is D + h +2, where L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw;
judging whether the center of any other window cw is positioned in the rectangle;
And if the center of any other window cw is positioned in the rectangle, the any other window cw is adjacent to the window rw.
2. The method of claim 1, wherein the step of obtaining a set of neighboring windows of a window comprises:
Marking the window as visited;
Adding a second window with the matrix element of 1 to the adjacent window set of the window;
If the second window is not marked as visited, marking the second window as visited, searching a third window with a matrix element of 1 with the second window, and adding the third window into an adjacent window set of the first window;
The above process is iterated until all windows with matrix elements of 1 are added to the set of neighboring windows of the one window.
3. the method of claim 1, wherein the step of moving the window so that other successively adjacent windows follow the window comprises:
Obtaining the offset of the target moving position of the window;
acquiring another window from the adjacent window set;
Acquiring the current position of the other window;
Acquiring the target moving position of the other window according to the offset of the target moving position of the window and the current position of the other window;
If the target moving position of the other window is different from the current position of the other window, moving the other window to the target moving position;
the above process is repeated until all other windows in the set of adjacent windows for that window have completed moving.
4. A system for moving adjacent windows in a batch, comprising:
The acquisition module is used for acquiring an adjacent window set of a window;
The moving module is used for moving the window, and other windows in the adjacent window set of the window move along with the window;
an initialize adjacent window matrix module, the initialize adjacent window matrix module comprising:
A first judging submodule, configured to sequentially judge a positional relationship between a window rw and any other window cw before the step of obtaining an adjacent window set of a window;
a first setting submodule, configured to set a matrix element matrix [ rw ] [ cw ] of a window rw relative to any other window cw to 1 if the two are adjacent;
the first marking submodule is used for marking the window cw as judged after the position relation between the window rw and any other window cw is judged;
repeatedly calling the sub-modules in the undetermined windows until the matrix elements between any two windows are set;
the first judgment sub-module includes:
the rectangle setting unit is used for setting a rectangle according to the position of a window rw, wherein the window rw is located at the center of the rectangle, the length L of the rectangle is L + m +2, and the width D of the rectangle is D + h +2, where L is the length of any other window cw, D is the width of any other window cw, m is the length of the window rw, and h is the width of the window rw;
a first determining unit, configured to determine whether a center of the any other window cw is located in the rectangle, and if the center of the any other window cw is located in the rectangle, the any other window cw is adjacent to the window rw.
5. The system of claim 4, wherein the acquisition module comprises:
A second marking submodule for marking the window as accessed;
The adjacent window set adding submodule is used for adding a second window with the matrix element of 1 to the adjacent window set of the window;
A third marking submodule, configured to mark the second window as accessed if the second window is not marked as accessed;
The searching submodule is used for searching a third window with the matrix element of 1 in the second window;
the adjacent window set adding submodule is also used for adding the third window into the adjacent window set of the window;
And recursively calling the sub-modules until all the windows with the matrix elements of 1 are added into the adjacent window set of the window.
6. The system of claim 4, wherein the movement module comprises:
The offset acquisition submodule is used for acquiring the offset of the target moving position of the window;
The other window acquisition submodule is used for acquiring one other window from the adjacent window set of the window;
The current position obtaining submodule is used for obtaining the current position of the other window;
The target moving position obtaining submodule is used for obtaining the target moving position of the other window according to the offset of the target moving position of the window and the current position of the other window;
A moving submodule, configured to move the other window to the target moving position if the target moving position of the other window is different from the current position of the other window;
The above-mentioned modules are repeatedly called until all other windows in the adjacent window set of the window have completed moving.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610620952.2A CN106293718B (en) | 2016-08-01 | 2016-08-01 | method and system for moving adjacent windows in batches |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610620952.2A CN106293718B (en) | 2016-08-01 | 2016-08-01 | method and system for moving adjacent windows in batches |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106293718A CN106293718A (en) | 2017-01-04 |
| CN106293718B true CN106293718B (en) | 2019-12-17 |
Family
ID=57664016
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610620952.2A Active CN106293718B (en) | 2016-08-01 | 2016-08-01 | method and system for moving adjacent windows in batches |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106293718B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1847924A1 (en) * | 2006-04-20 | 2007-10-24 | International Business Machines Corporation | Optimal display of multiple windows within a computer display |
| CN101739196A (en) * | 2008-11-25 | 2010-06-16 | 富士施乐株式会社 | Working space management method and working space management system |
| CN104331236A (en) * | 2014-09-30 | 2015-02-04 | 珠海市君天电子科技有限公司 | Multi-window Binding and dragging method and multi-window binding and dragging system |
| CN105511884A (en) * | 2015-12-14 | 2016-04-20 | 北京奇虎科技有限公司 | Logger interface setting method and device |
-
2016
- 2016-08-01 CN CN201610620952.2A patent/CN106293718B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1847924A1 (en) * | 2006-04-20 | 2007-10-24 | International Business Machines Corporation | Optimal display of multiple windows within a computer display |
| CN101739196A (en) * | 2008-11-25 | 2010-06-16 | 富士施乐株式会社 | Working space management method and working space management system |
| CN104331236A (en) * | 2014-09-30 | 2015-02-04 | 珠海市君天电子科技有限公司 | Multi-window Binding and dragging method and multi-window binding and dragging system |
| CN105511884A (en) * | 2015-12-14 | 2016-04-20 | 北京奇虎科技有限公司 | Logger interface setting method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106293718A (en) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20180174038A1 (en) | Simultaneous localization and mapping with reinforcement learning | |
| CN110738143A (en) | Positioning method and device, equipment and storage medium | |
| CN111121754A (en) | Mobile robot positioning navigation method and device, mobile robot and storage medium | |
| CN101278551A (en) | System and method for video stabilization | |
| TWI733107B (en) | Navigation method based on optical tag network, corresponding computing equipment and storage medium | |
| CN115002463B (en) | Image processing method, intelligent terminal and storage medium | |
| CN104754180A (en) | Method and device for reducing video frame jitter | |
| US11704840B2 (en) | Attribute information prediction method, encoder, decoder and storage medium | |
| CN103049903B (en) | Binocular stereoscopic matching method for stereoscopic vision system | |
| CN106293718B (en) | method and system for moving adjacent windows in batches | |
| CN105096350A (en) | Image detection method and device | |
| CN109272576B (en) | Data processing method, MEC server, terminal equipment and device | |
| KR101654758B1 (en) | System and method for calculating arrangement data between devices | |
| CN114218421A (en) | Resource recall method and device and network side equipment | |
| CN111354037A (en) | Positioning method and system | |
| CN111460866A (en) | Lane line detection and driving control method and device and electronic equipment | |
| CN113671949A (en) | Navigation map determination method and device, storage medium and electronic device | |
| CN111914890B (en) | Image block matching method between images, image registration method and product | |
| Choi et al. | A new 2-point absolute pose estimation algorithm under planar motion | |
| CN109785353B (en) | Secondary traversal binarization method and device for two-dimensional code and storage medium | |
| CN116295354A (en) | Unmanned vehicle active global positioning method and system | |
| CN111241226B (en) | Site selection method, device and equipment | |
| CN113390425B (en) | Map data processing method, device, equipment and storage medium | |
| CN114501030A (en) | Matching point searching method and device, storage medium and electronic device | |
| KR20220058846A (en) | Robot positioning method and apparatus, apparatus, storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 100041, room 2, building 3, building 30, Xing Xing street, Shijingshan District, Beijing, Patentee after: Beijing Falcon Safety Technology Co., Ltd Address before: 100041 Beijing city Shijingshan District Street Hing 30 Hospital No. 3 Building 2 layer A-0003 Patentee before: BEIJING KINGSOFT SECURITY MANAGEMENT SYSTEM TECHNOLOGY Co.,Ltd. |