代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/470693/1459342
c net29.c
// This is a test case for the recent libg++ make check problem.
// Build don't link:
class SubString {
public:
SubString();
SubString(const SubString& x);
};
class String {
public:
String();
www.eeworm.com/read/470693/1462561
c 20020227-1.c
/* This testcase failed on mmix-knuth-mmixware. Problem was with storing
to an unaligned mem:SC, gcc tried doing it by parts from a (concat:SC
(reg:SF 293) (reg:SF 294)). */
typedef __complex
www.eeworm.com/read/470693/1464437
c paste6.c
/* Regression test for paste appearing at the beginning of a set of
actual arguments. Original bug exposed by Linux kernel. Problem
reported by Jakub Jelinek . */
/* { dg-d
www.eeworm.com/read/470693/1466148
java printerexception.java
/* PrinterException.java -- generic problem in the printing subsystem
Copyright (C) 1999, 2002 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; y
www.eeworm.com/read/470693/1466686
java keystoreexception.java
/* KeyStoreException.java -- Indicates a problem with the key store
Copyright (C) 1998, 2002 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you
www.eeworm.com/read/464823/1524685
problems
$Id$
This is the Snort problems file. It is used to document bugs that we
can't work around and provide a bit of documentation in case someone
finds a way to work around the problem.
Platform: Lin
www.eeworm.com/read/459311/1570080
m testdich.m
function [X,I,alpha,theta] = testdich( dim, datanum )
% TESTDICH randomly creates test examples for dichotomy problem.
% [X,I] = testgidich( dim, datanum )
%
% TESTDICH creats test data randomly for
www.eeworm.com/read/458434/1586240
m testdich.m
function [X,I,alpha,theta] = testdich( dim, datanum )
% TESTDICH randomly creates test examples for dichotomy problem.
% [X,I] = testgidich( dim, datanum )
%
% TESTDICH creats test data randomly for
www.eeworm.com/read/457216/1599682
m ex_4_5.m
% Exercise 4.5: Show the equivalence of 3 convex problem formations
% From Boyd & Vandenberghe, "Convex Optimization"
% Jo雔le Skaf - 08/17/05
%
% Shows the equivalence of the following 3 problems:
% 1
www.eeworm.com/read/457216/1599694
m fastest_mixing_mc.m
% Section 4.6.3: Find the fastest mixing Markov chain on a graph
% Boyd & Vandenberghe "Convex Optimization"
% Jo雔le Skaf - 09/26/05
%
% The 'fastest mixing Markov chain problem' is to find a transiti