代码搜索：objects
找到约 10,000 项符合「objects」的源代码
代码结果 10,000
www.eeworm.com/read/342786/11999006
makefile
INCLUDE=-I../.. -I/usr/include/SDL
LIBS=-L../.. -ldmtx -lpng -lm -lGL -lGLU -lSDL -lpng -lpthread
#CFLAGS=-Wall -g -pg
CFLAGS=-Wall
OBJECTS=gltest.o image.o display.o callback.o
all: gltest
clean:
www.eeworm.com/read/153898/12000604
mk chroot.mk
# Copyright (c) 1990, 1991, 1992, 1993 Novell, Inc. All Rights Reserved.
# Copyright (c) 1984, 1985, 1986, 1987, 1988, 1989, 1990 Novell, Inc. All Rights Reserved.
# All Rights Reserved
# THIS IS U
www.eeworm.com/read/153893/12000743
mk chmod.mk
# Copyright (c) 1990, 1991, 1992, 1993 Novell, Inc. All Rights Reserved.
# Copyright (c) 1984, 1985, 1986, 1987, 1988, 1989, 1990 Novell, Inc. All Rights Reserved.
# All Rights Reserved
# THIS IS U
www.eeworm.com/read/153892/12000753
mk chgrp.mk
# Copyright (c) 1990, 1991, 1992, 1993 Novell, Inc. All Rights Reserved.
# Copyright (c) 1984, 1985, 1986, 1987, 1988, 1989, 1990 Novell, Inc. All Rights Reserved.
# All Rights Reserved
# THIS IS U
www.eeworm.com/read/342759/12002682
errata
pg 886, last paragraph (grammar):
---------------------------------
Another group of function objects encapsulate the standard
^
Should be singular (e
www.eeworm.com/read/342008/12046801
m modeseek.m
%MODESEEK Clustering by modeseeking
%
% [labels,J] = modeseek(D,k)
%
% If D is a n*n distance matrix between object then a k-nn
% modeseeking method is used to assign each object to its nearest
%
www.eeworm.com/read/342008/12047303
m distm.m
%DISTM Distance matrix between two datasets.
%
% D = distm(A,B)
%
% Computation of the distance matrix D between two datasets A and B.
% Distances are computed as squared Euclidean. If A has m obj
www.eeworm.com/read/342008/12047335
m classs.m
%CLASSS Linear mapping by classical scaling
%
% W = classs(D,k)
%
% Calculates a linear mapping W of a distance matrix D to k dimensions.
% D should be square, size m x m. New objects may be mapped