Skip to main content

Coding Period week 1 GSOC 2021 LibreHealth

Coding Period week 1 GSOC 2021 LibreHealth-

Hey, Reader's we are in 1st week of the coding period.

The coding period started on 8th June. I started working with the Cost of care flutter Application it was really exciting.





What progress have you made this week-

In the first week of the coding period, I have done the following thing with the cost of care flutter application.

1-upgraded project to futter latest version 2.2.1.

2- dart migrate to null safety. 

3-Updated all dependencies that are used in the project to their latest version.

4-Replaced Deprecated Widget.

5-some of the methods were deprecated I updated them too. 

    

My plan for next week-

1-I will implement a bookmark feature to the chargemaster.
2-UI modification of download CDM screen.

During 1st week I sent one  Merge request to the development Branch but I was struggling with pipeline failure. Then I asked my mentors they helped me to fix the pipeline. The pipeline was failing because some of the bloc test methods and Dio library methods were deprecated. 

This is all about 1st week of the coding period.I really enjoyed it.

See you next week.




Comments

  1. This 카지노 사이트 Game is ruled by these official guidelines and the Sponsor Terms of Service Agreement situated right here (collectively, the “Rules”). The Game is topic to all U.S. federal, state and local legal guidelines and regulations and is void where prohibited by law or any gaming regulatory company. You cannot participate in the Game under any circumstances if you're not a minimum of|no less than} twenty-one years of age.

    ReplyDelete

Post a Comment

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

 Concert Tickets Cses Problem set solution- Porblem statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  concert tickets available, each with a certain price. Then,  m m  customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers  n n  and  m m : the number of tickets and the number of customers. The next line contains  n n  integers  h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains  m m  integers  t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print  − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅