1
00:00:01,530 --> 00:00:02,190
Hi, everyone.

2
00:00:02,220 --> 00:00:09,080
So in this video, we're going to discuss this topic, itis now suppose you are provided with that,

3
00:00:09,080 --> 00:00:11,510
that you can easily traverse the Liati.

4
00:00:13,410 --> 00:00:19,710
Now, I suppose you have vectors then also you can easily traverse the area using the standard size

5
00:00:19,710 --> 00:00:20,250
function.

6
00:00:20,280 --> 00:00:23,430
You can go to each and every element and you can access the elements.

7
00:00:24,150 --> 00:00:28,090
Now you have a map, so how you will traverse the map.

8
00:00:28,680 --> 00:00:34,260
So basically for traversing the map, for accessing every key value inside the map, for accessing every

9
00:00:34,260 --> 00:00:37,170
element inside the map, we use our database.

10
00:00:38,250 --> 00:00:41,310
So with the help of our we can traverse the maps.

11
00:00:42,480 --> 00:00:48,770
OK, so many enrolled classes have our tutors so better also have our tutors.

12
00:00:49,350 --> 00:00:51,340
We have a list class to list.

13
00:00:51,360 --> 00:00:53,270
A class also has iterators.

14
00:00:54,270 --> 00:00:57,840
Similarly, we have so this is map we have on our road map.

15
00:00:58,350 --> 00:01:01,280
So in order to map also has our database.

16
00:01:01,770 --> 00:01:03,840
Similarly, you have unordered.

17
00:01:05,700 --> 00:01:10,170
And all that said and ordered it, so they also have ideato.

18
00:01:11,900 --> 00:01:19,700
So what is an order said and what is simple said, so downloaded that map and our road map, so they

19
00:01:19,700 --> 00:01:20,440
are very similar.

20
00:01:20,630 --> 00:01:22,150
So what maps those maps?

21
00:01:22,160 --> 00:01:23,180
Turkey, the loopier.

22
00:01:24,400 --> 00:01:30,910
But it will store only keys, it will not only keys, it will not store values, arrest everything the

23
00:01:30,910 --> 00:01:32,630
same, everything will be same.

24
00:01:32,650 --> 00:01:36,270
So this map will take longer time for INCERTITUDE Search.

25
00:01:36,520 --> 00:01:40,070
So this search will take longer time for instability and search.

26
00:01:40,690 --> 00:01:46,170
So this road map, it takes constant time for you to certainly touch this set an hour to start.

27
00:01:46,200 --> 00:01:48,890
It will also take constant time for INCERTITUDE search.

28
00:01:49,180 --> 00:01:50,110
So I would think the same.

29
00:01:50,260 --> 00:01:54,850
It is just that map will develop it and settle to or Leakey's, not values.

30
00:01:55,760 --> 00:01:56,360
Simple.

31
00:01:57,310 --> 00:02:05,260
So all of these map on our road map said said so for our data on all these glasses you need, I do this

32
00:02:05,920 --> 00:02:06,580
for Vector.

33
00:02:06,580 --> 00:02:11,980
It is optional to use iterators to traverse the vector because we also have the standard size function.

34
00:02:12,340 --> 00:02:14,530
OK, so 428 is optional to use.

35
00:02:16,030 --> 00:02:22,110
So if this map is this map is implemented using bisdee, so this set is also implemented using Boudi.

36
00:02:23,320 --> 00:02:25,800
Similarly, in order to map is implemented using hash table.

37
00:02:26,080 --> 00:02:29,010
So an order that is also implemented using hash table.

38
00:02:29,590 --> 00:02:34,510
So everything is very same, everything is very similar between between map and said.

39
00:02:35,860 --> 00:02:37,810
So now let us write the code.

40
00:02:41,190 --> 00:02:42,750
So I already had to file.

41
00:02:43,650 --> 00:02:50,520
Now let us create an unwanted map first, let us take over the map and then we will also see vectors

42
00:02:50,910 --> 00:02:52,610
how we can use our data for vector.

43
00:02:53,100 --> 00:02:59,310
So let's say the string, let's say the keys string and the value is integer and the name of map is

44
00:02:59,310 --> 00:02:59,780
my map.

45
00:03:00,510 --> 00:03:02,380
And now let us push them in place.

46
00:03:02,400 --> 00:03:05,790
So my map of, let's say stringers, ABC.

47
00:03:08,690 --> 00:03:11,750
And let's say the values run, so now let's copy this.

48
00:03:39,920 --> 00:03:46,420
So I have pushed six entries inside my map, so the size of my map is basically six.

49
00:03:47,720 --> 00:03:54,710
Now we want to assess each and every element of my map, so how can we access each and every element?

50
00:03:54,710 --> 00:03:55,850
We will use our database.

51
00:03:56,570 --> 00:03:58,340
So how can we use our database?

52
00:03:58,340 --> 00:04:00,930
And now let's discuss what are our duties.

53
00:04:02,060 --> 00:04:05,720
So basically, we want to traverse our unordered map.

54
00:04:08,000 --> 00:04:13,910
We want to exhaust each and every element of our road map, so as the name suggests on that map, so

55
00:04:13,910 --> 00:04:18,700
that means when you will traverse this and road map so there is no ordering of the elements.

56
00:04:18,709 --> 00:04:22,850
So there is no guarantee which element will come first and which element will come last.

57
00:04:23,180 --> 00:04:28,130
So it is not guaranteed that ABC will come first and ABC will come at last.

58
00:04:28,400 --> 00:04:29,450
So there's no guarantee.

59
00:04:30,440 --> 00:04:33,170
OK, and that means there is no ordering of elements.

60
00:04:34,610 --> 00:04:35,720
So now what will happen?

61
00:04:35,750 --> 00:04:41,570
So basically you have this map, so I don't know how it will store our developer.

62
00:04:42,810 --> 00:04:48,990
Then we have our data so decided I will point to an element and what is an element?

63
00:04:48,990 --> 00:04:50,960
An element is basically a developer.

64
00:04:51,390 --> 00:04:54,680
So our data is basically pointing to a developer.

65
00:04:55,080 --> 00:05:00,720
And if I will do 80 plus, plus, 80 plus, plus means move to the next element.

66
00:05:00,930 --> 00:05:02,470
So next element can be anywhere.

67
00:05:02,850 --> 00:05:04,920
So it will move to the next element.

68
00:05:10,600 --> 00:05:11,620
So when will do it?

69
00:05:12,220 --> 00:05:13,020
So this is a point.

70
00:05:13,100 --> 00:05:18,450
It will move to the next element and we do not know how the map is destroying our element.

71
00:05:18,460 --> 00:05:19,790
So it can be anything.

72
00:05:19,810 --> 00:05:21,280
So the next element can be anything.

73
00:05:21,280 --> 00:05:21,940
We don't know the.

74
00:05:22,230 --> 00:05:25,820
So there is no guarantee in which order the elements will appear.

75
00:05:26,620 --> 00:05:28,600
Now, how to create Knight-Ridder?

76
00:05:29,740 --> 00:05:34,210
So the syntax for creating a narrative is you will write an altered map.

77
00:05:35,410 --> 00:05:37,670
Then you will write Stringer and Bija.

78
00:05:40,140 --> 00:05:46,560
Then you will write a column column and then you will write the Syntex editor and then you will give

79
00:05:46,560 --> 00:05:47,000
the name.

80
00:05:47,010 --> 00:05:48,180
So the name is 80.

81
00:05:48,840 --> 00:05:50,070
So this is the type.

82
00:05:51,180 --> 00:05:52,360
This is the day to day.

83
00:05:54,480 --> 00:05:58,210
And this is basically the name of the variable.

84
00:05:58,890 --> 00:06:00,210
This is the name of the variable.

85
00:06:00,810 --> 00:06:02,460
OK, so I have a function.

86
00:06:03,970 --> 00:06:06,940
So if you will, right, it equals my map.

87
00:06:08,240 --> 00:06:10,430
Dart begins, So I have a function begin.

88
00:06:12,170 --> 00:06:18,710
So this began with the help of this big and function decided, I will point to the first element of

89
00:06:18,710 --> 00:06:19,180
the map.

90
00:06:19,640 --> 00:06:27,530
So this idea will point towards the first element of the map, simple.

91
00:06:28,160 --> 00:06:29,890
And then we will do it plus plus.

92
00:06:29,900 --> 00:06:31,070
So we will move ahead.

93
00:06:31,850 --> 00:06:33,110
So I have a sales function.

94
00:06:33,740 --> 00:06:37,230
So I know, for example, in our case, so there were six 11 percent.

95
00:06:37,640 --> 00:06:43,640
Now what I will do with the help of begin function, I will get to the first element, then I will do

96
00:06:43,640 --> 00:06:48,550
it six times because the size of the map is six and I will print all the key values here.

97
00:06:49,220 --> 00:06:54,350
Not the second option of reversing the map is basically we have a function darte and.

98
00:06:56,070 --> 00:07:05,280
So what I will do when it becomes equal to my stepdad and what will happen so and so and does not mean

99
00:07:05,280 --> 00:07:09,510
this one so and miss the element after last.

100
00:07:09,810 --> 00:07:14,040
So basically, this is and this is not and this is not.

101
00:07:14,040 --> 00:07:14,920
And this is wrong.

102
00:07:14,940 --> 00:07:15,800
This one is end.

103
00:07:16,470 --> 00:07:17,300
So what can I do?

104
00:07:18,400 --> 00:07:19,620
I will start from begin.

105
00:07:20,550 --> 00:07:26,830
I will do it placeless, so I will move ahead and then I will reach my stepdad and I will stop by treating

106
00:07:27,700 --> 00:07:28,270
simple.

107
00:07:29,350 --> 00:07:35,560
And the second option is basically you go to do begin, you will do it plus plus six times because the

108
00:07:35,560 --> 00:07:38,320
size of the map is six and you can print all the elements.

109
00:07:39,690 --> 00:07:44,670
Now, let us write the code, so let us use for loop, you can also use a while loop.

110
00:07:45,750 --> 00:07:51,990
So for now, again, first we have to give the red tape so this is not a tape.

111
00:07:55,820 --> 00:08:03,590
And the name of the variable is IP, and we will go to the beginning to my map that I have begun to

112
00:08:03,590 --> 00:08:04,040
function.

113
00:08:06,240 --> 00:08:06,600
Then.

114
00:08:09,070 --> 00:08:11,060
It is not equal.

115
00:08:11,110 --> 00:08:12,700
Do I have to traverse my map?

116
00:08:13,890 --> 00:08:15,390
They lied, they lied.

117
00:08:15,420 --> 00:08:18,660
It is not close to my and 80 plus plus.

118
00:08:20,530 --> 00:08:21,010
Symbol.

119
00:08:22,320 --> 00:08:23,610
Now, what is Ed?

120
00:08:24,330 --> 00:08:27,730
So basically, what is Ed pointing to?

121
00:08:28,470 --> 00:08:31,750
So you have this Ed idea.

122
00:08:31,770 --> 00:08:34,409
So this ad is basically pointing to appear.

123
00:08:35,890 --> 00:08:39,260
So this is a beard, a gray beard.

124
00:08:40,390 --> 00:08:43,470
I want to ask and I also want to assess the value.

125
00:08:44,169 --> 00:08:48,850
So if I have a beard, how can I first and second element so I can write it out first.

126
00:08:49,180 --> 00:08:50,340
But I have an address.

127
00:08:50,560 --> 00:08:51,630
So this is a pointer.

128
00:08:52,090 --> 00:08:56,260
So if you want to access the first element, you have to write it first.

129
00:08:57,970 --> 00:08:59,850
And similarly, you want to access the value.

130
00:08:59,860 --> 00:09:02,290
So value is basically a second.

131
00:09:05,500 --> 00:09:12,400
So ideato first is basically it every second is basically really simple.

132
00:09:13,360 --> 00:09:14,770
So now let us spend.

133
00:09:19,480 --> 00:09:24,280
Gizzle footprinting, the key idea first IP is basically.

134
00:09:25,400 --> 00:09:26,300
My editor.

135
00:09:39,200 --> 00:09:42,950
So ideato first and now let us also paint disvalue.

136
00:09:50,650 --> 00:09:53,620
So we're printing out the value, I will use it every second.

137
00:09:57,520 --> 00:10:02,590
Now, since this is an Redmap, so there is no ordering of elements, so there is no guarantee which

138
00:10:02,590 --> 00:10:05,080
element will come first and which element will come at last.

139
00:10:11,570 --> 00:10:19,070
So you can compare yourself, Bc5 is coming out first, then ABC for then simple ABC, then one, two

140
00:10:19,070 --> 00:10:19,450
and three.

141
00:10:20,180 --> 00:10:21,710
OK, so there is no ordering.

142
00:10:25,200 --> 00:10:32,130
So now, if instead of using a road map, you will lose map, so in map, this is basically starting.

143
00:10:33,200 --> 00:10:34,790
So let me copy this one.

144
00:10:37,740 --> 00:10:44,130
Now, instead of using an Redmap, if I will use simple map, so simple map means ordered map, so I

145
00:10:44,130 --> 00:10:45,210
have to change the name.

146
00:10:45,220 --> 00:10:46,410
So let's see my map to.

147
00:10:58,050 --> 00:11:06,360
And similarly, this is my map, do not begin my daughter end, and it's basically a local variable,

148
00:11:06,360 --> 00:11:08,970
so there's no need to change the name.

149
00:11:10,170 --> 00:11:16,820
Now, this map is basically ordered map, and that map basically means, if you will remember Bestinvest,

150
00:11:16,890 --> 00:11:18,420
if you will do the traversal.

151
00:11:18,750 --> 00:11:20,670
So in order to basically started.

152
00:11:21,830 --> 00:11:23,300
So basically, I got this map.

153
00:11:25,480 --> 00:11:28,360
This ordered map, it will start dakis.

154
00:11:29,730 --> 00:11:31,770
It will start our kids, so.

155
00:11:33,480 --> 00:11:35,160
This is how it will store their data.

156
00:11:37,150 --> 00:11:38,230
So guys are sorted.

157
00:11:38,920 --> 00:11:42,500
OK, so this map will sort the keys, so I will us inside the mine.

158
00:11:43,390 --> 00:11:44,360
I will drive us in.

159
00:11:44,530 --> 00:11:46,510
So I did manage according to Keys.

160
00:11:47,140 --> 00:11:49,900
OK, now let's see.

161
00:11:53,570 --> 00:11:56,840
OK, so this will be basically Maberly.

162
00:12:03,620 --> 00:12:04,430
So you can see.

163
00:12:07,840 --> 00:12:11,770
The values are sorted, so I am traversing this map, according to Kees.

164
00:12:15,050 --> 00:12:23,060
So what I want to say is so forget about values, so basically maps are sorted according to keys, so

165
00:12:23,060 --> 00:12:27,350
ABCs smaller than ABC1, then ABC two, ABC three ABC for an ABC.

166
00:12:27,620 --> 00:12:29,540
It is not sorted according to values.

167
00:12:30,680 --> 00:12:32,060
So let me demonstrate you.

168
00:12:33,890 --> 00:12:34,970
So, for example.

169
00:12:36,120 --> 00:12:37,950
If this value is, then.

170
00:12:39,710 --> 00:12:40,310
And.

171
00:12:42,270 --> 00:12:44,060
Let me push this one first.

172
00:13:04,220 --> 00:13:10,670
So now what I did here, first I am pushing ABC1, then I am pushing ABC, then ABC, to see what will

173
00:13:10,670 --> 00:13:11,020
happen.

174
00:13:11,540 --> 00:13:17,200
The map will Czartoryski will appear on the basis of this, not on the basis of values.

175
00:13:18,080 --> 00:13:19,280
So let's end our program.

176
00:13:23,530 --> 00:13:28,100
No doubt in first ABC, then ABC one and then ABC two.

177
00:13:28,360 --> 00:13:35,620
So basically the order to map its heart gave a little bit on the basis of KISS and not on the basis

178
00:13:35,620 --> 00:13:36,220
of values.

179
00:13:36,660 --> 00:13:38,650
OK, so Value 10 is coming out first.

180
00:13:40,400 --> 00:13:41,870
So this is a point to remember.

181
00:13:44,270 --> 00:13:56,420
So in map I have developed, so MAP will start on the basis of this map will start on basis of keys

182
00:13:56,420 --> 00:13:58,280
and not on basis of values.

183
00:13:59,490 --> 00:14:00,720
You should remember this one.

184
00:14:02,320 --> 00:14:11,110
Certain bases of keys and not on the basis of values, so similarly, just like in MAP, we also have

185
00:14:11,110 --> 00:14:12,670
items for vectors.

186
00:14:13,360 --> 00:14:14,160
So let's see.

187
00:14:14,770 --> 00:14:16,690
So let us create a vector first.

188
00:14:20,530 --> 00:14:21,550
But often tedious.

189
00:14:22,330 --> 00:14:24,700
And now let us push some values.

190
00:14:26,280 --> 00:14:27,900
So we don't push back, let's say one.

191
00:14:32,070 --> 00:14:33,690
Now, let us push some elements.

192
00:14:38,710 --> 00:14:43,250
So this is two, then three and four and then five.

193
00:14:44,050 --> 00:14:48,920
So basically Vector's has ordering of elements, so there is an order for elements.

194
00:14:48,920 --> 00:14:49,720
So it will traverse.

195
00:14:49,720 --> 00:14:52,030
Director, you will get.

196
00:14:53,430 --> 00:14:55,470
The data in which you inserted the data.

197
00:14:58,750 --> 00:15:00,050
So I pretty.

198
00:15:01,320 --> 00:15:02,190
So this is.

199
00:15:03,570 --> 00:15:05,790
The name of the victim is Vissel Vidauban.

200
00:15:10,440 --> 00:15:12,450
B is not equal to.

201
00:15:14,010 --> 00:15:19,080
So this is a so it is not going to be dark and.

202
00:15:20,890 --> 00:15:22,510
Similarly, 80 plus plus.

203
00:15:24,340 --> 00:15:25,450
So what is happening here?

204
00:15:25,900 --> 00:15:30,910
So for victims, it is basically pointing to an element.

205
00:15:32,590 --> 00:15:38,240
So if you want to access the element, you have to write star, be defense operator, then study it

206
00:15:38,240 --> 00:15:40,330
because it's containing Editress.

207
00:15:41,810 --> 00:15:45,940
So that's why you have to write 80, which accessed the element.

208
00:15:50,850 --> 00:15:51,810
Star idee.

209
00:15:57,540 --> 00:15:58,710
So in our last best.

210
00:16:01,270 --> 00:16:08,470
So see one, two, three, four, five days basically ordering of elements if we make the first willerton.

211
00:16:10,150 --> 00:16:11,360
Now let's test our program.

212
00:16:11,680 --> 00:16:16,540
So basically you will get the values in order, you inserted the values.

213
00:16:16,570 --> 00:16:18,100
OK, so first I'm getting Ben.

214
00:16:19,570 --> 00:16:26,440
OK, so we all know how that works now, apart from divorcing Ed, also have many of use cases.

215
00:16:27,220 --> 00:16:29,520
For example, you can use it later.

216
00:16:31,330 --> 00:16:34,270
For finding an element, whether an element exists or not.

217
00:16:34,840 --> 00:16:37,090
So basically what you can do.

218
00:16:39,260 --> 00:16:48,260
So I have a function find, so I have a function find this fine function will take as input and this

219
00:16:48,260 --> 00:16:50,180
function will return and I did.

220
00:16:51,330 --> 00:16:57,790
So this phone function returns and I do that now, if this idea is basically it goes to my daughter

221
00:16:57,790 --> 00:16:58,020
and.

222
00:17:00,100 --> 00:17:04,349
So that means the element does not exist in the map symbol.

223
00:17:05,109 --> 00:17:05,990
So let me show you.

224
00:17:06,910 --> 00:17:07,569
So if.

225
00:17:09,940 --> 00:17:12,160
My map got find function.

226
00:17:13,250 --> 00:17:16,819
So this fine function will take as input and let the Keys ABC.

227
00:17:18,770 --> 00:17:22,280
Equals equals my map dot and.

228
00:17:24,710 --> 00:17:29,930
So I told you, this fine function will determine our data and function is also returning annotated,

229
00:17:29,930 --> 00:17:31,850
so I'm comparing those to items.

230
00:17:32,450 --> 00:17:39,530
So if ABC is present in my map, then this condition will become false.

231
00:17:40,930 --> 00:17:42,040
So you can write.

232
00:17:45,370 --> 00:17:46,210
Not pleasant.

233
00:17:52,850 --> 00:17:54,290
As you can write, president.

234
00:18:17,800 --> 00:18:19,300
OK, so what I'm doing here is.

235
00:18:20,850 --> 00:18:27,630
So I have inbuilt function, find this fine function will return minute later, and if that data is

236
00:18:27,630 --> 00:18:33,240
basically equal to the and I did this and it means basically this and.

237
00:18:34,480 --> 00:18:37,160
Not the last element after the last element.

238
00:18:37,510 --> 00:18:40,420
So basically, if I'm not able to find A.B.C., what will happen?

239
00:18:40,990 --> 00:18:42,770
It will return me the end point.

240
00:18:42,970 --> 00:18:49,180
And if it is returning me and pointed at Miss ABCDs, not pleasant as it is present, I guess we'll

241
00:18:49,210 --> 00:18:50,660
suppose is present.

242
00:18:50,700 --> 00:18:51,490
So what will happen?

243
00:18:51,760 --> 00:18:54,820
So this fine function will administrator to ABC.

244
00:18:56,050 --> 00:18:56,590
So.

245
00:18:57,690 --> 00:18:58,810
Let's test our program.

246
00:18:59,130 --> 00:19:02,760
So ABC is currently presenting my daughter to present.

247
00:19:07,080 --> 00:19:08,490
So the output is present.

248
00:19:10,770 --> 00:19:12,090
Now, apart from finding.

249
00:19:13,180 --> 00:19:20,560
So what did can also do so let us create an editor, so let us copy this one on Redmap.

250
00:19:31,500 --> 00:19:32,970
Now, let us try to find out.

251
00:19:35,080 --> 00:19:36,490
Editor for ABC.

252
00:19:36,840 --> 00:19:40,140
So what I will do, I will call this function my dart, find ABC.

253
00:19:43,220 --> 00:19:50,600
So this find this is my map, so this fine function will return minute later to ABC.

254
00:19:51,930 --> 00:19:56,160
And then what can do, you can it is so you have a function.

255
00:19:56,190 --> 00:19:59,910
My God, it is now is function takes two things as input.

256
00:20:00,150 --> 00:20:03,250
Either you can give the key or you can also give it later.

257
00:20:03,870 --> 00:20:06,900
So I want to give Ed here 80.

258
00:20:08,300 --> 00:20:15,980
So what is happening here, my lord, find ABC so dysfunctional administrator to ABC and then I am I'm

259
00:20:15,980 --> 00:20:17,930
using it is a function to delete ABC.

260
00:20:18,170 --> 00:20:21,390
So if you will run this program this time, the output will be not present.

261
00:20:22,160 --> 00:20:23,200
Output will be not present.

262
00:20:23,210 --> 00:20:24,020
OK, so let's see.

263
00:20:27,370 --> 00:20:31,550
To the output is not pleasant because we deleted that entry.

264
00:20:35,460 --> 00:20:43,620
So now we have two functions, first function is fine function, the second function is command function

265
00:20:43,860 --> 00:20:46,230
to check whether a key is present or not.

266
00:20:46,530 --> 00:20:47,970
So we have two functions now.

267
00:20:48,630 --> 00:20:51,570
We can use fine function to check whether it gives present or not.

268
00:20:51,600 --> 00:20:57,000
Similarly, we can use current function to check whether it is present or not and similarly what it

269
00:20:57,000 --> 00:20:59,310
is function for function.

270
00:20:59,310 --> 00:21:05,850
Either you can pass the key, it will it is or it can also pass the editor to it is function and it

271
00:21:05,850 --> 00:21:07,350
will delete that entry.

272
00:21:07,710 --> 00:21:08,640
Now one more thing.

273
00:21:09,150 --> 00:21:10,860
What you can do, you can use it is function.

274
00:21:10,870 --> 00:21:14,870
You can give the starting data and you can also give the ending iterator.

275
00:21:15,750 --> 00:21:16,610
So I want to delete.

276
00:21:16,650 --> 00:21:19,290
So this is the starting data and this is the ending data.

277
00:21:19,320 --> 00:21:21,260
So what will happen if you will write this code?

278
00:21:21,870 --> 00:21:23,670
So what entries will be deleted?

279
00:21:24,240 --> 00:21:25,610
So it will delete it.

280
00:21:25,950 --> 00:21:31,070
It will delete it plus one, it will delete it plus two and it will delete 80 plus three.

281
00:21:31,410 --> 00:21:34,180
So 80 plus for this will not be deleted.

282
00:21:34,230 --> 00:21:35,670
This is basically excluded.

283
00:21:37,630 --> 00:21:43,200
OK, so if you write something like this, it is you will give the starting point that my mapped out

284
00:21:43,240 --> 00:21:48,690
begin and if you will give the ending point, which is my map, not end.

285
00:21:50,530 --> 00:21:53,830
So what will happen if you write like this?

286
00:21:53,830 --> 00:21:56,600
It is my map, not begin, comma, my end.

287
00:21:56,640 --> 00:21:57,760
So this is the starting out.

288
00:21:58,060 --> 00:21:59,100
This is the ending I did.

289
00:21:59,110 --> 00:21:59,940
Then what will happen?

290
00:22:00,310 --> 00:22:02,800
Your map will become empty.

291
00:22:03,490 --> 00:22:04,870
Your map will become empty.

292
00:22:05,290 --> 00:22:07,870
So let's test this one, OK.

293
00:22:09,670 --> 00:22:10,450
So basically.

294
00:22:14,080 --> 00:22:21,280
So basically using this thing, using this thing does not make sense for an Redmap, because for an

295
00:22:21,280 --> 00:22:25,590
Redmap, we don't know which one is the next entry because it is not ordering.

296
00:22:25,870 --> 00:22:30,340
So this thing only makes sense for basically ordering other classes.

297
00:22:30,340 --> 00:22:35,650
For example, map, for example, vectors, because there is ordering of elements.

298
00:22:36,730 --> 00:22:41,800
OK, so this thing does not make any sense for an oral element, because I don't know which element

299
00:22:41,800 --> 00:22:44,140
is the next element, how the elements are stored.

300
00:22:45,130 --> 00:22:46,850
So now let's use it is function.

301
00:22:47,470 --> 00:22:49,710
So now let us it is the complete map.

302
00:22:49,720 --> 00:22:51,280
Let's make our map and producer.

303
00:22:51,310 --> 00:22:53,800
What I will do, my daughter is.

304
00:22:53,980 --> 00:22:55,330
So let's come out.

305
00:22:58,580 --> 00:23:04,040
I can give two pointers, so to iterators, so my Mabahith bigon.

306
00:23:05,100 --> 00:23:09,840
Start leading from beginning Twitter and go until my McBratney.

307
00:23:11,710 --> 00:23:12,560
So what will happen?

308
00:23:12,940 --> 00:23:20,110
My map will become empty, so if you will try to find out, ABC now will be not present and this will

309
00:23:20,110 --> 00:23:21,010
not print anything.

310
00:23:22,040 --> 00:23:24,280
The output will be empty map.

311
00:23:25,600 --> 00:23:29,460
So I printing my map that begins with our will be pretty map.

312
00:23:29,710 --> 00:23:32,860
OK, so it will not be indenting because our map is empty.

313
00:23:33,910 --> 00:23:38,320
You can also print my map glasses so you can print.

314
00:23:39,960 --> 00:23:42,410
The size also, so my bra size will be zero.

315
00:23:45,620 --> 00:23:51,950
So I am deleting I'm making my mind up empty so the size will be zero and this court will not print

316
00:23:51,950 --> 00:23:54,180
anything and the output will be not present.

317
00:23:54,250 --> 00:23:55,100
OK, let's see.

318
00:24:01,980 --> 00:24:03,010
So not pleasant.

319
00:24:03,880 --> 00:24:09,810
Then this line of code is not printing anything, then my blog site is zero, so that's how you can

320
00:24:09,810 --> 00:24:10,830
use it function.

321
00:24:11,820 --> 00:24:16,710
So all this function to find function begin to function and function.

322
00:24:17,070 --> 00:24:18,010
It is function.

323
00:24:18,360 --> 00:24:24,870
So all these functions are also present in the upper classes and inside glass and said, OK, so all

324
00:24:24,870 --> 00:24:25,690
these functions are better.

325
00:24:25,710 --> 00:24:28,080
And they're also now one more thing.

326
00:24:28,260 --> 00:24:34,830
So instead of using this vector and I can use I have a keyword auto.

327
00:24:35,310 --> 00:24:39,670
So I told you what is this?

328
00:24:39,690 --> 00:24:41,620
So this is actually a data type.

329
00:24:42,480 --> 00:24:44,010
Now I have a keyword auto.

330
00:24:44,730 --> 00:24:46,490
So what auto keyword will do?

331
00:24:46,500 --> 00:24:49,250
So it will take that type automatically.

332
00:24:49,890 --> 00:24:51,850
It will define the type automatically.

333
00:24:51,870 --> 00:24:56,700
So instead of writing this and then what can I do, I can write 80.

334
00:24:58,050 --> 00:25:00,990
So Auto will automatically make that type, this one.

335
00:25:01,470 --> 00:25:05,220
So what you are writing or writing or do it is my map dot begin.

336
00:25:06,550 --> 00:25:13,690
And this may not begin will return annotator of this type and auto will judge this one or two will sense

337
00:25:13,690 --> 00:25:15,760
this and it will automatically take.

338
00:25:17,630 --> 00:25:18,530
This type.

339
00:25:22,710 --> 00:25:23,640
So instead of.

340
00:25:25,330 --> 00:25:28,270
Using this word, they can do it, you can simply write auto.

341
00:25:29,310 --> 00:25:30,340
So orders is given.

342
00:25:30,490 --> 00:25:31,620
OK, so this will work.

343
00:25:31,950 --> 00:25:32,760
So now let's see.

344
00:25:37,730 --> 00:25:39,200
OK, so I will call this --.

345
00:25:40,750 --> 00:25:47,110
Similarly, you can write auto elsewhere also, for example, instead of vector indictor with can do.

346
00:25:48,090 --> 00:25:49,710
You can simply write auto.

347
00:25:58,310 --> 00:26:02,750
OK, our code is working similarly, you can also do something like this.

348
00:26:06,090 --> 00:26:13,010
Instead of writing and a five words candle called.

349
00:26:16,530 --> 00:26:18,390
What you can do, you can write or towhead.

350
00:26:23,710 --> 00:26:29,800
See the value of these five, so that is the working of auto similarly where they can do.

351
00:26:31,360 --> 00:26:39,760
You can also write like this, although B is basically, let's say A, B, C, D, you can do anything.

352
00:26:39,790 --> 00:26:40,840
OK, let me show you.

353
00:26:44,660 --> 00:26:46,040
So instead of writing.

354
00:26:48,060 --> 00:26:53,400
So instead of writing String See is ABC.

355
00:26:55,340 --> 00:26:58,610
What you can do, you can write auto here, auto.

356
00:26:59,530 --> 00:27:02,820
See ABC and then you can print the value of AC.

357
00:27:07,990 --> 00:27:15,640
OK, ABC, so you can use audio instead of writing this big Syntex, you can write, although, OK,

358
00:27:16,150 --> 00:27:16,780
short one.

359
00:27:19,360 --> 00:27:23,400
So if you have any doubt in this video, you can ask me, OK, I was here in the next one by.

