Skip to main content

Artisan commands in Laravel

Usage of Laravel CLI tool (astisan)

This is blogs is specifically for Laravel version 5.2.

Artisan provides number of helpful commands for developing project. It is driven by Symfony console component.

To use artisan command you should be in your project directory.

1. To see list of all artisan commands
     php artisan list

2. To create controller
php artisan make:controller YourController
or,
php artisan make:controller YourController --resource

    option "--resource" will generate all REST function (index, store, show, ...)

3. To create migration table
php artisan make:migration create_users_table --create=users

     It will create a file in /database/migration directory. Use snake case for creating migration so that it will create class like CreateUsersTable.

     To migrate tables in to the database use command: php artisan migrate

     Rollback migrations: php artisan migrate:rollback

4. Create model
php artisan make:model modelname (modelname should be singular and capitalize) 

5. Database Seeder
Create - php artisan make:seeder UserTableSeeder
Run - php artisan db:seed (default run DatabaseSeeder.php)
To run specific sceeder - php artisan db:seed --class=UserTableSeeder

6. To clear cache
php artisan cache:clear

7. Create login and register form and its controller and routes in (v5.2)
php artisan make:auth

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

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};