This repository has been archived by the owner on Apr 15, 2024. It is now read-only.
/
AuxiliaryFileContents.swift
2549 lines (2087 loc) · 68.8 KB
/
AuxiliaryFileContents.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// Copyright 2018 Vinicius Jorge Vendramini
//
// Licensed under the Hippocratic License, Version 2.1;
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://firstdonoharm.dev/version/2/1/license
//
// To the full extent allowed by law, this software comes "AS IS,"
// WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED, and licensor and any other
// contributor shall not be liable to anyone for any damages or other
// liability arising from, out of, or in connection with the sotfware
// or this license, under any kind of legal claim.
// See the License for the specific language governing permissions and
// limitations under the License.
//
internal let gryphonKotlinLibraryFileContents = """
// Replace this with the real package identifier:
package /* com.example.myApp */
//
// Copyright 2018 Vinicius Jorge Vendramini
//
// Licensed under the Hippocratic License, Version 2.1;
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://firstdonoharm.dev/version/2/1/license
//
// To the full extent allowed by law, this software comes "AS IS,"
// WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED, and licensor and any other
// contributor shall not be liable to anyone for any damages or other
// liability arising from, out of, or in connection with the sotfware
// or this license, under any kind of legal claim.
// See the License for the specific language governing permissions and
// limitations under the License.
//
import java.lang.ClassCastException
fun String.suffix(startIndex: Int): String {
return this.substring(startIndex, this.length)
}
fun <T> MutableList<T>.removeLast() {
this.removeAt(this.size - 1)
}
fun String.indexOrNull(character: Char): Int? {
val result = this.indexOf(character)
if (result == -1) {
return null
}
else {
return result
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified T> List<*>.castOrNull(): List<T>? {
if (this.all { it is T }) {
return this as List<T>
}
else {
return null
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified T> List<*>.castMutableOrNull(): MutableList<T>? {
if (this.all { it is T }) {
return (this as List<T>).toMutableList()
}
else {
return null
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified K, reified V> Map<*, *>.castOrNull()
: Map<K, V>?
{
if (this.all { it.key is K && it.value is V }) {
return this as Map<K, V>
}
else {
return null
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified K, reified V> Map<*, *>.castMutableOrNull()
: MutableMap<K, V>?
{
if (this.all { it.key is K && it.value is V }) {
return (this as Map<K, V>).toMutableMap()
}
else {
return null
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified T> List<*>.cast(): List<T> {
if (this.all { it is T }) {
return this as List<T>
}
else {
throw ClassCastException()
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified T> List<*>.castMutable(): MutableList<T> {
if (this.all { it is T }) {
return (this as List<T>).toMutableList()
}
else {
throw ClassCastException()
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified K, reified V> Map<*, *>.cast()
: Map<K, V>
{
if (this.all { it.key is K && it.value is V }) {
return this as Map<K, V>
}
else {
throw ClassCastException()
}
}
@Suppress("UNCHECKED_CAST", "UNUSED_PARAMETER")
inline fun <reified K, reified V> Map<*, *>.castMutable()
: MutableMap<K, V>
{
if (this.all { it.key is K && it.value is V }) {
return (this as Map<K, V>).toMutableMap()
}
else {
throw ClassCastException()
}
}
fun <Element> List<Element>.sorted(
isAscending: (Element, Element) -> Boolean)
: MutableList<Element>
{
val copyList = this.toMutableList()
copyList.quicksort(0, this.size - 1, isAscending)
return copyList
}
fun <Element> MutableList<Element>.quicksort(
left: Int,
right: Int,
isAscending: (Element, Element) -> Boolean)
{
if (left < right) {
val pivot = this.partition(left, right, isAscending)
this.quicksort(left, pivot - 1, isAscending)
this.quicksort(pivot + 1, right, isAscending)
}
}
fun <Element> MutableList<Element>.partition(
left: Int,
right: Int,
isAscending: (Element, Element) -> Boolean)
: Int
{
val pivot = this[right]
var i = left - 1
var j = left
while (j <= right - 1) {
if (isAscending(this[j], pivot)) {
i += 1
val aux = this[i]
this[i] = this[j]
this[j] = aux
}
j += 1
}
val aux = this[i + 1]
this[i + 1] = this[right]
this[right] = aux
return i + 1
}
"""
internal let localConfigFileContents = """
ANDROID_ROOT = ../Android
"""
internal let gryphonSwiftLibraryFileContents = """
//
// Copyright 2018 Vinicius Jorge Vendramini
//
// Licensed under the Hippocratic License, Version 2.1;
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://firstdonoharm.dev/version/2/1/license
//
// To the full extent allowed by law, this software comes "AS IS,"
// WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED, and licensor and any other
// contributor shall not be liable to anyone for any damages or other
// liability arising from, out of, or in connection with the sotfware
// or this license, under any kind of legal claim.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// MARK: - Template class declarations
// gryphon ignore
internal class GRYTemplate {
static func dot(_ left: GRYTemplate, _ right: String) -> GRYDotTemplate {
return GRYDotTemplate(left, right)
}
static func dot(_ left: String, _ right: String) -> GRYDotTemplate {
return GRYDotTemplate(GRYLiteralTemplate(string: left), right)
}
static func call(
_ function: GRYTemplate,
_ parameters: [GRYParameterTemplate])
-> GRYCallTemplate
{
return GRYCallTemplate(function, parameters)
}
static func call(
_ function: String,
_ parameters: [GRYParameterTemplate])
-> GRYCallTemplate
{
return GRYCallTemplate(function, parameters)
}
}
// gryphon ignore
internal class GRYDotTemplate: GRYTemplate {
let left: GRYTemplate
let right: String
init(_ left: GRYTemplate, _ right: String) {
self.left = left
self.right = right
}
}
// gryphon ignore
internal class GRYCallTemplate: GRYTemplate {
let function: GRYTemplate
let parameters: [GRYParameterTemplate]
init(_ function: GRYTemplate, _ parameters: [GRYParameterTemplate]) {
self.function = function
self.parameters = parameters
}
//
init(_ function: String, _ parameters: [GRYParameterTemplate]) {
self.function = GRYLiteralTemplate(string: function)
self.parameters = parameters
}
}
// gryphon ignore
internal class GRYParameterTemplate: ExpressibleByStringLiteral {
let label: String?
let template: GRYTemplate
internal init(_ label: String?, _ template: GRYTemplate) {
if let existingLabel = label {
if existingLabel == "_" || existingLabel == "" {
self.label = nil
}
else {
self.label = label
}
}
else {
self.label = label
}
self.template = template
}
required init(stringLiteral: String) {
self.label = nil
self.template = GRYLiteralTemplate(string: stringLiteral)
}
static func labeledParameter(
_ label: String?,
_ template: GRYTemplate)
-> GRYParameterTemplate
{
return GRYParameterTemplate(label, template)
}
static func labeledParameter(
_ label: String?,
_ template: String)
-> GRYParameterTemplate
{
return GRYParameterTemplate(label, GRYLiteralTemplate(string: template))
}
static func dot(
_ left: GRYTemplate,
_ right: String)
-> GRYParameterTemplate
{
return GRYParameterTemplate(nil, GRYDotTemplate(left, right))
}
static func dot(
_ left: String,
_ right: String)
-> GRYParameterTemplate
{
return GRYParameterTemplate(nil, GRYDotTemplate(GRYLiteralTemplate(string: left), right))
}
static func call(
_ function: GRYTemplate,
_ parameters: [GRYParameterTemplate])
-> GRYParameterTemplate
{
return GRYParameterTemplate(nil, GRYCallTemplate(function, parameters))
}
static func call(
_ function: String,
_ parameters: [GRYParameterTemplate])
-> GRYParameterTemplate
{
return GRYParameterTemplate(nil, GRYCallTemplate(function, parameters))
}
}
// gryphon ignore
internal class GRYLiteralTemplate: GRYTemplate {
let string: String
init(string: String) {
self.string = string
}
}
// gryphon ignore
internal class GRYConcatenatedTemplate: GRYTemplate {
let left: GRYTemplate
let right: GRYTemplate
init(left: GRYTemplate, right: GRYTemplate) {
self.left = left
self.right = right
}
}
// gryphon ignore
internal func + (
left: GRYTemplate,
right: GRYTemplate)
-> GRYConcatenatedTemplate
{
GRYConcatenatedTemplate(left: left, right: right)
}
// gryphon ignore
internal func + (left: String, right: GRYTemplate) -> GRYConcatenatedTemplate {
GRYConcatenatedTemplate(left: GRYLiteralTemplate(string: left), right: right)
}
// gryphon ignore
internal func + (left: GRYTemplate, right: String) -> GRYConcatenatedTemplate {
GRYConcatenatedTemplate(left: left, right: GRYLiteralTemplate(string: right))
}
// MARK: - Templates
// Replacement for Comparable
// gryphon ignore
private struct _Comparable: Comparable {
static func < (lhs: _Comparable, rhs: _Comparable) -> Bool {
return false
}
}
// Replacement for Hashable
// gryphon ignore
private struct _Hashable: Hashable { }
private func gryphonTemplates() {
let _array1: MutableList<Any> = [1, 2, 3]
let _array2: MutableList<Any> = [1, 2, 3]
let _array3: [Any] = [1, 2, 3]
let _dictionary: [_Hashable: Any] = [:]
let _list: List<Any> = []
let _map: Map<_Hashable, Any> = [:]
let _any: Any = 0
let _string: String = ""
let _index = _string.startIndex
let _comparableArray: List<_Comparable> = []
let _closure: (_Comparable, _Comparable) -> Bool = { _, _ in true }
// Templates with an input that references methods defined in this file
_ = zip(_array1, _array2)
_ = GRYTemplate.call(.dot("_array1", "zip"), ["_array2"])
_ = _array1.toList()
_ = GRYTemplate.call(.dot("_array1", "toList"), [])
_ = _array1.appending(_any)
_ = "_array1 + _any"
_ = _array1.appending(contentsOf: _array2)
_ = "_array1 + _array2"
_ = List(_array3)
_ = GRYTemplate.call(.dot("_array3", "toList"), [])
_ = MutableList(_array3)
_ = GRYTemplate.call(.dot("_array3", "toMutableList"), [])
_ = Map(_dictionary)
_ = GRYTemplate.call(.dot("_dictionary", "toMap"), [])
_ = MutableMap(_dictionary)
_ = GRYTemplate.call(.dot("_dictionary", "toMutableMap"), [])
_ = _list.array
_ = GRYTemplate.call(.dot("_list", "toList"), [])
_ = _map.dictionary
_ = GRYTemplate.call(.dot("_map", "toMap"), [])
// Templates with an output that references methods defined in the GryphonKotlinLibrary.kt file
_ = _string.suffix(from: _index)
_ = GRYTemplate.call(.dot("_string", "suffix"), [.labeledParameter("startIndex", "_index")])
_ = _comparableArray.sorted(by: _closure)
_ = GRYTemplate.call(
.dot("_comparableArray", "sorted"), [.labeledParameter("isAscending", "_closure")])
_ = _array1.removeLast()
_ = GRYTemplate.call(.dot("_array1", "removeLast"), [])
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// MARK: - Collections
/// According to http://swiftdoc.org/v4.2/type/Array/hierarchy/
/// (link found via https://www.raywenderlich.com/139591/building-custom-collection-swift)
/// the Array type in Swift conforms exactly to these protocols,
/// plus CustomReflectable (which is beyond Gryphon's scope for now).
// gryphon ignore
public struct _ListSlice<Element>: Collection,
BidirectionalCollection,
RandomAccessCollection,
MutableCollection,
RangeReplaceableCollection
{
public typealias Index = Int
public typealias SubSequence = _ListSlice<Element>
let list: List<Element>
let range: Range<Int>
public init(
list: List<Element>,
range: Range<Int>)
{
self.list = list
self.range = range
}
public var startIndex: Int {
return range.startIndex
}
public var endIndex: Int {
return range.endIndex
}
public subscript(position: Int) -> Element {
get {
return list[position]
}
// For MutableCollection
set {
list._setElement(newValue, atIndex: position)
}
}
public subscript(bounds: Range<Index>) -> _ListSlice<Element> {
get {
// From Collection.swift
_failEarlyRangeCheck(bounds, bounds: startIndex..<endIndex)
return _ListSlice(list: list, range: bounds)
}
// For MutableCollection
set {
for i in bounds {
list._setElement(newValue[i], atIndex: i)
}
}
}
public func index(after i: Int) -> Int {
return list.index(after: i)
}
// BidirectionalCollection
public func index(before i: Int) -> Int {
return list.index(before: i)
}
// RangeReplaceableCollection
public init() {
self.list = []
self.range = 0..<0
}
// Other methods
public func filter(_ isIncluded: (Element) throws -> Bool) rethrows -> List<Element> {
let array = list.array[range]
return try List(array.filter(isIncluded))
}
public func map<T>(_ transform: (Element) throws -> T) rethrows -> List<T> {
let array = list.array[range]
return try List<T>(array.map(transform))
}
public func compactMap<T>(_ transform: (Element) throws -> T?) rethrows -> List<T> {
let array = list.array[range]
return try List<T>(array.compactMap(transform))
}
public func flatMap<SegmentOfResult>(
_ transform: (Element) throws -> SegmentOfResult)
rethrows -> List<SegmentOfResult.Element>
where SegmentOfResult: Sequence
{
let array = list.array[range]
return try List<SegmentOfResult.Element>(array.flatMap(transform))
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// gryphon ignore
public class List<Element>: CustomStringConvertible,
CustomDebugStringConvertible,
ExpressibleByArrayLiteral,
Sequence,
Collection,
BidirectionalCollection,
RandomAccessCollection
{
public typealias Buffer = [Element]
public typealias ArrayLiteralElement = Element
public typealias Index = Int
public typealias SubSequence = _ListSlice<Element>
public var array: Buffer
public init(_ array: Buffer) {
self.array = array
}
// Custom (Debug) String Convertible
public var description: String {
return array.description
}
public var debugDescription: String {
return array.debugDescription
}
// Expressible By Array Literal
public required init(arrayLiteral elements: Element...) {
self.array = elements
}
// Sequence
public func makeIterator() -> IndexingIterator<List<Element>> {
return IndexingIterator(_elements: self)
}
// Collection
public var startIndex: Int {
return array.startIndex
}
public var endIndex: Int {
return array.endIndex
}
public subscript(position: Int) -> Element {
return array[position]
}
public subscript(bounds: Range<Index>) -> _ListSlice<Element> {
// From Collection.swift
_failEarlyRangeCheck(bounds, bounds: startIndex..<endIndex)
return _ListSlice(list: self, range: bounds)
}
public func index(after i: Int) -> Int {
return array.index(after: i)
}
// BidirectionalCollection
public func index(before i: Int) -> Int {
return array.index(before: i)
}
// Used for _ListSlice to conform to MutableCollection
fileprivate func _setElement(_ element: Element, atIndex index: Int) {
array[index] = element
}
// Other methods
public init<S>(_ sequence: S) where Element == S.Element, S: Sequence {
self.array = Array(sequence)
}
public init() {
self.array = []
}
/// Used to obtain a List with a new element type. If all elements in the list can be casted to
/// the new type, the method succeeds and the new MutableList is returned. Otherwise, the method
/// returns `nil`.
public func `as`<CastedType>(_ type: List<CastedType>.Type) -> List<CastedType>? {
if let castedList = self.array as? [CastedType] {
return List<CastedType>(castedList)
}
else {
return nil
}
}
/// Used to obtain a List with a new element type. If all elements in the list can be casted to
/// the new type, the method succeeds and the new MutableList is returned. Otherwise, the method
/// crashes.
public func forceCast<CastedType>(to type: List<CastedType>.Type) -> List<CastedType> {
List<CastedType>(array as! [CastedType])
}
public func toList() -> List<Element> {
return List(array)
}
public var isEmpty: Bool {
return array.isEmpty
}
public var first: Element? {
return array.first
}
public var last: Element? {
return array.last
}
public func dropFirst(_ k: Int = 1) -> List<Element> {
return List(array.dropFirst(k))
}
public func dropLast(_ k: Int = 1) -> List<Element> {
return List(array.dropLast(k))
}
public func drop(while predicate: (Element) throws -> Bool) rethrows -> List<Element> {
return try List(array.drop(while: predicate))
}
public func appending(_ newElement: Element) -> List<Element> {
return List<Element>(self.array + [newElement])
}
public func filter(_ isIncluded: (Element) throws -> Bool) rethrows -> List<Element> {
return try List(self.array.filter(isIncluded))
}
public func map<T>(_ transform: (Element) throws -> T) rethrows -> List<T> {
return try List<T>(self.array.map(transform))
}
public func compactMap<T>(_ transform: (Element) throws -> T?) rethrows -> List<T> {
return try List<T>(self.array.compactMap(transform))
}
public func flatMap<SegmentOfResult>(
_ transform: (Element) throws -> SegmentOfResult)
rethrows -> List<SegmentOfResult.Element>
where SegmentOfResult: Sequence
{
return try List<SegmentOfResult.Element>(array.flatMap(transform))
}
public func prefix(while predicate: (Element) throws -> Bool) rethrows -> List<Element> {
return try List<Element>(array.prefix(while: predicate))
}
@inlinable
public func sorted(
by areInIncreasingOrder: (Element, Element) throws -> Bool) rethrows
-> List<Element>
{
return List(try array.sorted(by: areInIncreasingOrder))
}
public func appending<S>(contentsOf newElements: S) -> List<Element>
where S: Sequence, Element == S.Element
{
return List<Element>(self.array + newElements)
}
public func reversed() -> List<Element> {
return List(array.reversed())
}
public var indices: Range<Int> {
return array.indices
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// gryphon ignore
extension List {
public func toMutableList() -> MutableList<Element> {
return MutableList(array)
}
}
// gryphon ignore
extension List {
@inlinable
public static func + <Other>(
lhs: List<Element>,
rhs: Other)
-> List<Element>
where Other: Sequence,
List.Element == Other.Element
{
var array = lhs.array
for element in rhs {
array.append(element)
}
return List(array)
}
}
// gryphon ignore
extension List: Equatable where Element: Equatable {
public static func == (lhs: List, rhs: List) -> Bool {
return lhs.array == rhs.array
}
//
public func firstIndex(of element: Element) -> Int? {
return array.firstIndex(of: element)
}
}
// gryphon ignore
extension List: Hashable where Element: Hashable {
public func hash(into hasher: inout Hasher) {
array.hash(into: &hasher)
}
}
// gryphon ignore
extension List where Element: Comparable {
@inlinable
public func sorted() -> List<Element> {
return List(array.sorted())
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// gryphon ignore
public class MutableList<Element>: List<Element>,
MutableCollection,
RangeReplaceableCollection
{
// MutableCollection
public override subscript(position: Int) -> Element {
get {
return array[position]
}
set {
array[position] = newValue
}
}
public override subscript(bounds: Range<Index>) -> _ListSlice<Element> {
get {
// From Collection.swift
_failEarlyRangeCheck(bounds, bounds: startIndex..<endIndex)
return _ListSlice(list: self, range: bounds)
}
set {
for i in bounds {
array[i] = newValue[i]
}
}
}
// RangeReplaceableCollection
override public required init() {
super.init([])
}
public required init(arrayLiteral elements: Element...) {
super.init(elements)
}
// Other methods
public func append(_ newElement: Element) {
array.append(newElement)
}
public func append<S>(contentsOf newElements: S) where S: Sequence, Element == S.Element {
self.array.append(contentsOf: newElements)
}
public func insert(_ newElement: Element, at i: Index) {
array.insert(newElement, at: i)
}
@discardableResult
public func removeFirst() -> Element {
return array.removeFirst()
}
@discardableResult
public func removeLast() -> Element {
return array.removeLast()
}
public func removeAll(keepingCapacity keepCapacity: Bool = false) {
array.removeAll(keepingCapacity: keepCapacity)
}
@discardableResult
public func remove(at index: Int) -> Element {
return array.remove(at: index)
}
public func reverse() {
self.array = self.array.reversed()
}
override public func drop(while predicate: (Element) throws -> Bool) rethrows -> List<Element> {
return try List(array.drop(while: predicate))
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// gryphon ignore
extension List {
/// Used to obtain a MutableList with a new element type. If all elements in the list can be
/// casted to the new type, the method succeeds and the new MutableList is returned. Otherwise,
/// the method returns `nil`.
public func `as`<CastedType>(
_ type: MutableList<CastedType>.Type)
-> MutableList<CastedType>?
{
if let castedList = self.array as? [CastedType] {
return MutableList<CastedType>(castedList)
}
else {
return nil
}
}
/// Used to obtain a MutableList with a new element type. If all elements in the list can be
/// casted to the new type, the method succeeds and the new MutableList is returned. Otherwise,
/// the method crashes.
public func forceCast<CastedType>(
to type: MutableList<CastedType>.Type)
-> MutableList<CastedType>
{
MutableList<CastedType>(array as! [CastedType])
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////
// gryphon ignore
public func zip<ASequence, ListElement>(
_ array1: ASequence,
_ array2: List<ListElement>)
-> List<(ASequence.Element, ListElement)>
where ASequence: Sequence
{
return List(Swift.zip(array1, array2))
}
// gryphon ignore
public func zip<ASequence, ListElement>(
_ array1: List<ListElement>,
_ array2: ASequence)
-> List<(ListElement, ASequence.Element)>
where ASequence: Sequence
{
return List(Swift.zip(array1, array2))
}
// gryphon ignore
public func zip<List1Element, List2Element>(
_ array1: List<List1Element>,
_ array2: List<List2Element>)
-> List<(List1Element, List2Element)>
{
return List(Swift.zip(array1, array2))
}
////////////////////////////////////////////////////////////////////////////////////////////////////
/// According to https://swiftdoc.org/v4.2/type/dictionary/hierarchy/
/// the Dictionary type in Swift conforms exactly to these protocols,
/// plus CustomReflectable (which is beyond Gryphon's scope for now).
// gryphon ignore
public class Map<Key, Value>: CustomStringConvertible,
CustomDebugStringConvertible,
ExpressibleByDictionaryLiteral,
Collection
where Key: Hashable
{
public typealias Buffer = [Key: Value]
public typealias KeyValueTuple = (key: Key, value: Value)
public typealias SubSequence = Slice<Buffer>
public typealias Index = Buffer.Index
public typealias Element = KeyValueTuple
public var dictionary: Buffer
public init(_ dictionary: Buffer) {
self.dictionary = dictionary
}
// The tuple inside the list has to be translated as a Pair for Kotlin compatibility
public func toList() -> List<(Key, Value)> {
return List(dictionary).map { ($0.0, $0.1) }
}
// Custom (Debug) String Convertible
public var description: String {
return dictionary.description
}
public var debugDescription: String {
return dictionary.debugDescription
}
// Expressible By Dictionary Literal
public required init(dictionaryLiteral elements: (Key, Value)...) {
self.dictionary = Buffer(uniqueKeysWithValues: elements)
}
// Sequence
public func makeIterator() -> IndexingIterator<Map<Key, Value>> {
return IndexingIterator(_elements: self)
}
// Collection
public var startIndex: Index {
return dictionary.startIndex
}
public var endIndex: Index {