Skip to main content

How to build a project in eclipse with MAVEN build tool?

How to build a project in eclipse with MAVEN build tool?
Step 1:-
Install maven and set the path in my computer. Once path is set for java and maven you will get a screen
With version installed in your system.



Step 2:-
Write a command mvn archetype:generate to build a project of your choice.This will give you a option to select a project from list.



Step 3:- As soon as this operation will complete maven give you choice to choose project.Search for maven-archetype-webapp this will build a web project with basic structure.


Step4:- Follow the below procedure to give name , version ,package ,artifact and group id of your choice.



Step 5:- You will get screen with build success.Congrats your project is build in directory.

Step 6: Go in the directory to check for the folders automatically created by maven. You will get pom file and src folder and the package folder.



Step:-7  Move to the directry having pom.xml and run mvn eclipse:eclipse command to convert the project into eclipse.





You will get a screen of successful completion of project.

Step 9:- Open eclipse and import the same project into eclipse.

Step 10:- The following structure you will get after import will be successful.
Change you directory in command prompt from normal directory and go to the same project in eclipse workspace.


Now right click on project go to configure and select convert to maven.


 You will get an error don’t panic follow next steps.



This is a maven bug in eclipse first clean the project using command mvn eclipse :clean then again convert it to mvn eclipse:eclipse project.After completing the steps again convert to maven by selecting the same option.This  time you will be able to convert the project.

The below folder you will get as the final basic structure.


Comments

.

Popular posts from this blog

Selection Sort in JAVA

What is selection sort? It is a sorting technique that is based on the partitioning of array into two parts, sorted and unsorted. The process is:- 1) Find minimum element in unsorted array. 2) Swap the element at the end of sorted array. when i=0 we don't have any sorted array so element will be replaced from first element later the sorted array end will growas the index. Steps:- underline elements are sorted array, the length is increasing with each minimum element added at the end. minimum element11 11 25 12 22 64 minimum element12 11 12 25 22 64 minimum element22 11 12 22 25 64 minimum element25 11 12 22 25 64 minimum element64 11 12 22 25 64 Program:- package sorting ; public class SelectionSort { //function to print array public static void print ( int [] arr ) { for ( int i = 0 ; i <= arr . length - 1 ; i ++) System . out . print ( " " + arr [ i ]); System . out . printl

Depth First Search Implementation in Graph

Depth First Search Implementation in Graph -- Graph //This is a class to define the vertex in a graph public class Vertex { char label ; boolean visited ; public Vertex ( char label ){ this . label = label ; this . visited = false ; } package Graph ; import java.util.ArrayList ; import java.util.HashMap ; import java.util.Iterator ; import java.util.Map ; import java.util.Map.Entry ; // this class is abstract because we won't allow you make instance of it , it is of no use until not extended abstract public class GraphBase { //declaring instance of vertex Vertex vertex ; //declaring an array of vertex to hold all the vertex static Vertex [] vertexlist = new Vertex [ 10 ]; //declaring edgelist to hold all edges key is vertex value is neighbouring vertex static HashMap < Character , ArrayList < Character >> edgelist = new HashMap <>(); //count of vertex and edge static int