Installing a Developing Feature

3 minute read

Published:

The content does not fully belong to me; I just add some value to the reference by explaining my project scenario with this. For clear understanding and deep learning go through references.

Carbon Features are a set of features which were developed for the support of WSO2 Products; these are installed by default or manually. For manually installing those features, we need to locate the repositories where those features are located. There is a common location available for all repositories online; you just need to specify those repositories based on the carbon version of your product. This is for people who want to access the features to do things.

So from my project’s perspective, I need to improve the “HL7 Feature” which is currently under development. For this,

  1. First clone the repository containing the feature. For me, it is carbon-meditation.
  2. Go to the component of the relevant feature. For me, it is carbon-mediation/components/business-adapters/ hl7/ org.wso2.carbon.business.messaging.hl7.common/ - ( Actually only this part of the main component is being modified so I need to build only it, but it is better to build hl7 in case you are modifying others or not). Build the HL7 “component”; the component contains basic sources for the feature, about how it works and its implementation, but features consist of several subparts that are bundled separately when building this only.
  3. Then build feature. This will make a bundle with the full feature combined with necessary dependencies additional to the bundle and make the feature finalized. For my case it is in carbon-mediation/features/business-adapters/org.wso2.carbon.hl7.feature/

WHILE TESTING WITH

When building COMPONENT and FEATURE, it will generate a zip file in the target of the feature, which actually bundles the whole feature with necessary dependencies and configuration files. Based on the features, we need to unzip the zip file and add its contents to the working server. In my case, it doesn’t contain any config file, so I just unzip and copy the jar files to the /repository/components/dropins/ and restart the relevant server. It will use the feature which is stored in dropins by doing necessary actions. Actually, for my case, it will copy those jars to /repository/components/plugins/, but in case any configuration is found, it will do that as well. By doing this we can test the system.

[this is based on Inosh Goonerwardana’s Mentoring]

FOR FINAL DELIVERY

From my project’s perspective, when building COMPONENT and FEATURE, it will make the HL7 feature available at /home/user/.m2/repositories/ (the place where all installed repositories are installed, and this is the place where maven looks in search of repositories). Like this, based on your feature, you build the necessary part and make it available at /home/user/.m2/repositories/.

To make this accessible by the desired feature installing system in the Management console we need to add the particular SNAPSHOT version/latest version of the required feature using the tag in the carbon-feature repository and build it. When building it will add the SNAPSHOT/latest version of the feature to p2-repo. Then by using local repositories, we can install features 1.

References

  1. http://blog.kasunbg.org/2013/04/generating-wso2-p2-repo-for-features.html

You May Also Enjoy

Time Complexity of Single-Source Shortest Path Algorithms

4 minute read

Published:

Graph data structures are widely used to represent different aspects of computer science (e.g., road networks). We can denote a graph as \(G = (V, E)\), where \(V\) represents the set of vertices (in the context of a road network, these represent intersections), and \(E\) represents the set of edges (representing road segments). We generally define \(n~(= |V|)\) as the number of vertices and \(m~(= |E|)\) as the number of edges to express the time and space complexity of graph algorithms. One such problem is single-source shortest path (SSSP), which is used to find the shortest path from a single node to all other nodes. For decades, Dijkstra’s algorithm has been the go-to method for solving this problem. The runtime of Dijkstra’s algorithm depends on the priority queue implementation and often has a complexity of \(O(m + n \log n)\). Read more

CPU/GPU/TPU Performance Comparison

7 minute read

Published:

I have implemented a simple comparison of performance on Google Colab CPU, GPU, and TPU as part of an assignment for COSC 6385 course at the University of Houston. Read more

Spectre Vulnerability Simulation

2 minute read

Published:

In this post, I share some details on my extension to a simple simulation for the Spectre attack as part of the assignment for COSC 6385 course at the University of Houston. Read more

Meltdown Vulnerability Simulation

5 minute read

Published:

I have implemented a simple simulation for the Meltdown vulnerability as part of the assignment for COSC 6385 course at the University of Houston. Read more