Unverified Commit 323ffe12 authored by Alexandre Ardhuin's avatar Alexandre Ardhuin Committed by GitHub

fix indentation issues (#84374)

parent 62633210
...@@ -275,7 +275,7 @@ void _mergeSort<T>( ...@@ -275,7 +275,7 @@ void _mergeSort<T>(
int end, int end,
List<T> target, List<T> target,
int targetOffset, int targetOffset,
) { ) {
final int length = end - start; final int length = end - start;
if (length < _kMergeSortLimit) { if (length < _kMergeSortLimit) {
_movingInsertionSort<T>(list, compare, start, end, target, targetOffset); _movingInsertionSort<T>(list, compare, start, end, target, targetOffset);
......
...@@ -94,7 +94,8 @@ mixin PaintingBinding on BindingBase, ServicesBinding { ...@@ -94,7 +94,8 @@ mixin PaintingBinding on BindingBase, ServicesBinding {
/// unnecessary memory usage for images. Callers that wish to display an image /// unnecessary memory usage for images. Callers that wish to display an image
/// above its native resolution should prefer scaling the canvas the image is /// above its native resolution should prefer scaling the canvas the image is
/// drawn into. /// drawn into.
Future<ui.Codec> instantiateImageCodec(Uint8List bytes, { Future<ui.Codec> instantiateImageCodec(
Uint8List bytes, {
int? cacheWidth, int? cacheWidth,
int? cacheHeight, int? cacheHeight,
bool allowUpscaling = false, bool allowUpscaling = false,
......
...@@ -2282,8 +2282,10 @@ class FollowerLayer extends ContainerLayer { ...@@ -2282,8 +2282,10 @@ class FollowerLayer extends ContainerLayer {
/// Returns null if [a] [b] do not share a common ancestor, in which case the /// Returns null if [a] [b] do not share a common ancestor, in which case the
/// results in [ancestorsA] and [ancestorsB] are undefined. /// results in [ancestorsA] and [ancestorsB] are undefined.
static Layer? _pathsToCommonAncestor( static Layer? _pathsToCommonAncestor(
Layer? a, Layer? b, Layer? a,
List<ContainerLayer?> ancestorsA, List<ContainerLayer?> ancestorsB, Layer? b,
List<ContainerLayer?> ancestorsA,
List<ContainerLayer?> ancestorsB,
) { ) {
// No common ancestor found. // No common ancestor found.
if (a == null || b == null) if (a == null || b == null)
......
...@@ -18,7 +18,8 @@ import 'viewport_offset.dart'; ...@@ -18,7 +18,8 @@ import 'viewport_offset.dart';
// Trims the specified edges of the given `Rect` [original], so that they do not // Trims the specified edges of the given `Rect` [original], so that they do not
// exceed the given values. // exceed the given values.
Rect? _trim(Rect? original, { Rect? _trim(
Rect? original, {
double top = -double.infinity, double top = -double.infinity,
double right = double.infinity, double right = double.infinity,
double bottom = double.infinity, double bottom = double.infinity,
......
...@@ -336,8 +336,8 @@ class LogicalKeySet extends KeySet<LogicalKeyboardKey> with Diagnosticable ...@@ -336,8 +336,8 @@ class LogicalKeySet extends KeySet<LogicalKeyboardKey> with Diagnosticable
@override @override
String debugDescribeKeys() { String debugDescribeKeys() {
final List<LogicalKeyboardKey> sortedKeys = keys.toList()..sort( final List<LogicalKeyboardKey> sortedKeys = keys.toList()
(LogicalKeyboardKey a, LogicalKeyboardKey b) { ..sort((LogicalKeyboardKey a, LogicalKeyboardKey b) {
// Put the modifiers first. If it has a synonym, then it's something // Put the modifiers first. If it has a synonym, then it's something
// like shiftLeft, altRight, etc. // like shiftLeft, altRight, etc.
final bool aIsModifier = a.synonyms.isNotEmpty || _modifiers.contains(a); final bool aIsModifier = a.synonyms.isNotEmpty || _modifiers.contains(a);
...@@ -348,8 +348,7 @@ class LogicalKeySet extends KeySet<LogicalKeyboardKey> with Diagnosticable ...@@ -348,8 +348,7 @@ class LogicalKeySet extends KeySet<LogicalKeyboardKey> with Diagnosticable
return 1; return 1;
} }
return a.debugName!.compareTo(b.debugName!); return a.debugName!.compareTo(b.debugName!);
}, });
);
return sortedKeys.map<String>((LogicalKeyboardKey key) => key.debugName.toString()).join(' + '); return sortedKeys.map<String>((LogicalKeyboardKey key) => key.debugName.toString()).join(' + ');
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment