Language Ccpp Cref Man Strlen.htm

 <TITLE>strlen</TITLE>
<body bgcolor="#ffffcc">
<hr>
<pre>



<h3>STRLEN(3)           Linux Programmer's Manual           STRLEN(3)
</h3>

<h3>NAME
</h3>       strlen - calculate the length of a string

<h3>SYNOPSIS
</h3>       #include &lt;string.h&gt;

       size_t strlen(const char *s);

<h3>DESCRIPTION
</h3>       The  strlen() function calculates the length of the string
       s, not including the terminating `\0' character.

<h3>RETURN VALUE
</h3>       The strlen() function returns the number of characters  in
       s.

<h3>CONFORMING TO
</h3>       SVID 3, POSIX, BSD 4.3, ISO 9899

</pre>
<hr>
<h3>SEE ALSO
</h3><p>
<a href=string.htm>string</a>, 
<pre>




































                          April 12, 1993                        1



</pre>
<P>
<hr>
<p>
<center>
<table border=2 width=80%>
<tr align=center>
<td width=25%>
<a href=../index.htm>Top</a>
</td><td width=25%>
<a href=../master_index.html>Master Index</a>
</td><td width=25%>
<a href=../SYNTAX/keywords.html>Keywords</a>
</td><td width=25%>
<a href=../FUNCTIONS/index.htm>Functions</a>
</td>
</tr>
</table>
</center>
<p>
<hr>

This manual page was brought to you by <i>mjl_man V-2.0</i>

file: /Techref/language/ccpp/Cref/MAN/strlen.htm, 1KB, , updated: 2003/3/20 09:39, local time: 2024/11/27 02:33,

^{18.223.237.218:LOG IN}

©2024 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions?

Please DO link to this page! Digg it! / MAKE!

<A HREF="http://sxlist.com/Techref/language/ccpp/Cref/MAN/strlen.htm"> strlen</A>

Did you find what you needed?

Welcome to sxlist.com!

Site supported by
sales, advertizing,
& kind contributors
just like you!
Please don't rip/copy
(here's why
Copies of the site on CD
are available at minimal cost.