Skip to main content

Install Atom Text Editor in Ubuntu 16.04

Atom text editor feature:

  • Tweak its UI with CSS and add new features with HTML or Javascript
  • Node.js integration
  • Cross-platform support: Windows, Linux, and OS X.
  • A built-in package manager
  • Smart autocompletion
  • Split Atom interface into multiple panes
  • File system browser
  • Find and replace
  • Support themes

How to install Atom in Ubuntu via PPA:

Webupd8 Team is maintaining an unofficial PPA with most recent Atom packages for all current Ubuntu releases, and derivatives. While official Linux binary is 64-bit only, the PPA supports both 32-bit and 64-bit.
1. Add PPA
Open terminal (Ctrl+Alt+T) and run the command:
sudo add-apt-repository ppa:webupd8team/atom
Type in password when it prompts and hit Enter.
2. Update and install Atom editor:
Update system package index and install the text editor via command:
sudo apt update; sudo apt install atom
Once Atom is installed and a new release is out in future, you can simply upgrade the editor by running regular system updates via Software Updater utility.
3. (Optional) To remove Atom text editor
To remove the software, use Synaptic Package Manager or just run apt command with removeflag:
sudo apt remove --purge atom
And the PPA can be removed via Software & Updates utility under Other Software tabs.

Labels:

Comments

Post a Comment

Popular posts from this blog

Use Case Diagram for Online Book Store

Post a Comment
Read more

Online Movie Ticket Booking Sequence Diagram

Post a Comment
Read more

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};
Post a Comment
Read more