进来看看这样的语法是什么意思？
这是WSAStartup函数在头文件中的声明，这个声明可以不解释，不过也希望各位解释一下
#if INCL_WINSOCK_API_PROTOTYPES
__control_entrypoint(DllExport)
WINSOCK_API_LINKAGE
__checkReturn
int
WSAAPI
WSAStartup(
__in WORD wVersionRequested,
__out LPWSADATA lpWSAData
);
#endif /* INCL_WINSOCK_API_PROTOTYPES */
这是要看的，1<<8|1是什么意思啊？？
WSAStartup((WORD)(1<<8|1)，（LPWSADATA）&WSAData);
[解决办法]
1<<8
[解决办法]
1 ： 位运算，先将1左移8位，然后与1做按位或运算
[解决办法]
//C++ Operators
// Operators specify an evaluation to be performed on one of the following:
// One operand (unary operator)
// Two operands (binary operator)
// Three operands (ternary operator)
// The C++ language includes all C operators and adds several new operators.
// Table 1.1 lists the operators available in Microsoft C++.
// Operators follow a strict precedence which defines the evaluation order of
//expressions containing these operators. Operators associate with either the
//expression on their left or the expression on their right; this is called
//“associativity.” Operators in the same group have equal precedence and are
//evaluated left to right in an expression unless explicitly forced by a pair of
//parentheses, ( ).
// Table 1.1 shows the precedence and associativity of C++ operators
// (from highest to lowest precedence).
//
//Table 1.1 C++ Operator Precedence and Associativity
// The highest precedence level is at the top of the table.
//+------------------+-----------------------------------------+---------------+
//
[解决办法]
Operator
[解决办法]
Name or Meaning
[解决办法]
Associativity
[解决办法]
//+------------------+-----------------------------------------+---------------+
//
[解决办法]
::
[解决办法]
Scope resolution
[解决办法]
None
[解决办法]
//
[解决办法]
::
[解决办法]
Global
[解决办法]
None
[解决办法]
//
[解决办法]
[ ]
[解决办法]
Array subscript
[解决办法]
Left to right
[解决办法]
//
[解决办法]
( )
[解决办法]
Function call
[解决办法]
Left to right
[解决办法]
//
[解决办法]
( )
[解决办法]
Conversion
[解决办法]
None
[解决办法]
//
[解决办法]
.
[解决办法]
Member selection (object)
------解决方案--------------------
Left to right
[解决办法]
//
[解决办法]
->
[解决办法]
Member selection (pointer)
[解决办法]
Left to right
[解决办法]
//
[解决办法]
++
[解决办法]
Postfix increment
[解决办法]
None
[解决办法]
//
[解决办法]
--
[解决办法]
Postfix decrement
[解决办法]
None
[解决办法]
//
[解决办法]
new
[解决办法]
Allocate object
[解决办法]
None
[解决办法]
//
[解决办法]
delete
[解决办法]
Deallocate object
[解决办法]
None
[解决办法]
//
[解决办法]
delete[ ]
------解决方案--------------------
Deallocate object
[解决办法]
None
[解决办法]
//
[解决办法]
++
[解决办法]
Prefix increment
[解决办法]
None
[解决办法]
//
[解决办法]
--
[解决办法]
Prefix decrement
[解决办法]
None
[解决办法]
//
[解决办法]
*
[解决办法]
Dereference
[解决办法]
None
[解决办法]
//
[解决办法]
&
[解决办法]
Address-of
[解决办法]
None
[解决办法]
//
[解决办法]
+
[解决办法]
Unary plus
------解决方案--------------------
None
[解决办法]
//
[解决办法]
-
[解决办法]
Arithmetic negation (unary)
[解决办法]
None
[解决办法]
//
[解决办法]
!
[解决办法]
Logical NOT
[解决办法]
None
[解决办法]
//
[解决办法]
~
[解决办法]
Bitwise complement
[解决办法]
None
[解决办法]
//
[解决办法]
sizeof
[解决办法]
Size of object
[解决办法]
None
[解决办法]
//
[解决办法]
sizeof ( )
[解决办法]
Size of type
[解决办法]
None
[解决办法]
//
[解决办法]
typeid( )
[解决办法]
type name
[解决办法]
None
[解决办法]
//
[解决办法]
(type)
[解决办法]
Type cast (conversion)
[解决办法]
Right to left
[解决办法]
//
[解决办法]
const_cast
[解决办法]
Type cast (conversion)
[解决办法]
None
[解决办法]
//
[解决办法]
dynamic_cast
[解决办法]
Type cast (conversion)
[解决办法]
None
[解决办法]
//
[解决办法]
reinterpret_cast
[解决办法]
Type cast (conversion)
[解决办法]
None
[解决办法]
//
[解决办法]
static_cast
[解决办法]
Type cast (conversion)
[解决办法]
None
[解决办法]
//
------解决方案--------------------
.*
[解决办法]
Apply pointer to class member (objects)
[解决办法]
Left to right
[解决办法]
//
[解决办法]
->*
[解决办法]
Dereference pointer to class member
[解决办法]
Left to right
[解决办法]
//
[解决办法]
*
[解决办法]
Multiplication
[解决办法]
Left to right
[解决办法]
//
[解决办法]
/
[解决办法]
Division
[解决办法]
Left to right
[解决办法]
//
[解决办法]
%
[解决办法]
Remainder (modulus)
[解决办法]
Left to right
[解决办法]
//
[解决办法]
+
[解决办法]
Addition
[解决办法]
Left to right
------解决方案--------------------
//
[解决办法]
-
[解决办法]
Subtraction
[解决办法]
Left to right
[解决办法]
//
[解决办法]
<<
[解决办法]
Left shift
[解决办法]
Left to right
[解决办法]
//
[解决办法]
>>
[解决办法]
Right shift
[解决办法]
Left to right
[解决办法]
//
[解决办法]
<
[解决办法]
Less than
[解决办法]
Left to right
[解决办法]
//
[解决办法]
>
[解决办法]
Greater than
[解决办法]
Left to right
[解决办法]
//
[解决办法]
<=
------解决方案--------------------
Less than or equal to
[解决办法]
Left to right
[解决办法]
//
[解决办法]
>=
[解决办法]
Greater than or equal to
[解决办法]
Left to right
[解决办法]
//
[解决办法]
==
[解决办法]
Equality
[解决办法]
Left to right
[解决办法]
//
[解决办法]
!=
[解决办法]
Inequality
[解决办法]
Left to right
[解决办法]
//
[解决办法]
&
[解决办法]
Bitwise AND
[解决办法]
Left to right
[解决办法]
//
[解决办法]
^
[解决办法]
Bitwise exclusive OR
[解决办法]
Left to right
[解决办法]
//
[解决办法]
[解决办法]
[解决办法]
Bitwise OR
[解决办法]
Left to right
[解决办法]
//
[解决办法]
&&
[解决办法]
Logical AND
[解决办法]
Left to right
[解决办法]
//
[解决办法]
[解决办法]
[解决办法]
Logical OR
[解决办法]
Left to right
[解决办法]
//
[解决办法]
e1?e2:e3
[解决办法]
Conditional
[解决办法]
Right to left
[解决办法]
//
[解决办法]
=
[解决办法]
Assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
*=
[解决办法]
Multiplication assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
/=
[解决办法]
Division assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
%=
[解决办法]
Modulus assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
+=
[解决办法]
Addition assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
-=
[解决办法]
Subtraction assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
<<=
[解决办法]
Left-shift assignment
[解决办法]
Right to left
[解决办法]
//
------解决方案--------------------
>>=
[解决办法]
Right-shift assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
&=
[解决办法]
Bitwise AND assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
[解决办法]
=
[解决办法]
Bitwise inclusive OR assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
^=
[解决办法]
Bitwise exclusive OR assignment
[解决办法]
Right to left
[解决办法]
//
[解决办法]
,
[解决办法]
Comma
[解决办法]
Left to right
[解决办法]
//+------------------+-----------------------------------------+---------------+
[解决办法]
跟MAKEWORD(1,1)是一样的，表示使用winsock的1.1版本。
左移8位后就是二进制0000000100000000，再或1就成为0000000100000001，也可直接表示为0x0101