code
stringlengths 10
174k
| nl
stringlengths 3
129k
|
|---|---|
public Node removeMin(){
return null;
}
| Returns the Node with the smallest priority value, and removes it from the heap. This is dequeue, or poll. |
public Model validateNode(Dataset dataset,URI shapesGraphURI,Node focusNode,Resource minSeverity,Predicate<SHConstraint> constraintFilter,Function<RDFNode,String> labelFunction,ProgressMonitor monitor) throws InterruptedException {
Model results=JenaUtil.createMemoryModel();
Model shapesModel=dataset.getNamedModel(shapesGraphURI.toString());
List<Property> properties=SHACLUtil.getAllConstraintProperties(true);
Resource resource=(Resource)dataset.getDefaultModel().asRDFNode(focusNode);
Set<Resource> shapes=getShapesForResource(resource,dataset,shapesModel);
for ( Resource shape : shapes) {
if (monitor != null && monitor.isCanceled()) {
throw new InterruptedException();
}
addResourceViolations(dataset,shapesGraphURI,focusNode,shape.asNode(),properties,minSeverity,constraintFilter,results,labelFunction,monitor);
}
return results;
}
| Validates all SHACL constraints for a given resource. This always includes shapesGraph validation (sh:parameter etc). |
private TreeNode findNode(DefaultMutableTreeNode node,Object obj){
if (obj instanceof String) {
if (node.getUserObject().toString().equals(obj.toString())) {
return node;
}
}
else if (node.getUserObject().equals(obj)) {
return node;
}
TreeNode foundNode=null;
for (int i=0; i < node.getChildCount(); i++) {
DefaultMutableTreeNode childNode=(DefaultMutableTreeNode)node.getChildAt(i);
foundNode=findNode(childNode,obj);
if (foundNode != null) {
break;
}
}
return foundNode;
}
| Recurvice search or find node that contains the obj |
public Element create(String prefix,Document doc){
return new SVGOMAltGlyphItemElement(prefix,(AbstractDocument)doc);
}
| Creates an instance of the associated element type. |
public static EntityCondition makeRangeCondition(Timestamp rangeStart,Timestamp rangeEnd,String fromDateName,String thruDateName){
List<EntityCondition> criteria=new LinkedList<EntityCondition>();
criteria.add(EntityCondition.makeCondition(EntityCondition.makeCondition(fromDateName,EntityOperator.GREATER_THAN_EQUAL_TO,rangeStart),EntityOperator.AND,EntityCondition.makeCondition(fromDateName,EntityOperator.LESS_THAN,rangeEnd)));
criteria.add(EntityCondition.makeCondition(EntityCondition.makeCondition(thruDateName,EntityOperator.GREATER_THAN_EQUAL_TO,rangeStart),EntityOperator.AND,EntityCondition.makeCondition(thruDateName,EntityOperator.LESS_THAN,rangeEnd)));
criteria.add(EntityCondition.makeCondition(EntityCondition.makeCondition(fromDateName,EntityOperator.EQUALS,null),EntityOperator.AND,EntityCondition.makeCondition(thruDateName,EntityOperator.GREATER_THAN_EQUAL_TO,rangeStart)));
criteria.add(EntityCondition.makeCondition(EntityCondition.makeCondition(thruDateName,EntityOperator.EQUALS,null),EntityOperator.AND,EntityCondition.makeCondition(fromDateName,EntityOperator.LESS_THAN,rangeEnd)));
criteria.add(EntityCondition.makeCondition(EntityCondition.makeCondition(thruDateName,EntityOperator.EQUALS,null),EntityOperator.AND,EntityCondition.makeCondition(fromDateName,EntityOperator.EQUALS,null)));
return EntityCondition.makeCondition(criteria,EntityOperator.OR);
}
| Creates an EntityCondition representing a date range filter query to be used against entities that themselves represent a date range. When used the resulting entities will meet at least one of the following criteria: - fromDate is equal to or after rangeStart but before rangeEnd - thruDate is equal to or after rangeStart but before rangeEnd - fromDate is null and thruDate is equal to or after rangeStart - thruDate is null and fromDate is before rangeEnd - fromDate is null and thruDate is null |
public link removeElement(String hashcode){
removeElementFromRegistry(hashcode);
return (this);
}
| Removes an Element from the element. |
public static void main(String[] args){
jh61b.junit.textui.runClasses(TestVesselHelper.class);
}
| Runs tests. |
private static boolean withinOne(INode n,INode goal){
DoubleLinkedList<IMove> moves=n.validMoves();
for (Iterator<IMove> it=moves.iterator(); it.hasNext(); ) {
IMove move=it.next();
INode successor=n.copy();
move.execute(successor);
if (ge.eval(successor) == 0) {
return true;
}
}
return false;
}
| See if within one move of solution. |
public Instrumenter attachGenerationalDistanceCollector(){
includeGenerationalDistance=true;
return this;
}
| Includes the generational distance collector when instrumenting algorithms. |
@Override protected void observableActivated(){
if (activationHandler != null) {
activationHandler.observableActivated(this);
}
}
| BaseObservable.observableActivated() -> ActivationHandler.observableActivated(this) |
public DownloadTask resume(String taskId){
DownloadTask downloadTask=getCurrentTaskById(taskId);
if (downloadTask != null) {
if (downloadTask.getDownloadStatus() != DownloadStatus.DOWNLOAD_STATUS_COMPLETED) {
downloadTask.setDownloadStatus(DownloadStatus.DOWNLOAD_STATUS_PREPARE);
downloadTask.setdownFileStore(downFileStore);
downloadTask.setHttpClient(client);
Future future=executorService.submit(downloadTask);
futureMap.put(downloadTask.getId(),future);
}
}
else {
downloadTask=getDBTaskById(taskId);
if (downloadTask != null) {
currentTaskList.put(taskId,downloadTask);
downloadTask.setDownloadStatus(DownloadStatus.DOWNLOAD_STATUS_PREPARE);
downloadTask.setdownFileStore(downFileStore);
downloadTask.setHttpClient(client);
Future future=executorService.submit(downloadTask);
futureMap.put(downloadTask.getId(),future);
}
}
return downloadTask;
}
| if return null,the task does not exist |
public TwoColumnOutput(OutputStream out,int leftWidth,int rightWidth,String spacer){
this(new OutputStreamWriter(out),leftWidth,rightWidth,spacer);
}
| Constructs an instance. |
@Override public boolean eIsSet(int featureID){
switch (featureID) {
case UmplePackage.ABSTRACT___ABSTRACT_1:
return abstract_1 != ABSTRACT_1_EDEFAULT;
}
return super.eIsSet(featureID);
}
| <!-- begin-user-doc --> <!-- end-user-doc --> |
public void populateSequenceListForSegment(List<SequenceTypeTuple> sequenceTypeTuples,org.smpte_ra.schemas.st2067_2_2013.SegmentType segment){
org.smpte_ra.schemas.st2067_2_2013.ObjectFactory objectFactory=new org.smpte_ra.schemas.st2067_2_2013.ObjectFactory();
JAXBElement<SequenceType> element=null;
List<Object> any=segment.getSequenceList().getAny();
for ( SequenceTypeTuple sequenceTypeTuple : sequenceTypeTuples) {
switch (sequenceTypeTuple.getSequenceType()) {
case MainImageSequence:
element=objectFactory.createMainImageSequence(sequenceTypeTuple.getSequence());
break;
case MainAudioSequence:
element=objectFactory.createMainAudioSequence(sequenceTypeTuple.getSequence());
break;
default :
throw new IMFAuthoringException(String.format("Currently we only support %s and %s sequence types in building a Composition Playlist document, the type of sequence being requested is %s",Composition.SequenceTypeEnum.MainAudioSequence.toString(),Composition.SequenceTypeEnum.MainImageSequence,sequenceTypeTuple.getSequenceType().toString()));
}
any.add(element);
}
}
| A method to populate the SequenceList of a VirtualTrack segment |
@Override public FilterReply decide(ILoggingEvent event){
if (Strings.isNullOrEmpty(event.getLoggerName())) {
return FilterReply.DENY;
}
for ( String name : loggerName) {
FilterReply ret;
if (name.endsWith("/0")) {
String nullTerminatedLN=event.getLoggerName() + "/0";
ret=nameMatches(nullTerminatedLN.equals(name));
}
else {
ret=nameMatches(event.getLoggerName().startsWith(name));
}
ret=shouldReturn(ret);
if (ret != null) {
return ret;
}
}
if (exclude) {
return FilterReply.NEUTRAL;
}
else {
return FilterReply.DENY;
}
}
| Decide whether or not to deny the event based on the settings of this filter |
@Override public void tearDown() throws Exception {
if (this.rs != null) {
try {
this.rs.close();
}
catch ( SQLException SQLE) {
}
}
if (this.sha256Rs != null) {
try {
this.sha256Rs.close();
}
catch ( SQLException SQLE) {
}
}
if (System.getProperty("com.mysql.jdbc.testsuite.retainArtifacts") == null) {
Statement st=this.conn == null || this.conn.isClosed() ? getNewConnection().createStatement() : this.conn.createStatement();
Statement sha256st;
if (this.sha256Conn == null || this.sha256Conn.isClosed()) {
Connection c=getNewSha256Connection();
sha256st=c == null ? null : c.createStatement();
}
else {
sha256st=this.sha256Conn.createStatement();
}
for (int i=0; i < this.createdObjects.size(); i++) {
String[] objectInfo=this.createdObjects.get(i);
try {
dropSchemaObject(st,objectInfo[0],objectInfo[1]);
}
catch ( SQLException SQLE) {
}
try {
dropSchemaObject(sha256st,objectInfo[0],objectInfo[1]);
}
catch ( SQLException SQLE) {
}
}
st.close();
if (sha256st != null) {
sha256st.close();
}
}
if (this.stmt != null) {
try {
this.stmt.close();
}
catch ( SQLException SQLE) {
}
}
if (this.sha256Stmt != null) {
try {
this.sha256Stmt.close();
}
catch ( SQLException SQLE) {
}
}
if (this.pstmt != null) {
try {
this.pstmt.close();
}
catch ( SQLException SQLE) {
}
}
if (this.conn != null) {
try {
this.conn.close();
}
catch ( SQLException SQLE) {
}
}
if (this.sha256Conn != null) {
try {
this.sha256Conn.close();
}
catch ( SQLException SQLE) {
}
}
}
| Destroys resources created during the test case. |
private List<DoubleFactor> sumOut(String nodeId,List<DoubleFactor> factors){
List<DoubleFactor> dependentFactors=new LinkedList<DoubleFactor>();
List<DoubleFactor> remainingFactors=new LinkedList<DoubleFactor>();
for ( DoubleFactor f : factors) {
if (!f.getVariables().contains(nodeId)) {
remainingFactors.add(f);
}
else {
dependentFactors.add(f);
}
}
DoubleFactor productDependentFactors=pointwiseProduct(dependentFactors);
DoubleFactor sumDependentFactors=sumOutDependent(nodeId,productDependentFactors);
if (!sumDependentFactors.isEmpty()) {
remainingFactors.add(sumDependentFactors);
}
return remainingFactors;
}
| Sums out the variable from the pointwise product of the factors, and returns the result |
public static int partition(int[] list,int from,int to,int splitter){
steps+=to - from + 1;
int element;
for (int i=from - 1; ++i <= to; ) {
element=list[i];
if (element < splitter) {
list[i]=list[from];
list[from++]=element;
}
}
return from - 1;
}
| Partitions (partially sorts) the given list such that all elements falling into the given interval are placed next to each other. Returns the index of the element delimiting the interval. <p> <b>Example:</b> <p> <tt>list = (7, 4, 5, 50, 6, 4, 3, 6), splitter = 5</tt> defines the two intervals <tt>[-infinity,5), [5,+infinity]</tt>. <p> The method modifies the list to be <tt>list = (4, 4, 3, 50, 6, 7, 5, 6)</tt> and returns the split index <tt>2</tt>. In other words, <ul> <li>All values <tt>list[0..2]</tt> fall into <tt>[-infinity,5)</tt>. <li>All values <tt>list[3=2+1 .. 7=list.length-1]</tt> fall into <tt>[5,+infinity]</tt>. </ul> As can be seen, the list is partially sorted such that values falling into a certain interval are placed next to each other. Note that <i>within</i> an interval, elements are entirelly unsorted. They are only sorted across interval boundaries. In particular, this partitioning algorithm is not <i>stable</i>. <p> More formally, this method guarantees that upon return there holds: <ul> <li>for all <tt>i = from .. returnValue: list[i] < splitter</tt> and <li>for all <tt>i = returnValue+1 .. list.length-1: !(list[i] < splitter)</tt>. </ul> <p> <b>Performance:</b> <p> Let <tt>N=to-from+1</tt> be the number of elements to be partially sorted. Then the time complexity is <tt>O( N )</tt>. No temporary memory is allocated; the sort is in-place. <p> |
public T animate(int animId,AnimationListener listener){
Animation anim=AnimationUtils.loadAnimation(getContext(),animId);
anim.setAnimationListener(listener);
return animate(anim);
}
| Starts an animation on the view. <br> contributed by: marcosbeirigo |
public Iterator enumerateLiteralResultAttributes(){
return (null == m_avts) ? null : m_avts.iterator();
}
| Compiling templates requires that we be able to list the AVTs ADDED 9/5/2000 to support compilation experiment |
private void loadCookies(){
lock.lock();
try {
Set<String> cookieStrings=spePreferences.getStringSet(COOKIE_JAR,null);
if (cookieStrings != null) cookieJar.addAll(stringSetToCookieList(cookieStrings));
Set<String> URIStrings=spePreferences.getStringSet(URI_LIST,null);
if (URIStrings != null) {
for ( String s : URIStrings) {
uriIndex.put(URI.create(s),stringSetToCookieList(spePreferences.getStringSet(s,null)));
}
}
Set<String> domains=spePreferences.getStringSet(STRING_LIST,null);
if (domains != null) {
for ( String s : domains) {
domainIndex.put(s,stringSetToCookieList(spePreferences.getStringSet(s,null)));
}
}
}
catch ( Exception e) {
Log.e(TAG,"Failed to Load Cookies from SharedPref",e);
}
for ( HttpCookie cookie : cookieJar) {
Log.e(TAG,cookie.getName() + " : " + cookie.getValue());
}
lock.unlock();
}
| Load cookies from the SharedPreferences storage into the memory of this cookiesStore. |
private byte[] concat(final byte[] data1,final byte[] data2){
final byte[] newdata=new byte[data1.length + data2.length];
System.arraycopy(data1,0,newdata,0,data1.length);
System.arraycopy(data2,0,newdata,data1.length,data2.length);
return newdata;
}
| Concatenates two byte arrays. |
private boolean lastTabIsEmpty(){
if (!diagrams.isEmpty()) {
DiagramHandler lastDiagram=diagrams.get(diagrams.size() - 1);
if (lastDiagram.getController().isEmpty() && lastDiagram.getDrawPanel().getGridElements().isEmpty()) {
return true;
}
}
return false;
}
| If the last diagram tab and it's undo history (=controller) is empty return true, else return false |
public AuditLogReader(Configuration conf,DbConnectionFactory dbConnectionFactory,String auditLogTableName,String outputObjectsTableName,String mapRedStatsTableName,long getIdsAfter) throws SQLException {
this.dbConnectionFactory=dbConnectionFactory;
this.auditLogTableName=auditLogTableName;
this.outputObjectsTableName=outputObjectsTableName;
this.mapRedStatsTableName=mapRedStatsTableName;
this.lastReadId=getIdsAfter;
auditLogEntries=new LinkedList<>();
this.retryingTaskRunner=new RetryingTaskRunner(conf.getInt(ConfigurationKeys.DB_QUERY_RETRIES,DbConstants.DEFAULT_NUM_RETRIES),DbConstants.DEFAULT_RETRY_EXPONENTIAL_BASE);
}
| Constructs an AuditLogReader. |
static <E>void writeMultiset(Multiset<E> multiset,ObjectOutputStream stream) throws IOException {
int entryCount=multiset.entrySet().size();
stream.writeInt(entryCount);
for ( Multiset.Entry<E> entry : multiset.entrySet()) {
stream.writeObject(entry.getElement());
stream.writeInt(entry.getCount());
}
}
| Stores the contents of a multiset in an output stream, as part of serialization. It does not support concurrent multisets whose content may change while the method is running. <p>The serialized output consists of the number of distinct elements, the first element, its count, the second element, its count, and so on. |
public void storeRecursive(File file) throws IOException {
if (file.isDirectory()) {
makeDirectory(file.getName());
changeWorkingDirectory(file.getName());
for ( File f : file.listFiles()) {
storeRecursive(f);
}
changeWorkingDirectory("..");
}
else {
InputStream in=new FileInputStream(file);
store(file.getName(),in);
}
}
| Copy a local file or directory to the FTP server, recursively. |
@Nonnull public BugInstance addSourceLine(ClassContext classContext,PreorderVisitor visitor,int pc){
SourceLineAnnotation sourceLineAnnotation=SourceLineAnnotation.fromVisitedInstruction(classContext,visitor,pc);
if (sourceLineAnnotation != null) {
add(sourceLineAnnotation);
}
return this;
}
| Add a source line annotation for instruction whose PC is given in the method that the given visitor is currently visiting. Note that if the method does not have line number information, then no source line annotation will be added. |
public ThreeValueRulePanel(){
super();
this.add(mainTab);
tfBias=createTextField(null,null);
tfLowerThreshold=createTextField(null,null);
tfUpperThreshold=createTextField(null,null);
tfLowerValue=createTextField(null,null);
tfMiddleValue=createTextField(null,null);
tfUpperValue=createTextField(null,null);
mainTab.addItem("Bias",tfBias);
mainTab.addItem("Lower threshold",tfLowerThreshold);
mainTab.addItem("Upper threshold",tfUpperThreshold);
mainTab.addItem("Lower value",tfLowerValue);
mainTab.addItem("Middle value",tfMiddleValue);
mainTab.addItem("Upper value",tfUpperValue);
}
| Creates binary neuron preferences panel. |
DbException convertIllegalStateException(IllegalStateException e){
int errorCode=DataUtils.getErrorCode(e.getMessage());
if (errorCode == DataUtils.ERROR_FILE_CORRUPT) {
if (encrypted) {
throw DbException.get(ErrorCode.FILE_ENCRYPTION_ERROR_1,e,fileName);
}
}
else if (errorCode == DataUtils.ERROR_FILE_LOCKED) {
throw DbException.get(ErrorCode.DATABASE_ALREADY_OPEN_1,e,fileName);
}
else if (errorCode == DataUtils.ERROR_READING_FAILED) {
throw DbException.get(ErrorCode.IO_EXCEPTION_1,e,fileName);
}
throw DbException.get(ErrorCode.FILE_CORRUPTED_1,e,fileName);
}
| Convert the illegal state exception to the correct database exception. |
protected String doIt() throws Exception {
if (m_C_ProjectLine_ID == 0) throw new IllegalArgumentException("No Project Line");
MProjectLine projectLine=new MProjectLine(getCtx(),m_C_ProjectLine_ID,get_TrxName());
log.info("doIt - " + projectLine);
if (projectLine.getM_Product_ID() == 0) throw new IllegalArgumentException("No Product");
MProject project=new MProject(getCtx(),projectLine.getC_Project_ID(),get_TrxName());
if (project.getM_PriceList_ID() == 0) throw new IllegalArgumentException("No PriceList");
boolean isSOTrx=true;
MProductPricing pp=new MProductPricing(projectLine.getM_Product_ID(),project.getC_BPartner_ID(),projectLine.getPlannedQty(),isSOTrx);
pp.setM_PriceList_ID(project.getM_PriceList_ID());
pp.setPriceDate(project.getDateContract());
projectLine.setPlannedPrice(pp.getPriceStd());
projectLine.setPlannedMarginAmt(pp.getPriceStd().subtract(pp.getPriceLimit()));
projectLine.saveEx();
String retValue=Msg.getElement(getCtx(),"PriceList") + pp.getPriceList() + " - "+ Msg.getElement(getCtx(),"PriceStd")+ pp.getPriceStd()+ " - "+ Msg.getElement(getCtx(),"PriceLimit")+ pp.getPriceLimit();
return retValue;
}
| Perform process. |
synchronized void incrementQueriesIssuedSinceFailover(){
this.queriesIssuedSinceFailover++;
}
| Increments counter for query executions. |
private void chainingFilters(List<Employee> employees){
Stream<Employee> empStream=employees.stream().filter(null).filter(null).filter(null);
empStream.forEach(null);
}
| Method to demonstrate chaining of the filters. |
public double[] toEastingNorthing(double e,double n){
return new double[]{e + easting,n + northing};
}
| Convert an Easting-Northing from a relative (to this grid square) pair to an absolute pair |
@Override public void pause(boolean toPause){
isPaused=toPause;
}
| Pauses or unpauses the engine. |
public boolean isLoaded(){
return mBitmap != null || mStyle == STYLE_NULL;
}
| Returns true if the pointer icon has been loaded and its bitmap and hotspot information are available. |
@Override public Size2D arrange(Graphics2D g2,RectangleConstraint constraint){
RectangleConstraint cc=toContentConstraint(constraint);
LengthConstraintType w=cc.getWidthConstraintType();
LengthConstraintType h=cc.getHeightConstraintType();
Size2D contentSize=null;
if (w == LengthConstraintType.NONE) {
if (h == LengthConstraintType.NONE) {
contentSize=new Size2D(getWidth(),getHeight());
}
else if (h == LengthConstraintType.RANGE) {
throw new RuntimeException("Not yet implemented.");
}
else if (h == LengthConstraintType.FIXED) {
throw new RuntimeException("Not yet implemented.");
}
}
else if (w == LengthConstraintType.RANGE) {
if (h == LengthConstraintType.NONE) {
throw new RuntimeException("Not yet implemented.");
}
else if (h == LengthConstraintType.RANGE) {
contentSize=arrangeRR(g2,cc.getWidthRange(),cc.getHeightRange());
}
else if (h == LengthConstraintType.FIXED) {
throw new RuntimeException("Not yet implemented.");
}
}
else if (w == LengthConstraintType.FIXED) {
if (h == LengthConstraintType.NONE) {
throw new RuntimeException("Not yet implemented.");
}
else if (h == LengthConstraintType.RANGE) {
throw new RuntimeException("Not yet implemented.");
}
else if (h == LengthConstraintType.FIXED) {
throw new RuntimeException("Not yet implemented.");
}
}
assert contentSize != null;
return new Size2D(calculateTotalWidth(contentSize.getWidth()),calculateTotalHeight(contentSize.getHeight()));
}
| Arranges the contents of the block, within the given constraints, and returns the block size. |
public TabbedPaneTopTabState(){
super("Top");
}
| Creates a new TabbedPaneTopTabState object. |
private void returnData(Object ret){
if (myHost != null) {
myHost.returnData(ret);
}
}
| Used to communicate a return object from a plugin tool to the main Whitebox user-interface. |
public Object convert(Class type,Object value){
if (value == null) return (String)null;
else if (value instanceof Date) return DateUtils.formatDate((Date)value);
else return value.toString();
}
| Convierte un objeto a String. |
public static boolean isPrimitive(String type){
if (type.equals("int") || type.equals("long") || type.equals("double")|| type.equals("float")|| type.equals("char")|| type.equals("boolean")|| type.equals("byte")) {
return true;
}
return false;
}
| This method judges whether the type is a primitive type. |
public InputStream openStream(String userAgent,Iterator mimeTypes) throws IOException {
InputStream raw=openStreamInternal(userAgent,mimeTypes,acceptedEncodings.iterator());
if (raw == null) return null;
stream=null;
return checkGZIP(raw);
}
| Open the stream and check for common compression types. If the stream is found to be compressed with a standard compression type it is automatically decompressed. |
public SAXParserMMImpl(){
this(null,null);
}
| Constructs a SAX parser using the dtd/xml schema parser configuration. |
@ReactMethod public void canOpenURL(String url,Promise promise){
if (url == null || url.isEmpty()) {
promise.reject(new JSApplicationIllegalArgumentException("Invalid URL: " + url));
return;
}
try {
Intent intent=new Intent(Intent.ACTION_VIEW,Uri.parse(url));
intent.addFlags(Intent.FLAG_ACTIVITY_NEW_TASK);
boolean canOpen=intent.resolveActivity(getReactApplicationContext().getPackageManager()) != null;
promise.resolve(canOpen);
}
catch ( Exception e) {
promise.reject(new JSApplicationIllegalArgumentException("Could not check if URL '" + url + "' can be opened: "+ e.getMessage()));
}
}
| Determine whether or not an installed app can handle a given URL. |
public int itemAt(int k){
return m_items[k];
}
| Gest the index of the value of the specified attribute |
public void disableTableModificationMenus(){
showInsertRowPopupMenu=false;
showInsertColumnPopupMenu=false;
showDeleteRowPopupMenu=false;
showDeleteColumnPopupMenu=false;
showEditInPopupMenu=false;
}
| Disable popup menus that allow table structure to changed. |
public void draw(){
StdDraw.setPenColor(color);
StdDraw.filledCircle(rx,ry,radius);
}
| Draws this particle to standard draw. |
public static CCTurnOffTiles action(int s,ccGridSize gridSize,float d){
return new CCTurnOffTiles(s,gridSize,d);
}
| creates the action with a random seed, the grid size and the duration |
public void mouseWheelMoved(MouseWheelEvent e){
getHandler().mouseWheelMoved(e);
}
| Called when the mouse wheel is rotated while over a JScrollPane. |
public static void generateJavaScriptError(Writer writer,String javascriptCode) throws IOException {
writer.write("<script>alert(top.GetIdsLan(\"" + javascriptCode + "\"));</script>");
}
| Public methods |
protected ShardResponse transfomResponse(final ShardRequest sreq,ShardResponse rsp,String shard){
return rsp;
}
| Subclasses could modify the Response based on the the shard |
public int execute(final FormObject ref,final int type,final int eventType,final char keyPressed){
final int returnCode=executeCommand(ref,type,eventType,keyPressed);
boolean executeChangedCode=false;
if (eventType == ActionHandler.FOCUS_EVENT && (type != PdfDictionary.C2 || (type == PdfDictionary.C2 && (returnCode == ActionHandler.NOMESSAGE || returnCode == ActionHandler.VALUESCHANGED)))) {
executeChangedCode=true;
}
if (executeChangedCode) {
final String refName=ref.getTextStreamValue(PdfDictionary.T);
final Vector_String linkedObj=linkedjavascriptCommands.get(refName);
if (linkedObj != null) {
linkedObj.trim();
final String[] value=linkedObj.get();
for ( final String nextVal : value) {
if (nextVal.equals(refName) && type == PdfDictionary.C2) {
}
}
}
}
return returnCode;
}
| we execute the command given and then execute command C on any linked fields or on itself if there are no linked fields |
@Override public void write(ByteAppendable os,char ch) throws IOException {
throw new UnsupportedOperationException();
}
| JDKWriter is only a factory. |
protected int insertKey(int val){
int hash, index;
hash=HashFunctions.hash(val) & 0x7fffffff;
index=hash % _states.length;
byte state=_states[index];
consumeFreeSlot=false;
if (state == FREE) {
consumeFreeSlot=true;
insertKeyAt(index,val);
return index;
}
if (state == FULL && _set[index] == val) {
return -index - 1;
}
return insertKeyRehash(val,index,hash,state);
}
| Locates the index at which <tt>val</tt> can be inserted. if there is already a value equal()ing <tt>val</tt> in the set, returns that value as a negative integer. |
int remoteRecv(byte[] buffer,int len) throws IOException {
return remoteTcp.recv(buffer,len);
}
| Receive data as remote peer |
public static int testSplit1Snippet(int a){
try {
return container.a;
}
finally {
if (a < 0) {
container.a=15;
}
else {
container.b=15;
}
}
}
| In this case the read should be scheduled in the first block. |
public synchronized Entry nextValue(Entry prev){
return prev.next;
}
| Next Entry with not null value is returned. Iteration is organized in this manner: for(ConcurrentArrayHashMap<K, V>.Entry e = targets.firstValue(); e != null; e = targets.nextValue(e)) { V element = e.getValue(); |
@DSSpec(DSCat.INTERNET) @DSSource({DSSourceKind.NETWORK}) @DSGenerator(tool_name="Doppelganger",tool_version="2.0",generated_on="2013-12-30 13:02:38.276 -0500",hash_original_method="1FC662ADE026A6EC6E72DFD849EB4C0C",hash_generated_method="85E1BD66594FB807FDC8148CFC6E4EC3") @Override public void connect() throws IOException {
List<Proxy> proxyList=null;
if (proxy != null) {
proxyList=new ArrayList<Proxy>(1);
proxyList.add(proxy);
}
else {
ProxySelector selector=ProxySelector.getDefault();
if (selector != null) {
proxyList=selector.select(uri);
}
}
if (proxyList == null) {
currentProxy=null;
connectInternal();
}
else {
ProxySelector selector=ProxySelector.getDefault();
Iterator<Proxy> iter=proxyList.iterator();
boolean connectOK=false;
String failureReason="";
while (iter.hasNext() && !connectOK) {
currentProxy=iter.next();
try {
connectInternal();
connectOK=true;
}
catch ( IOException ioe) {
failureReason=ioe.getLocalizedMessage();
if (selector != null && Proxy.NO_PROXY != currentProxy) {
selector.connectFailed(uri,currentProxy.address(),ioe);
}
}
}
if (!connectOK) {
throw new IOException("Unable to connect to server: " + failureReason);
}
}
}
| Establishes the connection to the resource specified by this <code>URL</code> |
public void addException(String exception){
LocalDate exceptionDate=parseDateFormat(exception);
additions.add(exceptionDate);
MapUtils.getSet(exceptionDate,dateStats).remove(this.getId());
}
| Adds a new exception date |
public void abort(){
m_nToDo=ABORT;
go();
}
| Aborts the execution |
public void excluir(int idSetor){
try {
String sql="DELETE FROM tb_setor WHERE id_setor=?";
stm=conector.prepareStatement(sql);
stm.setInt(1,idSetor);
stm.execute();
stm.close();
}
catch ( SQLException ex) {
Mensagem.erro("Erro ao excluir setor na base de dados! \n" + ex);
}
}
| Excluir setor na base de dados |
private void updateProgress(String progressLabel,int progress){
if (myHost != null && ((progress != previousProgress) || (!progressLabel.equals(previousProgressLabel)))) {
myHost.updateProgress(progressLabel,progress);
}
previousProgress=progress;
previousProgressLabel=progressLabel;
}
| Used to communicate a progress update between a plugin tool and the main Whitebox user interface. |
public Filter(FilterType type,FilterPred pred){
this(null,type,pred);
}
| Constructs a Filter with the given type and predicate. |
public SearchForActions createSearch(int strategy,int qSearchImpl,HeuristicFunction hf){
QueueSearch qs=null;
SearchForActions result=null;
switch (qSearchImpl) {
case TREE_SEARCH:
qs=new TreeSearch();
break;
case GRAPH_SEARCH:
qs=new GraphSearch();
break;
case GRAPH_SEARCH_BFS:
qs=new GraphSearchBFS();
break;
case BIDIRECTIONAL_SEARCH:
qs=new BidirectionalSearch();
}
switch (strategy) {
case DF_SEARCH:
result=new DepthFirstSearch(qs);
break;
case BF_SEARCH:
result=new BreadthFirstSearch(qs);
break;
case ID_SEARCH:
result=new IterativeDeepeningSearch();
break;
case UC_SEARCH:
result=new UniformCostSearch(qs);
break;
case GBF_SEARCH:
result=new GreedyBestFirstSearch(qs,hf);
break;
case ASTAR_SEARCH:
result=new AStarSearch(qs,hf);
break;
case RBF_SEARCH:
result=new RecursiveBestFirstSearch(new AStarEvaluationFunction(hf));
break;
case RBF_AL_SEARCH:
result=new RecursiveBestFirstSearch(new AStarEvaluationFunction(hf),true);
break;
case HILL_SEARCH:
result=new HillClimbingSearch(hf);
break;
}
return result;
}
| Creates a search instance. |
public String findWarLocation(String warFilePrefix){
String gemfireHome=getGemFireHome();
if (!StringUtils.isBlank(gemfireHome)) {
String[] possibleFiles={gemfireHome + "/tools/Extensions/" + warFilePrefix+ "-"+ gemfireVersion+ ".war",gemfireHome + "/tools/Pulse/" + warFilePrefix+ "-"+ gemfireVersion+ ".war",gemfireHome + "/lib/" + warFilePrefix+ "-"+ gemfireVersion+ ".war",gemfireHome + "/tools/Extensions/" + warFilePrefix+ ".war",gemfireHome + "/tools/Pulse/" + warFilePrefix+ ".war",gemfireHome + "/lib/" + warFilePrefix+ ".war"};
for ( String possibleFile : possibleFiles) {
if (new File(possibleFile).isFile()) {
logger.info(warFilePrefix + " war found: {}",possibleFile);
return possibleFile;
}
}
}
String[] possibleFiles={warFilePrefix + "-" + gemfireVersion+ ".war","tools/Pulse/" + warFilePrefix + "-"+ gemfireVersion+ ".war","tools/Extensions/" + warFilePrefix + "-"+ gemfireVersion+ ".war","lib/" + warFilePrefix + "-"+ gemfireVersion+ ".war",warFilePrefix + ".war"};
for ( String possibleFile : possibleFiles) {
URL url=this.getClass().getClassLoader().getResource(possibleFile);
if (url != null) {
logger.info(warFilePrefix + " war found: {}",possibleFile);
return url.getPath();
}
}
logger.warn(warFilePrefix + " war file was not found");
return null;
}
| this method will try to find the named war files in the following order: 1. if GEMFIRE is defined, it will look under tools/Extensions, tools/Pulse and lib folder (in this order) to find either the name-version.war or the name.war file 2. If GEMFIRE is not defined, it will try to find either the name-version.war/name.war (in that order) on the classpath |
private String buildCount(String label,int countNew,int count){
if (count == 0) {
return label;
}
return label + " (" + countNew+ "/"+ count+ ")";
}
| Create count String for highlights/ignored mesages. |
private boolean checkThreadCallbacks(SceKernelThreadInfo thread){
boolean handled=false;
if (thread == null || !thread.doCallbacks) {
return handled;
}
for (int callbackType=0; callbackType < SceKernelThreadInfo.THREAD_CALLBACK_SIZE; callbackType++) {
RegisteredCallbacks registeredCallbacks=thread.getRegisteredCallbacks(callbackType);
pspBaseCallback callback=registeredCallbacks.getNextReadyCallback();
if (callback != null) {
if (log.isDebugEnabled()) {
log.debug(String.format("Entering callback type %d %s for thread %s (current thread is %s)",callbackType,callback.toString(),thread.toString(),currentThread.toString()));
}
CheckCallbackReturnValue checkCallbackReturnValue=new CheckCallbackReturnValue(thread,callback.getUid());
callback.call(thread,checkCallbackReturnValue);
handled=true;
break;
}
}
return handled;
}
| runs callbacks. Check the thread doCallbacks flag. |
public static MachineType platformToMachineType(SAMReadGroupRecord srgr,boolean paired){
if (MachineType.COMPLETE_GENOMICS.compatiblePlatform(srgr.getPlatform())) {
return MachineType.COMPLETE_GENOMICS;
}
else if (MachineType.COMPLETE_GENOMICS_2.compatiblePlatform(srgr.getPlatform())) {
return MachineType.COMPLETE_GENOMICS_2;
}
else if (MachineType.FOURFIVEFOUR_PE.compatiblePlatform(srgr.getPlatform()) || MachineType.FOURFIVEFOUR_SE.compatiblePlatform(srgr.getPlatform())) {
if (paired) {
return MachineType.FOURFIVEFOUR_PE;
}
else {
return MachineType.FOURFIVEFOUR_SE;
}
}
else if (MachineType.ILLUMINA_PE.compatiblePlatform(srgr.getPlatform()) || MachineType.ILLUMINA_SE.compatiblePlatform(srgr.getPlatform())) {
if (paired) {
return MachineType.ILLUMINA_PE;
}
else {
return MachineType.ILLUMINA_SE;
}
}
else if (MachineType.IONTORRENT.compatiblePlatform(srgr.getPlatform())) {
return MachineType.IONTORRENT;
}
return null;
}
| Acquire machine type from read group if possible. Assumes platform has been set in read group |
@Override public boolean isActive(){
return amIActive;
}
| Used by the Whitebox GUI to tell if this plugin is still running. |
@Override public void run(){
this.java.setSpawn(spawn);
if (!spawn) {
this.java.setFailonerror(true);
}
try {
this.java.execute();
}
catch ( BuildException ex) {
if (ex.getMessage().contains("Java returned: 1")) {
ex=new BuildException(ex.getMessage() + " See Cargo log for details.",ex.getCause(),ex.getLocation());
}
this.setBuildException(ex);
}
finally {
this.setFinished(true);
}
}
| Execute the Ant's java command. |
public T caseEnum(org.eclipse.vorto.core.api.model.datatype.Enum object){
return null;
}
| Returns the result of interpreting the object as an instance of '<em>Enum</em>'. <!-- begin-user-doc --> This implementation returns null; returning a non-null result will terminate the switch. <!-- end-user-doc --> |
public void rotateAngleAxisY(float angle){
if (mRotateMode != ROTATE_Y) setRotationVector(ROTATE_Y);
float rotation=angle - mCurrentAngle[1];
mCurrentAngle[1]=mCurrentAngle[1] + (angle - mCurrentAngle[1]);
mRenderer.setRotationObject(rotation);
}
| Rotate the object in the Y axis |
private int findBestMatchingType(int givenType,Set<Integer> allowedTypes){
int toReturn=-1;
for ( Integer type : allowedTypes) {
if (type == givenType) {
toReturn=type;
break;
}
if (Ontology.ATTRIBUTE_VALUE_TYPE.isA(givenType,type)) {
if (toReturn < 0) {
toReturn=type;
}
else if (Ontology.ATTRIBUTE_VALUE_TYPE.isA(type,toReturn)) {
toReturn=type;
}
}
}
return toReturn;
}
| Compares the givenType to the allowedTypes and return the best matching Type or -1 if no Type matches. <br /> NOTE: In this case means best matching the most specific Type |
static String node_type(Node n){
switch (n.getNodeType()) {
case Node.DOCUMENT_NODE:
return ("Document");
case Node.DOCUMENT_TYPE_NODE:
return ("Document type");
case Node.ELEMENT_NODE:
return ("Element");
case Node.ENTITY_NODE:
return ("Entity");
case Node.TEXT_NODE:
return ("Text");
default :
return String.format("node type %d",n.getNodeType());
}
}
| Returns a textual representation of a node type |
private int[] computeCounts(int splitChannel,int c0,int c1){
int splitSh4=(2 - splitChannel) * 4;
int c0Sh4=(2 - c0) * 4;
int c1Sh4=(2 - c1) * 4;
int half=count / 2;
int[] counts=new int[256];
int tcount=0;
int minR=min[0], minG=min[1], minB=min[2];
int maxR=max[0], maxG=max[1], maxB=max[2];
int[] minIdx={minR >> 4,minG >> 4,minB >> 4};
int[] maxIdx={maxR >> 4,maxG >> 4,maxB >> 4};
int[] vals={0,0,0};
for (int i=minIdx[splitChannel]; i <= maxIdx[splitChannel]; i++) {
int idx1=i << splitSh4;
for (int j=minIdx[c0]; j <= maxIdx[c0]; j++) {
int idx2=idx1 | (j << c0Sh4);
for (int k=minIdx[c1]; k <= maxIdx[c1]; k++) {
int idx=idx2 | (k << c1Sh4);
Counter[] v=colors[idx];
for (int iColor=0; iColor < v.length; iColor++) {
Counter c=v[iColor];
vals=c.getRgb(vals);
if (contains(vals)) {
counts[vals[splitChannel]]+=c.count;
tcount+=c.count;
}
}
}
}
}
return counts;
}
| create an array, which contains the number of pixels for each point along the splitChannel (between min and max of this cube). |
public static long quantile(long[] values,double quantile){
if (values == null) throw new IllegalArgumentException("Values cannot be null.");
if (quantile < 0.0 || quantile > 1.0) throw new IllegalArgumentException("Quantile must be between 0.0 and 1.0");
long[] copy=new long[values.length];
System.arraycopy(values,0,copy,0,copy.length);
Arrays.sort(copy);
int index=(int)(copy.length * quantile);
return copy[index];
}
| Compute the requested quantile of the given array |
boolean removeVolumesFromConsistencyGroup(List<String> virtualVolumeNames,String cgName,boolean deleteCGWhenEmpty) throws VPlexApiException {
s_logger.info("Request to remove volumes {} from consistency group {}",virtualVolumeNames.toString(),cgName);
boolean cgDeleted=false;
VPlexApiDiscoveryManager discoveryMgr=_vplexApiClient.getDiscoveryManager();
List<VPlexClusterInfo> clusterInfoList=discoveryMgr.getClusterInfoLite();
List<VPlexVirtualVolumeInfo> virtualVolumeInfoList=new ArrayList<VPlexVirtualVolumeInfo>();
for ( String virtualVolumeName : virtualVolumeNames) {
VPlexVirtualVolumeInfo virtualVolumeInfo=null;
for ( VPlexClusterInfo clusterInfo : clusterInfoList) {
virtualVolumeInfo=discoveryMgr.findVirtualVolume(clusterInfo.getName(),virtualVolumeName,false);
if (virtualVolumeInfo != null) {
break;
}
}
if (virtualVolumeInfo == null) {
throw VPlexApiException.exceptions.cantFindRequestedVolume(virtualVolumeName);
}
virtualVolumeInfoList.add(virtualVolumeInfo);
}
VPlexConsistencyGroupInfo cgInfo=discoveryMgr.findConsistencyGroup(cgName,clusterInfoList,false);
ClientResponse response=null;
try {
URI requestURI=_vplexApiClient.getBaseURI().resolve(VPlexApiConstants.URI_REMOVE_VOLUMES_FROM_CG);
s_logger.info("Remove volumes from consistency group URI is {}",requestURI.toString());
StringBuilder argBuilder=new StringBuilder();
for ( VPlexVirtualVolumeInfo virtualVolumeInfo : virtualVolumeInfoList) {
if (argBuilder.length() != 0) {
argBuilder.append(",");
}
argBuilder.append(virtualVolumeInfo.getPath());
}
Map<String,String> argsMap=new HashMap<String,String>();
argsMap.put(VPlexApiConstants.ARG_DASH_V,argBuilder.toString());
argsMap.put(VPlexApiConstants.ARG_DASH_G,cgInfo.getPath());
JSONObject postDataObject=VPlexApiUtils.createPostData(argsMap,true);
s_logger.info("Remove volumes from consistency group POST data is {}",postDataObject.toString());
response=_vplexApiClient.post(requestURI,postDataObject.toString());
String responseStr=response.getEntity(String.class);
s_logger.info("Remove volumes from consistency group response is {}",responseStr);
if (response.getStatus() != VPlexApiConstants.SUCCESS_STATUS) {
if (response.getStatus() == VPlexApiConstants.ASYNC_STATUS) {
s_logger.info("Remove volumes from consistency group completing asynchronously");
_vplexApiClient.waitForCompletion(response);
}
else {
String cause=VPlexApiUtils.getCauseOfFailureFromResponse(responseStr);
throw VPlexApiException.exceptions.removeVolumesFromCGFailureStatus(cgInfo.getName(),String.valueOf(response.getStatus()),cause);
}
}
s_logger.info("Successfully removed volumes from consistency group");
if (deleteCGWhenEmpty) {
discoveryMgr.updateConsistencyGroupInfo(cgInfo);
if (cgInfo.getVirtualVolumes().isEmpty()) {
s_logger.info("Deleting empty consistency group {}",cgName);
try {
deleteConsistencyGroup(cgInfo);
cgDeleted=true;
}
catch ( Exception e) {
s_logger.error("Exception deleting consistency group {}:{}",cgName,e.getMessage());
}
}
}
}
catch ( VPlexApiException vae) {
throw vae;
}
catch ( Exception e) {
throw VPlexApiException.exceptions.failedRemovingVolumesFromCG(cgInfo.getName(),e);
}
finally {
if (response != null) {
response.close();
}
}
return cgDeleted;
}
| Removes the volumes with the passed names from the consistency group with the passed name. If the removal of the volumes results in an empty group, delete the consistency group if the passed flag so indicates. |
public T caseTrace_(Trace_ object){
return null;
}
| Returns the result of interpreting the object as an instance of '<em>Trace </em>'. <!-- begin-user-doc --> This implementation returns null; returning a non-null result will terminate the switch. <!-- end-user-doc --> |
private void updateProgress(int progress){
if (myHost != null && progress != previousProgress) {
myHost.updateProgress(progress);
}
previousProgress=progress;
}
| Used to communicate a progress update between a plugin tool and the main Whitebox user interface. |
BinarySearchTreeNode<E> removeMaximum(BinarySearchTreeNode<E> node){
node=this.getMaximum(node);
if (node == null) return null;
if (node == this.root) {
this.root=node.left;
}
else if (node.parent.right == node) {
node.parent.right=node.left;
}
else {
node.parent.left=node.left;
}
this.size--;
return node;
}
| Removes the maximum value node from the subtree of the given node. |
public static InetAddress intToInetAddress(int hostAddress){
if (hostAddress == 0) return null;
byte[] addressBytes={(byte)(0xff & hostAddress),(byte)(0xff & (hostAddress >> 8)),(byte)(0xff & (hostAddress >> 16)),(byte)(0xff & (hostAddress >> 24))};
try {
return InetAddress.getByAddress(addressBytes);
}
catch ( UnknownHostException e) {
throw new AssertionError();
}
}
| Convert a IPv4 address from an integer to an InetAddress. |
public JSONObject(JSONObject jo,String[] names){
this();
for (int i=0; i < names.length; i+=1) {
try {
this.putOnce(names[i],jo.opt(names[i]));
}
catch ( Exception ignore) {
}
}
}
| Construct a JSONObject from a subset of another JSONObject. An array of strings is used to identify the keys that should be copied. Missing keys are ignored. |
@DSSafe(DSCat.SAFE_OTHERS) public boolean isVisibleToUser(){
return getBooleanProperty(BOOLEAN_PROPERTY_VISIBLE_TO_USER);
}
| Sets whether this node is visible to the user. |
public long tryConvertToWriteLock(long stamp){
long a=stamp & ABITS, m, s, next;
while (((s=state) & SBITS) == (stamp & SBITS)) {
if ((m=s & ABITS) == 0L) {
if (a != 0L) break;
if (U.compareAndSwapLong(this,STATE,s,next=s + WBIT)) return next;
}
else if (m == WBIT) {
if (a != m) break;
return stamp;
}
else if (m == RUNIT && a != 0L) {
if (U.compareAndSwapLong(this,STATE,s,next=s - RUNIT + WBIT)) return next;
}
else break;
}
return 0L;
}
| If the lock state matches the given stamp, performs one of the following actions. If the stamp represents holding a write lock, returns it. Or, if a read lock, if the write lock is available, releases the read lock and returns a write stamp. Or, if an optimistic read, returns a write stamp only if immediately available. This method returns zero in all other cases. |
SolrInputField f(String name,Object... values){
return field(name,1.0F,values);
}
| Convenience method for building up SolrInputFields with default boost |
public InlineQueryResultPhoto.InlineQueryResultPhotoBuilder replyMarkup(InlineReplyMarkup replyMarkup){
this.reply_markup=replyMarkup;
return this;
}
| *Optional Sets the inline keyboard attached to this message to the InlineReplyMarkup provided |
public Leaf(){
}
| Create a Leaf node. The default value of name is "". |
private JTextField createTextField(int width){
JTextField f=new JTextField(width);
f.setEditable(false);
f.setBorder(null);
return f;
}
| Create a test field. |
public static InputStream open(final String filePath){
try {
if (!TextUtils.isEmpty(filePath)) {
return new FileInputStream(filePath);
}
return null;
}
catch ( Exception e) {
e.printStackTrace();
return null;
}
}
| open a file |
public PBEKeySpec(char[] password,byte[] salt,int iterationCount){
if (salt == null) {
throw new NullPointerException("salt == null");
}
if (salt.length == 0) {
throw new IllegalArgumentException("salt.length == 0");
}
if (iterationCount <= 0) {
throw new IllegalArgumentException("iterationCount <= 0");
}
if (password == null) {
this.password=EmptyArray.CHAR;
}
else {
this.password=new char[password.length];
System.arraycopy(password,0,this.password,0,password.length);
}
this.salt=new byte[salt.length];
System.arraycopy(salt,0,this.salt,0,salt.length);
this.iterationCount=iterationCount;
this.keyLength=0;
}
| Creates a new <code>PBEKeySpec</code> with the specified password, salt and iteration count. |
private void addInitializedClass(String classNameWithDots){
if (!initializedClasses.contains(classNameWithDots)) {
initializedClasses.add(classNameWithDots);
}
}
| This method will add the class to the list of those classes that were initialized during this context execution. |
public SensorRefresher(){
setName("inspectit-platform-sensor-refresher-thread");
setDaemon(true);
}
| Creates a new instance of the <code>PlatformSensorRefresher</code> as a daemon thread. |
public static void rendezvous(String condition,int N){
BValue cond;
IValue iv;
String name="RV_" + condition;
synchronized (conditions) {
cond=(BValue)conditions.get(name);
if (cond == null) {
if (N < 2) {
throw new RuntimeException("rendezvous must be called with N >= 2");
}
cond=new BValue();
conditions.put(name,cond);
iv=new IValue(N - 1);
rv.put(name,iv);
}
else {
iv=(IValue)rv.get(name);
iv.v--;
}
}
if (iv.v > 0) {
waitForCondition(name);
}
else {
setCondition(name);
synchronized (conditions) {
clearCondition(name);
rv.remove(name);
}
}
}
| Force N threads to rendezvous (ie. wait for each other) before proceeding. The first thread(s) to call are blocked until the last thread makes the call. Then all threads continue. <p> All threads that call with the same condition name, must use the same value for N (or the results may be not be as expected). <P> Obviously, if fewer than N threads make the rendezvous then the result will be a hang. |
public boolean hasHref(){
return getHref() != null;
}
| Returns whether it has the URI of the website. |
private int mulInv(int x){
int t0, t1, q, y;
if (x < 2) {
return x;
}
t0=1;
t1=BASE / x;
y=BASE % x;
while (y != 1) {
q=x / y;
x=x % y;
t0=(t0 + (t1 * q)) & MASK;
if (x == 1) {
return t0;
}
q=y / x;
y=y % x;
t1=(t1 + (t0 * q)) & MASK;
}
return (1 - t1) & MASK;
}
| This function computes multiplicative inverse using Euclid's Greatest Common Divisor algorithm. Zero and one are self inverse. <p> i.e. x * mulInv(x) == 1 (modulo BASE) |
public static boolean isFinal(int mod){
return Modifier.isFinal(mod);
}
| Returns if modifier is final. Note that in our case modifier can be mix (public and private for example). |
public static String macContentsEclipse(){
return OS.getNative().winMacLinux("","Contents/Eclipse/","");
}
| Returns "Contents/Eclipse/" on macOS, and empty string on all others. |
public void clear(int fromIndex,int toIndex){
checkRange(fromIndex,toIndex);
if (fromIndex == toIndex) return;
int startWordIndex=wordIndex(fromIndex);
if (startWordIndex >= wordsInUse) return;
int endWordIndex=wordIndex(toIndex - 1);
if (endWordIndex >= wordsInUse) {
toIndex=length();
endWordIndex=wordsInUse - 1;
}
long firstWordMask=WORD_MASK << fromIndex;
long lastWordMask=WORD_MASK >>> -toIndex;
if (startWordIndex == endWordIndex) {
words[startWordIndex]&=~(firstWordMask & lastWordMask);
}
else {
words[startWordIndex]&=~firstWordMask;
for (int i=startWordIndex + 1; i < endWordIndex; i++) words[i]=0;
words[endWordIndex]&=~lastWordMask;
}
recalculateWordsInUse();
checkInvariants();
}
| Sets the bits from the specified <tt>fromIndex</tt> (inclusive) to the specified <tt>toIndex</tt> (exclusive) to <code>false</code>. |
public void endElement(String uri,String localName,String rawName) throws org.xml.sax.SAXException {
m_elementID--;
if (!m_shouldProcess) return;
if ((m_elementID + 1) == m_fragmentID) m_shouldProcess=false;
flushCharacters();
popSpaceHandling();
XSLTElementProcessor p=getCurrentProcessor();
p.endElement(this,uri,localName,rawName);
this.popProcessor();
this.getNamespaceSupport().popContext();
}
| Receive notification of the end of an element. |
private int readFrameType(final Object[] frame,final int index,int v,final char[] buf,final Label[] labels){
int type=b[v++] & 0xFF;
switch (type) {
case 0:
frame[index]=Opcodes.TOP;
break;
case 1:
frame[index]=Opcodes.INTEGER;
break;
case 2:
frame[index]=Opcodes.FLOAT;
break;
case 3:
frame[index]=Opcodes.DOUBLE;
break;
case 4:
frame[index]=Opcodes.LONG;
break;
case 5:
frame[index]=Opcodes.NULL;
break;
case 6:
frame[index]=Opcodes.UNINITIALIZED_THIS;
break;
case 7:
frame[index]=readClass(v,buf);
v+=2;
break;
default :
frame[index]=readLabel(readUnsignedShort(v),labels);
v+=2;
}
return v;
}
| Reads a stack map frame type and stores it at the given index in the given array. |
public AttachmentExample(){
oredCriteria=new ArrayList<Criteria>();
}
| This method was generated by MyBatis Generator. This method corresponds to the database table attachment |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.