代码搜索：binary
找到约 10,000 项符合「binary」的源代码
代码结果 10,000
www.eeworm.com/read/375190/2733750
cpp binary.cpp
// Copyright (c) 2001-2008 Hartmut Kaiser
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
www.eeworm.com/read/375190/2736099
hpp binary.hpp
//
// Copyright 2005 David Abrahams and Aleksey Gurtovoy. Distributed
// under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LIC
www.eeworm.com/read/372488/2772288
java binary.java
/* Copyright (c) 2001-2005, The HSQL Development Group
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the
www.eeworm.com/read/366702/2883687
c binary.c
/* { dg-do run } */
/* { dg-options "-std=gnu99" } */
/* N1169 6.5.7 - Bitwise shift operands.
C99 6.5.5 Multiplicative operators.
C99 6.5.6 Additive operators.
C99 6.5.7 Bitwise shift opera
www.eeworm.com/read/365521/2896793
m binary.m
s = serial('COM1');
s.InputBufferSize = 50000;
s.BaudRate = 19200;
fopen(s)
fprintf(s,'HARDCOPY:PORT RS232')
fprintf(s,'HARDCOPY:FORMAT BMP')
fprintf(s,'HARDCOPY START')
out = fread(s,
www.eeworm.com/read/358128/3003977
result binary.result
drop table if exists t1,t2;
create table t1 (name char(20) not null, primary key (name));
create table t2 (name char(20) binary not null, primary key (name));
insert into t1 values ("
www.eeworm.com/read/358128/3004652
test binary.test
#
# test sort,min and max on binary fields
#
--disable_warnings
drop table if exists t1,t2;
--enable_warnings
create table t1 (name char(20) not null, primary key (name));
create table t2 (name char(
www.eeworm.com/read/355768/3047901
c binary.c
#include
int binary_search(int array[], int value, int size)
{
int found = 0;
int high = size, low = 0, mid;
mid = (high + low) / 2;
printf("\n\nLooking for %d\n", v
www.eeworm.com/read/352283/3095474
java binary.java
/* Copyright (c) 2001-2008, The HSQL Development Group
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the
www.eeworm.com/read/257673/4361682
c binary.c
#include
int binary_search(int array[], int value, int size)
{
int found = 0;
int high = size, low = 0, mid;
mid = (high + low) / 2;
printf("\n\nLooking for %d\n", v