代码搜索：simplicity
找到约 184 项符合「simplicity」的源代码
代码结果 184
www.eeworm.com/read/304962/3782889
h polygon_2_simplicity.h
// Copyright (c) 2001 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Witten
www.eeworm.com/read/478460/6717858
pdf watermarking withwavelets_simplicity leads to robustness.pdf
www.eeworm.com/read/103987/15715264
txt kalman.txt
The program implements a stochastic filter known as a Kalman Estimator for "Estimating a Constant " problem. The program implements a Kalman estimator for "Estimating a constant problem.". It simulate
www.eeworm.com/read/286498/8762688
policy
# In this example, for simplicity, we will use a policy file that
# gives global permission to anyone from anywhere. Do not use this
# policy file in a production environment.
grant {
permission jav
www.eeworm.com/read/126074/6018714
doc conres.doc
;;;************************************************************
;;; CONFLICT RESOLUTION ERROR CHECKING
;;;
;;; This file conres.clp tests the following conflict resolution
;;; strategies:
;;;
;;; 1
www.eeworm.com/read/124399/6049965
doc conres.doc
;;;************************************************************
;;; CONFLICT RESOLUTION ERROR CHECKING
;;;
;;; This file conres.clp tests the following conflict resolution
;;; strategies:
;;;
;;; 1
www.eeworm.com/read/115238/6120026
policy
// In this example, for simplicity, we will use a policy file that
// gives global permission to anyone from anywhere. Do not use this
// policy file in a production environment.
grant {
permission
www.eeworm.com/read/100040/6275813
perl convertsmbpasswd.perl
#!/usr/bin/perl -w
#
# Convert a Samba 1.9.18 smbpasswd file format into
# a Samba 2.0 smbpasswd file format.
# Read from stdin and write to stdout for simplicity.
# Set the last change time to the ti
www.eeworm.com/read/281000/10273697
cpp fig08_09.cpp
/**
* Perform a find.
* Error checks omitted again for simplicity.
* Return the set containing x.
*/
int DisjSets::find( int x ) const
{
if( s[ x ] < 0 )
return x;
else
www.eeworm.com/read/281000/10274228
cpp fig08_15.cpp
/**
* Perform a find with path compression.
* Error checks omitted again for simplicity.
* Return the set containing x.
*/
int DisjSets::find( int x )
{
if( s[ x ] < 0 )
return