. Create app in phonegap in windows Skip to main content

Create app in phonegap in windows

Phonegap (Cordova) is a tool that allows creating native mobile app using HTML, CSS and Javascript.
This article shows you, how to create application and deploy them to various native mobile platforms using the cordova command-line interface (CLI).

Install Cordova using CLI

Follow these steps to install:


    1. Download and install Node.js. Following installation, you should be able to invoke node and npm on your command line.

    2. Install the cordova module using npm utility of Node.js. The cordova module will automatically be downloaded by the npm utility.
    3.   $ npm install -g cordova
Create APP:

Go to the directory where you maintain your source code, and run a command such as the following: using command.

Create hello app:
$ cordova create hello com.example.hello HelloWorld

This command will create a folder ‘HelloWorld’.

All subsequent commands need to be run within the project's directory, or any subdirectories.

So go to in this folder ‘cd HelloWorld’.

Add the platforms that you want to target your app. We will add the 'ios' and 'android' platform and ensure they get saved to config.xml:
$ cordova platform add ios --save

$ cordova platform add android --save

To check your current set of platforms:
$ cordova platform ls

Build the App

By default, cordova create script generates a skeletal web-based application whose start page is the project's
www/index.html

file. Any initialization should be specified as part of the deviceready event handler defined in
www/js/index.js.

Run the following command to build the project for all platforms:
$ cordova build

You can optionally limit the scope of each build to specific platforms - 'ios' in this case:
$ cordova build ios

$ cordova build android

Source: Phonegap Docs

Comments

Popular posts from this blog

Day 9 - Challenge 1 - Product of Array Except Self

Solving the "Product of Array Except Self" Problem in JavaScript Are you ready to dive into a common coding challenge that not only tests your programming skills but also sharpens your problem-solving mindset? If you're up for the challenge, let's tackle the "Product of Array Except Self" problem together using JavaScript. This problem requires us to return an array where each element at index i is the product of all the elements in the original array except the one at index i . Understanding the Problem:   Imagine you're given an array of integers, let's call it nums . Your task is to create a new array where the value at index i in this new array is the product of all the elements in nums , except the one at index i . In other words, you're calculating the product of all the elements to the left of nums[i] and the product of all the elements to the right of nums[i] , and then multiplying these two products to get the final value at index i ...

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...

Day 8 - Challenge 2 - Move Zeroes to the End

Moving Zeroes to the End: A JavaScript Solution Introduction:   When working with arrays, there are often times when we need to manipulate their elements to achieve a specific goal. One common problem is moving all zeroes to the end of an array while keeping the order of non-zero elements unchanged. In this blog post, we will explore an elegant solution to this problem using JavaScript. We'll discuss the problem statement, the approach we'll take, and provide a step-by-step guide to implementing the solution. The Problem:   Given an array of integers, the task is to move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. This means that after rearranging the array, all the zeroes should be at the end, and the order of the non-zero elements should remain the same. The Approach:   To solve this problem, we can utilize a two-pointer approach. We'll maintain two pointers, one for iterating through the array and another for keepin...