 All right Let's wrap up this minute. Oh, yeah, we have a mini quiz for you guys So Let's start with the first quiz Sorry, sorry Later We have a price so we are what's the first point answer you get over sticker So Okay, can you see the questions Is this code correct, that's a question Okay It's just a simple and Jason coding and also the single string Oh Okay, let me run it and I say You mean the program is correct. Well, I'm not sure what the program is supposed to do In casting No, it's a command function so technically you can you don't need to return anything Yeah, I think No Alright, so maybe you an idea for the back Alright So Okay, let me run it By definitions if you have any code in Jason's If the body within is a number numerical format, otherwise always convert to 60 or something I know Yeah, that's correct, yeah, so, but, yeah, it's one, one of the solution is to, if you find your struct when you include in JSON, I mean, when you run the JSON machine, it will match the type of the JSON struct, yeah, so, yeah, yeah, it's the first piece, okay, but I think I need to get, I think we'll go back our answer, the blue shape float, blue shape float, and you know the struct thing. That's the problem with the in-cast thing. That's not correct, yeah, that's a stupid thing. Okay, might be you two guys share the price. Then you change the cost to float 64 and see what it's like. Yeah, sure. So if you want to make an inventory, then maybe they don't have it. If you don't type checking with the process before, you convert it later into your inventory. You should work with us. There's no type. You take the time. Let's see. I mean, keep the line. Drop the type of session. Remove the flow. Dot 64 is. You need to first think. This should work. We need time. This is the first bit, so we still have chance. Now we come to the second one. What does it print? This program will print. So you can see how it slides from 100 to 700. Is there a plus plus? I think there's no plus plus. Is it a plus plus? I need a plus plus. Views like C. It does not have plus plus. Any other answer? 201. 201? No, it's not a correct answer. 202. Why do you think it's the second time if you print number 2? Because it's printed. It's 10 times 202. Okay, so I'm going to say 220. No, it's not correct. It's almost there, but it's not correct. This is... 220. 220. 220. 220. Sorry, 240 seconds. 220. No, it's already... 220. 2201. No, it's not correct. 201. No, it's not correct. Okay, maybe it's too ridiculous. And let's run it, and I think... I'll ask whoever can expand it. You get the prize. Actually, you can't see it. 211. 211 in the start. If you keep saying 211 in the start, please say no. Oh, okay, you can say that? Can you explain why? After the pen array, right? The value is a pointer to the original array, right? After a pen, x is really pointing to another array. So changing x value doesn't affect the original pointer. It keeps increasing the value. Yeah, actually the... My answer is... Because without running this program, you cannot present anything. Whatever you think it is. All right. You have a smile on your face. Oh, you don't have a smile on your face. Nothing on your face. You're good. You're fine. Very good. Thank you. My guess is 211 first. No, no, no. 211 is pretty cool. Okay, 211. I thought you meant 211 and he said no. So I was like, why did you cook that? Okay, so the reason here is that every time you bend an element to a slice, the capacity of the slice will increase. But not always. Do you think there is a question at the end? The capacity will really find the maximum. It may increase or stay the same. But I mean the address will change. So that's why in the first look, it decides the variable, the address of the element. The second element is still the same. Yes, so if you have an element and it's just a slice to go to the last element, then you have to take 212. We can give them the regular space. The tricky thing is the second part doesn't make any change to the van. The variable van doesn't change. So you have to go back to the old address. When you append a new element, the address value will change. So the van is not binding to the... The van always copies. The other thing is not output the x1 if output the van. It brings the van. Yes, your question is append always copies. Like that, I don't know. No, because it tends the capacity of the array. No, I think the capacity is only another... But here's the address. I mean, when you append, it copies the whole slice to a new location. So it really gathers up to the sumptom sometimes. You're right? Or it might clean up everything else if you want to be at that end. I don't know. Do you maybe, you know, reference to a lower array so that you might be smart enough not to do another slice? No. But then the people change the maker for another slice. So I'm not sure if... So let's say you have two slices from the same array. It doesn't copy you. But if I change one of the slices, they will change the other array. But I take a different way of that. So after the x, first x, after the definition, slice it to another... Oh, we find it. So create another slice by slicing x. On 918. You like 18, right? Yeah. Actually, the array and slice is two different things. You're talking about the array. This is the slice. This is the slice of a bank by a race. No, but the internal digit is... So y is a slice of x from zero to three. Can I try that? You mean when it's being that x, zero? No, no, no, no. Can you sign y? I don't remember the actual... Wrong line. Am I on the wrong line? Yeah. What is it? Are you looking where it was? Right syntax? Yes. And I'm referring to y. Yeah, I get it. Y is equal to y and... So we have a new location. 200. And now we have to increase y. This time x, y. So we can call... y, y. The range of y below... I guess. Yeah, so all of that... What's the action of y? That will work as a different range. Change range x to range y. Both? Remove it up. No, remove x. Check x to y. Okay. It's already... You're losing it's life. That's all. That's all. That's all. Keep, keep, keep it. And front. Okay. Whatever. Now it's changing its range. The last two are you talking about. That was just a copy paste error. So when you do a y, the value is still pointing to the location of x. So if x changes right, then we change the value of value. But for y, then it's a new one. I mean, it's a separate... another location. No, this is the same location. Same location. Same location. That's why the value is too old. Yeah. Because of the annoying capacity. Now, what do you represent? Now, if you print x, everything in x at this point, you should see something. No, this will be the same. You should see a random 800. But we put 400 one. Sorry. You should see an 800 one in there. Okay, let me try to... Yeah, that's good. Leave that silly extra value. The extra print line on line 29, do I buy or take? 29. Remove 29. Do we try 29? 29? Just kill that, yeah. That's good. Oh, 30 in change. 30 in change. How much? Most? Not very expensive, I mean. So, I mean, when y is the size of y, when you increase y, the value in the slides is the X, what's the difference? So, you have other ideas? No. It's commented. Oh, you can comment. Can you... Uncomment the way that you do. Uncomment that's why I got to choose. Okay. That's important. Run. There are shows that we don't really understand sizes in areas. Sizes? Oh, so it depends to the bottom, the end of the underlying capacity. Wait. That's how I was able to choose. I got it. That's fine. I just got to choose. There was 29 in there. Okay, I will post a quiz later. I mean, you guys can run. I read your outline. Okay, maybe this one is a 2D paper quiz. Let's try to make it easier. Is there another trick? Okay, so it takes the correct way. I mean, in the y, how do you fix this? You don't actually have a recover. There is 6. Oh, there you go. What was the cover? It's a different one. The more different, it's a very easy answer. I already think you have a set of easy questions. What is the function of the program? No, I would say nothing. Well, the difference is something you want to run it. What's the end of the function? So, what do you do with the function? You should just... It's a keyword. Keyword in low-level. It's like when you put any function after defer. You run after you in the set function scope. So you have to function as n. Yeah, so the function is n. You run after any. That's a question. Yeah. I do not think that would work. You probably... You know, at the moment, how... You probably should put a form and rely into the defer function instead of the query and the fact. It's also the... The whole question is... Do you really want to run after a defer function? No. Do you want to run after a defer function? It depends. It depends on the... It depends on the... So we will run after it? No, it doesn't. It's good. So you run after a defer function? It depends on the... Stop. So you move the format of the prongline into the function in terms of defer function. Yeah, I think... It just removes the one showing... It's not trying to recover it. It's probably the... Sorry, removing... Remove the form for the prongline You have to do the defer function. The recover has to be in sync with the panic. Yes, yes. So this way it will actually... Recover the panic. Oh, yeah. You're right. Can I second this? Please don't. Too much. Too much. No, but why does this form work? It doesn't work. Because the recover has to place in the same scope with panic. Oh. Because as far as recover we understand that you want to recover in this function. It's needed for stack. For stack. So this is how you... I mean, if you recover all the panics, it's going to end the functions. It's never used panic at all. Okay, let's go to the last question. Are you guys ready? Yeah. Can you see everything? No. So I think the answer to the first problem is... Okay, this program we run... Is it correct? Does it throw an error? If there's an error, then how to fix it? Oh, okay. The purpose of this program is to print one, two, three. You have to use a function V as the parameter and just call V operating the function. Yeah, but I mean... I want to use it. I mean... Just why not? You know, no local things. I think it's like... I find the P lower than P to advocate. In read. No, no, no. The print is a... It's a private method. It's a local method. It's a private method. Your field stroke is just as... A pointer. So, add another one. You need a star in the field. Oh, yeah. Let's try it. I know this because I do it all the time. Oh, okay. Thanks, Jen. It's one price for you. But I mean, another natural trend is you can assign... I wonder if you can take me just to the end of the star in the print. Yeah, that's what I was going to say. So, you can do this. Oh, star. Star? I mean... Basically, just use the star in the function print. Yeah, there's another certain set. So, when I deal with local things, I have to be very careful. Especially that... ... Alright, I think... I hope you guys like my quiz. Hopefully next time I have a better quiz. Because I know this. Actually, how many of you have been... ...first time with the GoLambida? I'm pretty sure. So... Yeah, I think it's useful. Very useful to have a quiz. So that you can learn the GoLambida program because it's faster. Yeah. You can write the book at home. Actually, I like this one as well. Alright, thank you guys. I hope you have any talk or presentations you want to show up next time. Please contact me. We're going to arrange... ...every month or every two months. Thanks. Thank you. So, I would like... ...two speakers, Chan and Hapis. First of all, Valentin from HBISG. So, don't forget... ... ... ... Thank you. Thank you.