Skip to main content

Docksal usage with Drupal

DOCKSAL
=======

1. Drupal installation using composer

ref: https://blog.docksal.io/creating-drupal-8-project-from-scratch-using-pre-installed-composer-in-docksal-cli-bfe49b0042e2

# Create new directory for the project
mkdir my-new-project
# Go to my new dir
cd my-new-project
# Download Drupal 8 using composer repo recommended in Drupal docs
fin run-cli composer create-project drupal-composer/drupal-project:8.x-dev . --stability dev --no-interaction
# Initialize Docksal project root
mkdir .docksal
# Configure DOCROOT to match checked out files
fin config set DOCROOT=web
# Start my project containers
fin project start


2. To start existing project on Docksal
  fin project start / fin up


3. DB settings (default)
   db name: default
   username: user
   password: user
   host: db

4. Install PHPMyAdmin to project
  fin addon install pma

  # Then access it like http://pma.project-name.docksal

  # To install any addon (ref https://docs.docksal.io/fin/addons/)
  fin addon install <name>

5. Removing addon from project
  fin addon remove <name>

6. Drush usage
  # Goto project directory
  # Then start project
  fin up / fin project start

  # Execute drush commands
  fin drush status

7. Project alias
  # Goto project directory
  cd /var/demo
  fin up

  # Now can execute commands from anywhere using project alaias
  # here alaias is @demo (its created automatically with project name)

  fin @demo drush status

8. Using Composer commands
  fin composer require drupal/admin_toolbar

9. Check logs
  fin logs -f


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