sPad, VI like sample text editor v1.0

By Sidharth Patnaik -
sPad is a Btech mini project. In this program you have the access to create view and save files. This is completely based on Command Line Interface. The zip contains a folder sPad and a powerpoint pptx file which will explain all its mechanish. Inside the sPad folder there are 5 header files init,open, pre,save and start apart form these there is a .cpp file which is the Driver program. you need to compile that file which will genenrate a executable file.

Understanding pre.h...
This file includes the basic header files namely iostream,fstream and cstring. This file initializes 2 String type variables and a character array name. You can think as using one of the string for secondary memory which is permanent and another as a primary memory which is temporary.

Understanding init.h...
This file includes two functions namely inp() and hlp(), the inp() can be thought as if converting the primary memory contents to the secondary memory contents. In the hlp(), initially there is no content. You can add them as per your required.

Understanding save.h...
This file includes two functions namely sve1() and sve2(), the sve1() is called when a new file is created, i.e at the time of saving you need to give the file name. sve2() on the otherhand is called when you have opened a file and then after editing you are trying to save it .

Understanding open.h...
This file has an open() which asks the name of the saved file and then it opens the file which can be furthered edited and saved.

Understanding start.h...
This file has a start() which is responsible for all designing elements. This functions also looks after the inputs and efficiently controls all the modules of the program. It also facilitates in displaying the status of the program.

Screenshots[Demo]



This is in beta mode, so i expect bugs. Feel free to report it. You can use this project with or without attribution. Download the complete project here.

Comments

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t...
Read more

Bit Stuffing Code Implementation in Java

By -
Image
This is an implementation of the Bit Stuffing popularly used in data communication, also known as one of the concepts of Framing data bits. To know more please  click here. Sample Output: This is a sample output with data binary data entered as 11001111110. Program Code: import java.util.*; public class BitStuffing { public static void main(String[] args) { System.out.print("Enter the Binary message: "); Scanner sn=new Scanner(System.in); String data = sn.nextLine(); String res = new String(); String out=new String(); int counter = 0; for(int i=0;i<data.length();i++) { if (data.charAt(i)!='1' && data.charAt(i)!='0') { System.out.println("Enter only Binary values!!!"); return; } ...
Read more

Hackerrank Modified Kaprekar Numbers Solution

By Sidharth Patnaik -
Image
This is the solution to the Modified Kaprekar Numbers found in the implementation section of the algorithm domain in Hackerrank. A modified Kaprekar number is a positive whole number n with d digits, such that when we split its square into two pieces - a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n) . Screenshot The Code def sendKap(x,s): y=x*x y=str(y) s1=y[:len(y)/2:] s2=y[len(y)/2::] s3=int(s1)+int(s2) if(s3==x): s.append(str(x)) st=input() en=input() s=[] for i in range(st,en+1): if(i>9): sendKap(i,s) elif(i==1): s.append(str(i)) elif(i==9): s.append(str(i)) if(len(s)==0): print 'INVALID RANGE' else: print ' '.join(s) Got any problems feel free to comment them here !
Read more