Section 3
- sisnan
- sisnan.f
- size_t · overview of system data types
- sk_new_session · create a new SNMPSESSION
- skein · calculate the ``SKEIN'' family of message digests
- skein1024 · calculate the ``SKEIN'' family of message digests
- SKEIN1024_Data · calculate the ``SKEIN'' family of message digests
- SKEIN1024_End · calculate the ``SKEIN'' family of message digests
- SKEIN1024_File · calculate the ``SKEIN'' family of message digests
- SKEIN1024_FileChunk · calculate the ``SKEIN'' family of message digests
- SKEIN1024_Final · calculate the ``SKEIN'' family of message digests
- SKEIN1024_Init · calculate the ``SKEIN'' family of message digests
- SKEIN1024_Update · calculate the ``SKEIN'' family of message digests
- skein256 · calculate the ``SKEIN'' family of message digests
- SKEIN256_Data · calculate the ``SKEIN'' family of message digests
- SKEIN256_End · calculate the ``SKEIN'' family of message digests
- SKEIN256_File · calculate the ``SKEIN'' family of message digests
- SKEIN256_FileChunk · calculate the ``SKEIN'' family of message digests
- SKEIN256_Final · calculate the ``SKEIN'' family of message digests
- SKEIN256_Init · calculate the ``SKEIN'' family of message digests
- SKEIN256_Update · calculate the ``SKEIN'' family of message digests
- skein512 · calculate the ``SKEIN'' family of message digests
- SKEIN512_Data · calculate the ``SKEIN'' family of message digests
- SKEIN512_End · calculate the ``SKEIN'' family of message digests
- SKEIN512_File · calculate the ``SKEIN'' family of message digests
- SKEIN512_FileChunk · calculate the ``SKEIN'' family of message digests
- SKEIN512_Final · calculate the ``SKEIN'' family of message digests
- SKEIN512_Init · calculate the ``SKEIN'' family of message digests
- SKEIN512_Update · calculate the ``SKEIN'' family of message digests
- skewtest · image processing library
- skipDelete · delete an item.
- skipFreeList · free a skip list.
- skipInsert · insert an item.
- skipNewList · create a skip list.
- skipNext · find next item.
- skipRelease · release lock on value.
- skipSearch · search a skip list.
- sl · a small and flexible linked list implementation
- sl_add · stringlist manipulation functions
- sl_find · stringlist manipulation functions
- sl_free · stringlist manipulation functions
- sl_init · stringlist manipulation functions
- sla_gbamv
- sla_gbamv.f
- sla_gbrcond
- sla_gbrcond.f
- sla_gbrfsx_extended
- sla_gbrfsx_extended.f
- sla_gbrpvgrw
- sla_gbrpvgrw.f
- sla_geamv
- sla_geamv.f
- sla_gercond
- sla_gercond.f
- sla_gerfsx_extended
- sla_gerfsx_extended.f
- sla_gerpvgrw
- sla_gerpvgrw.f
- sla_lin_berr
- sla_lin_berr.f
- sla_porcond
- sla_porcond.f
- sla_porfsx_extended
- sla_porfsx_extended.f
- sla_porpvgrw
- sla_porpvgrw.f
- sla_syamv
- sla_syamv.f
- sla_syrcond
- sla_syrcond.f
- sla_syrfsx_extended
- sla_syrfsx_extended.f
- sla_syrpvgrw
- sla_syrpvgrw.f
- sla_wwaddw
- sla_wwaddw.f
- slabad
- slabad.f
- slabrd
- slabrd.f
- slacn2
- slacn2.f
- slacon
- slacon.f
- slacpy
- slacpy.f
- slacsg
- sladiv
- sladiv.f
- sladiv1
- sladiv2
- slae2
- slae2.f
- slaebz
- slaebz.f
- slaed0
- slaed0.f
- slaed1
- slaed1.f
- slaed2
- slaed2.f
- slaed3
- slaed3.f
- slaed4
- slaed4.f
- slaed5
- slaed5.f
- slaed6
- slaed6.f
- slaed7
- slaed7.f
- slaed8
- slaed8.f
- slaed9
- slaed9.f
- slaeda
- slaeda.f
- slaein
- slaein.f
- slaev2
- slaev2.f
- slaexc
- slaexc.f
- slafts
- slafts.f
- slag2
- slag2.f
- slag2d
- slag2d.f
- slagge
- slagge.f
- slags2
- slags2.f
- slagsy
- slagsy.f
- slagtf
- slagtf.f
- slagtm
- slagtm.f
- slagts
- slagts.f
- slagv2
- slagv2.f
- slahd2
- slahd2.f
- slahilb
- slahilb.f
- slahqr
- slahqr.f
- slahr2
- slahr2.f
- slahrd
- slahrd.f
- slaic1
- slaic1.f
- slaisnan
- slaisnan.f
- slakf2
- slakf2.f
- slaln2
- slaln2.f
- slals0
- slals0.f
- slalsa
- slalsa.f
- slalsd
- slalsd.f
- slamc1
- slamc2
- slamc3
- slamc4
- slamc5
- slamch
- slamch.f
- slamchf77.f
- slamchtst.f
- slamrg
- slamrg.f
- slamsh · send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified by subsequent shifts in an effort to maximize the number of bulges that can be sent through
- slamswlq
- slamswlq.f
- slamtsqr
- slamtsqr.f
- slaneg
- slaneg.f
- slangb
- slangb.f
- slange
- slange.f
- slangt
- slangt.f
- slanhs
- slanhs.f
- slansb
- slansb.f
- slansf
- slansf.f
- slansp
- slansp.f
- slanst
- slanst.f
- slansy
- slansy.f
- slantb
- slantb.f
- slantp
- slantp.f
- slantr
- slantr.f
- slanv2
- slanv2.f
- slaord
- slaord.f
- slaorhr_col_getrfnp
- slaorhr_col_getrfnp.f
- slaorhr_col_getrfnp2
- slaorhr_col_getrfnp2.f
- slapll
- slapll.f
- slapmr
- slapmr.f
- slapmt
- slapmt.f
- slaptm
- slaptm.f
- slapy2
- slapy2.f
- slapy3
- slapy3.f
- slaqgb
- slaqgb.f
- slaqge
- slaqge.f
- slaqp2
- slaqp2.f
- slaqp2rk
- slaqp2rk.f
- slaqp3rk
- slaqp3rk.f
- slaqps
- slaqps.f
- slaqr0
- slaqr0.f
- slaqr1
- slaqr1.f
- slaqr2
- slaqr2.f
- slaqr3
- slaqr3.f
- slaqr4
- slaqr4.f
- slaqr5
- slaqr5.f
- slaqsb
- slaqsb.f
- slaqsp
- slaqsp.f
- slaqsy
- slaqsy.f
- slaqtr
- slaqtr.f
- slaqz0
- slaqz0.f
- slaqz1
- slaqz1.f
- slaqz2
- slaqz2.f
- slaqz3
- slaqz3.f
- slaqz4
- slaqz4.f
- slar1v
- slar1v.f
- slar2v
- slar2v.f
- slaran
- slaran.f
- slaref · applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns
- slarf
- slarf.f
- slarf1f
- slarf1f.f
- slarf1l
- slarf1l.f
- slarfb
- slarfb.f
- slarfb_gett
- slarfb_gett.f
- slarfg
- slarfg.f
- slarfgp
- slarfgp.f
- slarft
- slarft.f
- slarfx
- slarfx.f
- slarfy
- slarfy.f
- slarge
- slarge.f
- slargv
- slargv.f
- slarhs
- slarhs.f
- slarmm
- slarmm.f
- slarnd
- slarnd.f
- slarnv
- slarnv.f
- slaror
- slaror.f
- slarot
- slarot.f
- slarra
- slarra.f
- slarrb
- slarrb.f
- slarrc
- slarrc.f
- slarrd
- slarrd.f
- slarre
- slarre.f
- slarrf
- slarrf.f
- slarrj
- slarrj.f
- slarrk
- slarrk.f
- slarrr
- slarrr.f
- slarrv
- slarrv.f
- slarscl2
- slarscl2.f
- slartg
- slartg.f
- slartg.f90
- slartgp
- slartgp.f
- slartgs
- slartgs.f
- slartv
- slartv.f
- slaruv
- slaruv.f
- slarz
- slarz.f
- slarzb
- slarzb.f
- slarzt
- slarzt.f
- slas2
- slas2.f
- slascl
- slascl.f
- slascl2
- slascl2.f
- slasd0
- slasd0.f
- slasd1
- slasd1.f
- slasd2
- slasd2.f
- slasd3
- slasd3.f
- slasd4
- slasd4.f
- slasd5
- slasd5.f
- slasd6
- slasd6.f
- slasd7
- slasd7.f
- slasd8
- slasd8.f
- slasd9 · find the square roots of the roots of the secular equation,
- slasda
- slasda.f
- slasdq
- slasdq.f
- slasdt
- slasdt.f
- slaset
- slaset.f
- slasorte · sort eigenpairs so that real eigenpairs are together and complex are together
- slasq1
- slasq1.f
- slasq2
- slasq2.f
- slasq3
- slasq3.f
- slasq4
- slasq4.f
- slasq5
- slasq5.f
- slasq6
- slasq6.f
- slasr
- slasr.f
- slasrt
- slasrt.f
- slasrt2 · the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
- slassq
- slassq.f
- slassq.f90
- slasum
- slasum.f
- slasv2
- slasv2.f
- slaswlq
- slaswlq.f
- slaswp
- slaswp.f
- slasy2
- slasy2.f
- slasyf
- slasyf.f
- slasyf_aa
- slasyf_aa.f
- slasyf_rk
- slasyf_rk.f
- slasyf_rook
- slasyf_rook.f
- slatb4
- slatb4.f
- slatb5
- slatb5.f
- slatb9
- slatb9.f
- slatbs
- slatbs.f
- slatdf
- slatdf.f
- slatm1
- slatm1.f
- slatm2
- slatm2.f
- slatm3
- slatm3.f
- slatm4
- slatm4.f
- slatm5
- slatm5.f
- slatm6
- slatm6.f
- slatm7
- slatm7.f
- slatme
- slatme.f
- slatmr
- slatmr.f
- slatms
- slatms.f
- slatmt
- slatmt.f
- slatps
- slatps.f
- slatrd
- slatrd.f
- slatrs
- slatrs.f
- slatrs3
- slatrs3.f
- slatrz
- slatrz.f
- slatsqr
- slatsqr.f
- slattb
- slattb.f
- slattp
- slattp.f
- slattr
- slattr.f
- slatzm
- slatzm.f
- slauu2
- slauu2.f
- slauum
- slauum.f
- slavsp
- slavsp.f
- slavsy
- slavsy.f
- slavsy_rook
- slavsy_rook.f
- slctes
- slctes.f
- slctsx
- slctsx.f
- Sleep · delay execution for a given number of milliseconds
- sleep · sleep for a specified number of seconds
- sliderscreenshots · QwtSlider
- slist · implementation of a singly linked list
- SLIST_CLASS_ENTRY · implementations of singly-linked lists, singly-linked tail queues, lists and tail queues
- SLIST_CLASS_HEAD · implementations of singly-linked lists, singly-linked tail queues, lists and tail queues
- SLIST_EMPTY · implementation of a singly linked list
- SLIST_EMPTY_ATOMIC · implementations of singly-linked lists, singly-linked tail queues, lists and tail queues
- SLIST_ENTRY · implementation of a singly linked list