1
00:00:00,060 --> 00:00:04,650
So now what we're going to do is we'll try to understand how we receive the data, right, so we'll

2
00:00:04,650 --> 00:00:06,750
be adding some randomly donor console.

3
00:00:07,110 --> 00:00:08,430
And that will try to resume.

4
00:00:08,480 --> 00:00:08,660
Right.

5
00:00:08,670 --> 00:00:13,460
So first, let's see, just declared one before that will be used to sue the leader.

6
00:00:14,020 --> 00:00:14,270
Right.

7
00:00:14,280 --> 00:00:21,600
So we had you week because you'll be receiving the retail of by the named are both for data received,

8
00:00:21,660 --> 00:00:24,630
OK, and it will have a size of 11, right?

9
00:00:24,630 --> 00:00:29,790
So this allows the store and 11 bytes of data into this right.

10
00:00:29,800 --> 00:00:35,580
So we plan to send only 11 byte from and you what that will be storing over here, right?

11
00:00:35,580 --> 00:00:43,320
So if you explore the API that gives that, we have to receive the data, so we have it quite like received,

12
00:00:43,330 --> 00:00:43,620
right?

13
00:00:43,620 --> 00:00:44,240
So this.

14
00:00:45,570 --> 00:00:50,980
Again, operating to more pool mode or an instrument, it required an instance pointer.

15
00:00:51,000 --> 00:00:56,130
OK, then you wait the turbo four pointer and the number of bytes that we.

16
00:00:57,400 --> 00:00:58,280
Plan to receive.

17
00:00:58,360 --> 00:00:58,630
Right.

18
00:00:58,930 --> 00:01:01,060
And this basically returns the number of bytes.

19
00:01:01,510 --> 00:01:01,740
Right.

20
00:01:01,780 --> 00:01:06,130
So we go ahead and we try to utilize this function, right?

21
00:01:06,130 --> 00:01:07,300
So we call this function.

22
00:01:07,900 --> 00:01:08,620
We're here.

23
00:01:10,240 --> 00:01:10,600
OK.

24
00:01:10,870 --> 00:01:17,590
And then for this document is the just structure, which is you what the second argument is the pointer

25
00:01:17,590 --> 00:01:18,640
to are Rita buffer.

26
00:01:18,970 --> 00:01:20,650
So again, we will be utilizing.

27
00:01:21,970 --> 00:01:28,570
The dress so far date, all right, so we just need to specify the element of ready and that dress of

28
00:01:28,570 --> 00:01:31,630
that will store as the pointed right.

29
00:01:31,900 --> 00:01:35,080
And we plan to receive 11 bites of lead right now.

30
00:01:35,080 --> 00:01:39,700
What we're going to do is no, since this returns, the number of light, that issue will just be very

31
00:01:39,700 --> 00:01:40,690
plain whether.

32
00:01:41,650 --> 00:01:46,140
The literacy, OK, so we are saying this value to lyricism count.

33
00:01:46,870 --> 00:01:51,040
OK, and with each new bite we receive will be implementing the value of concrete.

34
00:01:51,040 --> 00:01:56,860
So whatever previous value that we have for account will be implementing with the number of bytes this

35
00:01:57,010 --> 00:01:57,300
right.

36
00:01:57,550 --> 00:02:06,040
So while count is not equal to 11, right, in that case, we'll just be waiting to receive all the

37
00:02:06,040 --> 00:02:08,350
data and as soon as we.

38
00:02:09,750 --> 00:02:15,570
As soon as our count becomes equal to one, that basically means we will receive all the details, right

39
00:02:15,900 --> 00:02:16,560
and here.

40
00:02:16,590 --> 00:02:18,540
Now remember, we want to.

41
00:02:19,990 --> 00:02:25,720
Stool each new bite into the element of far right, so this should not be zero.

42
00:02:26,050 --> 00:02:30,730
It should be equal to come with each new bite we received.

43
00:02:31,030 --> 00:02:33,100
The account value will be incrementing.

44
00:02:33,190 --> 00:02:39,290
OK, and that will basically increment address of the element that we have in another race.

45
00:02:39,310 --> 00:02:42,070
So we have 11 elements which are operated in an array.

46
00:02:42,310 --> 00:02:46,930
So as we increase the value of account, the number of elements, the.

47
00:02:48,280 --> 00:02:53,830
So here's what we're going to do is we have a count variable, which will be implemented as we receive

48
00:02:53,830 --> 00:02:54,430
a new byte.

49
00:02:54,850 --> 00:03:01,060
And since we specified this to be an address of an element where we want this to the leader who gets

50
00:03:01,090 --> 00:03:06,870
with each new value of account, we have a unique element of energy where we will be storing the lead,

51
00:03:07,000 --> 00:03:07,320
right?

52
00:03:08,110 --> 00:03:15,040
So after the transmission is complete, what we gonna do is we'll just be mentioning, we're here.

53
00:03:15,280 --> 00:03:17,200
OK, the transmission.

54
00:03:18,720 --> 00:03:19,890
Complete, right?

55
00:03:20,370 --> 00:03:24,190
And then we will be waiting for entire data to.

56
00:03:24,750 --> 00:03:27,070
Then will again be resetting our people.

57
00:03:27,330 --> 00:03:27,650
Right?

58
00:03:28,140 --> 00:03:33,870
Then we will be sending this all data that we have in a need to receive buffer to the concentrate.

59
00:03:33,870 --> 00:03:36,750
So we do that is we again call the death.

60
00:03:37,900 --> 00:03:38,260
OK.

61
00:03:38,650 --> 00:03:45,790
And here we will be utilizing the format specified to be person zero C and the data that we are going

62
00:03:45,790 --> 00:03:48,910
to send is present inside the literacy rate.

63
00:03:49,330 --> 00:03:51,940
With each new iteration, we want the same reader.

64
00:03:51,970 --> 00:03:56,530
So let me just use four called OK equals to zero.

65
00:03:56,890 --> 00:04:02,650
Now what we are doing here is we are using account because as soon as we come out of this, do I look

66
00:04:02,650 --> 00:04:05,350
around will again be reusable, right?

67
00:04:05,380 --> 00:04:12,670
So will again be making count of equals to zero and count is less than equal to 11 in that case will

68
00:04:12,670 --> 00:04:13,780
just be incrementing.

69
00:04:13,780 --> 00:04:14,620
I'll come right.

70
00:04:15,800 --> 00:04:18,530
And in that case, with each new value of a.

71
00:04:19,770 --> 00:04:23,160
Well, will be sending the data on two weapons, so this.

72
00:04:24,260 --> 00:04:25,920
Makes it today to what we are doing.

73
00:04:26,570 --> 00:04:31,190
First, we declared the only way we could store 11 bytes of data.

74
00:04:31,430 --> 00:04:34,220
OK, we are calling and you are initialization function.

75
00:04:34,490 --> 00:04:37,970
Then we are waiting for all the 11 bytes to transmit.

76
00:04:38,070 --> 00:04:42,350
OK, so this function returns the number of byte that is actually sent, right?

77
00:04:42,350 --> 00:04:49,520
So with each new byte we sent will get our count value will be implemented and simultaneously the new

78
00:04:49,520 --> 00:04:51,970
element will be chosen from memory.

79
00:04:52,050 --> 00:04:53,720
We will be storing added right.

80
00:04:53,900 --> 00:04:56,900
So after our transmission completes, OK, we are just.

81
00:04:57,940 --> 00:04:58,840
Here it should be.

82
00:04:59,080 --> 00:05:06,160
Reception company, great to be able to receive all the 11 bytes of data, then to send this string

83
00:05:06,160 --> 00:05:06,610
again.

84
00:05:06,670 --> 00:05:09,730
We are waiting for an entire string to be sent.

85
00:05:09,760 --> 00:05:12,100
When you are, then we are gearing up.

86
00:05:13,180 --> 00:05:15,760
OK, and then we are calling the four look.

87
00:05:15,910 --> 00:05:22,050
OK, where we are waiting for an 11 version because we have an 11 bytes of data presenting our received

88
00:05:22,060 --> 00:05:22,450
buffer.

89
00:05:22,450 --> 00:05:27,180
And with each new iteration, OK, you could clearly see we are sending data to come great.

90
00:05:27,190 --> 00:05:33,790
So with each new value for loop, our count will be changing and that will be sending the new D down

91
00:05:33,790 --> 00:05:35,370
to the console.

92
00:05:35,710 --> 00:05:37,930
So with this, let it just build up our code.

93
00:05:38,960 --> 00:05:43,970
OK, by betting control, and once it is successful, we will have our yearly fight.

94
00:05:44,240 --> 00:05:45,350
OK, so we go ahead.

95
00:05:45,440 --> 00:05:50,470
Select an application project debug as launch one, right?

96
00:05:51,350 --> 00:05:54,740
So this will be automatically relaunching the debug session.

97
00:05:55,130 --> 00:05:57,990
OK, and then we have our right system, right?

98
00:05:58,010 --> 00:06:01,760
So what we're going to do is we'll just be clicking on this resume button.

99
00:06:01,940 --> 00:06:06,270
OK, so you want and it will be successful and you are self this just this.

100
00:06:06,890 --> 00:06:13,670
I goal will be simply waiting for a user to add it, either because we added it while look and we will

101
00:06:13,670 --> 00:06:17,180
be coming out of I look only when we receive a by great.

102
00:06:17,480 --> 00:06:19,760
So here we will be adding an 11 byte.

103
00:06:19,760 --> 00:06:21,530
So hello, I'm space.

104
00:06:23,390 --> 00:06:27,580
So this represent the 11 byte of data that will just be hitting on enter.

105
00:06:27,910 --> 00:06:28,280
OK?

106
00:06:28,330 --> 00:06:34,960
As you see, as we complete receiving 11 might, so we first get reception, got complete message.

107
00:06:36,340 --> 00:06:44,000
And then be able to sing again, and Hallelujah, which is the leader that we have in received, right?

108
00:06:44,050 --> 00:06:50,180
So this is how you then received EPA that we have it, then you would like to receive the regional what

109
00:06:50,180 --> 00:06:51,270
are we going to do next?

110
00:06:51,270 --> 00:06:54,340
You will be utilizing the multiple instance of a new work.

111
00:06:54,520 --> 00:06:59,980
So that helps us understand how we handle the multiple instances of and you are.
