@univerjs-pro/collaboration 0.7.0-nightly.202505061607 → 0.7.0-nightly.202505081607
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
|
@@ -13,10 +13,6 @@ export declare enum CollaborationEvent {
|
|
|
13
13
|
* could emit missing changesets to the client using event `NEW_CHANGESETS`.
|
|
14
14
|
*/
|
|
15
15
|
FETCH_MISSING = "fetch_missing",
|
|
16
|
-
/**
|
|
17
|
-
* @internal
|
|
18
|
-
*/
|
|
19
|
-
PSEUDO_FETCH_MISSING_RESULT = "pseudo_fetch_missing_result",
|
|
20
16
|
/**
|
|
21
17
|
* The client submit a changeset to the server.
|
|
22
18
|
*/
|
|
@@ -29,65 +29,9 @@ export interface ITransformService {
|
|
|
29
29
|
* because it would cause critical problems if you unregister a transform algorithm.
|
|
30
30
|
*/
|
|
31
31
|
registerTransformAlgorithm: (algorithms: IMutationTransformAlgorithm) => void;
|
|
32
|
-
/**
|
|
33
|
-
* Transform two single mutations. Note that m1Prime and m2Prime may not be single mutations. 1x1 may result in nxn.
|
|
34
|
-
*
|
|
35
|
-
* @internal
|
|
36
|
-
*
|
|
37
|
-
* Visualization:
|
|
38
|
-
*
|
|
39
|
-
* /\
|
|
40
|
-
* m1 / \ m2
|
|
41
|
-
* / \
|
|
42
|
-
* \ /
|
|
43
|
-
* m2Prime \ / m1Prime
|
|
44
|
-
* \/
|
|
45
|
-
*
|
|
46
|
-
* @param m1
|
|
47
|
-
* @param m2
|
|
48
|
-
* @param onlyLeft If set to true, the result would only contain m1Prime.
|
|
49
|
-
*/
|
|
50
|
-
transformMutation(m1: IMutationInfo, m2: IMutationInfo): IFailureTransformMutationResult | Omit<ISuccessTransformMutationResult, 'm1Prime'>;
|
|
51
32
|
transformMutation(m1: IMutationInfo, m2: IMutationInfo, onlyLater: false): ITransformMutationResult;
|
|
52
|
-
/**
|
|
53
|
-
* Transform two array of mutations. Not that the time complexity (also memory complexity) of this method is O(m*n),
|
|
54
|
-
* in which m & n are numbers of mutations in each array.
|
|
55
|
-
*
|
|
56
|
-
* @internal
|
|
57
|
-
*
|
|
58
|
-
* Visualization:
|
|
59
|
-
*
|
|
60
|
-
* /\
|
|
61
|
-
* m1 / \ m2
|
|
62
|
-
* / \
|
|
63
|
-
* /\ /\
|
|
64
|
-
* / \ / \
|
|
65
|
-
* / \/ \
|
|
66
|
-
* \ /\ /
|
|
67
|
-
* \ / \ /
|
|
68
|
-
* \/ \/
|
|
69
|
-
* \ /
|
|
70
|
-
* \ /
|
|
71
|
-
* m2Prime \/ m1Prime
|
|
72
|
-
*
|
|
73
|
-
* @param m1
|
|
74
|
-
* @param m2
|
|
75
|
-
*/
|
|
76
|
-
transformMutations(m1: IMutationInfo[], m2: IMutationInfo[]): IFailureTransformMutationsResult | Omit<ISuccessTransformMutationsResult, 'm1Prime'>;
|
|
77
33
|
transformMutations(m1: IMutationInfo[], m2: IMutationInfo[], onlyLater: boolean): ITransformMutationsResult;
|
|
78
|
-
/**
|
|
79
|
-
* Transform two arrays of changesets
|
|
80
|
-
*
|
|
81
|
-
* @internal
|
|
82
|
-
*/
|
|
83
|
-
transformChangesets(c1: IChangeset[], c2: IChangeset[]): IFailureTransformChangesetsResult | Omit<ISuccessTransformChangesetsResult, 'c1Prime'>;
|
|
84
34
|
transformChangesets(c1: IChangeset[], c2: IChangeset[], onlyLater: false): ITransformChangesetsResult;
|
|
85
|
-
/**
|
|
86
|
-
* Transform mutations with changesets. We only wants transformed mutations here.
|
|
87
|
-
*
|
|
88
|
-
* @internal
|
|
89
|
-
*/
|
|
90
|
-
transformMutationsWithChangeset: (c1: IChangeset, m2: IMutationInfo[]) => ITransformMutationsWithChangesetResult;
|
|
91
35
|
}
|
|
92
36
|
export declare const ITransformService: import('@wendellhu/redi').IdentifierDecorator<ITransformService>;
|
|
93
37
|
export declare class TransformService extends Disposable implements ITransformService {
|