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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
//!
//! Essentially, this crate allows to convert a `u8` iterator into a `char` iterator. It is meant to iterate around 
//! an I/O and it decodes a single character at a time. The underling iterator can be an iterator for a `BufRead` or 
//! a `Cursor`, for example.
//!
//! ## Disclaimer
//! 
//! I wrote this crate as part of a learning project, not because there weren't alternatives or to write something better. 
//! There are already Rust crates to decode UTF-8. This crate may only make some sense if your hardware is so low in memory 
//! that would pay off to decode directly from the IO buffer (something unlikely to happen these days, right?) or you really need to 
//! decode a single character at a time.
//! 

use std::char::from_u32;
use std::ops::RangeInclusive;
use thiserror::Error;

// Range of codes reserved for UTF-16 surrogates aren't valid UTF-8
const LOW_UTF_16_SURROGATE: u32 = 0xD800;
const HIGH_UTF_16_SURROGATE: u32 = 0xDFFF;

enum CachedValue {
    None,
    Byte(u8),
    Eof,
}

///
/// A `Utf8Iterator` wraps a UTF-8 decoder around an iterator for `Read`.
///
/// Essentially, the `Utf8Iterator` converts a `u8` iterator into a `char` iterator. The underling iterator can be an
/// iterator for a `BufRead` or a `Cursor`, for example.
/// It is meant to iterate around an I/O. Therefore, it is expecting the inner iterator to be of type `Iterator<Item = Result<u8, std::io::Error>>`.
///
/// The `next()` method will return an `Option`, where `None` indicates the end of the sequence and a value
/// will be of type `Result` containing a `char` or an error, which will describe an UTF-8 decoding error or an IO error from the underling iterator.
/// Decoding errors will contain the malformed sequences.
///
/// # Examples    
/// ```
///    use rustf8::*;
///    use std::io::prelude::*;
///    use std::io::Cursor;
///    fn some_correct_utf_8_text() {
///        let input: Vec<u8> = vec![
///            0xce, 0xba, 0xe1, 0xbd, 0xb9, 0xcf, 0x83, 0xce, 0xbc, 0xce, 0xb5,
///        ];
///        let stream = Cursor::new(input);
///        let iter = stream.bytes();
///        let mut chiter = Utf8Iterator::new(iter);
///        assert_eq!('κ', chiter.next().unwrap().unwrap());
///        assert_eq!('ό', chiter.next().unwrap().unwrap());
///        assert_eq!('σ', chiter.next().unwrap().unwrap());
///        assert_eq!('μ', chiter.next().unwrap().unwrap());
///        assert_eq!('ε', chiter.next().unwrap().unwrap());
///        assert!(chiter.next().is_none());
///    }
/// ```
///
/// # Errors
///
/// The `Utf8Iterator` will identify UTF-8 decoding errors returning the enum `Utf8IteratorError`.
/// The error will also contain a `Box<u8>` with the malformed sequence.
/// Subsequent calls to `next()` are allowed and will decode valid characters from the point beyond the malformed sequence.
///
/// The IO error `std::io::ErrorKind::Interrupted` coming from the underling iterator will be transparently _consumed_ by the `next()` method.
/// Therefore there will be no need to treat such error.
///
/// # Panics
///
/// Panics if trying to use `unget()` twice before calling `next()`.
///
/// # Safety
///
/// This crate does not use `unsafe {}`.
///
/// Once decoded, the values are converted using `char::from_u32()`, which should prevent invalid characters anyway.
///
pub struct Utf8Iterator<R>
where
    R: Iterator,
{
    inner: R,
    _cache: CachedValue,
    _unget: Option<char>,
}

impl<R> Utf8Iterator<R>
where
    R: Iterator<Item = Result<u8, std::io::Error>>,
{
    /// Builds a new UTF-8 iterator using the provided iterator for a `Read`.
    /// This iterator will not reinitialize once it reaches the end of the sequence.
    /// Also, the decoding will start at the current position of the underling iterator.
    pub fn new(inner: R) -> Self {
        Utf8Iterator {
            inner,
            _cache: CachedValue::None,
            _unget: None,
        }
    }
    /// Returns a character to the iterator. That will be the item returned by the subsequent call to `next()`.
    /// Calling `unget()` twice before calling `next()` will panic.
    ///
    /// # Example
    /// ```
    /// use rustf8::*;
    /// use std::io::prelude::*;
    /// use std::io::Cursor;
    /// fn unget_test() {
    ///     let input: Vec<u8> = vec![
    ///         0xce, 0xba, 0xe1, 0xbd, 0xb9, 0xcf, 0x83, 0xce, 0xbc, 0xce, 0xb5,
    ///     ];
    ///     let stream = Cursor::new(input);
    ///     let iter = stream.bytes();
    ///     let mut chiter = Utf8Iterator::new(iter);
    ///     assert_eq!('κ', chiter.next().unwrap().unwrap());
    ///     chiter.unget('ε');
    ///     assert_eq!('ε', chiter.next().unwrap().unwrap());
    ///     assert_eq!('ό', chiter.next().unwrap().unwrap());
    ///     assert_eq!('σ', chiter.next().unwrap().unwrap());
    ///     assert_eq!('μ', chiter.next().unwrap().unwrap());
    ///     assert_eq!('ε', chiter.next().unwrap().unwrap());
    ///     chiter.unget('κ');
    ///     assert_eq!('κ', chiter.next().unwrap().unwrap());
    ///     assert!(chiter.next().is_none());
    /// }
    /// ```
    ///
    /// # Panics
    ///
    /// Panics if trying to use `unget()` twice before calling `next()`.
    ///
    pub fn unget(&mut self, ch: char) {
        match self._unget {
            None => self._unget = Some(ch),
            Some(_) => {
                panic!("Cannot return character before consuming the previous cached value.")
            }
        }
    }
    fn take_unget(&mut self) -> Option<char> {
        self._unget.take()
    }

    fn uncache_or_next(&mut self) -> Option<R::Item> {
        let result = match self.cache() {
            // Bumped into an unexpected byte during the previous call to next(),
            // therefore it cached that byte, returned the sequence until that point and now it
            // needs to carry on from the byte that was unexpected.
            CachedValue::Byte(b) => Some(Ok(*b)),
            // If in the previous call to next() it exited because the stream had ended, it means that it returned
            // the character (probably as an invalid sequence) and now it has to indicate the end of the stream.
            CachedValue::Eof => None,
            // Nothing cached previously, read from the underling iterator
            CachedValue::None => 'ignore_interruption: loop {
                if let Some(item) = self.inner.next() {
                    match item {
                        Ok(b) => break Some(Ok(b)),
                        Err(e) => {
                            if e.kind() == std::io::ErrorKind::Interrupted {
                                continue 'ignore_interruption;
                            } else {
                                break Some(Err(e));
                            }
                        }
                    };
                } else {
                    break None;
                }
            },
        };
        *self.cache_mut() = CachedValue::None;
        result
    }
    fn cache(&self) -> &CachedValue {
        &self._cache
    }
    fn cache_mut(&mut self) -> &mut CachedValue {
        &mut self._cache
    }
}

///
/// The `Utf8Iterator` will identify UTF-8 decoding errors returning the enum `Utf8IteratorError`.
///
/// The error will also contain a `Box<u8>` with the malformed sequence.
///
/// # Example
///
/// ```
/// #  use rustf8::*;
/// #  use rustf8::Utf8IteratorError::*;
/// #  use std::io::prelude::*;
/// #  use std::io::Cursor;
/// #  use std::fmt::Debug;
/// #  fn tokenizer() {
/// #     use std::io::Bytes;
/// #      enum Token {
/// #          None,
/// #          Identifier(String),
/// #          Integer(String),
/// #          OpenList,
/// #          CloseList,
/// #          Symbol(String),
/// #          Invalid(String),
/// #      }
/// #      enum State {
/// #          Begin,
/// #          DecodingIdentifier,
/// #          DecodingInteger,
/// #          FinishedToken,
/// #          Finalized,
/// #          Invalid,
/// #      }
/// #      /* Some code omitted */
/// #      impl PartialEq for Token {
/// #              fn eq(&self, other: &Self) -> bool {
/// #                  use Token::*;
/// #                  match (self, other) {
/// #                      (None, None) => true,
/// #                      (OpenList,OpenList) => true,
/// #                      (CloseList, CloseList) => true,
/// #                      (Identifier(a), Identifier(b)) => a == b,
/// #                      (Integer(a), Integer(b)) => a == b,
/// #                      (Symbol(a), Symbol(b)) => a == b,
/// #                      (Invalid(a), Invalid(b)) => a == b,
/// #                      (_, _) => false
/// #                  }
/// #              }
/// #      }
/// #      impl Clone for Token {
/// #          
/// #              fn clone(&self) -> Self {
/// #                  use Token::*;
/// #                  match self {
/// #                      None => None,
/// #                      OpenList => OpenList,
/// #                      CloseList => CloseList,
/// #                      Identifier(a) => Identifier(a.to_string()),
/// #                      Integer(a) => Integer(a.to_string()),
/// #                      Symbol(a) => Symbol(a.to_string()),
/// #                      Invalid(a) => Invalid(a.to_string()),
/// #                  }
/// #              }
/// #      }
/// #      impl Debug for Token {
/// #          
/// #              fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::result::Result<(), std::fmt::Error> {
/// #                  use Token::*;
/// #                  match self {
/// #                      None => f.debug_struct("None").finish(),
/// #                      OpenList => f.debug_struct("OpenList").finish(),
/// #                      CloseList => f.debug_struct("CloseList").finish(),
/// #                      Identifier(a) => f.debug_struct("Identifier").field("string", a).finish(),
/// #                      Integer(a) => f.debug_struct("Integer").field("string", a).finish(),
/// #                      Symbol(a) => f.debug_struct("Symbol").field("string", a).finish(),
/// #                      Invalid(a) => f.debug_struct("Invalid").field("string", a).finish(),
/// #                  }
/// #              }
/// #      }
/// #      let input = "(defun κόσμε (x y) (+ x y))";
/// #      let stream = Cursor::new(input);
/// #      let iter = stream.bytes();
/// #      let mut chiter = Utf8Iterator::new(iter);
/// #      let mut state = (State::Begin, Token::None);
/// #  
/// #      fn state_machine (chiter: &mut Utf8Iterator<Bytes<Cursor<&str>>>, ch: char, state: &(State, Token))
/// #       -> (State, Token) {
/// #          match state {
/// #              (State::Invalid, _) | (State::FinishedToken, _) | (State::Begin, _) => {
/// #                  if ch == '(' {
/// #                      (State::FinishedToken, Token::OpenList)
/// #                  } else if ch == ')' {
/// #                      (State::FinishedToken, Token::CloseList)
/// #                  } else if ch.is_whitespace() {
/// #                      (State::Begin, Token::None)
/// #                  } else if ch.is_alphabetic() || ch == '_' {
/// #                      (State::DecodingIdentifier, Token::Identifier(ch.to_string()))
/// #                  } else if ch.is_numeric() {
/// #                      (State::DecodingInteger, Token::Integer(ch.to_string()))
/// #                  } else if ch.is_ascii_punctuation() {
/// #                      (State::FinishedToken, Token::Symbol(ch.to_string()))
/// #                  } else {
/// #                      (State::Invalid, Token::Invalid(ch.to_string()))
/// #                  }
/// #              }
/// #              (State::DecodingIdentifier, Token::Identifier(id)) => {
/// #                  if ch.is_whitespace() {
/// #                      (State::FinishedToken, Token::Identifier(id.to_string()))
/// #                  } else if ch.is_alphanumeric() || ch == '_' {
/// #                      (
/// #                          State::DecodingIdentifier,
/// #                          Token::Identifier(id.to_string() + &ch.to_string()),
/// #                      )
/// #                  } else {
/// #                      chiter.unget(ch);
/// #                      (
/// #                          State::FinishedToken,
/// #                          Token::Identifier(id.to_string()),
/// #                      )
/// #                  }
/// #              }
/// #              (State::DecodingInteger, Token::Integer(num)) => {
/// #                  if ch.is_whitespace() {
/// #                      (State::FinishedToken, Token::Integer(num.to_string()))
/// #                  } else if ch.is_digit(10) {
/// #                      (
/// #                          State::DecodingIdentifier,
/// #                          Token::Integer(num.to_string() + &ch.to_string()),
/// #                      )
/// #                  } else {
/// #                      chiter.unget(ch);
/// #                      (State::FinishedToken, Token::Integer(num.to_string() + &ch.to_string()))
/// #                  }
/// #              }
/// #              (_, _) => panic!("Inconsistent state!"),
/// #          }
/// #      };
///  fn next_token (chiter: &mut Utf8Iterator<Bytes<Cursor<&str>>>, state: &mut (State, Token))
///    -> Option<Token> {
///      loop {
///          let r = chiter.next();
///          match r {
///              Some(item) => match item {
///                  Ok(ch) => {
///                      *state = state_machine(chiter, ch, &state);
///                      if let State::FinishedToken = state.0 {
///                          return Some(state.1.clone());
///                      }
///                  }
///                  Err(e) => match e {
///                      InvalidSequenceError(bytes) => {
///                          panic!("Detected an invalid UTF-8 sequence! {:?}", bytes)
///                      }
///                      LongSequenceError(bytes) => {
///                          panic!("UTF-8 sequence with more tha 4 bytes! {:?}", bytes)
///                      }
///                      InvalidCharError(bytes) => panic!(
///                          "UTF-8 sequence resulted in an invalid character! {:?}",
///                          bytes
///                      ),
///                      IoError(ioe, bytes) => panic!(
///                          "I/O error {:?} while decoding de sequence {:?} !",
///                          ioe, bytes
///                      ),
///                  },
///              },
///              None => {
///                  if let State::Finalized = state.0 {
///                      return None;
///                  } else {
///                      state.0 = State::Finalized;
///                      return Some(state.1.clone());
///                  }
///              }
///          }
///      }
///  };
///   
/// #      macro_rules! test_token {
/// #          ($exp:expr) => {
/// #              assert_eq!($exp, next_token(&mut chiter, &mut state).unwrap());
/// #          };
/// #      }
/// #      // (defun κόσμε (x y) (+ x y))
/// #      test_token!(Token::OpenList);
/// #      test_token!(Token::Identifier(String::from("defun")));
/// #      test_token!(Token::Identifier(String::from("κόσμε")));
/// #      test_token!(Token::OpenList);
/// #      test_token!(Token::Identifier(String::from("x")));
/// #      test_token!(Token::Identifier(String::from("y")));
/// #      test_token!(Token::CloseList);
/// #      test_token!(Token::OpenList);
/// #      test_token!(Token::Symbol(String::from("+")));
/// #      test_token!(Token::Identifier(String::from("x")));
/// #      test_token!(Token::Identifier(String::from("y")));
/// #      test_token!(Token::CloseList);
/// #      test_token!(Token::CloseList);
/// #  
/// #      assert!(chiter.next().is_none());
/// #      
/// #  }
/// ```

#[derive(Error, Debug)]
pub enum Utf8IteratorError {
    ///
    /// Returns the IO error coming from the underling iterator wrapped by `Utf8Iterator`.
    ///
    /// The error `std::io::ErrorKind::Interrupted` is _consumed_ by the iterator and is not returned.
    ///
    #[error("IO Error from the wrapped iterator while decoding sequence: {0:?}")]
    IoError(std::io::Error, Box<[u8]>),

    /// The decoder found a malformed sequence.
    #[error("The decoder found a malformed sequence while decoding sequence: {0:?}")]
    InvalidSequenceError(Box<[u8]>),

    ///
    /// The sequence is well formed, but it is too long (more than 4 bytes).
    ///
    #[error("The sequence is well formed, but it is too long (more than 4 bytes). Sequence: {0:?}")]
    LongSequenceError(Box<[u8]>),

    ///
    /// Found a well formed UTF-8 sequence, nevertheless the value does not represent a valid character.
    ///
    #[error("Found a well formed UTF-8 sequence, nevertheless the value does not represent a valid character. Sequence: {0:?}")]
    InvalidCharError(Box<[u8]>),
}

use crate::Utf8IteratorError::*;

impl<R> Iterator for Utf8Iterator<R>
where
    R: Iterator<Item = Result<u8, std::io::Error>>,
{
    type Item = Result<char, Utf8IteratorError>;

    /// Decodes the next UTF-8 sequence and returns the corresponding character.
    fn next(&mut self) -> Option<Self::Item> {
        // identify the length of the UTF-8 sequence, then extracts the first bits and returns the valid range of code points too.
        fn length_first_bits_and_valid_range(first_byte: u8) -> (usize, u32, RangeInclusive<u32>) {
            // Uses a mask to isolate the bits indicating the sequence length.
            // Extracts the first bits belonging the UTF-8 sequence using the negated mask.
            macro_rules! mktest {
                ($nbits:literal, $mask:literal, $range:expr) => {
                    if first_byte & $mask == ($mask << 1) {
                        return ($nbits, u32::from(first_byte & !$mask), $range);
                    }
                };
            }

            // 1 byte sequence
            if first_byte & 0b_1000_0000_u8 == 0 {
                return (1, u32::from(first_byte), 0x00..=0xf7);
            }
            mktest!(2, 0b_1110_0000_u8, 0x0080..=0x07ff); // 2 bytes sequence
            mktest!(3, 0b_1111_0000_u8, 0x0800..=0xffff); // 3 bytes sequence
            mktest!(4, 0b_1111_1000_u8, 0x10000..=0x10ffff); // 4 bytes sequence
            mktest!(5, 0b_1111_1100_u8, 0..=0); // 5 bytes sequence, invalid
            mktest!(6, 0b_1111_1110_u8, 0..=0); // 6 bytes sequence, invalid
            return (0, 0u32, 0..=0); // continuation byte or other unexpected char
        }

        // abbreviates the clutter when returning errors
        macro_rules! err {
            ($err:ident, $slice:ident) => {
                Some(Err($err($slice.into_boxed_slice())))
            };
            ($err:ident, $nested:ident, $slice:ident) => {
                Some(Err($err($nested, $slice.into_boxed_slice())))
            };
            ($err:ident, $nested:ident, $slice:expr) => {
                Some(Err($err($nested, $slice.into_boxed_slice())))
            };
        }

        macro_rules! is_not_in_surrogate_range {
            ($value:ident) => {
                $value <= LOW_UTF_16_SURROGATE || HIGH_UTF_16_SURROGATE <= $value
            };
        }

        macro_rules! is_not_byte_order_mark {
            ($value:ident) => {
                $value != 0xfffe
            };
        }
        macro_rules! is_not_not_char {
            ($value:ident) => {
                $value != 0xffff
            };
        }

        if let Some(ch) = self.take_unget() {
            // If client code has returned a char, send it back now.
            return Some(Ok(ch));
        } else if let Some(has_input) = self.uncache_or_next() {
            match has_input {
                Err(e) => return err![IoError, e, Vec::<u8>::new()], // IO Error, not in the middle of a character
                Ok(first_byte) => {
                    let mut seq = Vec::<u8>::new();
                    seq.push(first_byte);
                    let (nbytes, mut builder, range) =
                        length_first_bits_and_valid_range(first_byte);
                    if nbytes >= 1 {
                        while seq.len() < nbytes {
                            if let Some(has_input) = self.uncache_or_next() {
                                match has_input {
                                    Err(e) => return err![IoError, e, seq], // IO Error while decoding one character
                                    Ok(next_byte) => {
                                        if next_byte & 0xC0u8 == 0x80u8 {
                                            // continuation byte
                                            seq.push(next_byte);
                                            builder =
                                                (builder << 6) | u32::from(next_byte & 0x3Fu8);
                                        } else {
                                            *self.cache_mut() = CachedValue::Byte(next_byte);
                                            return err![InvalidSequenceError, seq];
                                        }
                                    }
                                }
                            } else {
                                // stream ended while decoding one character
                                *self.cache_mut() = CachedValue::Eof;
                                return err![InvalidSequenceError, seq];
                            }
                        }
                        if nbytes < 5 {
                            if range.contains(&builder)
                                && is_not_in_surrogate_range!(builder)
                                && is_not_byte_order_mark!(builder)
                                && is_not_not_char!(builder)
                            {
                                if let Some(ch) = from_u32(builder) {
                                    // normal, sane, character according to Rust.
                                    return Some(Ok(ch));
                                } else {
                                    return err![InvalidCharError, seq];
                                }
                            } else {
                                return err![InvalidCharError, seq];
                            }
                        } else {
                            // Invalid sequences.
                            // 5 and 6 bytes unicode will overflow the builder variable.
                            return err![LongSequenceError, seq];
                        }
                    } else {
                        // It seems that the first byte is a continuation or other unexpected value
                        return err![InvalidSequenceError, seq];
                    }
                }
            }
        } else {
            // Stream ended before the character decoding started.
            *self.cache_mut() = CachedValue::Eof;
            return None;
        }
    }
    fn size_hint(&self) -> (usize, Option<usize>) {
        self.inner.size_hint()
    }
}

#[cfg(test)]
mod tests {

    //
    // Original by Markus Kuhn, adapted for HTML by Martin Dürst.
    //
    // UTF-8 decoder capability and stress test
    // ----------------------------------------
    // https://www.w3.org/2001/06/utf-8-wrong/UTF-8-test.html
    //
    use super::*;
    use core::fmt::Debug;
    use std::io::prelude::*;
    use std::io::BufReader;
    use std::io::Cursor;
    use tempfile::tempfile;

    macro_rules! match_char_and_sequence {
        ($ch:expr; $($x:expr),*) => {
            let input: Vec<u8> = vec![ $($x),* ];
            let mut chiter = Utf8Iterator::new(Cursor::new(input).bytes());
            assert_eq!($ch, chiter.next().unwrap().unwrap());
            assert!(chiter.next().is_none());
        };
    }

    macro_rules! match_err_and_sequence {
        ($err:ident; $($x:expr),*) => {
            let input: Vec<u8> = vec![ $($x),* ];
            let mut chiter = Utf8Iterator::new(Cursor::new(input).bytes());
            let value = chiter.next().unwrap();
            if let Err($err(bytes)) = value {
                assert_eq!(vec![ $($x),* ].into_boxed_slice(), bytes)
            } else {
                panic!("Expecting:{:?}, found: {:?}", stringify!(Err(Utf8IteratorError { $err: [$($x),*]})), value);
            }
            assert!(chiter.next().is_none());
        };
        ($chiter:ident; $err:ident; $($x:expr),*) => {
            let value = $chiter.next().unwrap();
            if let Err($err(bytes)) = value {
                assert_eq!(vec![ $($x),* ].into_boxed_slice(), bytes)
            } else {
                panic!("Expecting:{:?}, found: {:?}", stringify!(Err(Utf8IteratorError { $err: [$($x),*]})), value);
            }
        };
        ($err:ident; $($x:expr),*; $($y:expr),*) => {
            let input: Vec<u8> = vec![ $($x),* ];
            let mut chiter = Utf8Iterator::new(Cursor::new(input).bytes());
            let value = chiter.next().unwrap();
            if let Err($err(bytes)) = value {
                assert_eq!(vec![ $($y),* ].into_boxed_slice(), bytes)
            } else {
                panic!("Expecting:{:?}, found: {:?}", stringify!(Err(Utf8IteratorError { $err: [$($y),*]})), value);
            }
            assert!(chiter.next().is_none());
        };
    }

    macro_rules! match_incomplete {
        ($chiter:ident; $($seq:expr),*) => {
            let value = $chiter.next().unwrap();
        if let Err(InvalidSequenceError(bytes)) = value {
            assert_eq!(vec![ $($seq),* ].into_boxed_slice(), bytes)
        } else {
            panic!(value);
        }
        };
    }

    #[test]
    fn _1_some_correct_utf_8_text() {
        let input: Vec<u8> = vec![
            0xce, 0xba, 0xe1, 0xbd, 0xb9, 0xcf, 0x83, 0xce, 0xbc, 0xce, 0xb5,
        ];
        let stream = Cursor::new(input);
        let iter = stream.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        assert_eq!('κ', chiter.next().unwrap().unwrap());
        assert_eq!('ό', chiter.next().unwrap().unwrap());
        assert_eq!('σ', chiter.next().unwrap().unwrap());
        assert_eq!('μ', chiter.next().unwrap().unwrap());
        assert_eq!('ε', chiter.next().unwrap().unwrap());
        assert!(chiter.next().is_none());
    }

    #[test]
    fn _2_1_first_possible_sequence_of_a_certain_length() {
        match_char_and_sequence!['\u{80}'; 0xc2, 0x80 ];
        match_char_and_sequence!['\u{800}'; 0xe0, 0xa0, 0x80 ];
        match_char_and_sequence!['\u{10000}'; 0xf0, 0x90, 0x80, 0x80 ];

        // U+200000: 5 bytes. Unicode escape must be at most 10FFFF in Rust.
        match_err_and_sequence![LongSequenceError; 0b11111000, 0b10000000, 0b10000000, 0b10000000, 0b10000000];

        // U+4000000: 6 bytes. Unicode escape must be at most 10FFFF in Rust.
        match_err_and_sequence![LongSequenceError; 0b11111100, 0b10000000, 0b10000000, 0b10000000, 0b10000000, 0b10000000 ];
    }

    #[test]
    fn _2_2_last_possible_sequence_of_a_certain_length() {
        // 2.2.1  1 byte  (U-0000007F):        ""
        match_char_and_sequence!['\u{7f}'; 0b_0111_1111];

        // 2.2.2  2 bytes (U-000007FF):        " 0xdf, 0xbf,"
        match_char_and_sequence!['\u{7FF}'; 0b_1101_1111, 0b_1011_1111];

        // 2.2.3  3 bytes (U-0000FFFF):        " 0xef, 0xbf, 0xbf,"
        // U+FFFF is not a character: match_char_and_sequence!['\u{FFFF}'; 0b_1110_1111, 0b_1011_1111, 0b_1011_1111];

        // 2.2.4  4 bytes (U-001FFFFF):        " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidCharError; 0b_1111_0111, 0b1011_1111, 0b1011_1111, 0b1011_1111];

        // Last valid char for Rust: \u{10FFFF}
        match_char_and_sequence!['\u{10FFFF}'; 0b_1111_0100, 0b1000_1111, 0b1011_1111, 0b1011_1111];

        // 2.2.5  5 bytes (U-03FFFFFF):        " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![LongSequenceError; 0b_1111_1011, 0b1011_1111, 0b1011_1111, 0b1011_1111, 0b1011_1111];

        // 2.2.6  6 bytes (U-7FFFFFFF):        " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![LongSequenceError; 0b_1111_1101, 0b1011_1111, 0b1011_1111, 0b1011_1111, 0b1011_1111, 0b1011_1111 ];
    }

    #[test]
    fn _2_3_other_boundary_conditions() {
        match_char_and_sequence!['\u{00D7FF}'; 0xed, 0x9f, 0xbf ];
        match_char_and_sequence!['\u{00E000}'; 0xee, 0x80, 0x80 ];
        match_char_and_sequence!['\u{00FFFD}'; 0xef, 0xbf, 0xbd ];
        match_char_and_sequence!['\u{10FFFF}'; 0xf4, 0x8f, 0xbf, 0xbf ];
        // U+110000: Unicode escape must be at most 10FFFF in Rust.
        match_err_and_sequence![InvalidCharError; 0xf4u8, 0x90u8, 0x80u8, 0x80u8 ];
    }

    #[test]
    fn _3_1_unexpected_continuation_bytes() {
        match_err_and_sequence![InvalidSequenceError; 0x80 ];
        match_err_and_sequence![InvalidSequenceError; 0xbf ];
        match_char_and_sequence!['\u{80}'; 0b110_0_0010, 0b10_00_0000 ]; // correctly encoded \u{80}
        assert_eq!('\u{80}', from_u32(0x80).unwrap()); // from_u32 accepts 0x80 as valid and interprets it as \u{80}. Should it?

        // Should return one error per invalid continuation byte.
        let seq: Vec<u8> = vec![0x80, 0xbf, 0x81, 0xb0, 0x80, 0xbf];
        let cmp: Vec<u8> = vec![0x80, 0xbf, 0x81, 0xb0, 0x80, 0xbf];
        let len = seq.len();
        let stream = Cursor::new(seq);
        let buffered = BufReader::new(stream);
        let iter = buffered.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        for i in 0..len {
            if let Err(InvalidSequenceError(bytes)) = chiter.next().unwrap() {
                assert_eq!(cmp[i], bytes[0]);
            }
        }
        assert!(chiter.next().is_none());

        //3.1.9  Sequence of all 64 possible continuation bytes (0x80-0xbf):
        let mut seq: Vec<u8> = vec![];
        for i in 0u8..64u8 {
            seq.push(i | 0b_1000_0000u8)
        }
        let cmp: Vec<u8> = seq.clone();
        let len = seq.len();
        let stream = Cursor::new(seq);
        let buffered = BufReader::new(stream);
        let iter = buffered.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        for i in 0..len {
            if let Err(InvalidSequenceError(bytes)) = chiter.next().unwrap() {
                assert_eq!(cmp[i], bytes[0]);
            }
        }
        assert!(chiter.next().is_none());
    }

    #[test]
    fn _3_2_lonely_start_characters() {
        macro_rules! test_lonely_start {
            ($range:expr) => {
                let mut seq: Vec<u8> = vec![];
                for i in $range {
                    seq.push(i);
                    seq.push(0x20);
                }
                let cmp: Vec<u8> = seq.clone();
                let len = seq.len();
                let stream = Cursor::new(seq);
                let buffered = BufReader::new(stream);
                let iter = buffered.bytes();
                let mut chiter = Utf8Iterator::new(iter);
                for i in 0..len / 2 {
                    if let Err(InvalidSequenceError(bytes)) = chiter.next().unwrap() {
                        assert_eq!(&cmp[i * 2..i * 2 + 1], bytes.as_ref());
                    }
                    if let Ok(ch) = chiter.next().unwrap() {
                        assert_eq!(ch, ' ');
                    }
                }
                assert!(chiter.next().is_none());
            };
        }
        // 3.2.1  All 32 first bytes of 2-byte sequences (0xc0-0xdf),
        //        each followed by a space character:
        test_lonely_start![0xC0u8..=0xdfu8];

        // 3.2.2  All 16 first bytes of 3-byte sequences (0xe0-0xef),
        //        each followed by a space character:
        test_lonely_start![0xe0u8..=0xefu8];

        // 3.2.3  All 8 first bytes of 4-byte sequences (0xf0-0xf7),
        //        each followed by a space character:
        test_lonely_start![0xf0u8..=0xf7u8];

        // 3.2.4  All 4 first bytes of 5-byte sequences (0xf8-0xfb),
        //        each followed by a space character:
        test_lonely_start![0xf8u8..=0xfbu8];

        // 3.2.5  All 2 first bytes of 6-byte sequences (0xfc-0xfd),
        //        each followed by a space character:
        test_lonely_start![0xfcu8..=0xfdu8];
    }

    #[test]
    fn _3_3_sequences_with_last_continuation_byte_missing() {
        // All bytes of an incomplete sequence should be signalled as a single
        // malformed sequence, i.e., you should see only a single replacement
        // characters in each of the next 10 tests. (Characters as in section 2)

        // 3.3.1  2-byte sequence with last byte missing (U+0000):     " 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1100_0000 ];
        // 3.3.2  3-byte sequence with last byte missing (U+0000):     " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1110_0000, 0b1000_0000 ];
        // 3.3.3  4-byte sequence with last byte missing (U+0000):     " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_0000, 0b1000_0000 , 0b1000_0000 ];
        // 3.3.4  5-byte sequence with last byte missing (U+0000):     " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_1000, 0b1000_0000 , 0b1000_0000 , 0b1000_0000 ];
        // 3.3.5  6-byte sequence with last byte missing (U+0000):     " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_1100, 0b1000_0000 , 0b1000_0000 , 0b1000_0000 , 0b1000_0000 ];

        // 3.3.6  2-byte sequence with last byte missing (U-000007FF): " 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1100_1111 ];
        // 3.3.7  3-byte sequence with last byte missing (U-0000FFFF): " 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1110_0111, 0b1011_1111 ];
        // 3.3.8  4-byte sequence with last byte missing (U-001FFFFF): " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_0111, 0b1011_1111 , 0b1011_1111 ];
        // 3.3.9  5-byte sequence with last byte missing (U-03FFFFFF): " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_1011, 0b1011_1111 , 0b1011_1111 , 0b1011_1111 ];
        // 3.3.10 6-byte sequence with last byte missing (U-7FFFFFFF): " 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd, 0xef, 0xbf, 0xbd,"
        match_err_and_sequence![InvalidSequenceError; 0b1111_1101, 0b1011_1111 , 0b1011_1111 , 0b1011_1111 , 0b1011_1111 ];
    }

    #[test]
    fn _3_4_concatenation_of_incomplete_sequences() {
        // All the 10 sequences of 3.3 concatenated, you should see 10 malformed sequences being signalled:
        let input: Vec<u8> = vec![
            // 2 byte sequence with a missing trailing byte
            0b1100_0000,
            // 3 byte sequence with a missing trailing byte
            0b1110_0000,
            0b1000_0000,
            // 4 byte sequence with a missing trailing byte
            0b1111_0000,
            0b1000_0000,
            0b1000_0000,
            // 5 byte sequence with a missing trailing byte
            0b1111_1000,
            0b1000_0000,
            0b1000_0000,
            0b1000_0000,
            // 6 byte sequence with a missing trailing byte
            0b1111_1100,
            0b1000_0000,
            0b1000_0000,
            0b1000_0000,
            0b1000_0000,
            // 2 byte sequence with a missing trailing byte
            0b1100_1111,
            // 3 byte sequence with a missing trailing byte
            0b1110_0111,
            0b1011_1111,
            // 4 byte sequence with a missing trailing byte
            0b1111_0111,
            0b1011_1111,
            0b1011_1111,
            // 5 byte sequence with a missing trailing byte
            0b1111_1011,
            0b1011_1111,
            0b1011_1111,
            0b1011_1111,
            // 6 byte sequence with a missing trailing byte
            0b1111_1101,
            0b1011_1111,
            0b1011_1111,
            0b1011_1111,
            0b1011_1111,
        ];

        let mut chiter = Utf8Iterator::new(Cursor::new(input).bytes());

        // 2 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1100_0000];
        // 3 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1110_0000, 0b1000_0000];
        // 4 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1111_0000, 0b1000_0000, 0b1000_0000];
        // 5 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1111_1000, 0b1000_0000, 0b1000_0000, 0b1000_0000];
        // 6 byte sequence with a missing trailing byte
        match_incomplete![ chiter;
            0b1111_1100,
            0b1000_0000,
            0b1000_0000,
            0b1000_0000,
            0b1000_0000
        ];
        // 2 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1100_1111];
        // 3 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1110_0111, 0b1011_1111];
        // 4 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1111_0111, 0b1011_1111, 0b1011_1111];
        // 5 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1111_1011, 0b1011_1111, 0b1011_1111, 0b1011_1111];
        // 6 byte sequence with a missing trailing byte
        match_incomplete![ chiter;
            0b1111_1101,
            0b1011_1111,
            0b1011_1111,
            0b1011_1111,
            0b1011_1111
        ];

        assert!(chiter.next().is_none());
    }

    #[test]
    fn _4_1_examples_of_an_overlong_ascii_character() {
        // With a safe UTF-8 decoder, all of the following five overlong
        // representations of the ASCII character slash ("/") should be rejected
        // like a malformed UTF-8 sequence, for instance by substituting it with
        // a replacement character. If you see a slash below, you do not have a
        // safe UTF-8 decoder!

        // 4.1.1 U+002F = c0 af
        match_err_and_sequence!(InvalidCharError; 0xc0, 0xaf);
        // 4.1.2 U+002F = e0 80 af
        match_err_and_sequence!(InvalidCharError; 0xe0, 0x80, 0xaf);
        // 4.1.3 U+002F = f0 80 80 af
        match_err_and_sequence!(InvalidCharError; 0xf0, 0x80, 0x80, 0xaf);
        // 4.1.4 U+002F = f8 80 80 80 af
        match_err_and_sequence!(LongSequenceError; 0xf8, 0x80, 0x80, 0x80, 0xaf);
        // 4.1.5 U+002F = fc 80 80 80 80 af
        match_err_and_sequence!(LongSequenceError; 0xfc, 0x80, 0x80, 0x80, 0x80, 0xaf);
    }
    #[test]
    fn _4_2_maximum_overlong_sequences() {
        // Below you see the highest Unicode value that is still resulting in an
        // overlong sequence if represented with the given number of bytes. This
        // is a boundary test for safe UTF-8 decoders. All five characters should
        // be rejected like malformed UTF-8 sequences.

        // 4.2.1  U-0000007F = c1 bf
        match_err_and_sequence!(InvalidCharError; 0xc1, 0xbf);
        // 4.2.2  U-000007FF = e0 9f bf
        match_err_and_sequence!(InvalidCharError; 0xe0, 0x9f, 0xbf);
        // 4.2.3  U-0000FFFF = f0 8f bf bf
        match_err_and_sequence!(InvalidCharError; 0xf0, 0x8f, 0xbf, 0xbf);
        // 4.2.4  U-001FFFFF = f8 87 bf bf bf
        match_err_and_sequence!(LongSequenceError; 0xf8, 0x87, 0xbf, 0xbf, 0xbf);
        // 4.2.5  U-03FFFFFF = fc 83 bf bf bf bf
        match_err_and_sequence!(LongSequenceError; 0xfc, 0x83, 0xbf, 0xbf, 0xbf, 0xbf);
    }

    #[test]
    fn _4_3_overlong_representation_of_the_nul_character() {
        // The following five sequences should also be rejected like malformed
        // UTF-8 sequences and should not be treated like the ASCII NUL
        // character.

        // 4.3.1  U+0000 = c0 80
        match_err_and_sequence!(InvalidCharError; 0xc0, 0x80);
        // 4.3.2  U+0000 = e0 80 80
        match_err_and_sequence!(InvalidCharError; 0xe0, 0x80, 0x80);
        // 4.3.3  U+0000 = f0 80 80 80
        match_err_and_sequence!(InvalidCharError; 0xf0, 0x80, 0x80, 0x80);
        // 4.3.4  U+0000 = f8 80 80 80 80
        match_err_and_sequence!(LongSequenceError; 0xf8, 0x80, 0x80, 0x80, 0x80);
        // 4.3.5  U+0000 = fc 80 80 80 80 80
        match_err_and_sequence!(LongSequenceError; 0xfc, 0x80, 0x80, 0x80, 0x80, 0x80);
    }

    #[test]
    fn _5_illegal_code_positions() {
        // The following UTF-8 sequences should be rejected like malformed
        // sequences, because they never represent valid ISO 10646 characters and
        // a UTF-8 decoder that accepts them might introduce security problems
        //comparable to overlong UTF-8 sequences.

        // 5.1 Single UTF-16 surrogates
        // 5.1.1  U+D800 = ed a0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xa0, 0x80);
        // 5.1.2  U+DB7F = ed ad bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xad, 0xbf);
        // 5.1.3  U+DB80 = ed ae 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xae, 0x80);
        // 5.1.4  U+DBFF = ed af bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xaf, 0xbf);
        // 5.1.5  U+DC00 = ed b0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xb0, 0x80);
        // 5.1.6  U+DF80 = ed be 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbe, 0x80);
        // 5.1.7  U+DFFF = ed bf bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbf, 0xbf);

        // 5.2 Paired UTF-16 surrogates
        // Leading, also called high, surrogates are from D800 to DBFF, and trailing, or low, surrogates are from DC00 to DFFF.
        //
        //5.2.1  U+D800 U+DC00 = ed a0 80 ed b0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xa0, 0x80);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xb0, 0x80);
        //5.2.2  U+D800 U+DFFF = ed a0 80 ed bf bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xa0, 0x80);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbf, 0xbf);
        //5.2.3  U+DB7F U+DC00 = ed ad bf ed b0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xad, 0xbf);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xb0, 0x80);
        //5.2.4  U+DB7F U+DFFF = ed ad bf ed bf bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xad, 0xbf);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbf, 0xbf);
        //5.2.5  U+DB80 U+DC00 = ed ae 80 ed b0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xae, 0x80);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xb0, 0x80);
        //5.2.6  U+DB80 U+DFFF = ed ae 80 ed bf bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xae, 0x80);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbf, 0xbf);
        //5.2.7  U+DBFF U+DC00 = ed af bf ed b0 80
        match_err_and_sequence!(InvalidCharError; 0xed, 0xaf, 0xbf);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xb0, 0x80);
        //5.2.8  U+DBFF U+DFFF = ed af bf ed bf bf
        match_err_and_sequence!(InvalidCharError; 0xed, 0xaf, 0xbf);
        match_err_and_sequence!(InvalidCharError; 0xed, 0xbf, 0xbf);

        // 5.3 Other illegal code positions
        //5.3.1  U+FFFE = ef bf be
        match_err_and_sequence!(InvalidCharError; 0xef, 0xbf, 0xbe);
        //5.3.2  U+FFFF = ef bf bf
        match_err_and_sequence!(InvalidCharError; 0xef, 0xbf, 0xbf);
    }

    #[test]
    fn read_from_cursor() {
        let stream = Cursor::new("来提供和改进网站体验ersé®þüúäåáßðfghjœøµñbv©xæ");
        let mut chiter = Utf8Iterator::new(stream.bytes());

        assert_eq!('来', chiter.next().unwrap().unwrap());
        assert_eq!('提', chiter.next().unwrap().unwrap());
        assert_eq!('供', chiter.next().unwrap().unwrap());
        assert_eq!('和', chiter.next().unwrap().unwrap());
        assert_eq!('改', chiter.next().unwrap().unwrap());
        assert_eq!('进', chiter.next().unwrap().unwrap());
        assert_eq!('网', chiter.next().unwrap().unwrap());
        assert_eq!('站', chiter.next().unwrap().unwrap());
        assert_eq!('体', chiter.next().unwrap().unwrap());
        assert_eq!('验', chiter.next().unwrap().unwrap());
        assert_eq!('e', chiter.next().unwrap().unwrap());
        assert_eq!('r', chiter.next().unwrap().unwrap());
        assert_eq!('s', chiter.next().unwrap().unwrap());
        assert_eq!('é', chiter.next().unwrap().unwrap());
        assert_eq!('®', chiter.next().unwrap().unwrap());
        assert_eq!('þ', chiter.next().unwrap().unwrap());
        assert_eq!('ü', chiter.next().unwrap().unwrap());
        assert_eq!('ú', chiter.next().unwrap().unwrap());
        assert_eq!('ä', chiter.next().unwrap().unwrap());
        assert_eq!('å', chiter.next().unwrap().unwrap());
        assert_eq!('á', chiter.next().unwrap().unwrap());
        assert_eq!('ß', chiter.next().unwrap().unwrap());
        assert_eq!('ð', chiter.next().unwrap().unwrap());
        assert_eq!('f', chiter.next().unwrap().unwrap());
        assert_eq!('g', chiter.next().unwrap().unwrap());
        assert_eq!('h', chiter.next().unwrap().unwrap());
        assert_eq!('j', chiter.next().unwrap().unwrap());
        assert_eq!('œ', chiter.next().unwrap().unwrap());
        assert_eq!('ø', chiter.next().unwrap().unwrap());
        assert_eq!('µ', chiter.next().unwrap().unwrap());
        assert_eq!('ñ', chiter.next().unwrap().unwrap());
        assert_eq!('b', chiter.next().unwrap().unwrap());
        assert_eq!('v', chiter.next().unwrap().unwrap());
        assert_eq!('©', chiter.next().unwrap().unwrap());
        assert_eq!('x', chiter.next().unwrap().unwrap());
        assert_eq!('æ', chiter.next().unwrap().unwrap());
        assert!(chiter.next().is_none());
    }

    #[test]
    fn read_from_file() {
        let mut file = tempfile().unwrap();
        file.write_all("来提供和改进网站体验ersé®þüúäåáßðfghjœøµñbv©xæ".as_bytes())
            .unwrap();
        file.flush().unwrap();
        file.seek(std::io::SeekFrom::Start(0)).unwrap();
        let mut chiter = Utf8Iterator::new(file.bytes());

        assert_eq!('来', chiter.next().unwrap().unwrap());
        assert_eq!('提', chiter.next().unwrap().unwrap());
        assert_eq!('供', chiter.next().unwrap().unwrap());
        assert_eq!('和', chiter.next().unwrap().unwrap());
        assert_eq!('改', chiter.next().unwrap().unwrap());
        assert_eq!('进', chiter.next().unwrap().unwrap());
        assert_eq!('网', chiter.next().unwrap().unwrap());
        assert_eq!('站', chiter.next().unwrap().unwrap());
        assert_eq!('体', chiter.next().unwrap().unwrap());
        assert_eq!('验', chiter.next().unwrap().unwrap());
        assert_eq!('e', chiter.next().unwrap().unwrap());
        assert_eq!('r', chiter.next().unwrap().unwrap());
        assert_eq!('s', chiter.next().unwrap().unwrap());
        assert_eq!('é', chiter.next().unwrap().unwrap());
        assert_eq!('®', chiter.next().unwrap().unwrap());
        assert_eq!('þ', chiter.next().unwrap().unwrap());
        assert_eq!('ü', chiter.next().unwrap().unwrap());
        assert_eq!('ú', chiter.next().unwrap().unwrap());
        assert_eq!('ä', chiter.next().unwrap().unwrap());
        assert_eq!('å', chiter.next().unwrap().unwrap());
        assert_eq!('á', chiter.next().unwrap().unwrap());
        assert_eq!('ß', chiter.next().unwrap().unwrap());
        assert_eq!('ð', chiter.next().unwrap().unwrap());
        assert_eq!('f', chiter.next().unwrap().unwrap());
        assert_eq!('g', chiter.next().unwrap().unwrap());
        assert_eq!('h', chiter.next().unwrap().unwrap());
        assert_eq!('j', chiter.next().unwrap().unwrap());
        assert_eq!('œ', chiter.next().unwrap().unwrap());
        assert_eq!('ø', chiter.next().unwrap().unwrap());
        assert_eq!('µ', chiter.next().unwrap().unwrap());
        assert_eq!('ñ', chiter.next().unwrap().unwrap());
        assert_eq!('b', chiter.next().unwrap().unwrap());
        assert_eq!('v', chiter.next().unwrap().unwrap());
        assert_eq!('©', chiter.next().unwrap().unwrap());
        assert_eq!('x', chiter.next().unwrap().unwrap());
        assert_eq!('æ', chiter.next().unwrap().unwrap());
        assert!(chiter.next().is_none());
    }

    #[test]
    fn read_file_with_errors() {
        let mut file = tempfile().unwrap();
        let input: Vec<u8> = vec![
            // "κόσμε"
            0xce,
            0xba,
            0xe1,
            0xbd,
            0xb9,
            0xcf,
            0x83,
            0xce,
            0xbc,
            0xce,
            0xb5,
            // 4 byte sequence with a missing trailing byte
            0b1111_0000,
            0b1000_0000,
            0b1000_0000,
            // "κόσμε"
            0xce,
            0xba,
            0xe1,
            0xbd,
            0xb9,
            0xcf,
            0x83,
            0xce,
            0xbc,
            0xce,
            0xb5,
            // Unexpected sequence bytes
            0x80,
            0xbf,
            // "κόσμε"
            0xce,
            0xba,
            0xe1,
            0xbd,
            0xb9,
            0xcf,
            0x83,
            0xce,
            0xbc,
            0xce,
            0xb5,
            // Over long ASCII
            0xf0,
            0x80,
            0x80,
            0xaf,
            // UTF-16 Surrogate
            0xed,
            0xa0,
            0x80,
            // "κόσμε"
            0xce,
            0xba,
            0xe1,
            0xbd,
            0xb9,
            0xcf,
            0x83,
            0xce,
            0xbc,
            0xce,
            0xb5,
        ];
        file.write_all(input.as_slice()).unwrap();
        file.flush().unwrap();
        file.seek(std::io::SeekFrom::Start(0)).unwrap();
        let mut chiter = Utf8Iterator::new(file.bytes());

        macro_rules! match_kosme {
            ($iter:ident) => {
                assert_eq!('κ', chiter.next().unwrap().unwrap());
                assert_eq!('ό', chiter.next().unwrap().unwrap());
                assert_eq!('σ', chiter.next().unwrap().unwrap());
                assert_eq!('μ', chiter.next().unwrap().unwrap());
                assert_eq!('ε', chiter.next().unwrap().unwrap());
            };
        }

        // "κόσμε"
        match_kosme!(chiter);
        // 4 byte sequence with a missing trailing byte
        match_incomplete![ chiter; 0b1111_0000, 0b1000_0000, 0b1000_0000];
        // "κόσμε"
        match_kosme!(chiter);
        // Unexpected sequence bytes
        match_err_and_sequence!(chiter; InvalidSequenceError; 0x80);
        // Unexpected sequence bytes
        match_err_and_sequence!(chiter; InvalidSequenceError; 0xbf);
        // "κόσμε"
        match_kosme!(iter);
        // Over long ASCII
        match_err_and_sequence!(chiter; InvalidCharError; 0xf0, 0x80, 0x80, 0xaf);
        // UTF-16 Surrogate
        match_err_and_sequence!(chiter; InvalidCharError; 0xed, 0xa0, 0x80);
        // "κόσμε"
        match_kosme!(chiter);

        assert!(chiter.next().is_none());
    }

    #[test]
    fn unget() {
        let input: Vec<u8> = vec![
            0xce, 0xba, 0xe1, 0xbd, 0xb9, 0xcf, 0x83, 0xce, 0xbc, 0xce, 0xb5,
        ];
        let stream = Cursor::new(input);
        let iter = stream.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        assert_eq!('κ', chiter.next().unwrap().unwrap());
        chiter.unget('ε');
        assert_eq!('ε', chiter.next().unwrap().unwrap());
        assert_eq!('ό', chiter.next().unwrap().unwrap());
        assert_eq!('σ', chiter.next().unwrap().unwrap());
        assert_eq!('μ', chiter.next().unwrap().unwrap());
        assert_eq!('ε', chiter.next().unwrap().unwrap());
        chiter.unget('κ');
        assert_eq!('κ', chiter.next().unwrap().unwrap());
        assert!(chiter.next().is_none());
    }

    #[test]
    #[should_panic]
    fn unget_panic() {
        let input: Vec<u8> = vec![
            0xce, 0xba, 0xe1, 0xbd, 0xb9, 0xcf, 0x83, 0xce, 0xbc, 0xce, 0xb5,
        ];
        let stream = Cursor::new(input);
        let iter = stream.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        assert_eq!('κ', chiter.next().unwrap().unwrap());
        chiter.unget('ε');
        chiter.unget('κ');
        
    }

   #[test]
    fn tokenizer() {
        use std::io::Bytes;
        enum Token {
            None,
            Identifier(String),
            Integer(String),
            OpenList,
            CloseList,
            Symbol(String),
            Invalid(String),
        }
        enum State {
            Begin,
            DecodingIdentifier,
            DecodingInteger,
            FinishedToken,
            Invalid,
        }
        impl PartialEq for Token {
            fn eq(&self, other: &Self) -> bool {
                use Token::*;
                match (self, other) {
                    (None, None) => true,
                    (OpenList, OpenList) => true,
                    (CloseList, CloseList) => true,
                    (Identifier(a), Identifier(b)) => a == b,
                    (Integer(a), Integer(b)) => a == b,
                    (Symbol(a), Symbol(b)) => a == b,
                    (Invalid(a), Invalid(b)) => a == b,
                    (_, _) => false,
                }
            }
        }
        impl Clone for Token {
            fn clone(&self) -> Self {
                use Token::*;
                match self {
                    None => None,
                    OpenList => OpenList,
                    CloseList => CloseList,
                    Identifier(a) => Identifier(a.to_string()),
                    Integer(a) => Integer(a.to_string()),
                    Symbol(a) => Symbol(a.to_string()),
                    Invalid(a) => Invalid(a.to_string()),
                }
            }
        }
        impl Debug for Token {
            fn fmt(
                &self,
                f: &mut std::fmt::Formatter<'_>,
            ) -> std::result::Result<(), std::fmt::Error> {
                use Token::*;
                match self {
                    None => f.debug_struct("None").finish(),
                    OpenList => f.debug_struct("OpenList").finish(),
                    CloseList => f.debug_struct("CloseList").finish(),
                    Identifier(a) => f.debug_struct("Identifier").field("string", a).finish(),
                    Integer(a) => f.debug_struct("Integer").field("string", a).finish(),
                    Symbol(a) => f.debug_struct("Symbol").field("string", a).finish(),
                    Invalid(a) => f.debug_struct("Invalid").field("string", a).finish(),
                }
            }
        }
        let input = "(defun κόσμε (x y) (+ x y))";
        let stream = Cursor::new(input);
        let iter = stream.bytes();
        let mut chiter = Utf8Iterator::new(iter);
        let mut state = (State::Begin, Token::None);

        fn state_machine(
            chiter: &mut Utf8Iterator<Bytes<Cursor<&str>>>,
            ch: char,
            state: &(State, Token),
        ) -> (State, Token) {
            match state {
                (State::Invalid, _) | (State::FinishedToken, _) | (State::Begin, _) => {
                    if ch == '(' {
                        (State::FinishedToken, Token::OpenList)
                    } else if ch == ')' {
                        (State::FinishedToken, Token::CloseList)
                    } else if ch.is_whitespace() {
                        (State::Begin, Token::None)
                    } else if ch.is_alphabetic() || ch == '_' {
                        (State::DecodingIdentifier, Token::Identifier(ch.to_string()))
                    } else if ch.is_numeric() {
                        (State::DecodingInteger, Token::Integer(ch.to_string()))
                    } else if ch.is_ascii_punctuation() {
                        (State::FinishedToken, Token::Symbol(ch.to_string()))
                    } else {
                        (State::Invalid, Token::Invalid(ch.to_string()))
                    }
                }
                (State::DecodingIdentifier, Token::Identifier(id)) => {
                    if ch.is_whitespace() {
                        (State::FinishedToken, Token::Identifier(id.to_string()))
                    } else if ch.is_alphanumeric() || ch == '_' {
                        (
                            State::DecodingIdentifier,
                            Token::Identifier(id.to_string() + &ch.to_string()),
                        )
                    } else {
                        chiter.unget(ch);
                        (State::FinishedToken, Token::Identifier(id.to_string()))
                    }
                }
                (State::DecodingInteger, Token::Integer(num)) => {
                    if ch.is_whitespace() {
                        (State::FinishedToken, Token::Integer(num.to_string()))
                    } else if ch.is_digit(10) {
                        (
                            State::DecodingIdentifier,
                            Token::Integer(num.to_string() + &ch.to_string()),
                        )
                    } else {
                        chiter.unget(ch);
                        (
                            State::FinishedToken,
                            Token::Integer(num.to_string() + &ch.to_string()),
                        )
                    }
                }
                (_, _) => panic!("Inconsistent state!"),
            }
        };
        fn next_token(
            chiter: &mut Utf8Iterator<Bytes<Cursor<&str>>>,
            state: &mut (State, Token),
        ) -> Option<Token> {
            loop {
                let r = chiter.next();
                match r {
                    Some(item) => match item {
                        Ok(ch) => {
                            *state = state_machine(chiter, ch, &state);
                            if let State::FinishedToken = state.0 {
                                return Some(state.1.clone());
                            }
                        }
                        Err(e) => match e {
                            InvalidSequenceError(bytes) => {
                                panic!("Detected an invalid UTF-8 sequence! {:?}", bytes)
                            }
                            LongSequenceError(bytes) => {
                                panic!("UTF-8 sequence with more tha 4 bytes! {:?}", bytes)
                            }
                            InvalidCharError(bytes) => panic!(
                                "UTF-8 sequence resulted in an invalid character! {:?}",
                                bytes
                            ),
                            IoError(ioe, bytes) => panic!(
                                "I/O error {:?} while decoding de sequence {:?} !",
                                ioe, bytes
                            ),
                        },
                    },
                    None => {
                        return None;
                    }
                }
            }
        };

        macro_rules! test_token {
            ($exp:expr) => {
                assert_eq!($exp, next_token(&mut chiter, &mut state).unwrap());
            };
        }
        // (defun κόσμε (x y) (+ x y))
        test_token!(Token::OpenList);
        test_token!(Token::Identifier(String::from("defun")));
        test_token!(Token::Identifier(String::from("κόσμε")));
        test_token!(Token::OpenList);
        test_token!(Token::Identifier(String::from("x")));
        test_token!(Token::Identifier(String::from("y")));
        test_token!(Token::CloseList);
        test_token!(Token::OpenList);
        test_token!(Token::Symbol(String::from("+")));
        test_token!(Token::Identifier(String::from("x")));
        test_token!(Token::Identifier(String::from("y")));
        test_token!(Token::CloseList);
        test_token!(Token::CloseList);

        assert!(chiter.next().is_none());
    }
}