Happy Codings - Programming Code Examples

Php Programming Code Examples

Php > File Manipulation Code Examples

Recursive Copy Function



Recursive Copy Function

function COPY_RECURSIVE_DIRS($dirsource, $dirdest) 
{ // recursive function to copy 
  // all subdirectories and contents: 
  if(is_dir($dirsource))$dir_handle=opendir($dirsource); 
  mkdir($dirdest."/".$dirsource, 0750); 
  while($file=readdir($dir_handle)) 
  { 
    if($file!="." && $file!="..") 
    { 
      if(!is_dir($dirsource."/".$file)) copy ($dirsource."/".$file, $dirdest."/".$dirsource."/".$file); 
      else COPY_RECURSIVE_DIRS($dirsource."/".$file, $dirdest); 
    } 
  } 
  closedir($dir_handle); 
  return true; 
}

Using Virtual Functions in C++ Language
See in this case the output is Woof, which is what we expect. What happens in this case? Since we marked the function animalSound() as virtual, the call to the function is resolved

Find Sum of Opposite Diagonal Elements
C program to read elements in a matrix and find the sum of minor diagonal elements. C program to calculate sum of minor diagonal elements. Input elements in matrix from user

C Program Code Merge Two Sorted Array
C program to read elements in two array and merge elements of two array into third array. Elements of array can be merged either in ascending order or in descending order in C.

C++ Performs Searching Based on Locality
Searching based on Locality of Reference and also called Principle of locality. So Depending on the memory access pattern data elements are "reallocated". In general search, 80% time

C Programming Selection sort [linked list]
Load some random values into the linked list. Adds a node at the end of a linked list. If the list is empty, create first node. Go to last node. Add node at the end. Assign data to...

C++ Codings for Implement Affine Cipher
This C++ Program implement "Affine Cipher". The affine cipher is a type of Monoalphabetic Substitution Cipher, wherein each letter in an alphabet is mapped to its numeric equivalent,

Binary Search Tree by Recursive Traversals
Function to insert a node in the tree. Inorder recursive & nonrecursive traversal. 'Preorder' recursive & nonrecursive traversal. 'Postrder' recursive traversal. Postorder non recursive

Dynamic Programming Algorithms in C++
c contains the number of columns for each of the n matrices. c[ 0 ] is the number of rows in matrix 1. Minimum number of multiplications is left in m[1][n]. Actual ordering is computed