| b69ab31 | | | 1 | /** |
| b69ab31 | | | 2 | * Copyright (c) Meta Platforms, Inc. and affiliates. |
| b69ab31 | | | 3 | * |
| b69ab31 | | | 4 | * This source code is licensed under the MIT license found in the |
| b69ab31 | | | 5 | * LICENSE file in the root directory of this source tree. |
| b69ab31 | | | 6 | */ |
| b69ab31 | | | 7 | |
| b69ab31 | | | 8 | import type {Dag} from '../previews'; |
| b69ab31 | | | 9 | import type {ExactRevset, OptimisticRevset, SucceedableRevset} from '../types'; |
| b69ab31 | | | 10 | |
| b69ab31 | | | 11 | import {CommitPreview} from '../previews'; |
| b69ab31 | | | 12 | import {Operation} from './Operation'; |
| b69ab31 | | | 13 | |
| b69ab31 | | | 14 | export class HideOperation extends Operation { |
| b69ab31 | | | 15 | constructor(private source: SucceedableRevset | ExactRevset | OptimisticRevset) { |
| b69ab31 | | | 16 | super('HideOperation'); |
| b69ab31 | | | 17 | } |
| b69ab31 | | | 18 | |
| b69ab31 | | | 19 | static opName = 'Hide'; |
| b69ab31 | | | 20 | |
| b69ab31 | | | 21 | getArgs() { |
| b69ab31 | | | 22 | return ['hide', '--rev', this.source]; |
| b69ab31 | | | 23 | } |
| b69ab31 | | | 24 | |
| b69ab31 | | | 25 | private hash() { |
| b69ab31 | | | 26 | return this.source.type === 'optimistic-revset' ? this.source.fake : this.source.revset; |
| b69ab31 | | | 27 | } |
| b69ab31 | | | 28 | |
| b69ab31 | | | 29 | previewDag(dag: Dag): Dag { |
| b69ab31 | | | 30 | const hash = this.hash(); |
| b69ab31 | | | 31 | const toHide = dag.descendants(hash); |
| b69ab31 | | | 32 | return dag.replaceWith(toHide, (h, c) => { |
| b69ab31 | | | 33 | const previewType = h === hash ? CommitPreview.HIDDEN_ROOT : CommitPreview.HIDDEN_DESCENDANT; |
| b69ab31 | | | 34 | return c?.merge({previewType}); |
| b69ab31 | | | 35 | }); |
| b69ab31 | | | 36 | } |
| b69ab31 | | | 37 | |
| b69ab31 | | | 38 | optimisticDag(dag: Dag): Dag { |
| b69ab31 | | | 39 | const hash = this.hash(); |
| b69ab31 | | | 40 | const toHide = dag.descendants(hash); |
| b69ab31 | | | 41 | const toCleanup = dag.parents(hash); |
| b69ab31 | | | 42 | // If the head is being hidden, we need to move the head to the parent. |
| b69ab31 | | | 43 | const newHead = []; |
| b69ab31 | | | 44 | if (toHide.toHashes().some(h => dag.get(h)?.isDot == true)) { |
| b69ab31 | | | 45 | const parent = dag.get(hash)?.parents?.at(0); |
| b69ab31 | | | 46 | if (parent && dag.has(parent)) { |
| b69ab31 | | | 47 | newHead.push(parent); |
| b69ab31 | | | 48 | } |
| b69ab31 | | | 49 | } |
| b69ab31 | | | 50 | return dag |
| b69ab31 | | | 51 | .remove(toHide) |
| b69ab31 | | | 52 | .replaceWith(newHead, (_h, c) => { |
| b69ab31 | | | 53 | return c?.merge({isDot: true, previewType: CommitPreview.GOTO_DESTINATION}); |
| b69ab31 | | | 54 | }) |
| b69ab31 | | | 55 | .cleanup(toCleanup); |
| b69ab31 | | | 56 | } |
| b69ab31 | | | 57 | } |