[Next]
[Up] [Previous]
[Contents]
[Index]
Next:
Contents
NannyMUD LPC
Mats H. Carlberg
March 1998
Contents
1. Introduction
2. Fundamentals
2.1 What is LPC?
2.2 LPC object and times
2.3 The value of truth
2.4 More Reading
3. Types, operators and expressions
3.1 Identifier Names
3.2 Type Checking
3.3 Data Types and Modifiers
3.4 Constants
3.5 Declarations
3.6 Arithmetic Operators
3.7 Relational and Logical Operators
3.8 Increment and Decrement Operators
3.9 Bitwise Operators
3.10 Assignment Operators and Expressions
3.11 Other Operators
3.12 Conditional Expressions
3.13 Precedence and Order of Evaluation
3.14 The time cost of everything
4. Flow Control
4.1 Statements and Blocks
4.2 Conditional execution: If-Else
4.3 Conditional execution: Else-If
4.4 Conditional execution: Switch
4.5 Loops: While
4.6 Loops: For
4.7 Loops: Do-While
4.8 Loops: Foreach
4.9 Break and Continue
5. Functions and Program Structure
5.1 Efuns, Sfuns and Lfuns
5.2 Functions without type
5.3 Function types
5.4 Function Prototyping
5.5 Functions Returning Strings, Arrays or Mappings
5.6 Calling Non-Existant Functions
5.7 Scope Rules
5.8 Block Structure
5.9 Recursion
5.10 The Preprocessor
5.11 Comments in LPC
6. Strings, Arrays and Mappings
6.1 Strings
6.2 Arrays
6.3 Mappings
6.4 Strings, Arrays and Mappings as Function Arguments
7. Inheritance and Overloading
7.1 Inheritance
7.2 Overloading
8. Miscelleanous Features
8.1 Shadows
8.2 Virtual Compiling
9. The Keywords of LPC
10. The Boot Sequence
11. Tips, Traps and Trix
11.1 On the #pragmas strict_types and save_types
11.2 Optimisation
11.3 Three Keys to Successful Creating at NannyMUD
11.4 Some Common Mistakes
Index
About this document ...
Mats Henrik Carlberg
1998-03-25