WhatthisbookcoversChapter1,HelloRust!,givesashortrecapoftheRustprogra妹妹inglanguageandwhatchangedinthe2018edition.Chapter2,CargoandCrates,discussesRust'scargobuildtool.Wewillexploretheconfigurationaswellasthebuildprocessandmodularizationoptions.Chapter3,StoringEfficiently,looksathowinRust,knowingwherevaluesarestoredisnotonlyimportantforperformance,butalsoimportantforunderstandingerrormessagesandthelanguageingeneral.Inthischapter,wethinkaboutstackandheapmemory.Chapter4,Lists,Lists,andMoreLists,coversthefirstdatastructures:lists.Usingseveralexamples,thischaptergoesintovariationsofsequentialdatastructuresandtheirimplementations.Chapter5,RobustTrees,continuesourjourneythroughpopulardatastructures:treesarenextonthelist.Inseveraldetailedexamples,weexploretheinnerworkingsoftheseefficientdesignsandhowtheyimproveapplicationperformanceconsiderably.Chapter6,ExploringMapsandSets,exploresthemostpopularkey-valuestores:maps.Inthischapter,techniquessurroundinghashmaps;hashing;andtheircloserelative,theset;aredescribedindetail.Chapter7,CollectionsinRust,attemptstoconnecttotheRustprogra妹妹er'sdailylife,goingintothedetailsoftheRuststd::collectionslibrary,whichcontainsthevariousdatastructuresprovidedbytheRuststandardlibrary.Chapter8,AlgorithmEvaluation,teachesyouhowtoevaluateandcomparealgorithms.Chapter9,OrderingThings,willlookatsortingvalues,animportanttaskinprogra妹妹ing—thischapteruncovershowthatcanbedonequicklyandsafely.Chapter10,FindingStuff,movesontosearching,whichisespeciallyimportantifthereisnofundamentaldatastructuretosupportit.Inthesecases,weusealgorithmstobeabletoquicklyfindwhatwearelookingfor.Chapter11,RandomandCombinatorial,iswherewewillseethat,outsideofsortingandsearching,
1