Starting our Git repository

-



Note 
Check your current working directory with a pwd (Mac OS X/Linux) or cd (Windows) command before initializing the repository. 


On Command Line:
$ git init
Initialized empty Git repository in ~/your-repo/.git/
$ git config --global user.name "Your Name"
$ git config --global user.email you@example.com
Create a  .gitignore file
$ git status
$ git add --all .
$ git commit -m "Some Useful Message."
$ git remote add origin https://github.com/<your-github-username>/<repo-name>.git
$ git push -u origin master

Comments

Post a Comment

Popular posts from this blog

HOW TO USE DOCKER

-
To start  with Dockers: Installation of Docker   On linux based system: ---------------------- Note:   we are using  Redhat 7.1 / centos 7.1 A)  installing  docker and its dependencies  ================================ [root@localhost ~]# yum  install  docker  docker-selinux  -y  Starting and enabling service [root@localhost ~]# systemctl  restart   docker [root@localhost ~]# systemctl  enable   docker [root@localhost ~]# systemctl  status   docker docker.service - Docker Application Container Engine    Loaded: loaded (/usr/lib/systemd/system/docker.service; disabled)    Active: active (running) since Thu 2017-10-07 22:46:00 IST; 5s ago      Docs: http://docs.docker.com  Main PID: 11000 (docker)    CGroup: /system.slice/docker.service            └─11000 /usr/bin/docker daemon --se...
Read more

Flutter Native Application Development

-
DAY 1 Language: Dart Dart has a great declarative approach Bespoke-Ability to modify Android - Java/Kotlin Windows- C# iOS- Objective C/Swift Cross-Platform Native App Microsoft-  Xamarin Facebook- React Native Google - Flutter Setup and Start https://flutter.dev/docs/get-started/codelab DAY 2
Read more

SINGLE LOOP SORTING TECHNIQUE

-
#include <bits/stdc++.h> using namespace std; int main() {     int i,n,num,temp,til;     vector<int> a;     cin>>n;     for(i=0;i<n;i++)     {         cin>>num;         a.push_back(num);     }     til=n;     for(i=0;i<til-1;i++)     {         if(a[i]>a[i+1])         {             temp=a[i];             a[i]=a[i+1];             a[i+1]=temp;         }         if(i==til-2)         {             for(i=0;i<n;i++) ...
Read more