CakePHP 1.3 Application Development Cookbook (with code)

Купить бумажную книгу и читать

Автор: Mariano Iglesias

Название: CakePHP 1.3 Application Development Cookbook

Издательство: Packt Publishing

Год: 2011

Формат: pdf

Язык: English

Размер: 6.41 Mb

CakePHP is a rapid development framework for PHP that provides an extensible architecture for developing, maintaining, and deploying web applications. While the framework has a lot of documentation and reference guides available for beginners, developing more sophisticated and scalable applications require a deeper knowledge of CakePHP features, a challenge that proves difficult even for well established developers.

The recipes in this cookbook will give you instant results and help you to develop web applications, leveraging the CakePHP features that allow you to build robust and complex applications. Following the recipes in this book you will be able to understand and use these features in no time.

We start with setting up authentication on a CakePHP application. One of the most important aspects of a CakePHP application: the relationship between models, also known as model bindings. Model binding is an integral part of any application’s logic and we can manipulate it to get the data we need and when we need. We will go through a series of recipes that will show us how to change the way bindings are fetched, what bindings and what information from a binding is returned, how to create new bindings, and how to build hierarchical data structures. We also define our custom find types that will extend the three basic ones, allowing our code to be even more readable and also create our own find type, with pagination support. This book also has recipes that cover two aspects of CakePHP models that are fundamental to most applications: validation, and behaviors.

A cookbook for CakePHP developers on how to leverage one of the most popular PHP frameworks, including recipes for working with AJAX, datasources, GEO location, routing, performance optimization, and more.