|
|
1.1 root 1: .\" Copyright (c) 1989, 1990 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" Redistribution and use in source and binary forms are permitted provided
5: .\" that: (1) source distributions retain this entire copyright notice and
6: .\" comment, and (2) distributions including binaries display the following
7: .\" acknowledgement: ``This product includes software developed by the
8: .\" University of California, Berkeley and its contributors'' in the
9: .\" documentation or other materials provided with the distribution and in
10: .\" all advertising materials mentioning features or use of this software.
11: .\" Neither the name of the University nor the names of its contributors may
12: .\" be used to endorse or promote products derived from this software without
13: .\" specific prior written permission.
14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
17: .\"
18: .\" @(#)operator.7 5.2 (Berkeley) 6/24/90
19: .\"
20: .Dd June 24, 1990
21: .Dt OPERATOR 7
22: .Os BSD 4.4
23: .Sh NAME
24: .Nm operator
25: .Nd C operator precedence and order of evaluation
26: .Sh DESCRIPTION
27: .Ds I
28: .Cw xxxxxxxxxxxxxxxxxxxxxxxxxxxxx
29: .Cl Operator Associativity
30: .Cl -------- -------------
31: .Cl \&() [] -> . left to right
32: .Cl \&! ~ ++ -- - (type) * & sizeof right to left
33: .Cl \&* / % left to right
34: .Cl \&+ - left to right
35: .Cl \&<< >> left to right
36: .Cl \&< <= > >= left to right
37: .Cl \&== != left to right
38: .Cl \&& left to right
39: .Cl \&^ left to right
40: .Cl \&left to right
41: .Cl \&&& left to right
42: .Cl \&left to right
43: .Cl \&?: right to left
44: .Cl \&= += -= etc. right to left
45: .Cl \&, left to right
46: .Cw
47: .De
48: .Sh FILES
49: .Dw /usr/share/misc/operator
50: .Di L
51: .Dp Pa /usr/share/misc/operator
52: .Dp
53: .Sh HISTORY
54: 4.4 BSD.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.