|
|
1.1 ! root 1: .\" Copyright (c) 1990 The Regents of the University of California. ! 2: .\" All rights reserved. ! 3: .\" ! 4: .\" This code is derived from software contributed to Berkeley by ! 5: .\" Chris Torek. ! 6: .\" ! 7: .\" Redistribution and use in source and binary forms are permitted ! 8: .\" provided that: (1) source distributions retain this entire copyright ! 9: .\" notice and comment, and (2) distributions including binaries display ! 10: .\" the following acknowledgement: ``This product includes software ! 11: .\" developed by the University of California, Berkeley and its contributors'' ! 12: .\" in the documentation or other materials provided with the distribution ! 13: .\" and in all advertising materials mentioning features or use of this ! 14: .\" software. Neither the name of the University nor the names of its ! 15: .\" contributors may be used to endorse or promote products derived ! 16: .\" from this software without specific prior written permission. ! 17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 18: .\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 19: .\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 20: .\" ! 21: .\" @(#)ldiv.3 5.1 (Berkeley) 5/16/90 ! 22: .\" ! 23: .TH LDIV 3 "May 16, 1990" ! 24: .UC 7 ! 25: .SH NAME ! 26: ldiv \- return quotient and remainder from division ! 27: .SH SYNOPSIS ! 28: .nf ! 29: .ft B ! 30: #include <stdlib.h> ! 31: ! 32: ldiv_t ! 33: ldiv(int num, int denom) ! 34: .ft R ! 35: .fi ! 36: .SH DESCRIPTION ! 37: .B Ldiv ! 38: computes the value ! 39: .I num/denom ! 40: and returns the quotient and remainder in a structure named ! 41: .B ldiv_t ! 42: that contains two ! 43: .B "long integer" ! 44: members named ! 45: .B quot ! 46: and ! 47: .BR rem . ! 48: .SH SEE ALSO ! 49: div(3) ! 50: .SH STANDARDS ! 51: .B Ldiv ! 52: conforms to ANSI X3.159-1989 (``ANSI C'').
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.