@@ -347,10 +347,15 @@ impl<K: Ord, V> BTreeMap<K, V> {
347
347
///
348
348
/// # Examples
349
349
///
350
+ /// Basic usage:
351
+ ///
350
352
/// ```
351
353
/// use std::collections::BTreeMap;
352
354
///
353
- /// let mut map: BTreeMap<&str, isize> = BTreeMap::new();
355
+ /// let mut map = BTreeMap::new();
356
+ ///
357
+ /// // entries can now be inserted into the empty map
358
+ /// a.insert(1, "a");
354
359
/// ```
355
360
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
356
361
pub fn new ( ) -> BTreeMap < K , V > {
@@ -364,6 +369,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
364
369
///
365
370
/// # Examples
366
371
///
372
+ /// Basic usage:
373
+ ///
367
374
/// ```
368
375
/// use std::collections::BTreeMap;
369
376
///
@@ -385,6 +392,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
385
392
///
386
393
/// # Examples
387
394
///
395
+ /// Basic usage:
396
+ ///
388
397
/// ```
389
398
/// use std::collections::BTreeMap;
390
399
///
@@ -408,6 +417,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
408
417
///
409
418
/// # Examples
410
419
///
420
+ /// Basic usage:
421
+ ///
411
422
/// ```
412
423
/// use std::collections::BTreeMap;
413
424
///
@@ -428,6 +439,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
428
439
///
429
440
/// # Examples
430
441
///
442
+ /// Basic usage:
443
+ ///
431
444
/// ```
432
445
/// use std::collections::BTreeMap;
433
446
///
@@ -460,6 +473,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
460
473
///
461
474
/// # Examples
462
475
///
476
+ /// Basic usage:
477
+ ///
463
478
/// ```
464
479
/// use std::collections::BTreeMap;
465
480
///
@@ -490,6 +505,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
490
505
///
491
506
/// # Examples
492
507
///
508
+ /// Basic usage:
509
+ ///
493
510
/// ```
494
511
/// use std::collections::BTreeMap;
495
512
///
@@ -519,6 +536,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
519
536
///
520
537
/// # Examples
521
538
///
539
+ /// Basic usage:
540
+ ///
522
541
/// ```
523
542
/// #![feature(btree_range, collections_bound)]
524
543
///
@@ -592,6 +611,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
592
611
///
593
612
/// # Examples
594
613
///
614
+ /// Basic usage:
615
+ ///
595
616
/// ```
596
617
/// #![feature(btree_range, collections_bound)]
597
618
///
@@ -667,6 +688,8 @@ impl<K: Ord, V> BTreeMap<K, V> {
667
688
///
668
689
/// # Examples
669
690
///
691
+ /// Basic usage:
692
+ ///
670
693
/// ```
671
694
/// use std::collections::BTreeMap;
672
695
///
@@ -1275,6 +1298,8 @@ impl<K, V> BTreeMap<K, V> {
1275
1298
///
1276
1299
/// # Examples
1277
1300
///
1301
+ /// Basic usage:
1302
+ ///
1278
1303
/// ```
1279
1304
/// use std::collections::BTreeMap;
1280
1305
///
@@ -1305,6 +1330,8 @@ impl<K, V> BTreeMap<K, V> {
1305
1330
///
1306
1331
/// # Examples
1307
1332
///
1333
+ /// Basic usage:
1334
+ ///
1308
1335
/// ```
1309
1336
/// use std::collections::BTreeMap;
1310
1337
///
@@ -1338,6 +1365,8 @@ impl<K, V> BTreeMap<K, V> {
1338
1365
///
1339
1366
/// # Examples
1340
1367
///
1368
+ /// Basic usage:
1369
+ ///
1341
1370
/// ```
1342
1371
/// use std::collections::BTreeMap;
1343
1372
///
@@ -1357,6 +1386,8 @@ impl<K, V> BTreeMap<K, V> {
1357
1386
///
1358
1387
/// # Examples
1359
1388
///
1389
+ /// Basic usage:
1390
+ ///
1360
1391
/// ```
1361
1392
/// use std::collections::BTreeMap;
1362
1393
///
@@ -1376,6 +1407,8 @@ impl<K, V> BTreeMap<K, V> {
1376
1407
///
1377
1408
/// # Examples
1378
1409
///
1410
+ /// Basic usage:
1411
+ ///
1379
1412
/// ```
1380
1413
/// use std::collections::BTreeMap;
1381
1414
///
@@ -1393,6 +1426,8 @@ impl<K, V> BTreeMap<K, V> {
1393
1426
///
1394
1427
/// # Examples
1395
1428
///
1429
+ /// Basic usage:
1430
+ ///
1396
1431
/// ```
1397
1432
/// use std::collections::BTreeMap;
1398
1433
///
0 commit comments